CN105792253B - A kind of wireless sense network medium access control optimization method - Google Patents
A kind of wireless sense network medium access control optimization method Download PDFInfo
- Publication number
- CN105792253B CN105792253B CN201610103875.3A CN201610103875A CN105792253B CN 105792253 B CN105792253 B CN 105792253B CN 201610103875 A CN201610103875 A CN 201610103875A CN 105792253 B CN105792253 B CN 105792253B
- Authority
- CN
- China
- Prior art keywords
- node
- competition
- network
- neighbor table
- neighbor
- 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
- 238000000034 method Methods 0.000 title claims abstract description 13
- 238000005457 optimization Methods 0.000 title claims abstract description 9
- 230000008859 change Effects 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 5
- 238000009499 grossing Methods 0.000 claims description 3
- 238000005265 energy consumption Methods 0.000 abstract description 8
- 230000002035 prolonged effect Effects 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 15
- 230000005540 biological transmission Effects 0.000 description 12
- 230000009467 reduction Effects 0.000 description 5
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 230000009466 transformation Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
-
- 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
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
- H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a kind of wireless sense network medium access control optimization method, forms the phase in network, sensor node is established neighbor table and recorded to the scheduling information of neighbor node.After entering competition period, the present invention participates in competition node number, neighbor table interior joint sum and prediction last time and participates in competition node number and accurately judged the node number for participating in competition next time according to existing in neighbor table.In order to make sensor node can adapt to the variation of network load, the present invention uses dynamic competition window strategy.The strategy is adaptively adjusted the contention window size of this node according to the variation of nodes number, effectively reduce conflict probability of happening and idle listening time, avoid the energy consumption as caused by conflict and prolonged idle listening, have the characteristics that network lifetime is long, time delay is small, Packet Delay shake it is small, suitable for loading the sensor network application for changing frequent massive wireless sensor and delay sensitive.
Description
Technical field
The invention belongs to network communication field more particularly to a kind of wireless sense network media smooth towards Adaptive Time Delay
Access control optimization method.
Background technique
CW (Contention Window, contention window in S-MAC (Sensor MAC, sensor medium access control) agreement
Mouthful) purpose of function is to guarantee the high efficiency of channel competition, reduce data transmission conflict.Pass through the work periodically listened to and slept
Make mode, in conjunction with the passive listening of adaptive-flow, reduce energy consumption, reduce propagation delay time, to provide stable, high quality
Data transmission.
Current is all much to change its basic operating mechanism by using complicated algorithm about the improvement of S-MAC agreement,
Increase control message, achieve the purpose that reduce time delay and reduces energy consumption.Its deficiency is: having ignored that sensor node is limited to be deposited
Storage and processing capacity, it is difficult to reduce energy consumption in the case where providing delay guarantee.In practical application, higher network flow
Load easily causes transmission collision number to rise and causes that localized network energy consumption is very fast, packet loss is serious, internodal data passes
The situation that defeated time delay is uneven, delay variation is larger.
Summary of the invention
The technical problem to be solved by the present invention is to provide a kind of wireless sense network medium visit smooth towards Adaptive Time Delay
Ask control optimization method.
To solve the above problems, the present invention adopts the following technical scheme that:
A kind of wireless sense network medium access control optimization method, comprising: form the phase in network, sensor node is established adjacent
Table is occupied to record the scheduling information of neighbor node；After entering competition period, according to participation existing in the neighbor table
It is a to the node for participating in competition next time to compete node number, neighbor table interior joint sum and prediction last time participation competition node number
Number is judged, that is,
Wherein, N (t+1) is the node number for assessing participation competition next time obtained, and N (t) is that the last time participation of prediction is competing
Node number is striven, β is the neighbor node number that the competition flag bit in neighbor table is 1, and η is total for the node saved in neighbor table
Number.
Preferably, the contention window size of this node is adaptively adjusted according to the variation of nodes number, with
Backoff counter value optimizes the smoothing processing of network delay as independent variable to competition window, that is,
Wherein, ECW indicates that node is the contention window size of competition setting next time；C is constant, for competition number of nodes
Issuable network congestion is modified when mesh is excessive；N is competition interstitial content, and M is and competition interstitial content dynamic
Change relevant variable；θ is the current value of node backoff counter.
Beneficial effects of the present invention are as follows:
After entering competition period, the present invention is saved according in participation existing in neighbor table competition node number, neighbor table
Point sum and prediction last time participate in competition node number and are accurately judged the node number for participating in competition next time.In order to make
Sensor node can adapt to the variation of network load, and the present invention uses dynamic competition window strategy.The strategy is according to network
The variation of interior joint number is adaptively adjusted the contention window size of this node, effectively reduces conflict probability of happening and the free time detects
The time is listened, the energy consumption as caused by conflict and prolonged idle listening is avoided, there is network lifetime length, time delay
Small, Packet Delay shakes small feature, is suitable for load and changes frequent massive wireless sensor and delay sensitive
Sensor network application.
Detailed description of the invention
Fig. 1 be it is of the invention it is a kind of based on the wireless sense network media access control method of time delay balance optimizing in sensor
The various situation example explanatory diagrams that network competition period is likely to occur.
Specific embodiment
The embodiment of the present invention provides a kind of wireless sense network medium access control optimization method, comprising: the phase is formed in network,
Sensor node is established neighbor table and is recorded to the scheduling information of neighbor node, and sent according to node in competition period
Competition flag bit in RTS (Request To Send request is sent) message updates the data mode of neighbor node.When node is joined
With competing and winning RTS message request is sent after the channel right to use send data.Node is before sending RTS, to its own waiting
The time required to the data length of transmission with transmission rate carries out that transmission is calculated and judge whether to complete in one cycle
Transmission, if can if in the RTS message that will be sent will competition mark position be 0, otherwise set 1；Sensor node exists
Idle listening period receives the RTS message from other nodes, checks that it competes flag bit and updates corresponding note in neighbor table
Record.
Sensor node is continuously kept out of the way number to it using competition backoff counter and is recorded.The feelings that node is kept out of the way
Condition includes receiving RTS message from other nodes in the idle listening stage or touching when sending itself RTS message
Hit conflict.Node executes after being kept out of the way to counter plus an operation, is set 0 when its successful contention is to channel.
Sensor node is before each competition window starts according to the competition flag bit of each node recorded in neighbor table
To judge to participate in the node number of competition.Not for the node that competition flag bit is 0 in record, the i.e. data mode of the node
Know, sensor node judges its data mode the contention window size competed according to last time and idle listening time.
After entering competition period the idle listening duration of its own is arranged, if in the duration in sensor node first
It has not listened to node inside and has sent RTS message, interception node will send the RTS message of oneself；If having listened to other nodes
The RTS message of transmission illustrates interception node this time failed competition to channel.
Interception node is to the size of competition window and listens to duration and is recorded for judging to compete flag bit in neighbor table
For 0 state of the node when next competition window is opened.In wireless sensor network, contention window size, listen to duration with
It participates in competition node number and meets following relationship:
N≈CW/L (1)
Wherein, L refers to idle listening duration, and CW is contention window size, and N is to participate in competition node number.
The present invention was used to participation existing in neighbor table competition node number, neighbor table interior joint sum and prediction last time
Competition node number is participated in accurately to judge the node number for participating in competition next time.
Data can only be sent by a node since wireless sensor network competes every time, no matter in network load
In larger or lesser situation, it is all more gentle for competing the rate of change of node number.In the comprehensive neighbor table of the present invention
Existing participation competition node number, neighbor table interior joint sum and prediction last time participate in competition node number, right using formula (2)
The node number for participating in competition next time is corrected.
Wherein, N (t+1) is the node number for participation competition next time that assessment obtains, N (t) is with formula (1) to the upper of prediction
Secondary participation competes node number, and β is the neighbor node number that the competition flag bit in neighbor table is 1, and η is to save in neighbor table
Node total number.
After completing to compete node evaluation, node will compete flag bit in neighbor table longest (N- α) by the period by 0
A node competition flag bit is set as 1.If N is less than α, (α-N) that changes flag bit by node itself recently a neighbours are saved
Point sets 0 again, and wherein α indicates the node number that competition flag bit is 1 in neighbor table.
In order to make sensor node can adapt to the variation of network load, the present invention uses dynamic competition window strategy.
The strategy is adaptively adjusted the contention window size of this node according to the variation of nodes number, effectively reduces conflict hair
Raw probability and idle listening time, avoid the energy consumption as caused by conflict and prolonged idle listening.
In order to overcome the unstability of wireless sensor node data transmission delay, the present invention using backoff counter value as
Independent variable optimizes the smoothing processing of network delay using arctan function to competition window, reduces delay variation.Every wheel is competing
It strives startup stage, contention window size is arranged using formula (3) in sensor node.
Wherein, ECW indicates that node is the contention window size of competition setting next time；C is constant, for competition number of nodes
Issuable network congestion is modified when mesh is excessive；N is competition interstitial content, and M is and competition interstitial content dynamic
Change relevant variable；θ is the current value of node backoff counter.
Formula (3) design philosophy:
1) present invention reaches optimization purpose using to the implicit reduction of contention window size progress.Node can with competition window with
θ increase and reduces so that node can be used for being arranged itself idle listening duration competition window range reduce, thus have more greatly
Probability obtain the channel right to use.Therefore one increases and to reduce dependent variable and constant interval obviously and controllable with independent variable
Function is very necessary.The present invention has obtained similar function by being converted to arctan function.
Firstly, making functional value be greater than 0 arctan function progress axial symmetry and translation transformation, and gradually passed since 0
Subtract.Arctan function is done into the transformation of axial symmetry about X-axis, so that its value tapers off state at [- ∞ ,+∞].Due to anti-
Tangent function changes obviously in [- 5,5] section, and the present invention intercepts the section as Main change section.Function is moved right
Dynamic 5, it moves upSo that entire function gradually successively decreases by 0, and both greater than 0.
Then, by entire function multiplied byMake entire function value interval [0,1].If competition interstitial content is N, then
For sensor node from competitive channel is started until completing data transmission, the mathematic expectaion of required competition number is N-1.To make node
Keep out of the way number at N-1 times or so when completing data and sending, N-1 is successively decreased as curve and changes the end in obvious section by the present invention
Point, the independent variable unit of expression formula multiplied bySo that entire curve is successively decreased and changes apparent independent variable section [0, N-1].
2) present invention obtains the linear functional relation between M, C value and N by Experimental modeling.In real network, competition section
When point is less, the smaller network performance of C value is higher；When competition interstitial content is more, C value appropriate is obtained with preferable network
Performance.It competes under the less scene of node, C value is first set 0, then be stepped up M value, the time delay and energy consumption of record experiment simulation output
Value.N value is increased one by one from 0, repeat before the step of, extract so that time delay and power consumption values are optimal M value.It is quasi- by curve
It builds mould jointly and obtains functional relation between M value and N.On this basis, to compete the size that the more scene of node seeks C value.The value of N
It is stepped up, the time delay and power consumption values of record experiment simulation output, is extracted so that C takes when time delay and power consumption values are best from 0
Value.C value and the functional relation of N are obtained by curve matching modeling.It is with the M expression formula that the verifying of the optimum value of C has obtained finally
The no scene more in node is still optimum value, should be according to if obtained M value does not meet existing best M value expression
Before the step of, is fitted the functional relation for modeling and obtaining under the more scene of competition node between M and N again, according to different numbers
Competition node scene select corresponding M and C.M and C expression formula is respectively as follows:
M=20N-10 (4)
When M value is that node carries out fair competition, time delay optimum initial competitor window when competition interstitial content is N is big
It is small.When N number of competition node starts fair competition channel, competing each time each other is that relatively independent and different nodes are believed
The probability of the road right to use is identical.Therefore the number of keeping out of the way when node acquisition channel is to meet normal distribution and each node
The desired value for keeping out of the way number to be passed through is (N-1).When it is 0 that node, which keeps out of the way number, node is when participation competes next time
Contention window size is the optimum size of time delay, keeps out of the way number with node and increases, and node is by arctan function to competition
Window size is implicitly reduced, so that its probability for obtaining channel rises.
Channel competition process is optimized with node backoff value by arctan function, so that each node is believed in competition
It is no longer complete fair play when road, it is different preferential that different node backoff value differences possesses node in competition
Grade.The biggish node of backoff value obtains smaller competition window by formula (3), when node is when being arranged the idle listening duration of itself
There is bigger probability to obtain the smaller idle listening time, i.e. the node possesses the higher priority acquisition channel right to use.
It is bigger by reduction of the arctan function to competition window when sensor node retreat count increases, by
In the reduced value that size of the reduced value to the node cycle of operation does not have an impact and same node competes each time also not phase
Together, therefore this reduction mode of the present invention is referred to as implicit reduction.And the competition window by obtaining after implicitly reduction processing is known as
Effective competition window.When reduced value is excessive, that is, node retreat count it is excessive when, it is possible that a small number of node is effective competing
It is too small to strive window, frequently occurs conflict so as to cause in competition period.For the such case being likely to occur, the present invention is provided with
Competition window correction value C and by Experimental modeling analyze method obtain time delay best window correction value and competition interstitial content it
Between relationship.
As shown in Figure 1, each component part an of complete cycle is listed first, including SYNC synchronous period, competition
Period, RTS/CTS data sending request confirm period, and data send and be sent completely confirmation period, node sleep period.Competing
When striving window and starting, the idle listening duration of itself is arranged in node in effective competition window, monitors channel status.When
Node does not listen to the RTS message of other nodes transmission in specified idle listening duration, then the RTS for broadcasting itself disappears
Breath.When node listens to the RTS message from other nodes when listening to channel, then it represents that node is in this competition
The channel right to use is not competed, sleep will be entered after the CTS message for listening to return, is completed data until other nodes and is passed
It is defeated.After RTS message of the node in transmission itself or after listening to the RTS message of other nodes, and response is not heard
CTS message, then it is assumed that current competition conflicts, reopened after waiting a conflict to keep out of the way duration new competition window into
Row channel competition.
This method can make sensor node to the sensitive perception of variation of network load and make quick adjustment, have net
Network life span is long, time delay is small, handling capacity is high, Packet Delay shakes small feature, is suitable for the frequent big rule of load variation
The sensor network application of mould wireless sensor network and delay sensitive.
Above embodiments are only exemplary embodiment of the present invention, are not used in the limitation present invention, protection scope of the present invention
It is defined by the claims.Those skilled in the art can within the spirit and scope of the present invention make respectively the present invention
Kind modification or equivalent replacement, this modification or equivalent replacement also should be regarded as being within the scope of the present invention.
Claims (1)
1. a kind of wireless sense network medium access control optimization method characterized by comprising form phase, sensor in network
Node is established neighbor table and is recorded to the scheduling information of neighbor node；After entering competition period, according in the neighbor table
It is competing to next time is participated in that existing participation competition node number, neighbor table interior joint sum and prediction last time participate in competition node number
The node number striven judged, i.e.,
Wherein, N (t+1) is the node number for participation competition next time that assessment obtains, N (t) is the last time of prediction to participate in competition section
Point number, β is the neighbor node number that the competition flag bit in neighbor table is 1, and η is the node total number saved in neighbor table；Root
The contention window size of this node is adaptively adjusted according to the variation of nodes number, using backoff counter value as change certainly
Amount optimizes the smoothing processing of network delay to competition window, i.e.,
Wherein, ECW indicates that node is the contention window size of competition setting next time；C is constant, for competition interstitial content mistake
Issuable network congestion is modified when big；N is competition interstitial content, and M is and competition interstitial content dynamic change
Relevant variable；θ is the current value of node backoff counter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610103875.3A CN105792253B (en) | 2016-02-25 | 2016-02-25 | A kind of wireless sense network medium access control optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610103875.3A CN105792253B (en) | 2016-02-25 | 2016-02-25 | A kind of wireless sense network medium access control optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105792253A CN105792253A (en) | 2016-07-20 |
| CN105792253B true CN105792253B (en) | 2019-03-29 |
Family
ID=56402764
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610103875.3A Active CN105792253B (en) | 2016-02-25 | 2016-02-25 | A kind of wireless sense network medium access control optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105792253B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103873195B (en) * | 2014-03-06 | 2017-02-22 | 国家电网公司 | Media access control method suitable for household power line network |
| CN107949011A (en) * | 2017-12-03 | 2018-04-20 | 石春 | A kind of adaptive perception window regulation method |
| CN113747384B (en) * | 2021-08-11 | 2023-04-07 | 中山大学 | Deep reinforcement learning-based industrial internet of things energy sustainability decision mechanism |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102711173A (en) * | 2012-06-10 | 2012-10-03 | 姚国良 | Data queue length-based channel access method for wireless sensor network |
| CN103260229A (en) * | 2013-06-04 | 2013-08-21 | 东北林业大学 | Wireless sensor network MAC protocol based on forecast and feedback |
| US9155027B1 (en) * | 2011-11-23 | 2015-10-06 | Marvell International Ltd. | 802.11 enhanced distributed channel access |
| CN105007586A (en) * | 2015-08-11 | 2015-10-28 | 中山大学 | Two-factor based self-adaptive contention window adjusting method for SMAC protocol of wireless sensor network |
-
2016
- 2016-02-25 CN CN201610103875.3A patent/CN105792253B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9155027B1 (en) * | 2011-11-23 | 2015-10-06 | Marvell International Ltd. | 802.11 enhanced distributed channel access |
| CN102711173A (en) * | 2012-06-10 | 2012-10-03 | 姚国良 | Data queue length-based channel access method for wireless sensor network |
| CN103260229A (en) * | 2013-06-04 | 2013-08-21 | 东北林业大学 | Wireless sensor network MAC protocol based on forecast and feedback |
| CN105007586A (en) * | 2015-08-11 | 2015-10-28 | 中山大学 | Two-factor based self-adaptive contention window adjusting method for SMAC protocol of wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| 一种竞争窗口自适应调整算法设计;赵磊，宋顾林;《计算机工程》;20111231;第37卷(第23期);全文 |
| 无线传感器SMAC协议竞争退避机制分析及优化;蒋文贤，李 跃;《计算机***应用》;20131130;第22卷(第11期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105792253A (en) | 2016-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105792253B (en) | A kind of wireless sense network medium access control optimization method | |
| CN103931241B (en) | Divide a group by using standing, act on behalf of CSMA and TIM monitoring to optimize section overhead during contention so as to reduce power consumption in Wireless network stations | |
| WO2022037676A1 (en) | Dynamic spectrum sharing method based on user online learning and low-overhead cooperation | |
| CN104936303B (en) | A kind of method that carrier sense thresholding jointly controls with competition window | |
| CN109327911B (en) | Reputation system-based spectrum switching method in cognitive heterogeneous wireless network | |
| CN104363635B (en) | The Stream Media Application method for allocating bandwidth resources of quick energy optimization | |
| WO2004107680A3 (en) | Enhancing fairness and performance in a multihop ad hoc network | |
| CN103828447B (en) | Ascending power control method and device | |
| CN108601067A (en) | A kind of wireless self-networking carrier wave detection channel access method kept out of the way based on time/power two-dimensional | |
| CN104853445B (en) | A kind of MAC protocol for wireless sensor networks based on broadcast message | |
| CN106656327B (en) | It is a kind of that method is continuously transmitted based on dynamic window | |
| CN108076467A (en) | Frequency spectrum resource be limited under broad sense sensor model and distributed Q-learning cut-in method | |
| Elmachkour et al. | Green opportunistic access for cognitive radio networks: A minority game approach | |
| CN105188117B (en) | The farmland wireless sensor network frequency interlace cut-in method of time-space domain multiplexing | |
| CN102421151A (en) | Minimum contention window adaptive adjustment method based on WLAN (Wireless Local Area Network) contention station number | |
| CN114375066A (en) | Distributed channel competition method based on multi-agent reinforcement learning | |
| CN111601398B (en) | Ad hoc network medium access control method based on reinforcement learning | |
| CN105007586B (en) | The adaptive competition window method of adjustment of double factor of wireless sense network SMAC agreements | |
| CN102711173A (en) | Data queue length-based channel access method for wireless sensor network | |
| CN102685808A (en) | Distribution type clustering method based on power control | |
| CN110312291A (en) | A kind of low-power consumption LoRa wireless network data transmission algorithm | |
| CN108966361A (en) | Dynamic back-off method based on the broadcast of WiFi mesh networks beacon frame | |
| CN111818633B (en) | Dynamic node admission method in star access network | |
| Mehta et al. | Application of game theory to wireless networks | |
| CN101801065A (en) | Mesh election competition method improved based on 802.16d |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |