CN108200602A - Multiple access method based on Load-aware in a kind of wireless self-networking - Google Patents
Multiple access method based on Load-aware in a kind of wireless self-networking Download PDFInfo
- Publication number
- CN108200602A CN108200602A CN201711468896.6A CN201711468896A CN108200602A CN 108200602 A CN108200602 A CN 108200602A CN 201711468896 A CN201711468896 A CN 201711468896A CN 108200602 A CN108200602 A CN 108200602A
- Authority
- CN
- China
- Prior art keywords
- node
- networking
- transmission rate
- wireless self
- load
- 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
- 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
Abstract
The present invention provides the multiple access methods based on Load-aware in a kind of wireless self-networking, node obtains the real-time network load state on this node periphery by the distributed collaborative the statistics between own load and node, node based on network load perceive as a result, the data package transmission velocity and sending time of following this node of a period of time of decision.The overall principle is when network load is higher, reduces average transmission rate；When network load is relatively low, average transmission rate is improved, so as to control the collision probability of wireless channel, promotes the utilization rate of radio resource.
Description
Technical field
The invention belongs to Wireless Ad Hoc Networks field, especially a kind of multiple access method based on Load-aware.
Background technology
In wireless self-networking, the identical radio channel resource of nodes sharing is to complete the transmitting-receiving of data, and multiple access accesses
Method then determines the mechanism for using between node and sharing radio channel resource, has for the utilization ratio of radio channel resource
Important influence.The multiple access method of wireless self-networking mainly uses the multiple access access side of carrier sense conflict avoidance at present
Method, node intercept channel status first before transmission data, can be with transmission data, if letter if channel is in idle condition
Road then needs to keep out of the way in busy state accesses channel again for a period of time.When wireless self-networking interior joint number is more, each node
Transmission data is frequently monitored and attempted, the collision probability that node data is grouped is caused to increase, the utilization rate of channel reduces.
Invention content
For overcome the deficiencies in the prior art, the present invention provides a kind of multiple access method based on Load-aware, passes through
(business load refers mainly to the flat of node transmission data grouping over the wireless channel in the method for interactive service load between node
Equal transmission rate) information, the rational control node rate that transmission data is grouped over the wireless channel, so as to reduce wireless channel
The collision probability of upper packet improves the service efficiency of Internet resources.
The technical solution adopted by the present invention to solve the technical problems includes the following steps：
Step 1, each node counts data hair of the node in upper a cycle according to setting cycle T in wireless self-networking
Transmission rate μ, and broadcasted in a network；
Step 2, each node counts this period according to setting cycle T and whole neighbours for receiving are inscribed save in wireless self-networking
The sum of the transmission rate of point broadcast η, and predicted according to the queue arrival rate information x of the history of this node in next cycle T
The business demand transmission rate λ of interior node；
Step 3, the transmission rate that each node is broadcasted according to setting cycle T according to whole neighbor nodes in wireless self-networking
The sum of η, the business demand transmission rate λ of this node and network optimal load Up, this node is calculated in next cycle T
Allow transmission rate μp,
Wherein α be weighting coefficient, 0 ＜ α ＜ 1；
Step 4, each node in wireless self-networking is according to the permission transmission rate μ of the nodep, calculate each data packet
Average backing off timeWherein NpktFor the mean size of node transmission data grouping, TsTo send number
According to the average time expense of grouping；
Step 5, each node in wireless self-networking is in each TwOne time of random selection sends one in period
Packet；At the end of this cycle T, it is transferred to step 1.
The beneficial effects of the invention are as follows：Node in wireless self-networking passes through interaction and the network load of sensing neighbor node
Situation and the transmission rate for predicting oneself, by suitable Load-aware model, the transmission rate to draw oneself up, so as to
Network is avoided to be in congestion state, reduces the collision probability of data packet in wireless network, improves the utilization rate of Internet resources.
Specific embodiment
With reference to embodiment, the present invention is further described, and the present invention includes but are not limited to following embodiments.
Multiple access method is used to coordinate each nodes sharing radio resource in wireless self-networking by the present invention, for wireless communication
The utilization ratio of road resource and the service quality of business have important influence.Multiple access method based on Load-aware can be with
Radio resource is shared between coordinator node, reduces the collision probability of internodal data grouping, promotes the profit of radio channel resource
Use efficiency.
Multiple access method proposed by the present invention based on Load-aware, node pass through the statistics and section to own load
Distributed collaborative between point obtains the real-time network load state on this node periphery, the knot that node is perceived based on network load
Fruit, the data package transmission velocity and sending time of following this node of a period of time of decision.The overall principle be when network load compared with
Gao Shi reduces average transmission rate；When network load is relatively low, average transmission rate is improved, so as to control rushing for wireless channel
Prominent probability promotes the utilization rate of radio resource.
Technical scheme of the present invention includes the following steps：
Step 1：Every cycle T, (T unit is the second to each node, and value range is appointing more than zero in wireless self-networking
Meaning rational, the present invention do not make concrete norm to the value of T) data transmission rate μ of the node in upper a cycle is counted,
Data transmission rate μ is defined as being averaged for the number of data packets being sent on wireless channel in the node unit interval herein
Then transmission rate μ is broadcasted, is transferred to step 2 by value, unit Mbps in a network.
Step 2：Each node every cycle T counts this period that whole neighbor nodes for receiving are inscribed is wide in wireless self-networking
The sum of transmission rate broadcast η (η=∑ μNeighbours), and predicted according to the queue arrival rate information x of the history of this node next
(present invention does not do concrete norm to the business demand transmission rate λ of this node to specific Forecasting Methodology, may be used in cycle T
Method includes but not limited to time statistical average method, sliding window linear prediction method, the secondary autoregressive prediction of sliding window
Method etc.), it is transferred to step 3.
Step 3：The sum of transmission rate that each node is broadcasted every cycle T according to whole neighbor nodes in wireless self-networking
η, the business demand transmission rate λ of this node and the optimal load U of networkp(node is prewired by internet search optimal load
It puts parameter list and obtains current optimal load, which includes number of network node, and packet loss is optimal negative
The contents such as load (are provided, as shown in table 1) with the mode of table, and the present invention is not to the acquisition methods of optimal load preconfiguration parameters table
Concrete norm is made, packet loss and net under some number of nodes can be obtained by way of mathematical modeling or offline network emulation
The relation table of network optimal load), calculate permission transmission rate μ of this node in next cycle Tp, unit Mbps, specific meter
Calculation mode is is shown below：
Wherein α is weighting coefficient, and value range is 0 ＜ α ＜ 1, and α fairness between 0, node is better, but is
Throughput performance of uniting is then poorer, and the present invention does not make concrete norm to the value of α, is transferred to step 4.
1 optimal load preconfiguration parameters table of table
| Number of nodes | Packet loss | Optimal load |
| 2 | 0.05 | xxMbps |
| 2 | 0.1 | xxMbps |
| … | … | … |
| 3 | 0.05 | xxMbps |
| … | … | … |
Step 4：Each node in wireless self-networking is according to the permission transmission rate μ of the nodep, calculate each data packet
Average backing off time Tw, specific calculation is：
Wherein NpktFor the mean size of node transmission data grouping, unit Mb, TsFor being averaged for transmission data grouping
The ratio between the mean size of time overhead, i.e. transmission data grouping and average transmission rate, unit is the second, is transferred to step 5.
Step 5：Each node in wireless self-networking is in each TwOne time of random selection sends one in period
Packet.At the end of this cycle T, it is transferred to step 1.
In a wireless self-networking, there are 4 nodes, respectively 0,1,2 and 3, it is illustrated by taking node 0 as an example,
The implementation method of his node is identical with node 0.
Step 1：Every cycle T, (T unit is the second to wireless self-networking interior joint 0, and value range is arbitrarily having more than zero
Number is managed, setting T is 2 seconds in the present embodiment) count data transmission rate μ of the node in upper a cycle0, data transmission herein
Rate μ0The average value for the number of data packets being sent in the node unit interval on wireless channel is defined as, unit is
Mbps, then by transmission rate μ0It is broadcasted in a network, is transferred to step 2.
Step 2：Wireless self-networking interior joint 0 every cycle T count this period be inscribed receive neighbor node broadcast hair
The sum of transmission rate η0, (hereinWherein i is node serial number), and speed is reached according to the queue of the history of this node
The business demand transmission rate λ of rate information x predictions this node in next cycle T0, it is flat using time statistics in the present embodiment
Equal method calculates demand transmission rate λ0, i.e.,Wherein N is time statistical average window number, can be with
The arbitrary positive integer of selected as, xiFor the queue arrival rate information of i-th of window, it is transferred to step 3.
Step 3：The sum of the transmission rate that wireless self-networking interior joint 0 is broadcasted every cycle T according to neighbor node η0, this section
The business demand transmission rate λ of point0And the optimal load of network(node is pre-configured by internet search optimal load joins
Number table obtains current optimal load, which includes number of network node, packet loss, optimal load etc.
Content obtains packet loss and network optimal load under some number of nodes in the present embodiment by the way of offline network emulation
Relation table, as shown in table 2), calculate permission transmission rate of this node in next cycle TUnit is Mbps, specific to calculate
Mode is is shown below：
Wherein α is weighting coefficient, and value range is 0 ＜ α ＜ 1, and α fairness between 0, node is better, but is
Throughput performance of uniting is then poorer, and α values are 0.5 in the present embodiment, are transferred to step 4.
2 optimal load preconfiguration parameters table of table
Step 4：Node 0 in wireless self-networking is according to the permission transmission rate of the nodeCalculate each data packet
Average backing off timeSpecifically calculation is：
WhereinFor 0 transmission data of node grouping mean size, unit Mb,It is grouped for 0 transmission data of node
Average time expense, i.e. the ratio between the mean size of transmission data grouping and average transmission rate, unit is the second.It is transferred to step 5.
Step 5：Node 0 in wireless self-networking is eachOne time of random selection sends a number in period
According to grouping.At the end of this cycle T, it is transferred to step 1.
Claims (1)
1. the multiple access method based on Load-aware in a kind of wireless self-networking, it is characterised in that include the following steps：
Step 1, each node counts the node according to setting cycle T and sends speed in the data of upper a cycle in wireless self-networking
Rate μ, and broadcasted in a network；
Step 2, each node according to setting cycle T counts this period that whole neighbor nodes for receiving are inscribed is wide in wireless self-networking
The sum of transmission rate broadcast η, and predicted in next cycle T originally according to the queue arrival rate information x of the history of this node
The business demand transmission rate λ of node；
Step 3, the sum of transmission rate that each node is broadcasted according to setting cycle T according to whole neighbor nodes in wireless self-networking
The optimal load U of η, the business demand transmission rate λ of this node and networkp, calculate permission of this node in next cycle T
Transmission rate μp,
Wherein α be weighting coefficient, 0 ＜ α ＜ 1；
Step 4, each node in wireless self-networking is according to the permission transmission rate μ of the nodep, calculate the flat of each data packet
Equal back off timeWherein NpktFor the mean size of node transmission data grouping, TsFor transmission data point
The average time expense of group；
Step 5, each node in wireless self-networking is in each TwOne time of random selection sends a data point in period
Group；At the end of this cycle T, it is transferred to step 1.
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 true CN108200602A (en) | 2018-06-22 |
| CN108200602B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113453269A (en) * | 2020-03-27 | 2021-09-28 | 哈尔滨工业大学 | Priority-based channel load statistics and backoff window setting method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1771750A (en) * | 2003-04-25 | 2006-05-10 | 富士通株式会社 | Transmitting device for assigning data for receiving device selected from plurality of receiving devices to shared channel |
| US20130049939A1 (en) * | 2011-08-24 | 2013-02-28 | Texas Instruments Incorporated | Enhanced Carrier Sense Multiple Access (CSMA) Protocols |
| US20140226497A1 (en) * | 2013-02-10 | 2014-08-14 | Qualcomm Incorporated | Adjustable carrier sense threshold for wireless broadcast |
| CN104581821A (en) * | 2015-01-28 | 2015-04-29 | 湘潭大学 | Congestion control method based on node cache length equitable distribution rate |
| CN106233757A (en) * | 2014-03-31 | 2016-12-14 | 康维达无线有限责任公司 | Premature beats between M2M service layer and 3GPP network and coordination |
| CN106454437A (en) * | 2015-08-12 | 2017-02-22 | 中国移动通信集团设计院有限公司 | Streaming media service rate prediction method and device |
-
2017
- 2017-12-29 CN CN201711468896.6A patent/CN108200602B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1771750A (en) * | 2003-04-25 | 2006-05-10 | 富士通株式会社 | Transmitting device for assigning data for receiving device selected from plurality of receiving devices to shared channel |
| US20130049939A1 (en) * | 2011-08-24 | 2013-02-28 | Texas Instruments Incorporated | Enhanced Carrier Sense Multiple Access (CSMA) Protocols |
| US20140226497A1 (en) * | 2013-02-10 | 2014-08-14 | Qualcomm Incorporated | Adjustable carrier sense threshold for wireless broadcast |
| CN106233757A (en) * | 2014-03-31 | 2016-12-14 | 康维达无线有限责任公司 | Premature beats between M2M service layer and 3GPP network and coordination |
| CN104581821A (en) * | 2015-01-28 | 2015-04-29 | 湘潭大学 | Congestion control method based on node cache length equitable distribution rate |
| CN106454437A (en) * | 2015-08-12 | 2017-02-22 | 中国移动通信集团设计院有限公司 | Streaming media service rate prediction method and device |
Non-Patent Citations (2)
| Title |
|---|
| PRASHANTH ARAVINDA KUMAR ACHARYA，ASHISH SHARMA，ETC: "Congestion-Aware Rate Adaptation in Wireless Networks: A Measurement-Driven Approach", 《2008 5TH ANNUAL IEEE COMMUNICATIONS SOCIETY CONFERENCE ON SENSOR, MESH AND AD HOC COMMUNICATIONS AND NETWORKS》 * |
| 王峰，杨金禄，孙永进，梁建辉: "基于ZigBee的无线网络在航天领域的应用", 《航天器环境工程》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113453269A (en) * | 2020-03-27 | 2021-09-28 | 哈尔滨工业大学 | Priority-based channel load statistics and backoff window setting method |
| CN113453269B (en) * | 2020-03-27 | 2022-07-15 | 哈尔滨工业大学 | Priority-based channel load statistics and backoff window setting method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108200602B (en) | 2021-01-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104936303B (en) | A kind of method that carrier sense thresholding jointly controls with competition window | |
| CN103067985A (en) | Super-speed wireless local area network channel binding and allocation method based on channel quality | |
| Kai et al. | Energy-efficient sensor grouping for IEEE 802.11 ah networks with max-min fairness guarantees | |
| CN105813218A (en) | Service scheduling method of wireless Ad hoc network | |
| CN103068054A (en) | Controllable super-speed wireless local area network channel access method based on time delay | |
| CN103220726A (en) | Dynamic adjustment method of EDCA (Enhanced Distributed Channel Access) parameter values and related device | |
| Ahmed et al. | A QoS-aware MAC protocol for IEEE 802.11 ah-based Internet of Things | |
| CN108811001A (en) | The discretized channel cut-in method reserved with TDMA based on CSMA competitions | |
| CN105873233A (en) | IEEE802.11ax access enhancement method based on hierarchical scheduling | |
| Bonald et al. | On the stability of flow-aware CSMA | |
| CN102984736A (en) | Optimizing method for wireless ubiquitous heterogeneous network resources | |
| CN107659940B (en) | Multi-priority multi-channel media access control method based on channel perception | |
| Kumar et al. | A delay efficient MAC and packet scheduler for heterogeneous M2M uplink | |
| CN105611570A (en) | Vehicle ad hoc network MAC layer back-off method based on channel state judgment | |
| Xiao et al. | Bandwidth sharing schemes for multimedia traffic in the IEEE 802.11 e contention-based WLANs | |
| Cheng et al. | A QoS-provision multi-channel MAC in RSU-assisted vehicular networks (poster) | |
| Mardani et al. | Robust uplink resource allocation in LTE networks with M2M devices as an infrastructure of Internet of Things | |
| CN108200602A (en) | Multiple access method based on Load-aware in a kind of wireless self-networking | |
| CN103152834A (en) | Intelligent allocation method for wireless flow | |
| CN114928611B (en) | IEEE802.11p protocol-based energy-saving calculation unloading optimization method for Internet of vehicles | |
| Kocak et al. | Fuzzy logic-based performance improvement on MAC layer in wireless local area networks | |
| Zhang et al. | Delay guaranteed MDP scheduling scheme for HCCA based on 802.11 p protocol in V2R environments | |
| Libório et al. | Network Slicing in IEEE 802.11 ah | |
| Chen et al. | HOL delay based scheduling in wireless networks with flow-level dynamics | |
| Hantrakoon et al. | Priority Based HCCA for IEEE 802.11 e |
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 |