CN108174409A - A kind of quick beacon period compression method for wireless Mesh netword - Google Patents
A kind of quick beacon period compression method for wireless Mesh netword Download PDFInfo
- Publication number
- CN108174409A CN108174409A CN201711225043.XA CN201711225043A CN108174409A CN 108174409 A CN108174409 A CN 108174409A CN 201711225043 A CN201711225043 A CN 201711225043A CN 108174409 A CN108174409 A CN 108174409A
- Authority
- CN
- China
- Prior art keywords
- time slot
- beacon
- beacon period
- equipment
- compression
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses one kind for the quick beacon period compression method of Mesh network, belong to wireless communication technology field.This method is improved beacon period compression mechanism on the basis of the compression of existing beacon period, the matter of time of beacon period compression is optimized by the way that beacon period compression problem is modeled as a kind of improved 01 knapsack optimization problem.Compared with the beacon period compression method in current Mesh nets, the present invention substantially reduces the time of beacon period compression while compressing beacon period and improving handling capacity.
Description
Technical field
The present invention relates to Wireless Mesh network technology field more particularly to a kind of quick beacons for wireless Mesh netword
Phase compression method.
Background technology
Wireless Mesh netword accesses channel using time-multiplexed method.In the time domain, by the time divide a section when
Between, this section time is referred to as superframe, wherein superframe is segmented into beacon period (BP) and data transfer period (DTP), this
Outer superframe can also be thinner be divided into MAS, a superframe can be divided into 256 Media Access Slots (MAS), beacon period and
The data phase respectively accounts for several MAS.The time of each section of timeslice is certain, i.e., superframe is fixed length, then beacon period is longer,
The data phase is then shorter, then in the case of comparable bandwidths, the handling capacity of the data of equipment becomes smaller accordingly.Because beacon period is most
One of important role is the synchronization for equipment room, therefore, when Mesh network is established, it is same not to influence equipment in guarantee
Under the premise of step, it should compression beacon period as possible.Beacon problem mainly includes beacon period compression and beacon fusion, and the present invention is main
Introduce beacon period compression problem.
As shown in Figure 1, it is assumed that in superframe n-hour, device A, B, D, C, F, G is in consolidated network, one Network Communication of composition；
At the time of superframe N+1, an equipment E booting is added in this network, at the time of superframe N+K, completes to add in；In superframe
At the time of N+K+1, two equipment B, C batteries for occupying Slot (time slot) 3, Slot5 exhaust, off-grid；Two equipment of B, C complete electricity
Pond is replaced, and application rejoins this network, and at the time of superframe N+3K+1, two nodes of B, C are completed to add in, and occupy respectively
Slot 9, Slot 10；Meanwhile occupy slot 7 equipment G off-grids, complete battery altering after, superframe N+3K+1+T when
To apply at quarter adding in network, and Slot 10 has been occupied by equipment C at this time, and equipment G will add in network, can only slot 10 with
Time slot afterwards sends beacon.If slot 10 is highest available time slot, then equipment G can only be in 0 Hes of signalling time slot Slot
Beacon in Slot 1, thus initiates beacon extension；If Slot 10 is not highest available time slot, then can be in Slot 10
To one beacon of selection between highest available time slot.Since Fig. 1 to the end, during this, only add there are one new equipment E
Enter, the temporary off-grid of three equipment B, C, G cause Slot 3, Slot 5, Slot 7 to free out, and cannot be occupied.And
Slot 9, Slot 10 are occupied by equipment B, C so that equipment G must select new time slot or initiate beacon period extension.That
Thus, which the slot of front free time can be more and more, the BP phases can increasingly be grown, it is meant that the DTP phases can be shorter and shorter, and such one
Carrying out the handling capacity of data will be affected.In order to increase the utilization rate of frequency, reduction power attenuation increases data throughout,
Idle beacon slot must be compressed.
The document of Vladimir etc. proposes the solution of beacon collision, and multiple equipment adds in single-hop or multi-hop simultaneously
Piconet analyzes collision problem when adding in network, and provides solution.When the document of Qi Wu et al. is by beacon period
The occupancy of gap is converted to 0-1 problems, thus provides the model of beacon period, then by proposing that a kind of algorithm model of library professor carries
Go out a kind of method of timeslot multiplex, improve the utilization rate of beacon slot so that beacon period reduction length is than pressure that agreement proposes
It contracts shorter.The document of Chen Wei proposes a kind of quick beacon blending algorithm so that beacon period merges and beacon period compression is realized together,
The rule being multiplexed when beacon period merges according to beacon slot directly selects available low time slot position, mode in this way
Substantially reduce the flow of beacon period compression method.The document of Leonardo et al. describes beacon period compression and beacon extension,
And in the energy expenditure that beacon period is compressed and extended.The document of Tian Jinglei proposes a kind of improvement of beacon period fusion, and
The beacon that the document of Vladimir et al. introduces distributed MAC protocol adds in and creates problem and beacon and adds in failure problem
Consider.But existing beacon period compression method is not suitable for the stronger network of mobility, and compression time is also long.
Invention content
Goal of the invention：In view of the problems of the existing technology the present invention, provides a kind of for the quick of wireless Mesh netword
Beacon period compression method, this method are suitable for the stronger network of mobility, and compression time substantially reduces.
Technical solution：Quick beacon period compression method of the present invention for wireless Mesh netword includes：
(1) BPOIE (beacon period occupancy information element) in the beacon that each equipment is sent according to neighbor device in network, more
Time Slot Occupancy vector d=(δ (1), δ (2) ..., δ (i) ..., δ (M)) in the BPOIE of this new plant maintenance so that each
Time Slot Occupancy vector d in the BPOIE of plant maintenance is consistent, wherein, δ (i) represents that time slot i is vacant for 0, represents to occupy for 1,
M represents beacon period length；
(2) each equipment traverses the Time Slot Occupancy vector d in the BPOIE of this plant maintenance, obtains the time slot of this hold facility
J and this hold facility time slot j and highest signalling time slot iLBetween beacon occupy number k, if the time slot j of this hold facility
Unit value c (j) it is minimum, and highest signalling time slot iLThe available free time slot between time slot j, then set in this equipment BPOIE
Reciprocal counter is put, value is set to n, and the beacon of reciprocal counter is included to neighbor device transmission, wherein, c (j)=M-j；
(3) each equipment therefrom reads reciprocal counter value, and by this equipment after the beacon for receiving other equipment transmission
Reciprocal counter value be updated to n=n-1；Size between the time slot j of this hold facility and the k of calculating is judged simultaneously, if j>K,
Then this equipment is selected so that the time slot of max (c (j) w (j), c (k+1) w (k+1)) maximum is occupied, and update Time Slot Occupancy is vectorial
D selects the time slot so that max (c (j) w (j), c (k+1) w (k+1)) maximum in next superframe, is sent to neighbor device comprising
The beacon of counter；Wherein, w (j) represents the weight of time slot j；
(4) it returns and performs step (3), until during n=0, terminate beacon compression.After the completion of compression, maximum value is obtained
In formula, t represents the time of compression.
Wherein, in step (2), if the unit value c (j) of the time slot j of hold facility is not minimum, during to highest signaling
Gap iLTo the searching highest free timeslot of unit value between time slot j, and occupy；If highest signalling time slot iLDo not have between time slot j
Available free time slot then terminates beacon compression.
Wherein, in step (3), if j≤k, Time Slot Occupancy vector d is updated, is sent to neighbor device comprising decrement
The beacon of device, and return and perform step (3).The value n of the reciprocal counter set in BPOIE is a constant, is used for for one
The value of order is sent, when nDowncount is not 0, beacon is not engaged in compressing, and compression time, which can be omitted, to be disregarded only
Calculate the compression process time.
Advantageous effect：Compared with prior art, the present invention its remarkable advantage is：The present invention proposes a kind of the fast of Mesh nets
Fast beacon compression algorithm, this method are suitable for the stronger network of mobility, and the compressed data phase can be caused to extend, improve and handle up
Amount, while on the basis of throughput hoisting requirement is reached, the time of beacon period compression greatly reduces.
Description of the drawings
Fig. 1 is equipment off-grid and adition process in BP.
Specific embodiment
1st, technical problem is analyzed
Assuming that the beacon of each equipment sends beacon in beacon period to more fixed BS (beacon slot) in network, each
The occupancy situation of BS can represent that 0 represents vacant with 0-1, and 1 represents to occupy.So beacon occupation problem has reformed into 0-1 and has asked
Topic, then beacon period compression problem can also be modeled with 0-1 knapsack problems (Knapsack problem), and knapsack problem can be with
It is described as：One group of article is given, each article has the weight and price of oneself, is limiting in total weight, how to select article
Cause total price highest.Knapsack capacity is certain, under the premise of no more than gross weight so that Item Value highest in packet.Due to
The problem of problem was investigated to the time, a kind of improved 0-1 knapsack problems are thus introduced, so-called improved 0-1 knapsack problems are just
It is plus the amount of a time on the basis of 0-1 knapsack problems, what is compared is the total value of article in unit interval knapsack.It should
Among the model for using beacon period compression so that beacon slot occupancy is forward as possible, if the unit value of beacon slot i is c
(i), and more forward beacon slot value is bigger；Weight in knapsack problem is applied in beacon compression, can correspond to expression
For weight, the weight of beacon slot i is represented using w (i), the w (i) of each beacon slot is consistent；Enable bool type variable δ (i) tables
Show whether time slot i is occupied, 0 represents vacant, and 1 represents to occupy；T represents the time of beacon period compression process；V represents beacon set
It closes, M is beacon period initial length, and d is time slot vector shared by equipment in network.So, object function is to occupy beacon slot
Total value, can equation turn to shown in following formula：
s.t.
C (i)=M-i
D=(δ (1), δ (2) ..., δ (i) ..., δ (M))
δ(i)∈{0,1}
2nd, technical method
In order to solve more than object function, the present invention proposes a kind of quick beacon period for wireless Mesh netword and compresses
Method includes：
(1) BPOIE in the beacon that each equipment is sent according to neighbor device in network updates the BPOIE of this plant maintenance
In Time Slot Occupancy vector d=(δ (1), δ (2) ..., δ (i) ..., δ (M)) so that in the BPOIE of each plant maintenance
Time Slot Occupancy vector d is consistent, wherein, δ (i) represents that time slot i is vacant for 0, represents to occupy for 1, M represents beacon period length.
(2) each equipment traverses the Time Slot Occupancy vector d in the BPOIE of this plant maintenance, obtains the time slot of this hold facility
J and this hold facility time slot j and highest signalling time slot iLBetween beacon occupy number k, if the time slot j of this hold facility
Unit value c (j) it is minimum, and highest signalling time slot iLThe available free time slot between time slot j, then set in this equipment BPOIE
Reciprocal counter is put, value is set to n, and the beacon of reciprocal counter is included to neighbor device transmission, wherein, c (j)=M-j.
Wherein, if the unit value c (j) of the time slot j of hold facility is not minimum, to highest signalling time slot iLTo time slot
The highest free timeslot of unit value is found between j, and is occupied；If highest signalling time slot iLWhen between time slot j without the free time
Gap then terminates beacon compression.The value n of the reciprocal counter set in BPOIE is a constant, for one for transmission order
Value, nDowncount be 0 when, beacon is not engaged in compressing, compression time can be omitted disregard only calculate it is compressed
The journey time.
(3) each equipment therefrom reads reciprocal counter value, and by this equipment after the beacon for receiving other equipment transmission
Reciprocal counter value be updated to n=n-1；Size between the time slot j of this hold facility and the k of calculating is judged simultaneously, if j>K,
Then this equipment is selected so that the time slot of max (c (j) w (j), c (k+1) w (k+1)) maximum is occupied, and update Time Slot Occupancy is vectorial
D selects the time slot so that max (c (j) w (j), c (k+1) w (k+1)) maximum in next superframe, is sent to neighbor device comprising
The beacon of counter；Wherein, w (j) represents the weight of time slot j.
So that max (c (j) w (j), c (k+1) w (k+1)) maximum time slot, in particular to, by c (j) w (j) and c (k+1) w
(k+1) time slot where the larger side of intermediate value if c (j) w (j) are greatly, select time slot j, if c (k+1) w (k+1) is greatly, selects
Time slot k+1.
Wherein, if j≤k, Time Slot Occupancy vector d is updated, the beacon of reciprocal counter is included to neighbor device transmission, and
It returns and performs step (3).
(4) it returns and performs step (3), until during n=0, terminate beacon compression.
Above disclosed is only a kind of preferred embodiment of the present invention, it is impossible to the right model of the present invention is limited with this
It encloses, therefore equivalent variations made according to the claims of the present invention, is still within the scope of the present invention.
Claims (5)
1. a kind of quick beacon period compression method for wireless Mesh netword, it is characterised in that this method includes：
(1) in the BPOIE in the beacon that each equipment is sent according to neighbor device in network, the BPOIE for updating this plant maintenance
Time Slot Occupancy vector d=(δ (1), δ (2) ..., δ (i) ..., δ (M)) so that the time slot in the BPOIE of each plant maintenance
It is consistent to occupy vector d, wherein, δ (i) represents that time slot i is vacant for 0, represents to occupy for 1, M represents beacon period length；
(2) each equipment traverses the Time Slot Occupancy vector d in the BPOIE of this plant maintenance, obtains the time slot j of this hold facility, with
And this hold facility time slot j and highest signalling time slot iLBetween beacon occupy number k, if the list of the time slot j of this hold facility
Position value c (j) is minimum, and highest signalling time slot iLThe available free time slot between time slot j, then setting is fallen in this equipment BPOIE
Counter, value are set to n, and the beacon of reciprocal counter is included to neighbor device transmission, wherein, c (j)=M-j；
(3) each equipment therefrom reads reciprocal counter value, and falling this equipment after the beacon for receiving other equipment transmission
Counter value is updated to n=n-1；Size between the time slot j of this hold facility and the k of calculating is judged simultaneously, if j>K, then originally
Equipment selects so that the time slot of max (c (j) w (j), c (k+1) w (k+1)) maximum is occupied, and updates Time Slot Occupancy vector d,
Next superframe selects the time slot so that max (c (j) w (j), c (k+1) w (k+1)) maximum, is sent to neighbor device comprising meter reciprocal
The beacon of number device；Wherein, w (j) represents the weight of time slot j；
(4) it returns and performs step (3), until during n=0, terminate beacon compression.
2. the quick beacon period compression method according to claim 1 for wireless Mesh netword, it is characterised in that：Step
(2) in, if the unit value c (j) of the time slot j of hold facility is not minimum, to highest signalling time slot iLIt is sought between time slot j
The highest free timeslot of unit value is looked for, and is occupied；If highest signalling time slot iLThere is no free timeslot between time slot j, then tie
Shu Xinbiao compresses.
3. the quick beacon period compression method according to claim 1 for wireless Mesh netword, it is characterised in that：Step
(3) in, if j≤k, Time Slot Occupancy vector d is updated, the beacon of reciprocal counter is included to neighbor device transmission, and returns and holds
Row step (3).
4. the quick beacon period compression method according to claim 1 for wireless Mesh netword, it is characterised in that：Compression
After the completion, maximum value is obtained
In formula, t represents the time of compression.
5. the quick beacon period compression method according to claim 1 for wireless Mesh netword, it is characterised in that：Step
(2) the value n of the reciprocal counter set in BPOIE described in is a constant.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711225043.XA CN108174409A (en) | 2017-11-29 | 2017-11-29 | A kind of quick beacon period compression method for wireless Mesh netword |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711225043.XA CN108174409A (en) | 2017-11-29 | 2017-11-29 | A kind of quick beacon period compression method for wireless Mesh netword |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108174409A true CN108174409A (en) | 2018-06-15 |
Family
ID=62524134
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711225043.XA Pending CN108174409A (en) | 2017-11-29 | 2017-11-29 | A kind of quick beacon period compression method for wireless Mesh netword |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108174409A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116319095A (en) * | 2023-05-19 | 2023-06-23 | 天津工业大学 | Beacon implantation detection method in high-flux network environment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080259877A1 (en) * | 2004-02-06 | 2008-10-23 | Koninklijke Philips Electronic, N.V. | System and Method for a Dynamic Beacon Period in a Mac Distributed Reservation Protocol |
| CN103733690A (en) * | 2011-08-19 | 2014-04-16 | 高通股份有限公司 | Beacons for wireless communication |
-
2017
- 2017-11-29 CN CN201711225043.XA patent/CN108174409A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080259877A1 (en) * | 2004-02-06 | 2008-10-23 | Koninklijke Philips Electronic, N.V. | System and Method for a Dynamic Beacon Period in a Mac Distributed Reservation Protocol |
| CN103733690A (en) * | 2011-08-19 | 2014-04-16 | 高通股份有限公司 | Beacons for wireless communication |
Non-Patent Citations (3)
| Title |
|---|
| QI WU.ET AL: "Performance evaluation. Of the beacon period contraction algorithm in UWB MBOA MAC", 《IEEE COMMUNICATIONS LETTERS》 * |
| 吴雪蕉: "《中国优秀硕士学位论文全文数据库》", 15 November 2017 * |
| 陈伟等: "《信息通信技术》", 31 December 2010 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116319095A (en) * | 2023-05-19 | 2023-06-23 | 天津工业大学 | Beacon implantation detection method in high-flux network environment |
| CN116319095B (en) * | 2023-05-19 | 2023-07-28 | 天津工业大学 | Beacon implantation detection method in high-flux network environment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102355670B (en) | Multichannel wireless mesh network channel distribution method | |
| Clarke | Expanding mobile wireless capacity: The challenges presented by technology and economics | |
| CN109041193B (en) | NOMA-based network slice dynamic combined user association and power allocation method | |
| CN105263143B (en) | The slot allocation method of adaptive session dot density and load in self-organizing network | |
| CN104541545B (en) | System and method for the reservation of resources for using DRX progress admission controls and scheduling | |
| CN106658735A (en) | TDMA based long propagation delay wireless link time slot distribution method | |
| CN105554887A (en) | Wireless MESH network distributed resource distribution method based on TDMA | |
| CN102460990A (en) | Network-wide inter-cell interference minimization via coordinated multipoint cell scheduling coordination | |
| CN111970763B (en) | VDES dynamic time slot reservation method based on message priority and rate | |
| CN103209494A (en) | Real-time video business resource distribution method based on importance mark | |
| CN105873219A (en) | GASE based TDMA wireless Mesh network resource allocation method | |
| CN101009612A (en) | A wireless multi-hop and self transfer back network base station and its bandwidth allocation method | |
| CN106604284A (en) | Method and device for allocating heterogeneous network resources | |
| CN103517278A (en) | Competition method for access to public frequency band | |
| CN114189914B (en) | WiFi6 optimization switching decision method and system based on service priority | |
| CN102821391A (en) | Distance ratio based D2D (dimension to dimension) link spectrum allocation method | |
| CN105530650B (en) | A kind of method and device of network resource planning | |
| Liu et al. | Delay aware flow scheduling for time sensitive fronthaul networks in centralized radio access network | |
| CN109729591B (en) | Time division multiple access time slot allocation method based on genetic algorithm | |
| CN108174409A (en) | A kind of quick beacon period compression method for wireless Mesh netword | |
| CN107959977B (en) | Wireless Mesh netword resource regulating method based on painting theory | |
| Li et al. | Scalable federated learning over passive optical networks | |
| CN106330608B (en) | The uplink user Throughput fairness optimization method in number energy integrated communication network | |
| CN102202344B (en) | Cross-layer congestion control method based on game theory in wireless Mesh network | |
| CN110324869B (en) | User access method and base station |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180615 |