CN103687041A - Evolvable scheduling method for avoiding sending collision in wireless self-organizing network - Google Patents
Evolvable scheduling method for avoiding sending collision in wireless self-organizing network Download PDFInfo
- Publication number
- CN103687041A CN103687041A CN201310692430.XA CN201310692430A CN103687041A CN 103687041 A CN103687041 A CN 103687041A CN 201310692430 A CN201310692430 A CN 201310692430A CN 103687041 A CN103687041 A CN 103687041A
- Authority
- CN
- China
- Prior art keywords
- length
- sending node
- sending
- node
- transmission 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.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides an evolvable scheduling method for avoiding a sending collision in a wireless self-organizing network. The evolvable scheduling method for avoiding the sending collision in the wireless self-organizing network comprises the steps that (1) the frame format in a standard protocol is modified, (2) relevant initial values of a sending node are set, (3) data are sent by the sending node, (4) information is fed back by a target node, and (5) the sending node judges the collision condition and adjusts the time of sending a data packet in the next sending period. The evolvable scheduling method for avoiding the sending collision in the wireless self-organizing network is simple, the rate of convergence is high, the requirement for the capacity of network nodes is low, and no extra load can be brought to the network.
Description
Technical field
The invention belongs to cordless communication network technical field, relate in a kind of wireless self-organization network, avoid sending conflict can Evolution Dispatch method.
Background technology
In the wireless self-organization network based on IEEE802.11MAC agreement, when two nodes that close on when geographical position send data by same frequency range to their destination nodes separately simultaneously, can cause that sending conflict causes their destination node can not correctly receive data.This transmission conflict can cause the re-transmission of data, and then causes the waste of the increase of data transfer delay, the decline of throughput performance and network radio resources.
The dispatching method that at present in wireless self-organization network, conventional avoiding sends conflict have the method that regulates based on avoidance mechanism and based on time slot reservation method.The method regulating based on avoidance mechanism is that each sending node selects respectively different keeping away to move back time span, avoids two sending nodes after synchronization finishes to keep out of the way, to start to send data simultaneously, and its representational algorithm comprises L-BEB and L-MAC.Based on time slot reservation the thought of method be for the reserved different time slot of different sending nodes, avoid them to transmit simultaneously, thereby avoid conflict, its representational algorithm comprises ZC and L-ZC.Wherein, L-MAC and L-ZC are document " M.Fang, et al., Decentralised learning MACs for collision-free access in WLANs, Springer Wireless Networks, May2012 " middle two kinds of methods that propose, ZC and L-BEB are respectively document " J.Lee and 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 provides.But, in wireless self-organization network, the method regulating based on avoidance mechanism and based on time slot reservation method mainly contain four problems.First, each sending node is to carry out at random respectively the adjustment of transmitting time, and this adjustment often needs iteration just can reach many times the conflict free transmission of each sending node, and convergence rate is slow.Secondly, in current method, be all that the shared time of packet of each sending node transmission of hypothesis is identical, this hypothesis does not always meet in practice.The 3rd, these methods all depend on node in network free time this information of section cognition, but can bring extra network overhead in order to obtain this information network.The 4th, occur to send after conflict, sending node upper be all the time period with the higher probability selection network free time while once sending packet, but in fact this method is not efficient, and in the situation that offered load is higher, may forever cannot reach the state sending without conflict.
Summary of the invention
The technical problem to be solved in the present invention is: provide a kind of simpler, convergence rate is faster, be more suitable in wireless self-organization network avoid sending conflict can Evolution Dispatch method.
Basic ideas of the present invention are: each network node judges respectively the situation that the packet of transmission clashes, according to the criterion of setting, regulate the Packet Generation of this node in the next transmission cycle constantly, the probability that each adjusting all can make this node clash reduces, and regulate step-length along with the adaptive adjusting of situation of conflict, after regulating by several times like this, can reach fast conflict free transmission.
Technical scheme comprises the following steps:
Step (one): the frame format in Standard modification agreement
Based on IEEE802.11 standard agreement, the frame format of Update Table bag MPDU: after CRC territory is moved to MAC header territory; Revise the frame format of ACK: between Receiver address territory and FCS territory, increase the data field RES of 1 byte, the initial value of data field RES is 0.
Step (two): the relevant initial value that sending node is set
To any sending node S in network, arranging and regulating the initial value of step-length is 1/2nd of Packet Generation time span, and the number of times that shortens continuously step-length is zero, and within the transmission cycle, a certain moment of random selection is as delivery time.
Step (three): sending node sends data
Sending node S sends packet to destination node D at the delivery time arranging.
Step (four): destination node return information
If the above-mentioned packet of the correct reception of destination node D sends ACK frame to sending node S in official hour; If destination node D can not correctly receive above-mentioned packet, but the CRC territory of received above-mentioned packet can be smoothly by verification, and destination node D is revised as 1 by the value of the data field RES in ACK frame, and sends at the appointed time ACK frame to sending node S; In other situations, destination node D does not send any information to sending node S.
Step (five): sending node judgement conflict situations, and regulate next Packet Generation that sends the cycle constantly
(a): if sending node S receives ACK frame at the appointed time, and in this ACK frame, the value of data field RES is 0, return to the data transmission that step (three) starts a new round.
(b): if sending node S receives ACK frame at the appointed time, and in this ACK frame, the value of data field RES is 1, sending node S checks whether two adjustment state that send the cycle satisfy condition one above:
Condition one: the adjustment state in twice transmission cycle is followed successively by chronological order and postpones and shift to an earlier date above;
Situation 1., if satisfy condition one, sending node S by regulate step-length be made as the last transmission cycle adjusting step-length 1/2nd, and the number of times that shortens continuously step-length is added to 1;
If shorten continuously step-length number of times, be less than 5 times, sending node S shifted to an earlier date delivery time in next transmission cycle, and the time span shifting to an earlier date equals to regulate the length of step-length, then returned to the data transmission that step (three) starts a new round; If shortening continuously step-length number of times is not less than 5 times, the number of times zero setting, the adjusting step-length that shorten continuously step-length are returned to initial value, sending node S keeps out of the way, the N that the time span of keeping out of the way is transmission cycle duration doubly, N is a certain random integers between 1 to 5, after having kept out of the way, within the transmission cycle, a certain moment of random selection, as the delivery time of packet, is then returned to the data transmission that step (three) starts a new round.
Situation is 2.: if do not satisfy condition one, sending node S shifted to an earlier date delivery time in next transmission cycle, and the time span shifting to an earlier date equals to regulate the initial value of step-length, then returns to the data that step (three) starts a new round and sends.
(c): if sending node S does not receive ACK frame at the appointed time, sending node S checks whether send the adjustment state in cycle above for twice satisfies condition two:
Condition two: the adjustment state that sends the cycle above for twice is followed successively by chronological order in advance and postpones;
Situation 1., if satisfy condition two, sending node S by regulate step-length be made as the last transmission cycle adjusting step-length 1/2nd, and the number of times that shortens continuously step-length is added to 1;
If shorten continuously step-length number of times, be less than 5 times, sending node S postponed delivery time in next transmission cycle, and the time span postponing equals to regulate the length of step-length, then returned to the data transmission that step (three) starts a new round; If shortening continuously step-length number of times is not less than 5 times, the number of times zero setting, the adjusting step-length that shorten continuously step-length are returned to initial value, sending node S keeps out of the way, the N that the time span of keeping out of the way is transmission cycle duration doubly, N is a certain random integers between 1 to 5, after having kept out of the way, within the transmission cycle, a certain moment of random selection, as the delivery time of packet, is then returned to the data transmission that step (three) starts a new round.
Situation is 2.: if do not satisfy condition two, sending node S postponed delivery time in next transmission cycle, and the time span postponing equals to regulate the initial value of step-length, then returns to the data that step (three) starts a new round and sends.
The invention has the beneficial effects as follows:
The present invention overcomes that convergence rate in existing wireless self-organization network collision avoidance mechanism is slow, the hypothesis based on identical data packet length, depend on the cognition of idle time of channel section and sending node are sent to the shortcoming of data with too high probability selection network free time section, provide a kind of simpler, convergence rate is faster, be more suitable in wireless self-organization network avoid sending conflict can Evolution Dispatch method.By step of the present invention (fives') judgement, only need sending node identification itself to send the position that packet clashes, and then regulate targetedly its Packet Generation within the next one transmission cycle constantly, can rapidly converge to the state of conflict-free.The present invention does not need other extra any supplementary meanss, low to network node Capability Requirement, can not bring extra load to network yet.Experiment shows that the present invention is effective, iterative process convergence rate piece.
Accompanying drawing explanation
Fig. 1 be provided by the invention avoid sending conflict can Evolution Dispatch method principle process schematic diagram;
Fig. 2 the present invention is based on MPDU frame format and the ACK frame format schematic diagram that in IEEE802.11 standard agreement, frame format is revised;
Fig. 3 is the result of utilizing Matlab simulation software to verify validity of the present invention in laboratory;
Fig. 4 be by Matlab simulation software, convergence of the present invention is tested and with the comparative result figure of existing several typical methods.
Embodiment
Below in conjunction with accompanying drawing, the present invention is described in detail.
Fig. 1 be provided by the invention avoid sending conflict can Evolution Dispatch method principle process schematic diagram, comprise five steps: step (), based on IEEE802.11 standard agreement, the frame format of Update Table bag MPDU and ACK frame format; Step (two), arranges the relevant initial value of sending node; Step (three), sending node sends data; Step (four): destination node is according to the situation return information that receives packet; Step (five): sending node judgement conflict situations, by conflict situations be divided into (a) and (b), (c) three kinds of situations are processed, and (b), (c) two kinds of situations are divided into respectively situation again and 1. 2. process with situation.It should be noted that, " adjustment state in twice transmission cycle is followed successively by chronological order and postpones and shift to an earlier date above " mentioned in summary of the invention, wherein postpones and refers to that the delivery time in current transmission cycle has postponement than the delivery time in last transmission cycle within the scope of defined time shaft of transmission cycle; The delivery time that refers in advance the current transmission cycle has in advance within the scope of defined time shaft of transmission cycle than the delivery time in last transmission cycle, and the delivery time in current transmission cycle sends the starting point in cycle separately than more close its of the delivery time in last transmission cycle.
Fig. 2 the present invention is based on MPDU frame format and the ACK frame format schematic diagram that in IEEE802.11 standard agreement, frame format is revised.Wherein Fig. 2 (a) is the form of original MPDU frame in IEEE802.11 standard agreement, and Fig. 2 (b) is the form of MPDU frame after revising, and after revising, CRC territory is between MAC Header territory and MSDU territory.The object of revising the frame format of MPDU is to make the CRC territory can Global Macros PLCP preamble, tri-territories of PLCP header and MAC header.Fig. 2 (c) is the form of original ACK frame in IEEE802.11 standard agreement, and Fig. 2 (d) is the form of ACK frame after revising, and amended frame has added RES territory between Receiver Address territory and FCS territory.
Fig. 3 is the result of utilizing Matlab simulation software to verify validity of the present invention in laboratory.Wherein abscissa represents transmitting time, and ordinate represents 5 sending nodes (being that node 1 is to node 5) that comprise in network, and the transmission Cycle Length of each sending node is 10ms.Fig. 3 (a) is 5 sending nodes Packet Generation situation before the dispatching method of the present invention's design is carried out in network, and the representative of grey square frame sends the shared time of packet.Can see that in 5 packets of transmission, the packet of node 3 and node 5 has overlapping part in time, the packet of node 1, node 2 and node 4 also has overlapping part in time, and these overlapping parts can lead to a conflict.Fig. 3 (b) is for carrying out dispatching method the situation after 5 iteration adjustments of the present invention's design, and we can see that 5 packets distinguish in time completely, therefore can not clash.
Fig. 4 be by Matlab simulation software, convergence of the present invention is tested and with the comparative result figure of existing several typical methods.Wherein abscissa is sending node number, and ordinate is to reach the needed iterations of conflict-free.In figure, solid line adds ◇ and represents to represent the present invention, with E-MAC, represents; 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 adopts 1000 Monte-Carlo Simulation, the transmission Cycle Length that in each emulation, sending node adopts is all the 10ms time, and the shared time span of each sending node transmission packet is selected at random in emulation each time from 100us to 1ms, the result providing in figure is the mean value of 1000 emulation.Can find out that the needed convergence number of times of method E-MAC that the present invention provides is minimum, and along with the increasing of sending node number, the growth rate of its required convergence number of times is the slowest.
Claims (1)
1. that in wireless self-organization network, avoids sending conflict can an Evolution Dispatch method, it is characterized in that, comprises the steps:
Step is 1.: the frame format in Standard modification agreement:
Based on IEEE802.11 standard agreement, the frame format of Update Table bag MPDU: after CRC territory is moved to MAC header territory;
Revise the frame format of ACK: between Receiver address territory and FCS territory, increase the data field RES of 1 byte, the initial value of data field RES is 0;
Step is 2.: the relevant initial value that sending node is set:
To any sending node S in network, arranging and regulating the initial value of step-length is 1/2nd of Packet Generation time span, and the number of times that shortens continuously step-length is zero, and within the transmission cycle, a certain moment of random selection is as delivery time;
Step is 3.: sending node sends data:
Sending node S sends packet to destination node D at the delivery time arranging;
Step is 4.: destination node return information:
If the above-mentioned packet of the correct reception of destination node D sends ACK frame to sending node S in official hour; If destination node D can not correctly receive above-mentioned packet, but the CRC territory of received above-mentioned packet can be smoothly by verification, and destination node D is revised as 1 by the value of the data field RES in ACK frame, and sends at the appointed time ACK frame to sending node S; In other situations, destination node D does not send any information to sending node S;
Step is 5.: sending node judgement conflict situations, and regulate next Packet Generation that sends the cycle constantly:
I: if sending node S receives ACK frame at the appointed time, and in this ACK frame, the value of data field RES is 0, returns to the data transmission that 3. step starts a new round;
II: if sending node S receives ACK frame at the appointed time, and in this ACK frame, the value of data field RES is 1, sending node S checks whether two adjustment state that send the cycle satisfy condition one above:
Condition one: the adjustment state in two transmission cycles is followed successively by chronological order and postpones and shift to an earlier date above;
Situation 1., if satisfy condition one, sending node S by regulate step-length be made as the last transmission cycle adjusting step-length 1/2nd, and the number of times that shortens continuously step-length is added to 1;
If shorten continuously step-length number of times, be less than 5 times, sending node S shifted to an earlier date delivery time in next transmission cycle, and the time span shifting to an earlier date equals to regulate the length of step-length, then returned to the data transmission that 3. step starts a new round; If shortening continuously step-length number of times is not less than 5 times, the number of times zero setting, the adjusting step-length that shorten continuously step-length are returned to initial value, sending node S keeps out of the way, the N that the time span of keeping out of the way is transmission cycle duration doubly, N is a certain random integers between 1 to 5, after having kept out of the way, within the transmission cycle, a certain moment of random selection, as the delivery time of packet, is then returned to the data transmission that 3. step starts a new round;
Situation is 2.: if do not satisfy condition one, sending node S shifted to an earlier date delivery time in next transmission cycle, and the time span shifting to an earlier date equals to regulate the initial value of step-length, then returns to the data that 3. step start a new round and sends;
III: if sending node S does not receive ACK frame at the appointed time, sending node S checks whether two adjustment state that send the cycle satisfy condition two above:
Condition two: two adjustment state that send the cycle are followed successively by chronological order in advance and postpone above;
Situation 1., if satisfy condition two, sending node S by regulate step-length be made as the last transmission cycle adjusting step-length 1/2nd, and the number of times that shortens continuously step-length is added to 1;
If shorten continuously step-length number of times, be less than 5 times, sending node S postponed delivery time in next transmission cycle, and the time span postponing equals to regulate the length of step-length, then returned to the data transmission that 3. step starts a new round; If shortening continuously step-length number of times is not less than 5 times, the number of times zero setting, the adjusting step-length that shorten continuously step-length are returned to initial value, sending node S keeps out of the way, the N that the time span of keeping out of the way is transmission cycle duration doubly, N is a certain random integers between 1 to 5, after having kept out of the way, within the transmission cycle, a certain moment of random selection, as the delivery time of packet, is then returned to the data transmission that 3. step starts a new round;
Situation is 2.: if do not satisfy condition two, sending node S postponed delivery time in next transmission cycle, and the time span postponing equals to regulate the initial value of step-length, then returns to the data that 3. step start a new round and sends.
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 true CN103687041A (en) | 2014-03-26 |
| CN103687041B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737903A (en) * | 2019-10-28 | 2021-04-30 | 中车株洲电力机车研究所有限公司 | Multi-master networking communication method |
Citations (3)
| 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 |
| 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 |
-
2013
- 2013-12-17 CN CN201310692430.XA patent/CN103687041B/en active Active
Patent Citations (3)
| 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 |
| 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 |
|---|
| AN SONG 等: "Modeling IEEE 802.11 DCF under Nonsaturated Condition with Coupled Queues Effect", 《IEEE XPLORE DIGITAL LIBRARY》 * |
| WANG SHAN 等: "Towards Wide-Open,Adaptable DCF Implementation for Dynamic Networks", 《中国通信CHINA COMMUNICATIONS》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737903A (en) * | 2019-10-28 | 2021-04-30 | 中车株洲电力机车研究所有限公司 | Multi-master networking communication method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103687041B (en) | 2016-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101459973B (en) | Wireless communication apparatus and wireless communication method | |
| TWI747854B (en) | Hybrid automatic repeat request (harq) payload mapping for short physical uplink control channel (pucch) on a shared communication medium | |
| CN105191228B (en) | The system and method for accessing selection for service-aware media | |
| CN103442392B (en) | Competition window self-adapting regulation method in a kind of 802.11e wireless network | |
| CN101651969B (en) | Implement method of power control cognition MAC protocol based on time division multiple access (TDMA) | |
| CN105592564B (en) | Adaptive access mechanism based on the estimation of live-vertex number in wireless Mesh netword | |
| CN102104875B (en) | A kind of Novel cognitive radio multi-channel MAC protocol method | |
| CN103684711B (en) | A kind of factory automation wireless network ARQ repeating method based on channel model | |
| US10455618B2 (en) | Synchronized-contention window full-duplex MAC protocol for enabling full-duplex communication in wireless local area network | |
| CN102625466A (en) | Distributed media access method used in wireless local area network | |
| CN105263143A (en) | Self-adaptive time slot allocation method according to node density and loads in self-organizing network | |
| Jia et al. | Improving the uplink performance of drive-thru Internet via platoon-based cooperative retransmission | |
| CN102300257A (en) | Channel booking mechanism-based multi-channel multi-address access method in wireless ad hoc network | |
| Gao | LTE-LAA and WiFi in 5G NR unlicensed: Fairness, optimization and win-win solution | |
| CN108811176A (en) | A kind of centralized contention resolution of wireless internet of things random multi-access channel | |
| CN114785470B (en) | Wireless device, network node and method for control using NR TDD | |
| CN103687041A (en) | Evolvable scheduling method for avoiding sending collision in wireless self-organizing network | |
| CN108966361A (en) | Dynamic back-off method based on the broadcast of WiFi mesh networks beacon frame | |
| CN101883439B (en) | Method for reliably transmitting real-time service in wireless Ad Hoc network | |
| Yang et al. | ACK-based adaptive backoff for random access protocols | |
| 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 | |
| Yu et al. | COO-MAC: a novel cooperative MAC protocol for wireless sensor networks | |
| Alonso et al. | A novel MAC protocol for dynamic ad hoc wireless networks with dynamic self-configurable master-slave architecture | |
| Bachhal et al. | CSMA/CA Based Ad-Hoc Network Using Mac Protocol. |
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 |