CN109068394A - Channel access method based on queue length and collision risk - Google Patents
Channel access method based on queue length and collision risk Download PDFInfo
- Publication number
- CN109068394A CN109068394A CN201810974327.7A CN201810974327A CN109068394A CN 109068394 A CN109068394 A CN 109068394A CN 201810974327 A CN201810974327 A CN 201810974327A CN 109068394 A CN109068394 A CN 109068394A
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- collision risk
- data
- vertex
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of channel access method based on queue length and collision risk, comprising the following steps: node is preferential to send the small data packet of collision risk before transmitting according to the collision risk of the status predication data packet of node each in queuing message；When receiving node one, which is jumped, has live-vertex in range, sending node transmits queuing message in the form of notification frame, retransmits data after sending successfully.The present invention utilizes node queue's information, reduces conflict caused by concealed terminal, improves network throughput, and reduce propagation delay time.
Description
Technical field
The present invention relates to Wireless Ad Hoc Networks fields, more particularly to a kind of letter based on queue length and collision risk
Road cut-in method.
Background technique
Wireless Mesh netword (Wireless Mesh Networks, WMNs) is made of wireless router and terminal device,
WLAN (WLAN) and wireless self-networking (Ad-Hoc) technology have been merged, has been the distributed network of self-organizing, multi-hop.WMNs
Not only there is the advantage of high-speed and high capacity relative to traditional wireless network, also there is wide coverage, transmission reliability
The advantages such as height and scalability are strong.The various advantage and characteristics of WMNs itself, so that it can be applied not only to Metropolitan Area Network (MAN), Internet of Things
Net also can be applied to the fields such as wireless sense network, emergency communication, intelligent transportation, military communication.But WMNs is not at present
In real life realize on a large scale deployment and application, in terms of practical application it there is also many technical problems to need to solve
Certainly.Core of the channel Intervention mechanism of medium access control (MediaAccess Control, MAC) layer as wireless Mesh netword
Heart technology is to limit an important factor for it moves towards application there is also many problems.
MAC layer is the important component of network, is responsible for the physics of node distribution wireless communication resources and control node
Layer, directly affects the fairness etc. that channel utilization, network delay, system power dissipation and channel use.It is fixed due to lacking
Basis instrument accesses channel, when preempting resources, it is necessary to which self-organization is simultaneously reconfigured when distributed network is added in node.Institute
Node is inherently identical, and all must in network without naturally classification or central controller, all functions
It must be distributed among the nodes.How under the conditions of limited radio channel resource channel is made full use of, keeps each user high
Effect quickly accesses the key task that channel is MAC protocol.
The Typical Representative of distributed channel access is IEEE 802.11DCF (Distributed Coordination
Function) agreement has been widely used in the various emulation of Ad-Hoc network at present.Distribution access is more flexible, is saving
In the case that dot density is smaller, network traffic load is relatively light, preferable network performance can be obtained using the agreement, thus be applicable in
In multi-hop Mesh network.CSMA/CA is the basis of numerous agreements such as 802.11DCF, and hidden node problem is its maximum disadvantage
One of.Concealed nodes influence being properly received for data, cause the frequent re-transmission of data, and excessive re-transmission thinks MAC layer
Receiving node failure, fails to network layer report link, and network layer reactivates routing procedure, network conflict is caused to add
Play, handling capacity drastically reduce.
802.11DCF solves hidden node problem with RTS/CTS mechanism, is most popular association in current wireless network
View.Node before sending big data packet by RTS/CTS shake hands channel reservation money.(R is that node sends half as shown in Figure 1
Diameter), node A first sends RTS message to node B before sending data to node B, and node B is received after RTS message if allowing to save
Point A sends data and then replys CTS message, includes temporal information, node A and node B needed for subsequent data transmission in RTS/CTS
The node that surrounding receives RTS, CTS message keeps silent within the time of transmission data, does not send any message.In heavy traffic
RTS/CTS can effectively improve network performance in network, but RTS/CTS itself can shake hands unsuccessfully, together because of hidden node problem
When there are problems that exposed node, network performance is promoted limited.802.11DCF solves hidden node problem and is based primarily upon a kind of vacation
If, it is believed that all concealed nodes are located in the range of transmission of receiving node.But the difference of communication range and disturbance range can be led
Cause RTS/CTS mechanism failure.
Takeda et al. propose it is a kind of based on queue length interaction scheduling scheme to solve hidden node problem.Node is real
When exchange queuing message, allow the longest node of queue length within the scope of double bounce to send data.Node is divided into active (active)
With inactive (inactive) two states, channel is accessed using CSMA mode.When backoff counter is 0, active node
Channel can be accessed and send data, inactive node may only reply.Node exchanges queuing message by data frame and ACK,
Remaining node monitor channel updates queuing message.Queuing message includes sending node, receiving node, and sending node one is jumped in range
The ID of queue length maximum node in addition to receiving node, current state, queue length.
As shown in Fig. 2, D sends data to E, A (the longest node of A, B, C queue length), D (sender), E are carried
The queuing message of (recipient), state switching law are as shown in table 1.It is compared with CSMA, RTS/CTS, the tune based on queue length
Degree scheme in the WMNs of heavy traffic handling capacity and in terms of have a biggish advantage, but when number of nodes increases,
When transmission rate becomes larger, time delay is obviously increased.
1 state switching law of table
In QECW scheme, queuing message is carried by data frame and ACK and is sent.When network load is larger, poor in timeliness,
Therefore the queuing message within the scope of double bounce is easy to appear inconsistent.When switching to active by inactive, node sends short frame
The message of Status Change is transferred to other nodes.If the neighbors of queuing message failure and receiving node is active shape
State, short frame and data frame all easily clash.As shown in figure 3, A, D, E, I are active node, remaining is inactive node.
D knows the queuing message of I by the ACK of F, and D monitors the data frame of E, turns after updating queuing message according to state switching law
For active state.A sends data to B, and D does not store the queuing message of A.The double bounce range of D exists simultaneously multiple at this time
The concealed nodes that active node, but D stores the queuing message within the scope of E, F double bounce, only A, H, J are only D.If D is sent out
Short frame is sent to send data to B to C, A, the data frame transfer time is long, and C will be constantly subjected to interfere before A terminates to send.More than
Conflict analysis show in the case that do not obtain receiving node one jump range in queuing message, the hidden node problem of QECW and
CSMA is equally serious.Therefore, it is necessary to study the queuing message solution hidden node problem how to store using node.
Summary of the invention
Technical problem to be solved by the invention is to provide a kind of channel access side based on queue length and collision risk
Method can reduce network conflict.
The technical solution adopted by the present invention to solve the technical problems is: providing a kind of based on queue length and collision risk
Channel access method, comprising the following steps:
(1) node is before transmitting according to the collision risk of the status predication data packet of node each in queuing message, preferentially
Send the small data packet of collision risk；
(2) when receiving node one, which is jumped, has live-vertex in range, sending node transmits queuing message in the form of notification frame,
Data are retransmited after sending successfully.
The step (2) specifically includes following sub-step:
(21) judge whether there is live-vertex in queuing message, if there is performing the next step；Otherwise, step (25) are gone to；
(22) check whether buffer area has live-vertex and notify the data packet of node, if there is judging live-vertex and leading to
Know position of the node data packet in buffer area, and performs the next step；Otherwise, step (25) are gone to；
(23) if the data packet of live-vertex is forward, mark position will be exchanged and be the label of live-vertex, and go to step
Suddenly (25)；If notifying the data packet of node forward, perform the next step；
(24) if sending node is successfully transmitted notification frame and gives notice node, will exchange mark position is the mark for notifying node
Number, and notice node is deleted, it goes in next step, otherwise deletes notice node, keep out of the way again；
(25) data are sent according to the concrete condition of exchange flag bit.
The notice node is to record a transparent node for jumping queuing message in range.
The exchange flag bit is used to record the node ID of preferential receipt data packet.
The step (25) specifically: if exchange flag bit is not 0, the data packet tune of flag bit corresponding node will be exchanged
To queue head, data are sent；If exchanging flag bit is 0, data are directly transmitted.
Beneficial effect
Due to the adoption of the above technical solution, compared with prior art, the present invention having the following advantages that and actively imitating
Fruit: the present invention is suitable for the WMNs of heavy traffic, for reducing network conflict, using node queue's length as the weighing apparatus of channel access
Amount standard realizes queuing message interaction by data frame and ACK, can effectively improve network throughput.The present invention passes through analysis
Various conflict situations, using the collision risk of the status predication data packet of node each in queuing message, node is according to data packet
Collision risk changes the sequence of buffer area data packet, preferential to send the data without concealed nodes direction.
Detailed description of the invention
Fig. 1 is concealed nodes illustraton of model in the prior art；
Fig. 2 is that queuing message notifies schematic diagram in the prior art；
Fig. 3 is the conflict schematic diagram of QECW in the prior art；
Fig. 4 is flow chart of the invention；
Fig. 5 is the form schematic diagram of notification frame in the present invention；
Fig. 6 is the schematic diagram of a specific embodiment conflict avoidance in the present invention.
Specific embodiment
Present invention will be further explained below with reference to specific examples.It should be understood that these embodiments are merely to illustrate the present invention
Rather than it limits the scope of the invention.In addition, it should also be understood that, after reading the content taught by the present invention, those skilled in the art
Member can make various changes or modifications the present invention, and such equivalent forms equally fall within the application the appended claims and limited
Range.
Embodiments of the present invention are related to a kind of channel access method based on queue length and collision risk, including following
Step: node is preferential to send punching before transmitting according to the collision risk of the status predication data packet of node each in queuing message
The small data packet of prominent risk；When receiving node one, which is jumped, has live-vertex in range, sending node transmits team in the form of notification frame
Column information retransmits data after sending successfully.
That is, node real-time exchange queuing message, allows the longest node of queue length within the scope of double bounce to send number
According to；Node before transmitting data, by the collision risk of prediction data packet, changes the transmission sequence of same priority data packet,
It is preferential to send the small data packet of collision risk.When the collision risk of data packet is the same, using the transmission principle of first in first out.Its
In, introducing notice node (abbreviation Inform Node) list records one and jumping queuing message in range is transparent node ID.Fig. 3
In, D has successfully received the ACK of F, and I is active state.ID of the D in Inform Node list records F.In addition, using exchange mark
Will position (abbreviation Exchange) records the node ID of preferential receipt data packet.When sending node Exchange flag bit not
When being 0, the data packet of Exchange corresponding node is adjusted to queue head before sending data and retransmits data packet by node needs.
Specifically as shown in figure 4, executing following steps when node accesses channel:
1. if turning in next step there is active node in queuing message；Otherwise turn step 5；
2. checking whether buffer area has active node and the data packet of InformNode, if there is both judgements data packet to exist
Position in buffer area turns in next step；If not turning step 5；
3. if Exchange to be set to the label of active node, turns step 5 the data packet of active node is forward；If
The data packet of Inform node is forward, turns in next step；
If Exchange to be set to the label of Inform Node 4. node is successfully transmitted notification frame to InformNode,
InformNode is deleted, turns next step, otherwise deletes InformNode, keep out of the way again；
5. if a data packet of Exchange corresponding node is adjusted to queue head, sends number Exchange is not 0
According to；If Exchange is 0, data are sent；
6. node sends failure, Exchange is set 0, terminates process；Node is sent successfully, terminates process.
The format of notification frame is provided with the transmission of notification frame and wants as shown in figure 5, in order to reduce the load of network as far as possible
It asks.If node send notification frame failure, by the node ID stored in Inform node delete, node next time access channel when not
Notification frame can be retransmited.By taking Fig. 3 as an example, unsuccessfully mean that I has begun transmission data when D sends notification frame, at this time F data packet
Collision risk it is maximum.
The present invention is further illustrated below by a specific embodiment.
As shown in fig. 6, D has found that E, I are active node before transmitting data, buffer area has the data packet of E, F.(1)
If the data packet of E is forward, D preferentially sends the data of E；(2) if the data packet of F is forward, D sends Inform and is properly received to F, F
After reply D.If I can be properly received the reply of F at this time, updates queuing message and switch to inactive state, be just avoided that conflict.D
Inform send successfully after preferentially send the data of F.(3) if the Inform of D sends failure, channel is accessed after keeping out of the way SIFS.
It is not difficult to find that present invention can be suitably applied to the WMNs of heavy traffic, for reducing network conflict.By node queue's length
As the measurement standard of channel access, queuing message interaction is realized by data frame and ACK, can effectively improve network throughput
Amount.But when network load increases, the queue length variation of node is too fast, and the inconsistent number that leads to a conflict of information increases.This
Various conflict situations are analyzed in invention, using the collision risk of the status predication data packet of node each in queuing message, node according to
The collision risk of data packet changes the sequence of buffer area data packet, preferential to send the data without concealed nodes direction.
Claims (5)
1. a kind of channel access method based on queue length and collision risk, which comprises the following steps:
(1) node is preferential to send before transmitting according to the collision risk of the status predication data packet of node each in queuing message
The small data packet of collision risk；
(2) when receiving node one, which is jumped, has live-vertex in range, sending node transmits queuing message in the form of notification frame, sends
Data are retransmited after success.
2. the channel access method according to claim 1 based on queue length and collision risk, which is characterized in that described
Step (2) specifically includes following sub-step:
(21) judge whether there is live-vertex in queuing message, if there is performing the next step；Otherwise, step (25) are gone to；
(22) check whether buffer area has live-vertex and notify the data packet of node, if there is judging that live-vertex and notice save
Position of the point data packet in buffer area, and perform the next step；Otherwise, step (25) are gone to；
(23) if the data packet of live-vertex is forward, mark position will be exchanged and be the label of live-vertex, and go to step
(25)；If notifying the data packet of node forward, perform the next step；
(24) if sending node is successfully transmitted notification frame and gives notice node, will exchange mark position is the label for notifying node,
And notice node is deleted, it goes in next step, otherwise deletes notice node, keep out of the way again；
(25) data are sent according to the concrete condition of exchange flag bit.
3. the channel access method according to claim 1 based on queue length and collision risk, which is characterized in that described
Notice node is to record a transparent node for jumping queuing message in range.
4. the channel access method according to claim 1 based on queue length and collision risk, which is characterized in that described
Exchange flag bit is used to record the node ID of preferential receipt data packet.
5. the channel access method according to claim 1 based on queue length and collision risk, which is characterized in that described
Step (25) specifically: if exchange flag bit is not 0, the data packet for exchanging flag bit corresponding node is adjusted to queue head,
Send data；If exchanging flag bit is 0, data are directly transmitted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810974327.7A CN109068394B (en) | 2018-08-24 | 2018-08-24 | Channel access method based on queue length and collision risk |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810974327.7A CN109068394B (en) | 2018-08-24 | 2018-08-24 | Channel access method based on queue length and collision risk |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109068394A true CN109068394A (en) | 2018-12-21 |
| CN109068394B CN109068394B (en) | 2021-04-23 |
Family
ID=64756937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810974327.7A Active CN109068394B (en) | 2018-08-24 | 2018-08-24 | Channel access method based on queue length and collision risk |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109068394B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112398744A (en) * | 2019-08-16 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Network communication method and device and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101982944A (en) * | 2010-11-17 | 2011-03-02 | 东南大学 | Method for underwater acoustic sensor network Aloha protocol |
| CN102612091A (en) * | 2012-03-01 | 2012-07-25 | 天津大学 | Media access control method based on spatial fairness in underwater sensor network |
| CN103634913A (en) * | 2012-08-22 | 2014-03-12 | 上海交通大学 | Clustering-based multi-hop multi-channel cognitive wireless sensor network communication method |
| CN105722234A (en) * | 2016-02-05 | 2016-06-29 | 北京佰才邦技术有限公司 | Method for scheduling resource in unlicensed frequency band, base station and terminal |
| CN108307439A (en) * | 2017-08-17 | 2018-07-20 | 上海大学 | A kind of self-adoptive retreating method under a large amount of multi-hop wireless nodes |
-
2018
- 2018-08-24 CN CN201810974327.7A patent/CN109068394B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101982944A (en) * | 2010-11-17 | 2011-03-02 | 东南大学 | Method for underwater acoustic sensor network Aloha protocol |
| CN102612091A (en) * | 2012-03-01 | 2012-07-25 | 天津大学 | Media access control method based on spatial fairness in underwater sensor network |
| CN103634913A (en) * | 2012-08-22 | 2014-03-12 | 上海交通大学 | Clustering-based multi-hop multi-channel cognitive wireless sensor network communication method |
| CN105722234A (en) * | 2016-02-05 | 2016-06-29 | 北京佰才邦技术有限公司 | Method for scheduling resource in unlicensed frequency band, base station and terminal |
| CN108307439A (en) * | 2017-08-17 | 2018-07-20 | 上海大学 | A kind of self-adoptive retreating method under a large amount of multi-hop wireless nodes |
Non-Patent Citations (1)
| Title |
|---|
| 杜骏璍: "20160315", 《中国优秀硕士论文全文数据库》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112398744A (en) * | 2019-08-16 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Network communication method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109068394B (en) | 2021-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Fu et al. | The impact of multihop wireless channel on TCP performance | |
| EP1850538B1 (en) | Radio communication device, communication route control device, communication route control method, and communication system | |
| Jurdak | Wireless ad hoc and sensor networks: A cross-layer design perspective | |
| CN111479306B (en) | Q-learning-based flight ad hoc network QoS routing method | |
| CN1886942B (en) | Method and system for routing traffic in AD HOC networks | |
| US20060028984A1 (en) | Energy efficient medium access control protocol for IEEE 802.11 WLANs | |
| JP2009512334A (en) | Method and apparatus for determining link cost for routing in wireless network | |
| Radenkovic et al. | Framework for utility driven congestion control in delay tolerant opportunistic networks | |
| CN104009913A (en) | Broadcasting method based on distance and energy balance in mobile Ad Hoc network | |
| Kim et al. | An AHP-based flexible relay node selection scheme for WBANs | |
| Qiu et al. | Maintaining links in the highly dynamic fanet using deep reinforcement learning | |
| CN105530680B (en) | A kind of vehicle self-organizing network relay vehicle selection method | |
| US20060120371A1 (en) | Coordinated convergecast for AD HOC wireless networks | |
| CN109068394A (en) | Channel access method based on queue length and collision risk | |
| Zhao et al. | Queueing analysis for medical data transmissions with delay-dependent packet priorities in WBANs | |
| Basarkod et al. | On-demand QoS and stability based multicast routing in mobile ad hoc networks | |
| CA2452742C (en) | Traffic specifications for polling requests of periodic sources | |
| Abada et al. | Improving relay selection scheme for connecting VANET to internet over IEEE 802.11 p | |
| Campos et al. | Performance issues of ad hoc routing protocols in a network scenario used for videophone applications | |
| Guo et al. | Evaluating the impact of aggregation and RTS/CTS schemes on IEEE 802.11 based Linear Wireless Ad‐Hoc Networks | |
| Hadiwardoyo | An overview of qos enhancements for wireless vehicular networks | |
| Abada et al. | An efficient mobile gateway selection and discovery based-routing protocol in heterogeneous LTE-VANET networks | |
| Paranjape et al. | Intra and inter cluster congestion control technique for mobile wireless sensor networks | |
| Zhao et al. | Quality-driven capacity-aware resources optimization design for ubiquitous wireless networks | |
| Wannawilai et al. | AODV with Sufficient Intermediary Bandwidth Aware |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |