CN101801065A - Mesh election competition method improved based on 802.16d - Google Patents
Mesh election competition method improved based on 802.16d Download PDFInfo
- Publication number
- CN101801065A CN101801065A CN201010034003A CN201010034003A CN101801065A CN 101801065 A CN101801065 A CN 101801065A CN 201010034003 A CN201010034003 A CN 201010034003A CN 201010034003 A CN201010034003 A CN 201010034003A CN 101801065 A CN101801065 A CN 101801065A
- Authority
- CN
- China
- Prior art keywords
- competition
- time
- node
- neighbours
- information
- 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
Links
Images
Abstract
The invention relates to a Mesh election competition method improved based on 802.16d, comprising the following steps of: calculating a time slot of the current competition slot; determining the neighboring nodes according to the competition slot and the neighboring information; carrying out Mesh election on the neighboring nodes satisfying the condition; and storing the information of successful contention and broadcasting the information. The invention can coordinate the transmissions of the MSH-NCFG ( Mesh Network Configuration) message and the MSH-DSCH (Mesh Distributed Schedule) message between two skips to avoid the collision.
Description
Technical field
The present invention relates to a kind of Mesh election (Mesh nets competition) method, particularly relate to a kind ofly, be applied to the wireless self-networking communications field based on the improved Mesh election of 802.16d competing method.
Background technology
The basic thought of IEEE 802.16Mesh mode configuration is that channel is divided into control and data segment, in the control subframe, inserts the free competition mechanism that adopts; And the data burst part is avoided collision by the scheduling of message in the control subframe.Wherein the time slot of regulation control subframe is not a perfect competition in the agreement, and each node is fought for send opportunity by stochastic selection algorithm.The mechanism that two kinds of data dispatchings are arranged under the Mesh pattern: centralized scheduling (Centralized Scheduling) and distributed scheduling (Distributed Scheduling).In distributed scheduling, each node uses the pseudo-random algorithm competitive channel to insert according to the schedule information in the two-hop neighbors scope, and distributed scheduling can be free more and effectively connects and transmit data.
The distributed scheduling pattern is divided into two kinds again, coordinates distributed scheduling pattern and non-coordination distributed scheduling pattern.Both differences are that the coordinated scheduling pattern is in the control subframe when sending MSC-DSCH message, but not the coordinated scheduling pattern is at data burst.Coordinate in the distributed scheduling expectation network not collision conflict in the IEEE 802.16Mesh pattern, having only a node in a control time slot, to send data within the two-hop neighbors scope of a node like this.
In order to realize the competition of the control subframe message in the double bounce scope, the 802.16d agreement has proposed a kind of Mesh election algorithm.It is a pseudo-random function, needs the ID of input time slot quantity and node, and its concrete algorithmic procedure has detailed description in agreement.Algorithm produces a series of pseudorandom values on the basis of input parameter, and these values are called as mixed number in standard.If current node ID and timeslot number produce the mixed number of a maximum, it just wins competition.Otherwise the node competition is unsuccessful.If node has been won, the next transmission time slot of temporary transient transmission time slot for it is set, this information of broadcasting arrives neighbor node in MSH-DSCH message then.If node failure, he will select the transmission time slot of next time, repeat top competitive behavior then up to success.Based on top description, a node competition probability of successful depends on total competition interstitial content as can be seen.And the competition interstitial content is relevant with the number and the topological structure of neighbor node.
802.16d provide the pseudo-random algorithm of competitive channel under the Mesh pattern in the agreement, simultaneously in order to save Internet resources, provided the interval that two parameter X mt HoldoffExponent and Next Xmt Mx represent to compete the result.The scope of competition is all nodes in the two-hop neighbors scope, so each node all needs to know the schedule information of all nodes in the two-hop neighbors scope.802.16d mention the schedule information that can obtain two hop nodes according to neighbours' schedule information of neighbours in the agreement, but defer to the computational methods of the next transmitting time that proposes in the agreement, receiving node can't accurately obtain the information of two-hop neighbors.Realize safeguarding the Mesh election competition in the two-hop neighbors, must design a kind of new method of safeguarding two-hop neighbors, coordinate the transmission of the control subframe message of each node in the double bounce, avoid collision.
In addition, when document related to Mesh election mostly, describing obtaining of two-hop neighbors information was neighbours' schedule information of broadcasting according to neighbours, but does not provide concrete implementation strategy.Minority has proposed solution, but notion is very fuzzy, and is also indeterminate on concrete the enforcement.In addition, about the processing of network access node not with how to determine the transmitting time of control messages after networking first, also find in the literature.Therefore, be necessary to propose a kind of improved mesh election competing method.
Summary of the invention
The invention reside in and avoid above the deficiencies in the prior art proposition a kind of, be used to coordinate the control subframe message MSH-NCFG of each node in the double bounce and the transmission of scheduling sublayer frame message MSH-DSCH, avoid collision based on the improved Meshelection method of 802.16d.
Technical scheme of the present invention is:
A kind ofly it is characterized in that, comprising based on the improved Mesh election of 802.16d competing method:
Calculate the time slot that send competition next time according to current time slot; The time slot value of this moment is an absolute value, comprises superframe interior;
Determine neighbor node according to competition slot and neighbor information, described neighbor node will be judged according to current competition slot, will satisfy one of following three conditions at least:
1) interval of neighbours' next transmitting time comprises current competition slot,
2) the possible interval of neighbours' next transmitting time comprises current competition slot,
3) neighbours' next transmitting time is unclear;
Carry out Mesh election with qualified neighbor node,, then distribute current competition slot to give the control messages of this node, and broadcast this message to neighbours if compete successfully; If the competition of next time slot is then carried out in the competition failure, seek qualified neighbor node again and be at war with, till success;
The information that the preservation competition is successful is also broadcasted; In order to realize the competition of all nodes in the two-hop neighbors scope, the CALCULATION OF PARAMETERS method of carrying in the scheduling message during broadcasting need be adjusted and revise; The adjustment of described computational process and modification comprise: the interval range at next sending time slots place can not obtain based on current time slot, but resets time reference, is to recomputate that to send next time be false interval range with this benchmark.Datum mark is made as that to be in time span be 2
ExpThe integral multiple position and with the most approaching point of current time, Exp is the index avoidance value that defines in the standard.Sending node sends Mesh election competition as a result the time, obtains the parameter Mx and the Exp that need carry in the scheduling message according to the formula that provides among benchmark and the 802.16d (1); Intermediate node will recomputate the scheduling parameter Mx and the Exp of sending node according to current benchmark and formula (1) when transmitting neighbor information; Two hop nodes accurately draw the competition result according to current benchmark and two parameters that receive after receiving information interval.
2
Xmt?Holdoff?Exponent·NextXmtMx＜NextXmtTime≤2
Xmt?HoldoffExponent·(NextXmtMx+1) (1)
The present invention also further comprises the not processing of network access node: the schedule information that need know two-hop neighbors during Mesh election competition, neighbours' schedule information of network access node is kept in its neighbours' chained list, network access node is not also set up neighbours' chained list, need information is kept in potential neighbours' chained list, determine the control information transmitting time of node after node networks first, need to carry out the competition of Mesh election time slot according to the neighbours' schedule information in potential neighbours' chained list.
The present invention also further comprises the maintenance of local information, particular content comprises: the maintenance of local information comprises the maintenance of the next transmitting time of network description message (MSH-NCFG) and the maintenance of the next transmitting time of distributed scheduling message (MSH-DSCH), when node sends MSH-NCFG message at every turn, need to calculate the time of MSH-NCFG transmission next time, and all have corresponding message to send for the successful time slot of each competition by competition; But for scheduling message MSH-DSCH, whether there is scheduling message to send, guarantees the accuracy of Mesh election competition, need to guarantee that the successful time slot of each competition all has corresponding scheduling message to send for the successful time slot of each competition is uncertain; When the formation of scheduling message is sky, can in competing successful time slot, this send the DSCH message of only carrying local scheduling information and neighbours' schedule information.
The invention solves 802.16d to mesh election parameter and the unclear problem of procedure definition, realize the sending time slots competition of each node control subframe message in the double bounce, avoid collision.
Description of drawings
Fig. 1 is the condition schematic diagram that the neighbor node that participates in the competition should meet;
Fig. 2 is a Mesh election competition flow chart;
Fig. 3 is the flow chart that obtains two-hop neighbors information among the Mesh election;
Embodiment
The present invention analyzes the MSH-NCFG of 802.16d agreement proposition and the competition algorithm of MSH-DSCH transmitting time, proposes a kind of practicable pseudo-random algorithm that can realize all nodes competitions in the double bounce scope.Based on the computational methods of 802.16d design, comprise and improve computational methods, the not maintenance of the processing of network access node and local information in the competition process.
Be based on the designed a kind of computational methods of distributed scheduling Mesh net of 802.16d agreement based on the computational methods of 802.16d design, its basic thought is that the regulation according to agreement designs, the pseudo-random algorithm that provides in the agreement is provided random algorithm in core such as the competition process exactly.But simultaneously some indefinite parts in the agreement are revised and are replenished, for example in the agreement accurately proposition how to safeguard the information of two-hop neighbors.
The Calculation Method particular content comprises in the described improvement competition process: in the realization of competition, in order to save Internet resources, 802.16d the agreement defining node does not directly send its Meshelection competition result when broadcast parameter, but only sends its competition result's interval.802.16d protocol definition two parameter X mt Holdoff Exponent and Next Xmt Mx in order to represent this interval, as shown in Equation (1).
The interval range of Next Xmt Time is based on that current time slot obtains in the formula.But defer to this kind algorithm, scope is that the neighbours of double bounce can't accurately obtain the information in the local node scheduling message.Neighbor node is the Mesh election result who calculates local node according to the current time.If do not know the transmitting time of local node, neighbor node just can't accurately calculate Mesh election competition result.Therefore, two-hop neighbors will obtain the information of sending node, must be through the conversion of intermediate node.How the conversion information that could make is not lost, and is the algorithm core of safeguarding two-hop neighbors.For the accuracy of maintenance information, the CALCULATION OF PARAMETERS process need be adjusted and revise.
The adjustment of computational process and modification, its basic thought is that the interval range of Next Xmt Time is to obtain based on current time slot, but, newly calculate the interval range of next transmitting time with this time base weight according to current time slot redesign time reference.All nodes are the algorithm of clear and definite benchmark all.Datum mark is made as the point that time span is 2 integral multiple position, and its size also needs adjust according to Mesh election process and current conditions such as network state, and method is flexible.Sending node sends Mesh election competition as a result the time, obtains the parameter Mx and the Exp that need carry in the scheduling message according to benchmark and formula (1).Intermediate node will recomputate the scheduling parameter Mx and the Exp of sending node according to current benchmark and formula (1) when transmitting neighbor information.Two hop nodes accurately draw the competition result according to current benchmark and two parameters that receive after receiving information interval.
The processing particular content of described not network access node comprises: the processing of 802.16d and undeclared not network access node.Need know the schedule information of two-hop neighbors during Mesh election competition, neighbours' schedule information of network access node is kept in its neighbours' chained list, network access node is not also set up neighbours' chained list, can only be kept at information in potential neighbours' chained list, determine the control information transmitting time of node after node networks first, carry out the competition of Mesh election time slot according to the neighbours' schedule information in potential neighbours' chained list exactly.So handle, can avoid the collision of control messages first, avoid vicious circle simultaneously.Because control messages can be informed its existence of neighbours to neighbours' broadcast message first, neighbours can be in competition process with this node as possible competition object.If control messages sends failure first, neighbours can't obtain its information, think that this node does not exist, and may cause vicious circle thus.
The particular content of safeguarding of described local information comprises: the maintenance of local information comprises the maintenance of MSH-NCFG transmitting time next time and the maintenance of MSH-DSCH transmitting time next time.When node sends MSH-NCFG message, need calculate the time of MSH-NCFG transmission next time at every turn, and all have corresponding message to send for the successful time slot of each competition by competition.But, whether there is scheduling message to send for the successful time slot of each competition is uncertain for scheduling message MSH-DSCH.Guarantee the accuracy of Mesh election competition, need to guarantee that the successful time slot of each competition all has corresponding scheduling message to send.When the formation of scheduling message is sky, can in competing successful time slot, this send the DSCH message of only carrying local scheduling information and neighbours' schedule information.Its purpose is safeguarded this locality and neighbor information exactly.
Be described further below in conjunction with 2 pairs of implementing procedures of the present invention of accompanying drawing.
(1) determines to meet the neighbor node of race condition
Neighbor node in the not every double bounce scope all will participate in the competition, the neighbor node of competition will be judged according to current competition slot, at least to satisfy one of following three conditions, as shown in Figure 1: the interval of neighbours' next transmitting time comprises current competition slot, may send collision (Node B); The possibility of neighbours' next transmitting time interval (owing to do not know the interval of neighbours' next transmitting time, can only be a general scope) comprise current competition slot (node C); Neighbours' next transmitting time unclear (node D).
(2) carry out Mesh election with qualified neighbor node
Determine current competition slot, after determining to compete node according to competition slot simultaneously, begin the process of being at war with.The pseudo-random algorithm that competition process adopts 802.16d to provide if compete successfully, then distributes current competition slot to give the control messages of this node, and broadcasts this message to neighbours; If the competition of next time slot is then carried out in the competition failure, seek qualified neighbor node again and be at war with, till success.
(3) broadcasting competition result
As Fig. 3, suppose that the A point competes successfully the result of broadcasting competition simultaneously, how to obtain the schedule information of node as example explanation two-hop neighbors C.
Before the A broadcasting competition result, at first need to calculate Mx according to competition result and formula (1), Mx is the origin identification between the competition slot location.Want B and C and can accurately obtain this interval, can not be benchmark with current point in time 1 during calculating, but recomputate a time reference standard point1, computing formula be as follows:
Wherein Current Xmt Time is this transmitting time, and HoldoffExpontent is the index avoidance of node A.
After obtaining time reference, calculate Mx, will represent that then interval two Parameter H oldoffExpontent and Mx send.
B receives the message that A sends, and calculates the time reference standard point1 of B according to the time that receives and formula (3), this value should with the equating of A.According to standard point1, the B point just can accurately obtain the interval at the scheduling message place that A orders.
When B sends message at 2 places, can transmit the scheduling message of A.During forwarding, B need recomputate time reference standard point2 according to the current time, and will recomputate two parameters according to standard point2.Transmit then.
After C receives the message that B transmits, calculate the time reference standard point2 of C according to the time that receives and formula (3), this value should with the equating of B.According to standard point2, the C point just can accurately obtain the interval at the scheduling message place that A orders.
Claims (3)
1. one kind based on the improved Mesh election of 802.16d competing method, it is characterized in that, comprising:
Calculate the time slot that send competition next time according to current time slot; The time slot value of this moment is an absolute value, comprises superframe interior;
Determine neighbor node according to competition slot and neighbor information, described neighbor node will be judged according to current competition slot, will satisfy one of following three conditions at least:
1) interval of neighbours' next transmitting time comprises current competition slot,
2) the possible interval of neighbours' next transmitting time comprises current competition slot,
3) neighbours' next transmitting time is unclear;
Carry out Mesh election with qualified neighbor node,, then distribute current competition slot to give the control messages of this node, and broadcast this message to neighbours if compete successfully; If the competition of next time slot is then carried out in the competition failure, seek qualified neighbor node again and be at war with, till success;
The information that the preservation competition is successful is also broadcasted; In order to realize the competition of all nodes in the two-hop neighbors scope, the CALCULATION OF PARAMETERS method of carrying in the scheduling message during broadcasting need be adjusted and revise; The adjustment of described computational process and modification comprise: the interval range at next sending time slots place can not obtain based on current time slot, but resets time reference, is to recomputate that to send next time be false interval range with this benchmark; Datum mark is made as that to be in time span be 2
ExpThe integral multiple position and with the most approaching point of current time, Exp is the index avoidance value that defines in the standard; Sending node sends Mesh election competition as a result the time, obtains the parameter Mx and the Exp that need carry in the scheduling message according to the formula that provides among benchmark and the 802.16d (1); Intermediate node will recomputate the scheduling parameter Mx and the Exp of sending node according to current benchmark and formula (1) when transmitting neighbor information; Two hop nodes accurately draw the competition result according to current benchmark and two parameters that receive after receiving information interval;
2
XmtHoldoffExponent·NextXmtMx＜NextXmtTime≤2
XmtHoldoffExponent·(NextXmtMx+1) (1)。
2. according to claim 1 based on the improved Mesh election of 802.16d competing method, it is characterized in that, also further comprise the not processing of network access node: the schedule information that need know two-hop neighbors during Mesh election competition, neighbours' schedule information of network access node is kept in its neighbours' chained list, network access node is not also set up neighbours' chained list, need information is kept in potential neighbours' chained list, determine the control information transmitting time of node after node networks first, need to carry out the competition of Mesh election time slot according to the neighbours' schedule information in potential neighbours' chained list.
3. according to claim 1 based on the improved Mesh election of 802.16d competing method, it is characterized in that, also further comprise the maintenance of local information, particular content comprises: the maintenance of local information comprises the maintenance of the next transmitting time of network description message (MSH-NCFG) and the maintenance of the next transmitting time of distributed scheduling message (MSH-DSCH), when node sends MSH-NCFG message at every turn, need to calculate the time of MSH-NCFG transmission next time, and all have corresponding message to send for the successful time slot of each competition by competition; But for scheduling message MSH-DSCH, whether there is scheduling message to send, guarantees the accuracy of Mesh election competition, need to guarantee that the successful time slot of each competition all has corresponding scheduling message to send for the successful time slot of each competition is uncertain; When the formation of scheduling message is sky, can in competing successful time slot, this send the DSCH message of only carrying local scheduling information and neighbours' schedule information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010100340039A CN101801065B (en) | 2010-01-08 | 2010-01-08 | Improved Mesh election competition method based on 802.16d |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010100340039A CN101801065B (en) | 2010-01-08 | 2010-01-08 | Improved Mesh election competition method based on 802.16d |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101801065A true CN101801065A (en) | 2010-08-11 |
| CN101801065B CN101801065B (en) | 2012-10-31 |
Family
ID=42596487
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010100340039A Expired - Fee Related CN101801065B (en) | 2010-01-08 | 2010-01-08 | Improved Mesh election competition method based on 802.16d |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101801065B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105813165A (en) * | 2016-03-03 | 2016-07-27 | 北京交通大学 | Wireless Mesh network applied MAC layer distributed type scheduling mechanism |
| CN106332296A (en) * | 2016-10-17 | 2017-01-11 | 东南大学 | Method for scheduling radio resources in car-mounted communication system |
| CN111050405A (en) * | 2019-12-04 | 2020-04-21 | 中国人民解放军军事科学院国防科技创新研究院 | Time slot election method, device, equipment and readable storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101242364A (en) * | 2008-01-22 | 2008-08-13 | 东南大学 | Collaborative distributed dispatching method in wireless mesh network |
-
2010
- 2010-01-08 CN CN2010100340039A patent/CN101801065B/en not_active Expired - Fee Related
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105813165A (en) * | 2016-03-03 | 2016-07-27 | 北京交通大学 | Wireless Mesh network applied MAC layer distributed type scheduling mechanism |
| CN106332296A (en) * | 2016-10-17 | 2017-01-11 | 东南大学 | Method for scheduling radio resources in car-mounted communication system |
| CN111050405A (en) * | 2019-12-04 | 2020-04-21 | 中国人民解放军军事科学院国防科技创新研究院 | Time slot election method, device, equipment and readable storage medium |
| CN111050405B (en) * | 2019-12-04 | 2023-04-18 | 中国人民解放军军事科学院国防科技创新研究院 | Time slot election method, device, equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101801065B (en) | 2012-10-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zheng et al. | Performance analysis of group-synchronized DCF for dense IEEE 802.11 networks | |
| EP2781126B1 (en) | Reducing power consumption in wireless network stations by optimizing contention period overhead with station grouping, proxy csma, and tim monitoring | |
| CN108093469B (en) | Distributed access method of wireless transmission system based on TDMA | |
| CN105263143B (en) | The slot allocation method of adaptive session dot density and load in self-organizing network | |
| CN102752844B (en) | Multistage distribution method of channel resources of wireless sensor network | |
| CN102104875B (en) | A kind of Novel cognitive radio multi-channel MAC protocol method | |
| DE112006003086T5 (en) | A system and method for performing topology control in a wireless network | |
| CN102811498A (en) | Self-adaptive competition window adjusting method based on interference analysis | |
| CN109548156B (en) | Single-channel Time Division Multiple Access (TDMA) satellite cluster ad hoc network time slot resource allocation method | |
| CN107094281B (en) | Access method and system for M2M equipment to access base station | |
| CN103415045A (en) | Design method for efficient wireless information interaction network protocol | |
| CN109362122A (en) | The transmission dispatching method and system of communication data in a kind of low-power consumption wide area network | |
| CN101801065B (en) | Improved Mesh election competition method based on 802.16d | |
| CN105188117B (en) | The farmland wireless sensor network frequency interlace cut-in method of time-space domain multiplexing | |
| Batta et al. | A distributed weight-based tdma scheduling algorithm for latency improvement in iot | |
| CN102685808A (en) | Distribution type clustering method based on power control | |
| CN107027161A (en) | The method of data transfer, access point and website in a kind of WLAN | |
| Yu et al. | A high-throughput MAC protocol for wireless ad hoc networks | |
| CN110461006A (en) | Reduce WLAN interference method, device and terminal device | |
| CN110312291A (en) | A kind of low-power consumption LoRa wireless network data transmission algorithm | |
| KR101527151B1 (en) | System and method for scheduling distributed depth-based tdma slot in industrial wireless sensor network | |
| CN116600366B (en) | Data acquisition method and system based on wireless communication network | |
| CN106793152B (en) | Network concurrent competition channel based on power distribution and arbitration method | |
| CN105072687A (en) | WLAN channel allocation method based on artificial bee colony algorithm | |
| CN109639473A (en) | It is a kind of for the complete to full communication algorithm of two-sided battle array radar ad hoc network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121031 Termination date: 20160108 |
|
| EXPY | Termination of patent right or utility model |