CN108200602B - Multi-address access method based on load perception in wireless ad hoc network - Google Patents
Multi-address access method based on load perception in wireless ad hoc network Download PDFInfo
- Publication number
- CN108200602B CN108200602B CN201711468896.6A CN201711468896A CN108200602B CN 108200602 B CN108200602 B CN 108200602B CN 201711468896 A CN201711468896 A CN 201711468896A CN 108200602 B CN108200602 B CN 108200602B
- Authority
- CN
- China
- Prior art keywords
- node
- wireless
- period
- hoc network
- network
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention provides a multi-access method based on load perception in a wireless ad hoc network, wherein a node obtains the real-time network load condition around the node through the statistics of self load and the distributed cooperation among the nodes, and the node decides the data packet sending rate and sending time of the node in a future period of time based on the result of network load perception. The overall principle is to reduce the average sending rate when the network load is high; when the network load is lower, the average sending rate is improved, so that the collision probability of a wireless channel is controlled, and the utilization rate of wireless resources is improved.
Description
Technical Field
The invention belongs to the technical field of wireless ad hoc networks, and particularly relates to a load sensing-based multiple access method.
Background
In the wireless ad hoc network, nodes share the same wireless channel resource to complete data transmission and reception, and the multiple access method determines a mechanism for using and sharing the wireless channel resource among the nodes, and has an important influence on the utilization efficiency of the wireless channel resource. The multiple access method of the wireless ad hoc network at present mainly adopts a multiple access method of carrier sense collision avoidance, a node firstly senses a channel state before sending data, the data can be sent if the channel is in an idle state, and the node needs to retreat for a period of time and then accesses the channel if the channel is in a busy state. When the number of nodes in the wireless ad hoc network is large, each node frequently monitors and tries to send data, so that the collision probability of node data grouping is increased, and the utilization rate of a channel is reduced.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a multiple access method based on load perception, which reasonably controls the rate of sending data packets on a wireless channel by nodes through exchanging information of service load (in the method, the service load mainly refers to the average sending rate of sending the data packets on the wireless channel by the nodes) among the nodes, thereby reducing the collision probability of the data packets on the wireless channel and improving the use efficiency of network resources.
The technical scheme adopted by the invention for solving the technical problem comprises the following steps:
step 1, each node in the wireless ad hoc network counts the data transmission rate mu of the node in the previous period according to a set period T and broadcasts in the network;
step 2, each node in the wireless ad hoc network counts the sum eta of the sending rates broadcast by all the neighbor nodes received in the period according to the set period T, and predicts the business demand sending rate lambda of the node in the next period T according to the historical queue arrival rate information x of the node;
step 3, each node in the wireless ad hoc network broadcasts the sending rate sum eta according to all the neighbor nodes according to the set period T, the service requirement sending rate lambda of the node and the optimal load U of the networkpCalculating the allowed sending rate mu of the node in the next period Tp，
Wherein alpha is a weighting coefficient, and alpha is more than 0 and less than 1;
step 4, each node in the wireless ad hoc network sends the speed mu according to the permission of the nodepCalculating the average back-off time of each data packet
Wherein N ispktAverage size of data packets sent for the node, TsAverage time overhead for transmitting data packets;
step 5, each node in the wireless ad hoc network is at each TwRandomly selecting a time to send a data packet in a time period; when the period T is finished, the step 1 is carried out.
The invention has the beneficial effects that: the nodes in the wireless ad hoc network control the sending rate of the nodes through interacting and sensing the network load condition of the neighbor nodes and predicting the sending rate of the nodes and through a proper load sensing model, so that the network is prevented from being in a congestion state, the collision probability of data packets in the wireless network is reduced, and the utilization rate of network resources is improved.
Detailed Description
The present invention is further illustrated by the following examples, which include, but are not limited to, the following examples.
The invention uses the multiple access method to coordinate the wireless resources shared by all nodes in the wireless ad hoc network, and has important influence on the utilization efficiency of the wireless channel resources and the service quality of the service. The load sensing-based multiple access method can coordinate sharing of wireless resources among nodes, reduce the collision probability of data grouping among the nodes and improve the utilization efficiency of wireless channel resources.
According to the load perception-based multiple access method, the nodes acquire the real-time network load conditions around the nodes through the statistics of the loads of the nodes and the distributed cooperation among the nodes, and the nodes decide the data packet sending rate and sending time of the nodes in a future period of time based on the network load perception result. The overall principle is to reduce the average sending rate when the network load is high; when the network load is lower, the average sending rate is improved, so that the collision probability of a wireless channel is controlled, and the utilization rate of wireless resources is improved.
The technical scheme of the invention comprises the following steps:
step 1: every other period T (T unit is second, the value range is any rational number greater than zero, the invention does not make specific specification for T value) of each node in the wireless ad hoc network counts the data transmission rate mu of the node in the last period, wherein the data transmission rate mu is defined as the average value of the number of data packets transmitted to a wireless channel by the node in unit time, the unit is Mbps, then the transmission rate mu is broadcasted in the network, and the step 2 is carried out.
Step 2: each node in the wireless ad hoc network counts the sum eta (eta is sigma mu) of the sending rates broadcast by all the neighbor nodes received in the period at intervals of TNeighbor(s)) And predicting the service demand sending rate lambda of the node in the next period T according to the historical queue arrival rate information x of the node (the invention does not make specific specification on a specific prediction method, and the adopted methods include but are not limited to a time statistical averaging method, a sliding window linear prediction method, a sliding window secondary autoregressive prediction method and the like), and then, turning to step 3.
And step 3: every node in the wireless ad hoc network is according to the sum eta of the sending rates broadcasted by all the neighbor nodes, the service demand sending rate lambda of the node and the optimal load U of the network at intervals of a period Tp(the node finds the optimal load pre-configuration parameter table to obtain the current optimal load through the network, the optimal load pre-configuration parameter table comprises the network node number, the packet loss rate, the optimal load and other contents (given in a table way, as shown in table 1), the invention does not make specific specification on the acquisition method of the optimal load pre-configuration parameter table, can obtain the relation table of the packet loss rate and the network optimal load under a certain node number through a mathematical modeling or offline network simulation way, and calculates the allowable sending rate mu of the node in the next period T)pThe unit is Mbps, and the specific calculation mode is as follows:
wherein alpha is a weighting coefficient, the value range of alpha is more than 0 and less than 1, the closer alpha is to 0, the better the fairness among nodes is, but the worse the system throughput performance is, the invention does not make specific specifications on the value of alpha, and the step 4 is shifted.
Table 1 optimal load pre-configuration parameter table
| Number of nodes | Packet loss rate | Optimum load |
| 2 | 0.05 | xxMbps |
| 2 | 0.1 | xxMbps |
| … | … | … |
| 3 | 0.05 | xxMbps |
| … | … | … |
And 4, step 4: each node in the wireless ad hoc network transmits the speed mu according to the permission of the nodepCalculating the average back-off time T of each data packetwThe specific calculation method is as follows:
wherein N ispktAverage size of data packets sent for the node in Mb, TsStep 5 is carried out for the average time overhead for transmitting data packets, i.e. the ratio of the average size of the transmitted data packets to the average transmission rate, in seconds.
And 5: each node in the wireless ad hoc network is at each TwA time within the time period is randomly selected to transmit a data packet. When the period T is finished, the step 1 is carried out.
In a wireless ad hoc network, there are 4 nodes, which are 0, 1, 2 and 3 respectively, taking node 0 as an example for description, and the implementation method of other nodes is the same as node 0.
Step 1: node 0 in wireless ad hoc network is arranged at intervals of T (T unit)For second, it takes any rational number whose value range is greater than zero, in this embodiment, T is set to 2 seconds) to count the data transmission rate μ of the node in the last period0Here the data transmission rate mu0Defined as the average of the number of data packets sent to the radio channel by the node per unit time, in Mbps, and then the sending rate, mu0And broadcasting in the network, and turning to the step 2.
Step 2: node 0 in the wireless ad hoc network counts the sum eta of the sending rates of the neighbor node broadcasts received in the period every T period0(Here)
Where i is a node number), and predicts the service demand sending rate lambda of the node in the next period T according to the historical queue arrival rate information x of the node0In this embodiment, the required transmission rate λ is calculated by using a time statistical averaging method0I.e. by
Wherein N is the number of time statistic average windows, and can be selected as any positive integer, xiAnd (4) transferring the queue arrival rate information of the ith window to the step 3.
And step 3: node 0 in the wireless ad hoc network broadcasts the sum eta of the sending rates according to the neighbor nodes every period T0Service requirement sending rate lambda of the node0And the optimal load of the network
(the node finds the optimal load preconfigured parameter table through the network to obtain the current optimal load, the optimal load preconfigured parameter table includes the network node number, the packet loss rate, the optimal load, and the like, in this embodiment, the relationship table between the packet loss rate and the network optimal load at a certain node number is obtained by using an offline network simulation manner, as shown in table 2), and the allowed sending rate of the node in the next period T is calculated
The unit is Mbps, and the specific calculation method is shown as the following formula:
wherein α is a weighting coefficient, whose value range is 0 < α < 1, and the closer α is to 0, the better the fairness among nodes is, but the worse the system throughput performance is, in this embodiment, the value of α is 0.5, and step 4 is performed.
Table 2 optimal load pre-configuration parameter table
And 4, step 4: node 0 in wireless ad hoc network according to the allowed sending rate of the node
Calculating the average back-off time of each data packet
The specific calculation method is as follows:
wherein
The average size of the data packets sent for node 0, in Mb,
average time overhead for transmitting data packets for node 0, i.e. average size of transmitted data packets and average transmission rateThe ratio of the rates is in seconds. And (5) turning to the step.
And 5: node 0 in the wireless ad hoc network is at each
A time within the time period is randomly selected to transmit a data packet. When the period T is finished, the step 1 is carried out.
Claims (1)
1. A multi-access method based on load perception in a wireless ad hoc network is characterized by comprising the following steps:
step 1, each node in the wireless ad hoc network counts the data transmission rate mu of the node in the previous period according to a set period T and broadcasts in the network;
step 2, each node in the wireless ad hoc network counts the sum eta of the sending rates broadcast by all the neighbor nodes received in the period according to the set period T, and predicts the business demand sending rate lambda of the node in the next period T according to the historical queue arrival rate information x of the node;
step 3, each node in the wireless ad hoc network broadcasts the sending rate sum eta according to all the neighbor nodes according to the set period T, the service requirement sending rate lambda of the node and the optimal load U of the networkpCalculating the allowed sending rate mu of the node in the next period Tp，
Wherein alpha is a weighting coefficient, and alpha is more than 0 and less than 1;
step 4, each node in the wireless ad hoc network sends the speed mu according to the permission of the nodepCalculating the average back-off time of each data packet
Wherein N ispktAverage size of data packets sent for the node, TsFor averaging transmitted data packetsA time overhead;
step 5, each node in the wireless ad hoc network is at each TwRandomly selecting a time to send a data packet in a time period; when the period T is finished, the step 1 is carried out.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711468896.6A CN108200602B (en) | 2017-12-29 | 2017-12-29 | Multi-address access method based on load perception in wireless ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711468896.6A CN108200602B (en) | 2017-12-29 | 2017-12-29 | Multi-address access method based on load perception in wireless ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108200602A CN108200602A (en) | 2018-06-22 |
| CN108200602B true CN108200602B (en) | 2021-01-01 |
Family
ID=62585898
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711468896.6A Active CN108200602B (en) | 2017-12-29 | 2017-12-29 | Multi-address access method based on load perception in wireless ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108200602B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113453269B (en) * | 2020-03-27 | 2022-07-15 | 哈尔滨工业大学 | Priority-based channel load statistics and backoff window setting method |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100464607C (en) * | 2003-04-25 | 2009-02-25 | 富士通株式会社 | Transmitting device for assigning data for receiving device selected from plurality of receiving devices to shared channel |
| US9030932B2 (en) * | 2011-08-24 | 2015-05-12 | Texas Instruments Incorporated | Enhanced carrier sense multiple access (CSMA) protocols |
| US9288709B2 (en) * | 2013-02-10 | 2016-03-15 | Qualcomm Incorporated | Adjustable carrier sense threshold for wireless broadcast |
| EP3855797A1 (en) * | 2014-03-31 | 2021-07-28 | Convida Wireless, LLC | Overload control and coordination between m2m service layer and 3gpp networks |
| CN104581821B (en) * | 2015-01-28 | 2018-03-20 | 湘潭大学 | Jamming control method based on nodal cache length fair allocat speed |
| CN106454437B (en) * | 2015-08-12 | 2019-08-13 | 中国移动通信集团设计院有限公司 | A kind of streaming media service rate prediction method and device |
-
2017
- 2017-12-29 CN CN201711468896.6A patent/CN108200602B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN108200602A (en) | 2018-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Luo et al. | Self-coordinating localized fair queueing in wireless ad hoc networks | |
| EP2119143B1 (en) | Method of congestion management in a wireless mesh network. | |
| Bhandari et al. | Device grouping for fast and efficient channel access in IEEE 802.11 ah based IoT networks | |
| CN110662233B (en) | Statistical priority multiple access method based on directional antenna receiving and transmitting | |
| CN111163491A (en) | Fine-grained statistical priority multiple access method with high channel utilization rate | |
| CN108200602B (en) | Multi-address access method based on load perception in wireless ad hoc network | |
| CN102104517B (en) | Random number statement-based multiple access method | |
| EP2526660B1 (en) | A method for operating a wireless network and a wireless network | |
| Cheng et al. | A QoS-provision multi-channel MAC in RSU-assisted vehicular networks (poster) | |
| Rohm et al. | A simulation based analysis of the impact of IEEE 802.15. 4 MAC parameters on the performance under different traffic loads | |
| CN103152834A (en) | Intelligent allocation method for wireless flow | |
| WO2019054112A1 (en) | Communication apparatus, wireless communication system and data flow control method | |
| Peng et al. | Throughput modeling of differentiation schemes for IEEE 802.11 e MAC protocol | |
| CN117693996A (en) | Method and apparatus for coordinated transmission opportunity sharing in a wireless network | |
| Yazdani et al. | A fair access mechanism based on TXOP in IEEE 802.11 e wireless networks | |
| Sanguankotchakorn et al. | Adaptive channel access mechanism for real time traffic over IEEE 802.11 e Wi-Fi network | |
| CN113329439A (en) | Resource allocation method based on transmission delay | |
| CN110958717A (en) | Contention-free random medium access control method and system for centralized wireless local area network | |
| Cao et al. | Cellular M2M network access congestion: Performance analysis and solutions | |
| Shuhaimi et al. | Performance analysis for uniform and binomial distribution on contention window using DSRC and Wi-Fi Direct standard | |
| Paudel et al. | I-DCF: improved DCF for channel access in IEEE 802.11 wireless networks | |
| Ito et al. | Adaptive contention window control scheme for dense IEEE802. 11 wireless LANs | |
| Yu et al. | An adaptive radio resource management technique for APs in WLANs | |
| Nam et al. | Fairness Enhancement Scheme for Multimedia Applications in IEEE 802.11 e Wireless LANs | |
| CN113194424B (en) | RAW packet access method based on outage probability in industrial Internet of things |
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 |