CN105517184A - High-efficiency contention window adjusting mechanism in high-density radio random access network - Google Patents
High-efficiency contention window adjusting mechanism in high-density radio random access network Download PDFInfo
- Publication number
- CN105517184A CN105517184A CN201511006147.2A CN201511006147A CN105517184A CN 105517184 A CN105517184 A CN 105517184A CN 201511006147 A CN201511006147 A CN 201511006147A CN 105517184 A CN105517184 A CN 105517184A
- Authority
- CN
- China
- Prior art keywords
- channel
- competition window
- node
- est
- wireless 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.)
- Pending
Links
- 230000007246 mechanism Effects 0.000 title abstract description 5
- 230000008844 regulatory mechanism Effects 0.000 claims description 17
- 238000000034 method Methods 0.000 claims description 7
- 230000002860 competitive effect Effects 0.000 claims description 6
- 238000013507 mapping Methods 0.000 claims description 5
- 230000004308 accommodation Effects 0.000 claims description 4
- 238000012544 monitoring process Methods 0.000 claims description 4
- 230000001174 ascending effect Effects 0.000 claims description 2
- 238000001514 detection method Methods 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 abstract description 5
- 238000004891 communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 108700026140 MAC combination Proteins 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the field of electronic information technology, and provides a high-efficiency contention window adjusting mechanism which is suitable for a high-density radio random access network. The high-efficiency contention window adjusting mechanism is characterized in that a channel parameter is dynamically estimated through making a node in the network monitor the channel state in real time; and furthermore a more reasonable contention window adjusting plan is selected according to the deviation degree between an estimated value and a theoretical optimal value. The high-efficiency contention window adjusting mechanism has advantages of low difficulty, easy realization, high adjusting accuracy in channel accessing and high adjusting speed.
Description
Technical field
The present invention relates to electronic information technical field, particularly the efficient media of one get involved competition mechanism, more specifically, design the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System.
Background technology
At present, distributed wireless Network with Random Multiple Access System is widely used in military affairs, intelligent transportation, environmental monitoring, and the concern of hygiene medical treatment is multi-field.Have benefited from microelectromechanical-systems, SOC (system on a chip), the develop rapidly of radio communication and low-power-consumption embedded technology, wireless Network with Random Multiple Access System progressively becomes Internet of Things communication, and M2M communicates, and V2V communication waits the important component part of cutting edge communications technical field.The quantity of the wireless network node caused in certain area significantly increases by this.Therefore, we need more reasonably medium education (MAC) agreement badly, make super amount node in high density distributed wireless Stochastic accessing net more fair, take limited channel resource efficiently.
In wireless Network with Random Multiple Access System, neighbours' quantity of node exponentially increases with the increase of networking density.By the impact of each node application layer data generation rate, competition node (simultaneously the node of the competitive channel resource) quantity in network will keep constantly change.Compare with conventional wireless Network with Random Multiple Access System, high-density wireless Stochastic accessing net MAC protocol needs:
1. dispatch more accurately.Make network when super multinode accesses simultaneously, still can keep high throughput.
2. dispatch more fast.Enable network effectively hold the situation of change of competition interstitial content, and make rapid adjustment.Reduce because network competition interstitial content pace of change is too fast, amplitude of variation is excessive, and the throughput loss caused.
In existing achievement in research, the technology of accurately scheduling can be carried out often along with slow problem of regulating the speed, and the technology with fast dispatch ability is difficult to the accuracy ensureing scheduling.
Summary of the invention
The object of the invention is to the deficiency overcoming prior art, a kind of efficient competition window Regulation mechanism being applicable to high-density wireless Network with Random Multiple Access System is proposed, by making nodes Real-Time Monitoring channel status, dynamically channel parameter is estimated, and select more reasonably competition window Adjusted Option according to the departure degree of estimated value and theoretially optimum value.This invention has easy realization, and channel access scheduling accuracy is high, the feature that governing speed is fast.
In order to realize above object, the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System that the present invention proposes, has following steps:
1. each node monitors channel is in the state information of each time slot, comprises channel idle, busy etc.
2. node is when attempting access channel, and whether the channel condition information quantity that first detection node obtains meets the demands.
3. if the channel condition information lazy weight of node acquisition, then node produces random-backoff time according to original competition window, and returns step 1.
4. if the channel condition information quantity that node obtains meets the demands, then node is estimated channel parameter X according to those information, and continues step 5.
5. node is according to network congestion analysis, and the possible value of the estimated value X_est of channel parameter X is carried out interval division by the one-dimension array utilizing length to be 2M-1.
6. node is according between X_est location, and the amplitude of accommodation that Dynamic Selection is different adjusts competition window, thus makes channel competition state return optimum faster.
Efficient competition window Regulation mechanism in aforesaid a kind of high-density wireless Network with Random Multiple Access System, in step 5, node will there are differences the interval division of X_est under different channels race condition.Node needs constantly to carry out double counting to the interval division of X_est in running.The operand making node in running significantly increases by this.
In order to overcome this problem, the dividing condition that may occur under different channels competitive environment can be similar to mapping by node becomes one or several with reference to dividing.Node prestores with reference to dividing, and in running, directly utilizes and judges interval belonging to X_est with reference to dividing.
The X_est interval division that may occur under aforesaid different channels competitive environment is carried out in the approximate process mapped to reference to dividing, and node follows following principle: the absolute error value in mapping process is less than the maximal accuracy of X_est.Wherein, the maximal accuracy of X_est is determined by the channel condition information quantity for estimating channel parameter.
Efficient competition window Regulation mechanism in aforesaid a kind of high-density wireless Network with Random Multiple Access System, in step 5, the element number of spatial division array is determined by the channel condition information quantity for estimating channel parameter.
Efficient competition window Regulation mechanism in aforesaid a kind of high-density wireless Network with Random Multiple Access System, in step 5, the element of spatial division array arranges according to ascending order, and wherein comprises the element that M-1 is less than X_opt, element X_opt, and the individual element being greater than X_opt of M-1.
Efficient competition window Regulation mechanism in aforesaid a kind of high-density wireless Network with Random Multiple Access System, in step 6, X_est is positioned at the space being greater than X_opt or the space being less than X_opt, will adopt different competition window adjustable strategies---and expand or reduce.
Efficient competition window Regulation mechanism in aforesaid a kind of high-density wireless Network with Random Multiple Access System, in step 6, space length X_opt is far away at X_est place, and the amplitude of accommodation of carrying out needed for competition window is larger.
Accompanying drawing explanation
Fig. 1 is operating process block diagram of the present invention
Fig. 2 is competition window of the present invention adjustment flow chart
Embodiment
Be described below in detail embodiments of the invention, the flow chart of described embodiment is shown in the drawings.Being exemplary below by the embodiment be described with reference to the drawings, only for explaining the present invention, and can not limitation of the present invention being interpreted as.
Fig. 1 is operating process block diagram of the present invention.The invention provides the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System.Embodiment have chosen channel idle probability P I as the channel parameter evaluating channel competition environment.Its concrete operations, comprise the steps:
1. Initial Channel Assignment monitoring parameter PA, PB, and competition window CW.
2. the random number assignment in generation [0, CW-1] interval to backoff counter BC, and utilizes BS to record the start numbers of backoff counter.
3. node detects channel busy, not busy state in units of time slot.As detected, channel is busy, goes to step 4.As detected, channel idle then goes to step 5.
4., because channel clear is interrupted, node returns step 3 after proceeding as follows.
A) number of time slots utilizing PA idle continuously to channel adds up.Wherein channel continuous free timeslot number obtains by the difference asked between the start numbers of backoff counter and current backoff counter numerical value.
B) utilize PB to record idle channel and interrupted number of times.
C) BS is utilized to record current backoff counter numerical value.
5., because channel keeps idle, whether first node detects backoff counter numerical value is zero.As backoff counter numerical nonzero, then node makes backoff counter numerical value subtract 1, and returns step 3.As backoff counter numerical value is not more than zero, then node goes to step 6.
6. node access channel success.And detect idle channel and interrupted number of times, i.e. PB+1.As current idle channel is interrupted number of times less than 5 times, then node keeps contention window size constant, and returns step 2.As current idle channel is interrupted number of times more than 5 times, then node utilizes the channel information of current acquisition, and namely PA, PB calculate channel idle probability P I.PI can be expressed as PA/ (PA+PB).Utilize the channel idle probability P I asked for, node adjusts competition window CW, finally returns step 2.
After node obtains channel idle probability P I, will adjust competition window CW.Its adjustment flow chart as shown in Figure 2, specifically comprises the steps:
1. parameter initialization.Initialization content is as follows:
A) PO is the channel idle probability of channel competition when remaining on optimum state.PO is about 0.7778 in the present embodiment.
B) backoff parameter based on BF.In the present embodiment, basic backoff parameter is set to 2, namely competition window with 2 multiple increase or reduce.
C) PI interval divides array THR [2M-1].This array is made up of 2M-1 element, and in array, element increases progressively arrangement, and wherein comprises the element that M-1 is less than PO, element PO, and the individual element being greater than PO of M-1.
D) PI interval divides array size M.The size that PI interval divides array depends on, describe in operating process step 6, the minimum idle channel be at war with required for window adjusting is interrupted number of times.In the present embodiment, it is 5 that minimum idle channel is interrupted number of times.Now, for ensureing that the element in interval division array effectively can be identified by the PI calculating acquisition, in the present embodiment, another M value is 5, and namely PI interval division array comprises 9 elements.In the present embodiment, THR [2M-1]={ 0.0274,0.1655,0.4068,0.6378,0.7778,0.8937,0.9453,0.9722,0.9861}.
E) initialization competition window adjustment index Index.
2. node compares PI and THR M element, i.e. PO, magnitude relationship, and carry out following corresponding operating:
A) as PI and PO is equal, node keeps competition window constant and terminates competition window adjustment.
B) as PI is greater than PO, then node proceeds as follows:
I. competition window is become existing worth 1/2nd.
Ii. competition window adjustment index adds 1.
Iii. current competitive window adjusting index is differentiated.As index is more than or equal to M, then node terminates the adjustment of this competition window.As index is less than M, then go to step iv.
Iv. the magnitude relationship of M+Index element in PI and array THR is differentiated.As PI is greater than this element, then node returns step I.As PI is less than or equal to this element, then node terminates the adjustment of this competition window.
C) as PI is less than PO, then node proceeds as follows:
I. competition window is become existing worth two times.
Ii. competition window adjustment index adds 1.
Iii. current competitive window adjusting index is differentiated.As index is more than or equal to M, then node terminates the adjustment of this competition window.As index is less than M, then go to step iv.
Iv. the magnitude relationship of M-Index element in PI and array THR is differentiated.As PI is greater than this element, then node returns step I.As PI is less than or equal to this element, then node terminates the adjustment of this competition window.
Claims (7)
1. the efficient competition window Regulation mechanism in a high-density wireless Network with Random Multiple Access System, it is characterized in that, by Real-Time Monitoring channel status, dynamically channel parameter X is estimated, and select more reasonably competition window Adjusted Option according to the departure degree of estimated value X_est and theoretially optimum value X_opt.Described method concrete steps are:
1.1 each node monitors channels, in the state information of each time slot, comprise channel idle, busy etc.
1.2 nodes are when attempting access channel, and whether the channel condition information quantity that first detection node obtains meets the demands.
If the channel condition information lazy weight that 1.3 nodes obtain, then node produces random-backoff time according to original competition window, and returns step 1.1.
If the channel condition information quantity that 1.4 nodes obtain meets the demands, then node is estimated channel parameter X according to those information, and continues step 1.5.
1.5 nodes are according to network congestion analysis, and the possible value of the estimated value X_est of channel parameter X is carried out interval division by the one-dimension array utilizing length to be 2M-1.
1.6 nodes are according between X_est location, and the amplitude of accommodation that Dynamic Selection is different adjusts competition window, thus make channel competition state return optimum faster.
2. the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System according to claim 1, it is characterized in that, in described step 1.5, the dividing condition that may occur under different channels competitive environment is similar to mapping by node becomes one or several with reference to dividing.Node prestores with reference to dividing, and in running, directly utilizes and judges interval belonging to X_est with reference to dividing.
3. the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System according to claim 2, it is characterized in that, the reference of X_est divides mapping and follows following principle: the maximal accuracy being less than X_est with reference to the absolute error value divided in mapping process.Wherein, X_est maximal accuracy by claim 1 step 1.2 for estimate channel parameter X channel condition information quantity determine.
4. the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System according to claim 1, is characterized in that, in described step 1.5, the element number of spatial division array is determined by the channel condition information quantity in step 1.2.
5. the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System according to claim 1, it is characterized in that, in described step 1.5, the element of spatial division array arranges according to ascending order, and wherein comprise the element that M-1 is less than X_opt, element X_opt, and the individual element being greater than X_opt of M-1.
6. the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System according to claim 1, it is characterized in that, in described step 1.6, X_est is positioned at the space being greater than X_opt or the space being less than X_opt, will adopt different competition window adjustable strategies---and expand or reduce.
7. the efficient competition window Regulation mechanism in a kind of high-density wireless Network with Random Multiple Access System according to claim 1, is characterized in that, in described step 1.6, space length X_opt is far away at X_est place, and the amplitude of accommodation of carrying out needed for competition window is larger.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511006147.2A CN105517184A (en) | 2015-12-29 | 2015-12-29 | High-efficiency contention window adjusting mechanism in high-density radio random access network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511006147.2A CN105517184A (en) | 2015-12-29 | 2015-12-29 | High-efficiency contention window adjusting mechanism in high-density radio random access network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105517184A true CN105517184A (en) | 2016-04-20 |
Family
ID=55724718
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511006147.2A Pending CN105517184A (en) | 2015-12-29 | 2015-12-29 | High-efficiency contention window adjusting mechanism in high-density radio random access network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105517184A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109150346A (en) * | 2018-11-01 | 2019-01-04 | 南通大学 | A kind of method that car networking broadcast background flows down transmission of video |
| CN110366264A (en) * | 2019-07-31 | 2019-10-22 | 展讯通信（上海）有限公司 | Competition window method of adjustment, network element device, user equipment and storage medium |
| CN110536473A (en) * | 2019-08-16 | 2019-12-03 | 中兴通讯股份有限公司 | Signaling method, device and storage medium |
| WO2020083265A1 (en) * | 2018-10-26 | 2020-04-30 | Huawei Technologies Co., Ltd. | Channel access mechanism for random access channel in unlicensed spectrum |
-
2015
- 2015-12-29 CN CN201511006147.2A patent/CN105517184A/en active Pending
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020083265A1 (en) * | 2018-10-26 | 2020-04-30 | Huawei Technologies Co., Ltd. | Channel access mechanism for random access channel in unlicensed spectrum |
| US11638300B2 (en) | 2018-10-26 | 2023-04-25 | Huawei Technologies Co., Ltd. | Channel access mechanism for random access channel in unlicensed spectrum |
| US12004214B2 (en) | 2018-10-26 | 2024-06-04 | Huawei Technologies Co., Ltd. | Channel access mechanism for random access channel in unlicensed spectrum |
| CN109150346A (en) * | 2018-11-01 | 2019-01-04 | 南通大学 | A kind of method that car networking broadcast background flows down transmission of video |
| CN110366264A (en) * | 2019-07-31 | 2019-10-22 | 展讯通信（上海）有限公司 | Competition window method of adjustment, network element device, user equipment and storage medium |
| CN110536473A (en) * | 2019-08-16 | 2019-12-03 | 中兴通讯股份有限公司 | Signaling method, device and storage medium |
| WO2021031925A1 (en) * | 2019-08-16 | 2021-02-25 | 中兴通讯股份有限公司 | Signal sending method and apparatus, and storage medium |
| CN110536473B (en) * | 2019-08-16 | 2023-03-10 | 中兴通讯股份有限公司 | Signal transmission method, signal transmission device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102017534B (en) | Deterministic back-off-method and apparatus for peer-to-peer communications | |
| CN105517184A (en) | High-efficiency contention window adjusting mechanism in high-density radio random access network | |
| EP3860031A1 (en) | Method and user equipment for multi-carrier data transmission | |
| Koseoglu | Lower bounds on the LTE-A average random access delay under massive M2M arrivals | |
| EP2243259B1 (en) | System and method for multi-channel data-adaptive thresholding for shared channels with time-varying rate constraints | |
| US20050164642A1 (en) | Wireless ultra wideband network having frequency bin transmission level setting and related methods | |
| EP1560345A1 (en) | Wireless ultra wideband network having interference mitigation and related methods | |
| CN105979547B (en) | A kind of communication means of wide area network, node apparatus and system | |
| CN112492556B (en) | Wireless sensor network and association request sending method | |
| RU2012131946A (en) | ADAPTIVE COMPETITIVE WINDOW IN INTERRUPTED CHANNELS OF WIRELESS COMMUNICATION | |
| CN103699433A (en) | Method and system for performing dynamic adjustment on number of tasks in Hadoop platform | |
| CN106102172B (en) | A kind of uplink channel resources distribution method and device | |
| CN115714793B (en) | On-demand transmission method for perception information in industrial Internet of things | |
| Hammood et al. | An energy-efficient optimization based scheme for low power devices in wireless body area networks | |
| CN101534510A (en) | Method and system for sharing distributed frequency spectrum | |
| CN110602798A (en) | Distributed determination method for optimal parameters of LTE network machine communication random access | |
| Tian et al. | Multi-objective surrogate modeling for real-time energy-efficient station grouping in IEEE 802.11 ah | |
| CN101534542A (en) | Method, device and system for adjusting random access leader sequence | |
| CN103634813B (en) | A kind of node communication control method, device, equipment and network based on group | |
| CN107484255A (en) | Preferred channels number determines method in a kind of multichannel CSMA agreements based on frequency packet | |
| CN105792287B (en) | The protection time slot self-adjusted block and method of evaluating performance of wireless body area network | |
| CN105072687A (en) | WLAN channel allocation method based on artificial bee colony algorithm | |
| CN109861774B (en) | Cognitive underwater acoustic network access scheduling method | |
| Zhao et al. | A multi-channel cooperative demand-aware media access control scheme in vehicular ad-hoc network | |
| CN105451346B (en) | uplink data transmission method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160420 |
|
| WD01 | Invention patent application deemed withdrawn after publication |