CN103687041B - A kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method - Google Patents
A kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method Download PDFInfo
- Publication number
- CN103687041B CN103687041B CN201310692430.XA CN201310692430A CN103687041B CN 103687041 B CN103687041 B CN 103687041B CN 201310692430 A CN201310692430 A CN 201310692430A CN 103687041 B CN103687041 B CN 103687041B
- Authority
- CN
- China
- Prior art keywords
- length
- sending node
- send
- sending
- cycle
- 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.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provide a kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method.Technical scheme comprises the following steps: step (): the frame format in amendment standard agreement；Step (two): the associated initial value of sending node is set；Step (three): sending node sends data；Step (four): destination node return information；Step (five): sending node judges conflict situations, and regulates next packet delivery time sending the cycle.Technical solution of the present invention is simple, fast convergence rate, low to network node Capability Requirement, also will not bring extra load to network.
Description
Technical field
The invention belongs to cordless communication network technical field, relate to a kind of wireless self-organization network is avoided sending
That conflicts can Evolution Dispatch method.
Background technology
In wireless self-organization network based on IEEE802.11MAC agreement, when geography be positioned proximate to two
Individual node simultaneously with destination node from same frequency range to each of which send data time, can cause transmission conflict lead
The destination node causing them can not have correctly received data.This transmission conflict can cause the re-transmission of data, enters
And cause the increase of data transfer delay, the decline of throughput performance and the waste of network radio resources.
The dispatching method avoiding sending conflict conventional in wireless self-organization network at present has based on avoidance mechanism regulation
Method and method based on slot reservations.Method based on avoidance mechanism regulation is that each sending node selects respectively
Select different keeping away and move back time span, it is to avoid two sending nodes start simultaneously at after synchronization terminates to keep out of the way to be sent out
Sending data, its representational algorithm includes L-BEB and L-MAC.The thought of method based on slot reservations is
Reserve different time slots for different sending nodes, it is to avoid they transmit simultaneously, thus avoid conflict, its generation
The algorithm of table includes ZC and L-ZC.Wherein, L-MAC and L-ZC be document " M.Fang, et al.,
Decentralised learning MACs for collision-free access in WLANs,Springer Wireless
Networks, May2012 " the middle two kinds of methods proposed, ZC and L-BEB is document " J.Lee and the most respectively
J.Walrand,Design and analysis of an asynchronous zero collision MAC protocol,vol.
Tech.Rep.UCB/EECS-2007-63,2007 " and document " J.Barcelo, et al., Learning-BEB:
Avoiding Collisions in WLAN, Eunice Summer School2008 " in the method that is given.But,
In wireless self-organization network, method based on avoidance mechanism regulation and method based on slot reservations mainly have
Four problems.First, each sending node is the adjustment being transmitted the time the most at random, this adjustment
Generally requiring iteration and can be only achieved the conflict free transmission of each sending node many times, convergence rate is slow.Secondly,
Current method all assuming that, the time that each sending node sends shared by a packet is identical, this
Plant and assume the most not always to meet.3rd, these methods all rely on node to network hollow idle
Between the cognition of this information of section, but extra network overhead can be brought in order to obtain this information network.4th,
Occur send conflict after, sending node upper once send packet time be all with higher probability selection network
The idle time period, but the most this method is not efficient, and in the case of offered load is higher,
May forever be unable to reach the state that Lothrus apterus sends.
Summary of the invention
The technical problem to be solved in the present invention is: provide that one is simpler, convergence rate faster, be more suitable for
Wireless self-organization network avoid send conflict can Evolution Dispatch method.
The basic ideas of the present invention are: each network node judges the feelings that the packet sent is clashed respectively
Condition, regulates the packet delivery time in this node next one transmission cycle according to the criterion set, adjusts every time
The probability that joint all can make this node clash reduces, and regulation step-length can be adaptive along with the situation of conflict
Regulation, so by being rapidly achieved conflict free transmission after regulating several times.
Technical scheme comprises the following steps:
Step (one): the frame format in amendment standard agreement
Based on IEEE802.11 standard agreement, the frame format of amendment packet MPDU: CRC territory is moved
After MAC header territory；The frame format of amendment ACK: in Receiver address territory and FCS territory it
Between increase the data field RES of 1 byte, the initial value of data field RES is 0.
Step (two): the associated initial value of sending node is set
To any sending node S in network, the initial value arranging regulation step-length is that packet sends time span
1/2nd, the number of times shortening continuously step-length is zero, randomly chooses a certain moment conduct within the transmission cycle
Delivery time.
Step (three): sending node sends data
Sending node S sends packet to destination node D at the delivery time arranged.
Step (four): destination node return information
If destination node D is properly received above-mentioned packet, then send out to sending node S within the time of regulation
Send ACK frame；If destination node D can not be properly received above-mentioned packet, but received above-mentioned packet
CRC territory can pass through verification, then the value of the data field RES in ACK frame is revised by destination node D
It is 1, and sends ACK frame at the appointed time to sending node S；In the case of other, destination node D is not
Send any information to sending node S.
Step (five): sending node judges conflict situations, and regulates next packet sending cycle transmission
Moment
(a): if sending node S receives data in ACK frame, and this ACK frame at the appointed time
The value of territory RES is 0, then return step (three) and start the data transmission of a new round.
(b): if sending node S receives data in ACK frame, and this ACK frame at the appointed time
The value of territory RES is 1, then sending node S checks above whether two adjustment state sending the cycle meet bar
Part one:
Condition one: the adjustment state that above twice sends the cycle is followed successively by chronological order and postpones and shift to an earlier date；
1., if meeting condition one, then regulation step-length is set to previous to situation by sending node S
Send the cycle regulation step-length 1/2nd, and the number of times shortening step-length continuously is added 1；
If shortening step-length number of times continuously to be less than 5 times, sending node S sends cycle at next will
In advance, time span in advance, equal to the length of regulation step-length, is then back to step to delivery time
(3) data starting a new round send；If shortening step-length number of times continuously to be not less than 5 times,
Then by shorten continuously step-length number of times zero setting, regulation step-length return to initial value, sending node S
Keeping out of the way, the time span kept out of the way is send cycle duration N times, and N is between 1 to 5
A certain random integers, within the transmission cycle, randomly choose a certain moment after having kept out of the way as number
According to the delivery time of bag, it is then back to step (three) and starts the data transmission of a new round.
Situation is 2.: if being unsatisfactory for condition one, then sending node S sends cycle at next and will send out
Sending the moment in advance, time span in advance, equal to the initial value of regulation step-length, is then back to step
(3) data starting a new round send.
(c): if sending node S does not the most receive ACK frame, then sending node S inspection
Look into whether the adjustment state that above twice sends the cycle meets condition two:
Condition two: the adjustment state that above twice sends the cycle is followed successively by chronological order in advance and postpones；
1., if meeting condition two, then regulation step-length is set to previous to situation by sending node S
Send the cycle regulation step-length 1/2nd, and the number of times shortening step-length continuously is added 1；
If shortening step-length number of times continuously to be less than 5 times, sending node S sends cycle at next will
Delivery time postpones, and the time span postponed, equal to the length of regulation step-length, is then back to step
(3) data starting a new round send；If shortening step-length number of times continuously to be not less than 5 times,
Then by shorten continuously step-length number of times zero setting, regulation step-length return to initial value, sending node S
Keeping out of the way, the time span kept out of the way is send cycle duration N times, and N is between 1 to 5
A certain random integers, within the transmission cycle, randomly choose a certain moment after having kept out of the way as number
According to the delivery time of bag, it is then back to step (three) and starts the data transmission of a new round.
Situation is 2.: if being unsatisfactory for condition two, then sending node S sends cycle at next and will send out
Sending the moment to postpone, the time span postponed, equal to the initial value of regulation step-length, is then back to step
(3) data starting a new round send.
The invention has the beneficial effects as follows:
The present invention overcomes convergence rate in existing wireless self-organization network collision avoidance mechanism slow, based on identical number
According to packet length hypothesis, depend on the cognition to idle time of channel section and sending node with too high probability selection
The shortcoming that network idle time section sends data, it is provided that one is simpler, convergence rate faster, be more suitable for
Wireless self-organization network avoid send conflict can Evolution Dispatch method.By step of the present invention (five)
Judge, it is only necessary to sending node identification itself sends the position that clashed of packet, so have for
Property regulation its packet delivery time within the next one transmission cycle, conflict-free can be rapidly converged to
State.The present invention need not any supplementary means that other are extra, low to network node Capability Requirement, also
Extra load will not be brought to network.Experiment shows that the present invention is effective, iterative process convergence rate block.
Accompanying drawing explanation
Fig. 1 be avoiding of providing of the present invention send conflict can the principle process schematic diagram of Evolution Dispatch method；
Fig. 2 be the present invention based in IEEE802.11 standard agreement frame format amendment MPDU frame format and
ACK frame format schematic diagram；
Fig. 3 is the result utilizing Matlab simulation software to verify effectiveness of the invention at laboratory；
Fig. 4 be by Matlab simulation software the convergence of the present invention tested and with existing several typical cases
The comparative result figure of method.
Detailed description of the invention
The present invention is described in detail below in conjunction with the accompanying drawings.
Fig. 1 be avoiding of providing of the present invention send conflict can the principle process schematic diagram of Evolution Dispatch method,
Including five steps: step (), based on IEEE802.11 standard agreement, revise packet MPDU
Frame format and ACK frame format；Step (two), arranges the associated initial value of sending node；Step (three),
Sending node sends data；Step (four): destination node is according to the situation return information receiving packet；
Step (five): sending node judges conflict situations, is divided into (a) and (b), (c) three by conflict situations
Kind of situation processes, and (b), (c) two kinds of situations are respectively classified into situation again and 1. 2. carry out with situation
Process.It should be noted that mentions in summary of the invention " above sends the adjustment state in cycle on time twice
Between order be followed successively by postpone and shift to an earlier date ", wherein postpone previous of the delivery time ratio referring to the currently transmitted cycle
The delivery time sending the cycle has postponement in the range of time shaft defined in the transmission cycle；Refer to current sending out in advance
Send the delivery time in cycle than the delivery time in previous transmission cycle from time shaft scope defined in the transmission cycle
Inside having in advance, the delivery time in the most currently transmitted cycle is more each closer to it than the delivery time in previous transmission cycle
Starting point from the cycle of transmission.
Fig. 2 be the present invention based in IEEE802.11 standard agreement frame format amendment MPDU frame format and
ACK frame format schematic diagram.The lattice of original MPDU frame during wherein Fig. 2 (a) is IEEE802.11 standard agreement
Formula, Fig. 2 (b) is the form of MPDU frame after amendment, after amendment CRC territory be positioned at MAC Header territory and
Between MSDU territory.The purpose of the frame format of amendment MPDU is to enable CRC territory Global Macros PLCP
Tri-territories of preamble, PLCP header and MAC header.Fig. 2 (c) is IEEE802.11 standard agreement
In the form of original ACK frame, Fig. 2 (d) be revise after the form of ACK frame, amended frame is at Receiver
RES territory is with the addition of between Address territory and FCS territory.
Fig. 3 is the result utilizing Matlab simulation software to verify effectiveness of the invention at laboratory.
Wherein abscissa represents the transmission time, and vertical coordinate represents 5 sending nodes (the i.e. node 1 comprised in network
To node 5), the transmission Cycle Length of each sending node is 10ms.Fig. 3 (a) be in network 5 send out
Sending node packet before the dispatching method that the present invention designs performs to send situation, Lycoperdon polymorphum Vitt square frame represents to be sent out
Send the time shared by packet.It can be seen that 5 the packet interior joint 3 sent and the data of node 5
Bag has the part of overlap in time, and the packet of node 1, node 2 and node 4 the most also has weight
Folded part, the part of these overlaps can lead to a conflict.Fig. 3 (b) is for performing the dispatching method of present invention design also
Situation after 5 iteration adjustments, it may be seen that 5 packets distinguish the most completely,
Thus without clashing.
Fig. 4 be by Matlab simulation software the convergence of the present invention tested and with existing several typical cases
The comparative result figure of method.Wherein abscissa is sending node number, vertical coordinate be reach conflict-free needed for
The iterations wanted.In figure, solid line adds ◇ and represents and represent the present invention, represents with E-MAC；Dotted line adds and represents
L-MAC；Solid line adds Δ and represents L-BEB；Solid line adds+represents L-ZC；Dotted line adds zero and represents ZC.Emulation
Using 1000 Monte-Carlo Simulation, the transmission Cycle Length that in emulation, sending node uses every time is all 10ms
Time, and each sending node sends the time span shared by packet in emulation each time from 100us
Randomly choosing to 1ms, the result be given in figure is the meansigma methods of 1000 emulation.Can be seen that the present invention to
Convergence number of times required for method E-MAC gone out is minimum, and increasing along with sending node number, needed for it
The growth rate of number of times to be restrained is the slowest.
Claims (1)
1. that avoids sending conflict in a wireless self-organization network can Evolution Dispatch method, it is characterised in that include
Following step:
Step is 1.: the frame format in amendment standard agreement:
Based on IEEE 802.11 standard agreement, the frame format of amendment packet MPDU: CRC territory is moved
After MAC header territory so that after amendment CRC territory be positioned at MAC Header territory and MSDU territory it
Between；
The frame format of amendment ACK: increase the number of 1 byte between Receiver address territory and FCS territory
According to territory RES, the initial value of data field RES is 0；
Step is 2.: arrange the associated initial value of sending node:
To any sending node S in network, the initial value arranging regulation step-length is that packet sends time span
1/2nd, the number of times shortening continuously step-length is zero, randomly chooses a certain moment conduct within the transmission cycle
Delivery time；
Step is 3.: sending node sends data:
Sending node S sends packet to destination node D at the delivery time arranged；
Step is 4.: destination node return information:
If destination node D is properly received above-mentioned packet, then send out to sending node S within the time of regulation
Send ACK frame；If destination node D can not be properly received above-mentioned packet, but received above-mentioned packet
CRC territory can pass through verification, then the value of the data field RES in ACK frame is revised by destination node D
It is 1, and sends ACK frame at the appointed time to sending node S；In the case of other, destination node D is not
Send any information to sending node S；
Step is 5.: sending node judges conflict situations, and regulates next packet delivery time sending the cycle:
I: if sending node S receives number in ACK frame, and this ACK frame at the appointed time
It is 0 according to the value of territory RES, then returns step and 3. start the data transmission of a new round；
II: if sending node S receives number in ACK frame, and this ACK frame at the appointed time
Be 1 according to the value of territory RES, then whether the adjustment state in sending node S inspection above two transmission cycles
Meet condition one:
Condition one: above two adjustment state sending the cycle are followed successively by chronological order and postpone and shift to an earlier date；
1., if meeting condition one, then regulation step-length is set to previous to situation by sending node S
Send the cycle regulation step-length 1/2nd, and the number of times shortening step-length continuously is added 1；
If shortening step-length number of times continuously to be less than 5 times, sending node S sends cycle at next will
In advance, time span in advance, equal to the length of regulation step-length, is then back to step to delivery time
3. the data starting a new round send；If shortening step-length number of times continuously to be not less than 5 times, then will
Shorten the number of times zero setting of step-length continuously, regulation step-length returns to initial value, and sending node S is carried out
Keeping out of the way, the time span kept out of the way is send cycle duration N times, and N is certain between 1 to 5
One random integers, randomly choose a certain moment as packet within the transmission cycle after having kept out of the way
Delivery time, be then back to step 3. start a new round data send；
Situation is 2.: if being unsatisfactory for condition one, then sending node S sends cycle at next and will send out
Sending the moment in advance, time span in advance, equal to the initial value of regulation step-length, is then back to step
3. the data starting a new round send；
III: if sending node S does not the most receive ACK frame, then sending node S inspection
Look into whether above two adjustment state sending the cycles meet condition two:
Condition two: above two adjustment state sending the cycle are followed successively by chronological order in advance and postpone；
1., if meeting condition two, then regulation step-length is set to previous to situation by sending node S
Send the cycle regulation step-length 1/2nd, and the number of times shortening step-length continuously is added 1；
If shortening step-length number of times continuously to be less than 5 times, sending node S sends cycle at next will
Delivery time postpones, and the time span postponed, equal to the length of regulation step-length, is then back to step
3. the data starting a new round send；If shortening step-length number of times continuously to be not less than 5 times, then will
Shorten the number of times zero setting of step-length continuously, regulation step-length returns to initial value, and sending node S is carried out
Keeping out of the way, the time span kept out of the way is send cycle duration N times, and N is certain between 1 to 5
One random integers, randomly choose a certain moment as packet within the transmission cycle after having kept out of the way
Delivery time, be then back to step 3. start a new round data send；
Situation is 2.: if being unsatisfactory for condition two, then sending node S sends cycle at next and will send out
Sending the moment to postpone, the time span postponed, equal to the initial value of regulation step-length, is then back to step
3. the data starting a new round send.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310692430.XA CN103687041B (en) | 2013-12-17 | 2013-12-17 | A kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310692430.XA CN103687041B (en) | 2013-12-17 | 2013-12-17 | A kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103687041A CN103687041A (en) | 2014-03-26 |
| CN103687041B true CN103687041B (en) | 2016-09-21 |
Family
ID=50322985
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310692430.XA Active CN103687041B (en) | 2013-12-17 | 2013-12-17 | A kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103687041B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737903B (en) * | 2019-10-28 | 2022-08-12 | 中车株洲电力机车研究所有限公司 | Multi-master networking communication method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674631A (en) * | 2009-10-14 | 2010-03-17 | 南京邮电大学 | Multi-channel routing method based on minimum channel switching in self-organizing network |
| CN103297171A (en) * | 2012-02-23 | 2013-09-11 | 华为技术有限公司 | Data frame sending method and receiving method, site and access point |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070064701A1 (en) * | 2005-09-19 | 2007-03-22 | Via Technologies Inc. | WLAN data reception method and device |
-
2013
- 2013-12-17 CN CN201310692430.XA patent/CN103687041B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674631A (en) * | 2009-10-14 | 2010-03-17 | 南京邮电大学 | Multi-channel routing method based on minimum channel switching in self-organizing network |
| CN103297171A (en) * | 2012-02-23 | 2013-09-11 | 华为技术有限公司 | Data frame sending method and receiving method, site and access point |
Non-Patent Citations (2)
| Title |
|---|
| Modeling IEEE 802.11 DCF under Nonsaturated Condition with Coupled Queues Effect;An Song 等;《IEEE Xplore Digital Library》;20110925;全文 * |
| Wang Shan 等.Towards Wide-Open,Adaptable DCF Implementation for Dynamic Networks.《中国通信China Communications》.3GPP,2012,第77-89页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103687041A (en) | 2014-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101459973B (en) | Wireless communication apparatus and wireless communication method | |
| US20230262668A1 (en) | Fast wireless local area network communication method and apparatus using multiple transfer rate partitioning and cooperative transmission | |
| CN107211323A (en) | System and method for transmitting data in WLAN multi-user transmission chance | |
| US10455618B2 (en) | Synchronized-contention window full-duplex MAC protocol for enabling full-duplex communication in wireless local area network | |
| Gao et al. | MAC for machine-type communications in industrial IoT—Part I: Protocol design and analysis | |
| JP2005198307A (en) | Wireless communication method applying priority order in wireless personal area network | |
| EP2271029B1 (en) | Collision detection in an ad-hoc power line communication network | |
| JP2009514306A (en) | Communication network | |
| CN106455107A (en) | Preemptive Wi-Fi (Wireless Fidelity) TDMA (Time Division Multiple Access) control method | |
| US8223790B1 (en) | Method and apparatus performing no back-off forwarding | |
| Gao | LTE-LAA and WiFi in 5G NR unlicensed: Fairness, optimization and win-win solution | |
| CN103687041B (en) | A kind of wireless self-organization network is avoided send conflict can Evolution Dispatch method | |
| CN109156021B (en) | Method and apparatus for robustness enhancement in a wireless communication system | |
| CN105101451B (en) | The adaptive certainty back-off method and system of MAC layer in wireless distributed network | |
| Hans et al. | A review of de-facto MAC standard: IEEE 802.11 DCF | |
| Zhang et al. | Synchronous Multi-Link Access in IEEE 802.11 be: Modeling and Network Sum Rate Optimization | |
| CN106912110B (en) | Single-transmission multi-receiving air interface resource allocation method | |
| Engelhardt et al. | Towards tactile wireless multi-hop networks: The tactile coordination function as EDCA supplement | |
| CN101883439A (en) | Method for reliably transmitting real-time service in wireless Ad Hoc network | |
| Fernandez et al. | Deterministic real-time access point concepts for industrial hybrid Ethernet/IEEE 802.11 networks | |
| Peón et al. | Towards a reliable and high-speed wireless complement to TTEthernet | |
| Bachhal et al. | CSMA/CA Based Ad-Hoc Network Using Mac Protocol. | |
| Alonso et al. | A novel MAC protocol for dynamic ad hoc wireless networks with dynamic self-configurable master-slave architecture | |
| KR101779702B1 (en) | Method for selecting relay node in wireless network, method and system for cooperative communications using that | |
| CN107396453B (en) | SD-TDMA-based VANET channel access method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | 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 |