CN110337125A - A kind of work station weight group technology in 5G network - Google Patents

A kind of work station weight group technology in 5G network Download PDF

Info

Publication number
CN110337125A
CN110337125A CN201910328157.XA CN201910328157A CN110337125A CN 110337125 A CN110337125 A CN 110337125A CN 201910328157 A CN201910328157 A CN 201910328157A CN 110337125 A CN110337125 A CN 110337125A
Authority
CN
China
Prior art keywords
work station
concealed nodes
business
sta
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910328157.XA
Other languages
Chinese (zh)
Other versions
CN110337125B (en
Inventor
李云
刘叶
陈其荣
吴广富
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201910328157.XA priority Critical patent/CN110337125B/en
Publication of CN110337125A publication Critical patent/CN110337125A/en
Application granted granted Critical
Publication of CN110337125B publication Critical patent/CN110337125B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0294Traffic management, e.g. flow control or congestion control forcing collision
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/06Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H04W28/065Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0808Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention belongs to mobile communication technology fields, and in particular to detect the concealed nodes relationship in network including the PS-Poll frame at all working station is started Index for examination of the transmission time as concealed nodes to the work station weight group technology in a kind of 5G network;After the PS-Poll frame that access point obtains work station starts transmission time, the concealed nodes relationship between work station is determined, construct and hide relational matrix;The expection business demand that work station reports is quantified as different business-levels, the expection business demand table at construction work station by access point;Expected business demand table is integrated into concealed nodes relational matrix, the hiding traffic table that there is full appreciation to the potential impact of concealed nodes is formed;Work station is grouped again according to the hiding traffic table detected during each TBTT;The throughput hoisting of the existing random packet method of throughput ratio of STA weight group technology of the invention 40%.

Description

A kind of work station weight group technology in 5G network
Technical field
The invention belongs to mobile communication technology fields, and in particular to the work station weight group technology in a kind of 5G network.
Background technique
With the rapid proliferation of embedded device, Internet of Things (Internet of Things, IoT) communication is becoming packet Include the master of the various emerging intelligent Services including intelligent city, smart meter reading, medical monitoring, agricultural monitoring and industrial automation etc. Want communication pattern.The new opplication of these expansible intelligence systems and service need by a large amount of smart machines (sensor, robot, Controller etc.) it links together.For the Internet of Things application of mass termination node, how effectively great amount of terminals to be connected to Same access point (Access Point, AP) is the emphasis of research.IEEE 802.11ah network is mainly by work station (Station, STA) and AP composition.One 802.11ah AP can be associated with up to 8192 STAs in 1Km communication range, thus It forms an association large number of equipment and covers the network of large area.In network large-scale in this way, it is understood that there may be a large amount of hidden Equipment is hidden, leads to serious collision problem, to limit system performance.In the case where random placement network, any two The mutually hiding probability of node device increases to 40%, when the node device quantity of deployment reaches 8000, concealed nodes pair Desired amt be up to 1,311 836.In addition, being hidden when node device enters energy saving (Power Save, PS) mode Node problems can be more significant.Since most of STA are run in a power-save mode in 802.11ah network, STAs can be same Time wakes up and monitors the beacon of AP transmission, and attempts to send energy saving poll (Power Save-Polling, PS-Poll) frame and ask It asks uplink to transmit, thus will lead to multiple conflict.In order to minimize device conflict, IEEE 802.11ah is with transmission The enhancing distributed channel of chance (Transmit Opportunity, TXOP) accesses (Enhance Distributed Channel Access, EDCA) on the basis of introduce limiting and access window (Restricted Access Window, RAW) machine System is to realize packet-based contention scheme.Wherein, AP divides STA in groups, and gives one RAW time slot of each group of distribution, belongs to In same group of STAs in the RAW time slot of distribution competitive channel, and STA only in the time slot of distribution be in wake-up states, Equal suspend mode in remaining time slot.Previous research, which is concentrated mainly on, to improve in packet-based contention scheme performance, such as by adjusting RAW timeslot number or RAW duration to obtain optimum performance, but in these researchs, it is assumed that network is fully connected, i.e. net Hidden node problem is not present in network, it means that existing packet-based competition mechanism cannot efficiently solve concealed nodes Problem, and specific STA grouping scheme is not specified in IEEE 802.11ah standard, and existing STA group technology is usual Only STA is assigned randomly in different groups.This random distribution approach will lead to the STAs with high business demand The increase of potential conflict in group.
Summary of the invention
The present invention is directed to overcome above-mentioned technical deficiency, in Carrier Sense Multiple Access/conflict avoidance competition-based Under (Carrier Sense Multiple Access with Collision Avoidance, CSMA/CA) system, to minimize For the purpose of transmission collision caused by hidden node problem, the work station weight group technology in a kind of 5G network is proposed, comprising:
S1, the energy saving poll frame at all working station is started to Index for examination of the transmission time as concealed nodes, detects net Concealed nodes relationship in network;
S2, start transmission time t in the PS-Poll frame that access point obtains work stationiAfterwards, hiding between work station is determined Node relationships construct and hide relational matrix;
The expection business demand that work station reports is quantified as different business-levels by S3, access point, construction work station It is expected that business demand table;
S4, expected business demand table is integrated into concealed nodes relational matrix, forms the potential impact to concealed nodes Hiding traffic table with full appreciation;
S5, the root during each target beacon transmission times (Target Beacon Transmission Time, TBTT) Work station is grouped again according to the hiding traffic table detected.
Further, if the concealed nodes relationship in detection network includes: tiFor work station i in limiting and access window time slot For the first time at the beginning of transmission PS-Poll frame, tjPS-Poll is transmitted for the first time for work station j in limiting and access window time slot At the beginning of frame, work as tiWith tjWhen absolute value of the difference is greater than TA, then it is assumed that work station i and work station j concealed nodes each other, In, TA is the maximum transmitted time delay between same time slot STAs, is expressed as TA=tback-off+ δ, tback-offIndicate work station i with The absolute difference of window is kept out of the way in work station j selection for the first time, and δ indicates the propagation delay of 802.11ah network.
Further, work station i transmits t at the beginning of PS-Poll frame for the first time in limiting and access window time slotiObtain Taking method includes: other limiting and access windows or the explicit control frame of optimum working zone transmission within same beacon period.
Further, constructing hiding relational matrix includes: by the carrier sense relationship k of work station i and work station jijAs The element of the i-th row jth column in relational matrix is hidden, wherein the carrier sense relationship k of work station i and work station jijIt indicates are as follows:
Wherein, TA is the maximum transmitted time delay between two work stations of same time slot, is expressed as TA=tback-off+ δ, tback-offIndicate that the absolute difference of window is kept out of the way in work station i and work station j selection for the first time, δ indicates the biography of 802.11ah network Sowing time prolongs.Work as kij=0, then it represents that work station i and work station j energy mutual perception work as kij=1, then it represents that work station i and work It stands j concealed nodes each other.
Further, work station is grouped according to the hiding traffic table detected during each TBTT again and includes:
S51, descending arrangement is carried out to work station according to the business-level of work station, and by the highest work station of business-level It successively assigns in empty group, until there is a work station in each group;
S52, calculate in remaining work station the highest work station of business-level and hide business to each group of bring, and by its It is assigned in additional hiding least group of portfolio;
If S53, work station can carry out a variety of distribution selections, then be tieed up using class on multiple groups of influences having the same Spy is assigned to the sequence in group as status switch, setting for the sequence of work station as observation sequence, work station than algorithm Viterbi window size W, W work station before selecting from work station sequence are obtained minimum additional hiding by viterbi algorithm Then the associated optimal path of business determines the distribution of work station according to optimal path;
S54, repetition step S51~S53 are assigned in group until by all working station.
Beneficial effects of the present invention:
1, the business demand that the potential concealed nodes pair and STAs in network are obtained in data transmission procedure, does not need Change the frame structure of consensus standard, and can also be used for media access control (Medium Access Control, MAC) association View supports other wireless networks competition-based of grouping;
2, hiding traffic table is introduced to minimize the potential hiding business in network, using viterbi algorithm realization pair The grouping again of STA, under the premise of guaranteeing the service quality and fair system of equipment, STA weight group technology of the invention is gulped down Throughput hoisting 40% of the amount of spitting than existing random packet method.
Detailed description of the invention
Fig. 1 is limiting and access window structural schematic diagram in the present invention;
Fig. 2 is that the IEEE 802.11ah MAC layer data used in the present invention transmit exemplary diagram;
Fig. 3 is flow chart of the method for the present invention;
Fig. 4 is the simulation experiment result of the embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other Embodiment shall fall within the protection scope of the present invention.
The present invention proposes the work station weight group technology in a kind of 5G network, such as Fig. 3, comprising the following steps:
S1, the PS-Poll frame at all working station is started to Index for examination of the transmission time as concealed nodes, detects network In concealed nodes relationship;
S2, start transmission time t in the PS-Poll frame that access point obtains work stationiAfterwards, hiding between work station is determined Node relationships construct and hide relational matrix;
The expection business demand that work station reports is quantified as different business-levels by S3, access point, construction work station It is expected that business demand table;
S4, expected business demand table is integrated into concealed nodes relational matrix, forms the potential impact to concealed nodes Hiding traffic table with full appreciation;
S5, the hiding traffic table that basis detects during each TBTT are grouped work station again.
Wherein, work station is grouped and is specifically included again according to the hiding traffic table detected during each TBTT Following steps:
S51, descending arrangement is carried out to work station according to the business-level of work station, and by the highest work station of business-level It successively assigns in empty group, until there is a work station in each group;
S52, calculate in remaining work station the highest work station of business-level and hide business to each group of bring, and by its It is assigned in additional hiding least group of portfolio;
If S53, work station can carry out a variety of distribution selections, then be tieed up using class on multiple groups of influences having the same Spy is assigned to the sequence in group as status switch, setting for the sequence of work station as observation sequence, work station than algorithm Viterbi window size W, W work station before selecting from work station sequence are obtained minimum additional hiding by viterbi algorithm Then the associated optimal path of business determines the distribution of work station according to optimal path;
S54, repetition step S51~S53 are assigned in group until by all working station.
In the present embodiment, consider in the round overlay area AP that radius is R, an AP is associated with n work station 802.11ah network, and all STA are battery powered.Work station is run in a power-save mode, and in AP coverage area It is uniformly distributed, and static between each work station or movement speed is very slow.
As shown in Figure 1, STA is divided into M=8 group of RAW timeslot number, one RAW time slot of every group of distribution, when each RAW The duration of gap is identical.Assuming that being mainly uplink communication in IEEE 802.11ah network, i.e. STA passes buffered data It is defeated by AP.STA obtains RAW scheduling information in TBTT periodic wakeup, if there are buffered datas by STA, in the RAW of its distribution Uplink communication is requested based on EDCA mechanism transmission PS-Poll frame in gap, otherwise in a dormant state until between next beacon Every TBTT.IEEE 802.11ah MAC layer data as shown in Figure 2 transmit example.When AP is successfully received PS-Poll frame When, ACK frame is sent to STA and carries out response, if STA is not received by ACK frame, transmits PS-Poll frame again until reaching Maximum retransmission.Buffered data just is sent to AP after STA receives ACK frame and the ACK frame for waiting AP to send is confirmed.
The present embodiment proposes a kind of STA weight group technology based on IEEE 802.11ah network, specifically includes following step It is rapid:
The carrier sense relationship between STA is obtained by detecting the beginning transmission time of PS-Poll frame, constructs and hides section Point relational matrix;The expection business demand that STAs is reported is collected, the business demand of STA is quantified as to different business-levels, structure Build the expection business demand table of STA;Expected business demand table is integrated into concealed nodes relational matrix, is formed to concealed nodes Potential impact have full appreciation hiding traffic table;Descending arrangement is carried out to STA according to the business-level of STA, and by industry Business rank highest STA is successively assigned in empty group, until not having sky group;Business-level highest STA is to every in calculating residue STAs A group of bring hides business, judges STA whether on multiple groups of influences having the same, if so, using class viterbi algorithm STA is distributed, otherwise, STA is assigned in additional hiding least group of portfolio, judges whether all STA distribute, if then Terminate process, otherwise repeats the process of above-mentioned distribution STA.
In embodiments of the present invention, by tiIt is denoted as in RAW time slot at the beginning of STA i first time transmission PS-Poll frame, kijFor the carrier sense relationship of STA i and STA j.In order to make it easy to understand, ignoring the capture effect of wireless channel and the bit error rate is asked Topic.Since concealed nodes in uplink to can only detect, use the beginning transmission time of PS-Poll frame as hidden Hide the Testing index of node.If STA i and STA j send the Time overlap of PS-Poll frame for the first time, judge STA i with STA j concealed nodes pair each other.If tiAt the beginning of STA i in RAW time slot for the first time transmission PS-Poll frame, kijFor STA The carrier sense relationship of i and STA j, if kij=0 indicates that STA i and STA j can mutual perceptions;kij=1 indicates STA i With STA j concealed nodes each other.Therefore kijIt may be expressed as:
Wherein, TA is the maximum transmitted time delay between same time slot STAs, is expressed as TA=tback-off+ δ, tback-offTable Show that the absolute difference of window is kept out of the way in work station i and work station j selection for the first time, δ indicates the propagation delay of 802.11ah network.
AP can be started reception STA i by record and send the timestamp of PS-Poll frame to obtain ti, thus in any two Hiding node relationships are found between STAs, but since AP acquisition time can not be stabbed from the PS-Poll frame of transmission failure, and In uplink communication, AP can not obtain the business demand of STA.Therefore, STA is needed its AID, tiIt is needed with expected business Negate the AP that feeds.Consider two kinds of feedback systems: first way is the PS-Poll frame structure modified in 802.11ah standard;The Two kinds are other RAWs or the explicit control frame of optimum working zone transmission within same beacon period.For first way, Need to increase in PS-Poll frame one for ti8 byte fields and 2 byte fields for business demand, extensive Network in, the PS-Poll frame of modification significantly increases expense, and first way is also needed to standardize 802.11ah and be repaired Change, therefore uses second of feedback system in this chapter.It is hidden in network in view of STA is that static or movement speed is very slow Hiding node relationships will not change, and STA business demand is dynamic.Therefore, by sending display control in previous beacon interval Frame processed feeds back information to AP.
The STA t in each RAW time slot is obtained in APiAfterwards, according to kijDetermine the concealed nodes in RAW time slot between STA Relationship updates concealed nodes relational matrix.All elements in concealed nodes relational matrix are initially both configured to 0, hidden updating When hiding node relationships matrix, if kij=1, i.e. STA i and STA j hide relationship each other, then element (i, j) is set to 1;Otherwise such as Fruit kij=0, element (i, j) is set to 0, indicates that STA i and STA j can mutual perception.Concealed nodes matrix is symmetrically, every It updates at the TBTT of one beacon interval until the concealed nodes relationship comprising all associated nodes of AP.
In addition to concealed nodes information, AP also collects the expection business demand of STA feedback.AP quantifies the business demand of STA For different business-levels, the expection business demand table of STA is constructed, as shown in table 1, business expected from the digital representation in table needs It asks, number is bigger, and the business demand for indicating STA is more, has more buffered datas to need to send.
The expection business demand table of 1 STA of table
In Internet of Things network, business demand can also be matched it to based on the type of STA, AP by the type of STA Specific business-level.If two STAs concealed nodes each other may result in conflict in attempting transmission process.For Reducing conflict bring to the greatest extent influences, should be by movable concealed nodes to assigning in different groups, and according to expected business need Ask table, the hiding business in minimum group.Expected business demand table is integrated into concealed nodes table, is formed to concealed nodes Potential impact has the hiding traffic table of full appreciation.
STA is grouped again according to hiding traffic table, grouping algorithm mainly has centralized dynamics planning and distribution to change More two kinds of new algorithm of generation, wherein centralized dynamics planning algorithm main advantage is can be maximum whole according to global information acquisition Body benefit, but its algorithm complexity is generally higher;And distributed iterative more new algorithm has lower Algorithms T-cbmplexity, but Suboptimal system overall efficiency can only be obtained, and possibly can not be restrained in an iterative process.Therefore the present invention is using centralized class Viterbi algorithm is grouped STA according to global information again.
After having collected above-mentioned concealed nodes relational matrix and the expected business demand table of STA, the basis during each TBTT The concealed nodes and expected business demand detected are grouped STA again.The algorithm description that STA is grouped again are as follows: basis first The business-level of STA carries out descending arrangement to STA, and the highest STA of business-level is successively assigned in empty group, until each There is a STA in group;Then calculating the highest STA of business-level in residue STA gives each group of bring hiding business, and will It is assigned in additional hiding least group of portfolio, if STA can carry out a variety of points to multiple groups of influences having the same With selection, then class viterbi algorithm is used.Viterbi algorithm really uses Dynamic Programming (Dynamic Programming, DP) Hidden Markov Model forecasting problem is solved, i.e., asks the path (optimal path) of maximum probability with Dynamic Programming.Viterbi algorithm Description are as follows: since moment t=1, the maximum probability of every part path when the state of moment t is i is successively calculated, until Obtain the maximum probability for each path that state when moment t=T is i.Then, the maximum probability according to moment t=T is as optimal The Probability p in path*, from destination nodeStart, gradually acquires node from the front to the backObtain optimal pathThe present invention is assigned to the sequence in group as status switch using the sequence of STA as observation sequence, STA, Viterbi window size W is set, and W STAs before selecting from STA sequence obtains minimum additional hiding industry by viterbi algorithm It is engaged in associated optimal path, the distribution of STA is then determined according to optimal path;Finally use identical method by all STAs All it is assigned in group.
In order to further illustrate the validity of STA weight group technology, throughput performance of the invention is emulated below Verifying, Fig. 4 are the curve relation figure of STAs quantity and handling capacity of the present invention under Matlab 2014a environment.In IEEE In 802.11ah network environment, simulation parameter is provided that AP transmission range is 1Km, and the mean size of data frame is 256bytes, orthogonal frequency division multiplexing (Orthogonal Frequency Division Multiplexing, OFDM) symbol are held The continuous time is 40us, and basic rate 650kbps, PS-Poll frame sign is 240us, and ACK size is 240us, and backoff period is held The continuous time is 52us, and SIFS 160us, DIFS 264us, it is 5 that maximum, which keeps out of the way series, and minimum window number is the time slot of 15, RAW Number is that 8, RAW time-slot duration is 235ms, and Viterbi window size is 20.All STAs are run in a power-save mode, and all There is the data packet for uplink transmission.Ignore the capture effect and bit error rate problem of wireless channel.In a network, there are three types of STAs:S1, S2 and S2 of different business demand, its ratio be 1:3:6.Wherein, high ten times of the business-level ratio S2 of S1, S2's High ten times of business-level ratio S3.STA quantity under AP coverage area is gradually incremented to 1000. simulation results from 100 and shows STA quantity is smaller (less than 100), and the throughput differences between STA weight grouping algorithm and random grouping algorithm are smaller, corresponds to figure The initial stage of middle curve.Therefore, in underloading network, STA weight grouping algorithm and random grouping algorithm throughput differences are little. With the increase of STA quantity, the handling capacity of two kinds of algorithms is all declined, but the throughput degradation of random grouping algorithm is more tight Weight, throughput degradation in 1000 STAs 48%.Because of serious hidden node problem, so that STA is in transmission Collision is clashed, will appear continuous collision when serious, causes the lasting conflict time very long, so handling capacity and energy efficiency It can decline obviously, and STA weight grouping algorithm also leads to handling capacity due to conflict ever-increasing between non-concealed equipment collision It can be declined.Therefore, STA weight grouping algorithm can effectively improve network throughput in large scale network;Wherein grey PS-Poll frame indicates.
It although an embodiment of the present invention has been shown and described, for the ordinary skill in the art, can be with A variety of variations, modification, replacement can be carried out to these embodiments without departing from the principles and spirit of the present invention by understanding And modification, the scope of the present invention is defined by the appended.

Claims (5)

1. the work station weight group technology in a kind of 5G network, which comprises the following steps:
S1, the energy saving poll PS-Poll frame at all working station is started into Index for examination of the transmission time as concealed nodes, detected Concealed nodes relationship in network;
S2, start transmission time t in the energy saving poll PS-Poll frame that access point obtains work stationiAfterwards, it determines between work station Concealed nodes relationship constructs and hides relational matrix;
The expection business demand that work station reports is quantified as different business-levels, the expection at construction work station by S3, access point Business demand table;
S4, expected business demand table is integrated into concealed nodes relational matrix, formation has the potential impact of concealed nodes The hiding traffic table of full appreciation;
S5, the hiding traffic table that basis detects during each target beacon transmission times TBTT divide work station again Group.
2. the work station weight group technology in a kind of 5G network according to claim 1, which is characterized in that in detection network If concealed nodes relationship include: tiTransmit energy saving poll PS-Poll frame for the first time for work station i in limiting and access window time slot At the beginning of, tjAt the beginning of transmitting energy saving poll PS-Poll frame for the first time for work station j in limiting and access window time slot Between, work as tiWith tjWhen absolute value of the difference is greater than TA, then it is assumed that work station i and work station j concealed nodes each other, wherein TA is same Maximum transmitted time delay between two work stations of time slot, is expressed as TA=tback-off+ δ, tback-offIndicate work station i and work The absolute difference of window is kept out of the way in the j that stands selection for the first time, and δ indicates the propagation delay of 802.11ah network.
3. the work station weight group technology in a kind of 5G network according to claim 2, which is characterized in that limitation access window Work station i transmits t at the beginning of energy saving poll PS-Poll frame for the first time in mouth time slotiAcquisition methods include: in same letter Other limiting and access windows or optimum working zone marked in the period send explicit control frame.
4. the work station weight group technology in a kind of 5G network according to claim 1, which is characterized in that building, which is hidden, closes It is matrix include: by the carrier sense relationship k of work station i and work station jijAs the i-th row jth column in hiding relational matrix Element, wherein the carrier sense relationship k of work station i and work station jijIt indicates are as follows:
Wherein, TA is the maximum transmitted time delay between same time slot STAs, is expressed as TA=tback-off+ δ, tback-offIndicate work The absolute difference of window is kept out of the way in i and work station j selection for the first time of standing, and δ indicates the propagation delay of 802.11ah network.Work as kij=0, It then indicates work station i and work station j energy mutual perception, works as kij=1, then it represents that work station i and work station j concealed nodes each other.
5. the work station weight group technology in a kind of 5G network according to claim 1, which is characterized in that in each TBTT Period is grouped work station according to the hiding traffic table detected again
S51, descending arrangement is carried out to work station according to the business-level of work station, and successively by the highest work station of business-level It assigns in empty group, until there is a work station in each group;
The highest work station of business-level hides business to each group of bring in S52, the remaining work station of calculating, and is distributed Into additional hiding least group of portfolio;
If S53, work station can carry out a variety of distribution selections, then use class Viterbi on multiple groups of influences having the same Algorithm is assigned to the sequence in group as status switch for the sequence of work station as observation sequence, work station, Wei Te is arranged Than window size W, W work station before selecting from work station sequence obtains minimum additional hiding business by viterbi algorithm Then associated optimal path determines the distribution of work station according to optimal path;
S54, repetition step S51~S53 are assigned in group until by all working station.
CN201910328157.XA 2019-04-23 2019-04-23 Workstation re-grouping method in 5G network Active CN110337125B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910328157.XA CN110337125B (en) 2019-04-23 2019-04-23 Workstation re-grouping method in 5G network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910328157.XA CN110337125B (en) 2019-04-23 2019-04-23 Workstation re-grouping method in 5G network

Publications (2)

Publication Number Publication Date
CN110337125A true CN110337125A (en) 2019-10-15
CN110337125B CN110337125B (en) 2022-04-05

Family

ID=68139757

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910328157.XA Active CN110337125B (en) 2019-04-23 2019-04-23 Workstation re-grouping method in 5G network

Country Status (1)

Country Link
CN (1) CN110337125B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113194424A (en) * 2021-04-27 2021-07-30 大连理工大学 RAW packet access method based on interruption probability in industrial Internet of things

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1581831A (en) * 2004-05-18 2005-02-16 中兴通讯股份有限公司 Method for realizing group-turn accessing in wireless LAN
CN103298079A (en) * 2012-02-23 2013-09-11 华为技术有限公司 Data transmission method, access point and site
US20140153415A1 (en) * 2012-12-03 2014-06-05 Nokia Corporation Method, apparatus, and computer program product for signaling for sectorized beam operation in wireless networks
CN104365169A (en) * 2012-06-27 2015-02-18 Lg电子株式会社 Method for indicating channel access type in wireless communication system, and apparatus therefor
CN105191474A (en) * 2013-05-10 2015-12-23 株式会社Kt Method for alleviating hidden node problem in WLAN system
WO2016006830A1 (en) * 2014-07-08 2016-01-14 엘지전자 주식회사 Method and apparatus for power save mode operation on basis of frame transmitted from another bss in wireless lan
CN106961696A (en) * 2017-04-28 2017-07-18 扬州大学 A kind of evitable group technology of WLAN concealed terminal

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1581831A (en) * 2004-05-18 2005-02-16 中兴通讯股份有限公司 Method for realizing group-turn accessing in wireless LAN
CN103298079A (en) * 2012-02-23 2013-09-11 华为技术有限公司 Data transmission method, access point and site
CN104365169A (en) * 2012-06-27 2015-02-18 Lg电子株式会社 Method for indicating channel access type in wireless communication system, and apparatus therefor
US20140153415A1 (en) * 2012-12-03 2014-06-05 Nokia Corporation Method, apparatus, and computer program product for signaling for sectorized beam operation in wireless networks
CN105191474A (en) * 2013-05-10 2015-12-23 株式会社Kt Method for alleviating hidden node problem in WLAN system
WO2016006830A1 (en) * 2014-07-08 2016-01-14 엘지전자 주식회사 Method and apparatus for power save mode operation on basis of frame transmitted from another bss in wireless lan
CN106961696A (en) * 2017-04-28 2017-07-18 扬州大学 A kind of evitable group technology of WLAN concealed terminal

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
MAYANK AGARWAL: "Intrusion detection system for PS-Poll DoS attack in 802.11 networks using real time discrete event system", 《IEEE/CAA JOURNAL OF AUTOMATICA SINICA》 *
吴广富; 邓天垠; 苏开荣; 李云: "《计算机集成制造系统》", 《电子与信息学报》 *
谢忠林: "Wi-Fi网络MAC协议跨层优化研究", 《计算机集成制造系统》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113194424A (en) * 2021-04-27 2021-07-30 大连理工大学 RAW packet access method based on interruption probability in industrial Internet of things
CN113194424B (en) * 2021-04-27 2023-09-12 大连理工大学 RAW packet access method based on outage probability in industrial Internet of things

Also Published As

Publication number Publication date
CN110337125B (en) 2022-04-05

Similar Documents

Publication Publication Date Title
EP2496046B1 (en) Two-stage adaptive frequency hopping method for a clustered wireless sensor network
CN104081875B (en) Address multiple communication terminals in cordless communication network
EP3036958B1 (en) Method and device for transmission of ps-poll frames in an ofdma system
Zhou et al. Advances in IEEE 802.11 ah standardization for machine-type communications in sub-1GHz WLAN
US20140177501A1 (en) Method of communication based on power save mode in wireless local area network and apparatus for the same
CN109890085B (en) Method for determining random access back-off parameters of priority-classified machine type communication
Sahota et al. An energy-efficient wireless sensor network for precision agriculture
CN108882301A (en) The nonopiate accidental access method kept out of the way in extensive M2M network based on optimal power
CN102647805B (en) Wireless sensor network transmission method based on medium access control (MAC) protocol
Bel et al. An energy consumption model for IEEE 802.11 ah WLANs
CN101841933A (en) Method for constructing medium-range wireless sensor network used for field information acquisition
CN108633099B (en) Channel access indication method and device
CN107820309B (en) Wake-up strategy and time slot optimization algorithm for low-power-consumption communication equipment
CN105407463A (en) Wireless sensor network system
CN110149725B (en) Method for transmitting uplink data by using lead code
CN102300257A (en) Channel booking mechanism-based multi-channel multi-address access method in wireless ad hoc network
CN103430584A (en) Method and apparatus for reducing interference
CN103959680A (en) Grouping-based data transceiving method in wireless LAN system and apparatus for supporting same
CN104853445A (en) A broadcasting message based wireless sensor network MAC protocol
CN102422691A (en) Beacon for a star network, sensor nodes in a star network, method for initializing a gateway in a star network and method for operating a star network
Bai et al. An adaptive grouping scheme in ultra-dense IEEE 802.11 ax network using buffer state report based two-stage mechanism
CN109819505B (en) Method for adapting time slot of limited access window for optimizing network energy efficiency
Chi et al. Implementation and study of a greenhouse environment surveillance system based on wireless sensor network
CN110337125A (en) A kind of work station weight group technology in 5G network
CN113316232B (en) Multilink power saving method based on power saving and multi-query

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant