CN103957602A - Dynamic access control method for dynamic channel of wireless sensor network - Google Patents

Dynamic access control method for dynamic channel of wireless sensor network Download PDF

Info

Publication number
CN103957602A
CN103957602A CN201410129841.2A CN201410129841A CN103957602A CN 103957602 A CN103957602 A CN 103957602A CN 201410129841 A CN201410129841 A CN 201410129841A CN 103957602 A CN103957602 A CN 103957602A
Authority
CN
China
Prior art keywords
node
network
time
state
sleep
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
Application number
CN201410129841.2A
Other languages
Chinese (zh)
Other versions
CN103957602B (en
Inventor
饶元
曹一明
李绍稳
朱军
江朝辉
张武
陈卫
傅雷扬
许高建
商伶俐
高宁
邓成
骆琛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Anhui Agricultural University AHAU
Original Assignee
Anhui Agricultural University AHAU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Anhui Agricultural University AHAU filed Critical Anhui Agricultural University AHAU
Priority to CN201410129841.2A priority Critical patent/CN103957602B/en
Publication of CN103957602A publication Critical patent/CN103957602A/en
Application granted granted Critical
Publication of CN103957602B publication Critical patent/CN103957602B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention relates to a dynamic access control method for a dynamic channel of a wireless sensor network. In the network forming stage, administrative area division is carried out on the whole network, and area network access parameters are controlled through management nodes; a selection method based on energy control is adopted for selection of the management nodes, and all sensor nodes can participate in selection of the management nodes. According to the method, all network areas between an information source area network and an objective area can gradually adapt to load changes, and the method has the advantages of being long in network lifetime, short in time delay and high in handling capacity and is applied to large-scale wireless sensor networks with frequent load changes.

Description

A kind of wireless sensor network dynamic channel dynamic access control method
Technical field
The present invention relates to a kind of wireless sensor network dynamic channel dynamic access control method, belong to network communication field.
Background technology
In recent years, wireless sensor network obtains showing great attention in worldwide.Wireless sensor network has a large amount of sensor nodes, but the energy of node is very limited, and depleted of energy means that node will depart from network, cause network topological change or network paralysis.Therefore the energy consumption problem of sensor node is one of key factor of restriction wireless sensor network protocols design.
Wherein, channel access control (Media Access Control, hereinafter to be referred as MAC) agreement is for distributing limited wireless communication resources, the working method of its decision node wireless transceiver.For the feature of energy of wireless sensor network sensitivity, the primary goal of MAC Protocol Design is to want effectively to control the energy consumption of sensor node, improves network life cycle; And improve on this basis the access efficiency of node channel, reduce possibility clashing, lifting network whole efficiency.
In the MAC agreement based on competition, be mainly the life cycle of improving network by interim sleep mechanism, but the method can cause the increase of time delay and the reduction of network throughput at present.Special in the time that in network, load variations is large, existing protocol lacks effective processing policy for sudden load.Reduce if the too high duty ratio of network settings can make network energy consume too fast and effective utility of laser power, and the network performance of too small duty ratio can make to tackle burst load time sharply declines.Secondly, the self adaptation adjusting that only single node carries out load variations can make the reaction of adjacent node slower, because adjacent node self may be in information source region, do not know the imminent load variations situation of current localized network, needs could adapt to for a long time conventionally.Information when load outburst can not be transferred out by adjacent node in time, more easily causes the increase of capacity usage ratio decline, network congestion and time delay.
Therefore the channel access method that the massive wireless sensor, how changing for load frequent is designed a kind of energy efficient and Delay Constraint has become a key technology of being badly in need of solution.
Summary of the invention
The present invention relates to a kind of wireless sensor network dynamic channel dynamic access control method, described method comprises the steps:
Form the phase at network, overall network is managed to region and divide, by management node control area network access parameters; Adopt a kind of electoral machinery based on energy control for the election of management node, the election that each sensor node can participative management node;
By a stand-by period, the control function waitforCWP (ELR) of (wt, wait time) controls competition window position; Shown in following formula, this function is by a parameter " energy surplus ratio " (ELR, Energy Left Rate) calculate its value, energy surplus ratio equals residue energy of node value than upper node total energy value (ELR=Eleft/Etotal):
waitforCWP ( ELR ) = [ β × C × ( 1 - Eleft Etotal ) ]
Wherein, Eleft is residue energy of node; Etotal is node gross energy; β is for controlling parameter, makes all competitions finish the rear formation phase and can reserve a part of time slot network is effectively restrained; C is total timeslot number of whole formation phase;
Finally obtaining stand-by period wt is:
wt=waitforCWP(ELR)×a?slottime
In the network stabilization phase, the state of node is divided into duty cycle and sleep period; Duty cycle is divided into again two little periods: control sync period, monitoring phase; Each control sync period is divided into three little stages, is respectively control stage, management node synchronous phase, member's synchronous phase;
Network access parameters is regulated by Broadcasting Control synchronizing information at control sync period management node, the member node in Local Area Network is carried out synchronously, and arrange the report time slot of each member node at sleep stage; Do not receive and control synchronizing information or the node that newly adds can be applied for to contiguous management node, management node is replied after receiving;
In the time of the network data exchange phase, management node is monitored network state, judges the bearing capacity of network according to current region network state; In the time of sleep stage, in region, all member node are waken up and are reported packet awaits number in queue to management node in the time of particular time-slot separately, and management node is estimated the following loading condition of Local Area Network in a short time by waiting for total number packets;
Management node, according to network carrying ability and the access control parameter of estimating loading condition dynamic adjustments Local Area Network, comprises mode of operation, work sleep duration, initial contention window mouth etc.; If Local Area Network channel utilization is high, conflict takes place frequently, waits for that number of packet is many, current network parameter bearing capacity deficiency so, need to improve network operating time and slightly large initial contention window mouth; If the channel utilization of current network is low, conflict fresh, wait for the few or nothing of number of packet, the bearing capacity surplus of current network so, can suitably reduce the operating time or enter repeatedly the short sleep state of short monitoring and control the time delay that sleep causes, and less initial contention window mouth is provided; If network channel occupancy is in high state slightly, and conflict fresh, current network bearing capacity relatively adapts to so;
In the time that next working stage starts, management node changes Network access control parameter by member node in Broadcasting Control synchronizing information notice management area; The management node of adjacent domain can pass through boundary node sensed in advance load variations, and makes and judge in advance and predict, overall network is adapted to gradually;
In the time that can not fulfiling management responsibility because of some reason, management node can enter management failure state, now send at once network control fail message, this region member node is understood the information of carrying out in the time that next work period starts synchronously and is carried out Local Gravity And subregion (1), improves Its Fault Tolerance;
(1) concrete grammar of Local Gravity And subregion:
In order to improve Its Fault Tolerance, the present invention has designed a Local Gravity And partition method: in the time that management node runs into irreversible problem (as hardware damage) or predictable problem (as too low in energy), can broadcast at once the message that a network control message informs that region interior nodes management node lost efficacy, this region in member node receive and can in the time that network is idle, notify after this information around this management node thrashing message of other member node in same region.In the time that next duty cycle starts, the node of receiving this message is broadcasted and is prepared management node challenge message within the control phase (Control), and approximately fixes on and when management node sync period (EM-SYNC) starts, manage node competition.Failed areas interior nodes can the competition of participative management node.
If can add other region while having node to receive the network control message of other management node broadcast when Local Gravity And subregion, enter the normal network operation stage after subregion completes.
When member node normal data service interaction, utilize channel booking mechanism transmission reliability; Self carrys out dynamic Competition adjustment window by blocking continuous summation exponent back off algorithm, thereby avoids conflict.
The method can make information source Local Area Network progressively adapt to load variations to the all-network region between object region, has the advantages that network lifetime is long, time delay is little, throughput is high, is applicable to load variations massive wireless sensor frequently.
Brief description of the drawings
By describing in more detail exemplary embodiment of the present invention with reference to accompanying drawing, above and other aspect of the present invention and advantage will become more and be readily clear of, in the accompanying drawings:
Fig. 1 is the view at the interim node of network stabilization of a kind of wireless sensor network dynamic channel dynamic access control method of the present invention.
Fig. 2 adjusts sleep-work ratio schematic diagram.
Embodiment
Hereinafter, now with reference to accompanying drawing, the present invention is described more fully, various embodiment shown in the drawings.But the present invention can implement in many different forms, and should not be interpreted as being confined to embodiment set forth herein.On the contrary, it will be thorough with completely providing these embodiment to make the disclosure, and scope of the present invention is conveyed to those skilled in the art fully.
Hereinafter, exemplary embodiment of the present invention is described with reference to the accompanying drawings in more detail.
In the present invention, the state of node has: wait for the state of choosing, management work state, member's operating state, repartition state, management failure state, member's failure state.
Form the phase at network, the present invention manages region to overall network and divides, by management node control area network access parameters.Adopt a kind of electoral machinery based on energy control for election the present invention of management node, the election that each sensor node can participative management node.Be specially: this method definition formation phase is to be made up of C time slot, in the time that competition starts, each node calculates the election hatch section present position in C time slot of oneself according to own current residual energy value, each election hatch section is made up of m time slot, and m depends on node distribution situation; Then the election of node participative management node in election hatch section separately, self become after management node at once broadcast control node towards periphery and produce message, other non-management node of receiving this message stops election process at once, receives that multiple management nodes can add one of them while producing message at random.
The value of m depends on whole wireless sensor network node distribution situation, and must be integer (result of calculation rounds up), and minimum value is 10.Suppose that node is equally distributed, whole network node quantity is more, and the nodes that may be assigned to so same competition window section when competition management node is just more, and therefore competition window section just needs the generation that avoids conflict of the time slot of greater number.
m = MAX { [ N × π × Rc 2 α × S ] + 1,10 }
Wherein, N refers to whole network node sum, and Rc is node signal efficient communication covering radius, and S for this reason wireless sensor network can the deployment region gross area, and α is for controlling parameter.
In order to control node energy equilibrium, the node competition window position that dump energy Eleft is larger should be more forward, starts before competition window section the stand-by period fewer.The present invention controls competition window position by the control function waitforCWP (ELR) of a stand-by period (wt, wait time).Shown in following formula, this function is by a parameter " energy surplus ratio " (ELR, Energy Left Rate) calculate its value, energy surplus ratio equals residue energy of node value than upper node total energy value (ELR=Eleft/Etotal):
Wherein, Eleft is residue energy of node; Etotal is node gross energy; β is for controlling parameter, makes all competitions finish the rear formation phase and can reserve a part of time slot network is effectively restrained; C is total timeslot number of whole formation phase.
As shown in Equation 3, finally we obtain stand-by period wt and are:
wt=waitforCWP(ELR)×a?slottime
As shown in Figure 1, in the network stabilization phase, the state of node is divided into duty cycle and sleep period.Duty cycle is divided into again two little periods: control sync period, monitoring phase.Each control sync period is divided into three little stages, is respectively control stage, management node synchronous phase, member's synchronous phase.
Network access parameters is regulated by Broadcasting Control synchronizing information at control sync period management node, the member node in Local Area Network is carried out synchronously, and arrange the report time slot of each member node at sleep stage; Do not receive and control synchronizing information or the node that newly adds can be applied for to contiguous management node, management node is replied after receiving.
In the time of the network data exchange phase, management node is monitored network state (comprising the parameters such as conflict, channel utilization), judges the bearing capacity of network according to current region network state.In the time of sleep stage, in region, all member node are waken up and are reported packet awaits number in queue to management node in the time of particular time-slot separately, and management node is estimated the following loading condition of Local Area Network in a short time by waiting for total number packets.
Management node, according to network carrying ability and the access control parameter of estimating loading condition dynamic adjustments Local Area Network, comprises mode of operation (vice-minister monitors still repeatedly short monitoring), work sleep duration, initial contention window mouth etc.If Local Area Network channel utilization is high, conflict takes place frequently, waits for that number of packet is many, current network parameter bearing capacity deficiency so, need to improve the network operating time (reducing the length of one's sleep) and slightly large initial contention window mouth; If the channel utilization of current network is low, conflict fresh, wait for the few or nothing of number of packet, the bearing capacity surplus of current network so, can suitably reduce the operating time (improving the operating time) or enter repeatedly the short sleep state of short monitoring and control the time delay that sleep causes, and less initial contention window mouth is provided.If network channel occupancy is in high state slightly, and conflict fresh, current network bearing capacity relatively adapts to so.
The present invention adopts channel utilization (CU, Channel Ulilization), conflict number of times (CT, Collision Times), packet count (QPN in queue, Queued Packets Number), etc. packet node number to be sent (WNN, Want-to-send Nodes Number), a upper duty cycle successfully sends packet count (SPN, Sent Packets Number), a upper duty cycle produces parameter such as packet count (Generated Packets Number) etc. and calculates the work duration NextWorkTime in a following cycle.
NextWorkTime = { α [ 1 + CU - CU ‾ ] + β ( QPN + GPN SPN ) } × WorkTime
Wherein, α and β be control coefrficient, for the desired value of channel utilization, WorkTime is the duration of working on last stage.
(2) calculate NextWorkTime and mode of operation concrete grammar:
In the time that offered load increases, the method that the present invention increases shared proportion of each interior nodes operating time in cycle, cut down sleep is dealt with load to be increased, until the node sleep time is minimum value (MinSleep), now the operating time is maximum (MaxWTime); If offered load reduces, the energy loss of bringing in order to reduce idle listening, the present invention reduces each cycling time, increases the method for the length of one's sleep, consider simultaneously and increase the time delay of bringing the length of one's sleep, in the time that reach some values of defining (STimeMax) length of one's sleep, the present invention proposes a kind of method that replaces an original vice-minister to intercept with n short intercepting-sleep mechanism.
In the time that be greater than the maximum restriction length of one's sleep (STimeMax) length of one's sleep (SleepTime) of adjusting next time, it is to intercept the operating time (SWorkTime) short twice that the operating time (WorkTime) that a vice-minister is intercepted divides equally
SWorkTime=WorkTime/n
And become each length of one's sleep:
SSleep=SleepTime/n
Here the initial value of n is 2, and repeatedly the short duration sum of intercepting can not be greater than the duration that a vice-minister intercepts.In the time that again exceed the maximum restriction length of one's sleep (STimeMax) the short length of one's sleep of intercepting, n is increased to 1, then an original vice-minister is intercepted-slept and become n+1 short intercepting-sleep.Until working time of node is minimum value (MinWTime).
Therefore the operating time WorkTime that we obtain will meet:
MinWTime≤NextWorkTime≤MaxWTime
If the operating time increases:
NextWorkTime=MIN[NextWorkTime,MaxWTime]
If the operating time reduces:
NextWorkTime=MAX[NextWorkTime,MinWTime]
The packet node number to be sent such as employing of the present invention (WNN, Want-to-send Nodes Number) calculates the initial contention window mouth InitCw of next working stage node.
InitCw=2 α×WNN×a?slottime
Wherein α is control coefrficient.If there are the groupings to be sent such as more nodes have, so we in the time that next stage starts, to run into the possibility of conflict just larger, so just need sufficient initial contention window mouth avoid this series of conflicts.
In the time that next working stage starts, management node changes Network access control parameter by member node in Broadcasting Control synchronizing information notice management area.The management node of adjacent domain can pass through boundary node sensed in advance load variations, and makes and judge in advance and predict, overall network is adapted to gradually.
In the time that can not fulfiling management responsibility because of some reason, management node can enter management failure state, now can send at once network control fail message, this region member node is understood the information of carrying out in the time that next work period starts synchronously and is carried out Local Gravity And subregion, improves Its Fault Tolerance.
When member node normal data service interaction, utilize channel booking mechanism transmission reliability.Self carrys out dynamic Competition adjustment window by blocking continuous summation exponent back off algorithm, thereby avoids conflict.
Node current channel condition is divided into state (FCS, Frequent Collision State) and the non-state that takes place frequently of conflict (ICS, Infrequent Collis ion State) of taking place frequently that conflict by this method.
When node is in non-the taking place frequently when state of conflicting, this method thinks that the probability clashing is less, does not need competition window to take excessive adjustment, otherwise easily cause the increase of time delay after clashing; If but node meets with conflict continuously, think that present node should be accelerated to the conflict status adjustment that takes place frequently gradually by the non-state that takes place frequently of conflict, and consecutive collision number of times more regulate the speed should be faster.Successfully transmission should be dwindled competition window fast, makes the network node of state under low load can be in best competition window state.
When node is in conflict while taking place frequently state, this method thinks that the probability that conflict occurs is larger, should not take excessive adjustment to competition window after successfully sending data, otherwise the increase of the probability that easily leads to a conflict; If but node successfully transmission continuously think that present node should be accelerated to the non-status adjustment that takes place frequently of conflict gradually by the conflict state that takes place frequently, and more governing speed should be faster to send continuously number of success.While clashing, should increase fast competition window, make the network node of state under high capacity can be in best competition window state.
Node has a level and smooth transfer process at the conflict state that takes place frequently with non-the taking place frequently of conflicting between state.
Concrete grammar is as follows:
Block continuous control index stack back off algorithm several parameters are set, be respectively: competition window maximum CWmax, contention window minimum CWmin, the competition window value of defining CWlimit, competition window adjusted value CWadjust and continuous coefficients α.
Wherein the competition window value of defining CWlimit is used for defining present node in the conflict state that the takes place frequently non-state that takes place frequently that still conflicts; Competition window adjusted value CWadjust is the time slot size of each Competition adjustment window, when FCS, is CWadf, is CWadi when ICS; Continuous coefficients α is the count value that node successfully sent or recurred conflict continuously, and initial value is 1.The current contention window value of node is CW.
If 1 CW<Cwl imit, node is current in ICS state, CWadjust=CWadi.
While clashing:
CW=MIN(CW+2 αCWadjustCWlimit+2)
α=α+1
Without conflicting while successfully transmission:
CW = MAX ( CW 2 , CW min )
α=1
If 2 CW>Cwlimit, node is current in FCS state, CWadjust=CWadf.
While clashing:
CW=MIN(2×CW,CWmax)
α=1
Without conflicting while successfully transmission:
CW=MAX(CW-2 α×CWadjust,CWlimit-2)
α=α+1
The foregoing is only embodiments of the invention, be not limited to the present invention.The present invention can have various suitable changes and variation.All any amendments of doing within the spirit and principles in the present invention, be equal to replacement, improvement etc., within protection scope of the present invention all should be included in.

Claims (6)

1. a wireless sensor network dynamic channel dynamic access control method, is characterized in that described method comprises the steps:
Form the phase at network, overall network is managed to region and divide, by management node control area network access parameters; Adopt a kind of electoral machinery based on energy control for the election of management node, the election that each sensor node can participative management node;
By a stand-by period, the control function waitforCWP (ELR) of (wt, wait time) controls competition window position; Shown in following formula, this function is by a parameter " energy surplus ratio " (ELR, Energy Left Rate) calculate its value, energy surplus ratio equals residue energy of node value than upper node total energy value (ELR=Eleft/Etotal):
Wherein, Eleft is residue energy of node; Etotal is node gross energy; β is for controlling parameter, makes all competitions finish the rear formation phase and can reserve a part of time slot network is effectively restrained; C is total timeslot number of whole formation phase;
Finally obtaining stand-by period wt is:
wt=waitforCWP(ELR)×a?slottime
In the network stabilization phase, the state of node is divided into duty cycle and sleep period; Duty cycle is divided into again two little periods: control sync period, monitoring phase; Each control sync period is divided into three little stages, is respectively control stage, management node synchronous phase, member's synchronous phase;
Network access parameters is regulated by Broadcasting Control synchronizing information at control sync period management node, the member node in Local Area Network is carried out synchronously, and arrange the report time slot of each member node at sleep stage; Do not receive and control synchronizing information or the node that newly adds can be applied for to contiguous management node, management node is replied after receiving;
In the time of the network data exchange phase, management node is monitored network state, judges the bearing capacity of network according to current region network state; In the time of sleep stage, in region, all member node are waken up and are reported packet awaits number in queue to management node in the time of particular time-slot separately, and management node is estimated the following loading condition of Local Area Network in a short time by waiting for total number packets;
Management node, according to network carrying ability and the access control parameter of estimating loading condition dynamic adjustments Local Area Network, comprises mode of operation, work sleep duration, initial contention window mouth etc.; If Local Area Network channel utilization is high, conflict takes place frequently, waits for that number of packet is many, current network parameter bearing capacity deficiency so, need to improve network operating time and slightly large initial contention window mouth; If the channel utilization of current network is low, conflict fresh, wait for the few or nothing of number of packet, the bearing capacity surplus of current network so, can suitably reduce the operating time or enter repeatedly the short sleep state of short monitoring and control the time delay that sleep causes, and less initial contention window mouth is provided; If network channel occupancy is in high state slightly, and conflict fresh, current network bearing capacity relatively adapts to so;
In the time that next working stage starts, management node changes Network access control parameter by member node in Broadcasting Control synchronizing information notice management area; The management node of adjacent domain can pass through boundary node sensed in advance load variations, and makes and judge in advance and predict, overall network is adapted to gradually;
In the time that can not fulfiling management responsibility because of some reason, management node can enter management failure state, now send at once network control fail message, this region member node is understood the information of carrying out in the time that next work period starts synchronously and is carried out Local Gravity And subregion, improves Its Fault Tolerance;
When member node normal data service interaction, utilize channel booking mechanism transmission reliability; Self carrys out dynamic Competition adjustment window by blocking continuous summation exponent back off algorithm, thereby avoids conflict.
2. a kind of wireless sensor network dynamic channel dynamic access control method as claimed in claim 1, is characterized in that:
Described electoral machinery is specially: this method definition formation phase is to be made up of C time slot, in the time that competition starts, each node calculates the election hatch section present position in C time slot of oneself according to own current residual energy value, each election hatch section is made up of m time slot, and m depends on node distribution situation; Then the election of node participative management node in election hatch section separately, self become after management node at once broadcast control node towards periphery and produce message, other non-management node of receiving this message stops election process at once, receives that multiple management nodes can add one of them while producing message at random;
The value of m depends on whole wireless sensor network node distribution situation, and must be integer, and result of calculation rounds up, and minimum value is 10; Suppose that node is equally distributed, whole network node quantity is more, and the nodes that may be assigned to so same competition window section when competition management node is just more, and therefore competition window section just needs the generation that avoids conflict of the time slot of greater number;
Wherein, N refers to whole network node sum, and Rc is node signal efficient communication covering radius, and S for this reason wireless sensor network can the deployment region gross area, and α is for controlling parameter.
3. a kind of wireless sensor network dynamic channel dynamic access control method as claimed in claim 1 or 2, is characterized in that: described mode of operation is that a vice-minister monitors or repeatedly short monitoring, and concrete grammar is as follows:
In the time that offered load increases, the method that increase shared proportion of each interior nodes operating time in cycle, cuts down sleep is dealt with load to be increased, until the node sleep time is minimum value (MinSleep), now the operating time is maximum (MaxWTime); If offered load reduces, the energy loss of bringing in order to reduce idle listening, reduce each cycling time, increase the method for the length of one's sleep, consider simultaneously and increase the time delay of bringing the length of one's sleep, in the time that reach some values of defining (STimeMax) length of one's sleep, replace an original vice-minister to intercept with n short intercepting-sleep mechanism, concrete steps are as follows:
In the time that be greater than the maximum restriction length of one's sleep (STimeMax) length of one's sleep (SleepTime) of adjusting next time, it is to intercept the operating time (SWorkTime) short twice that the operating time (WorkTime) that a vice-minister is intercepted divides equally
SWorkTime=WorkTime/n
And become each length of one's sleep:
SSleep=SleepTime/n
Here the initial value of n is 2, and repeatedly the short duration sum of intercepting can not be greater than the duration that a vice-minister intercepts; In the time that again exceed the maximum restriction length of one's sleep (STimeMax) the short length of one's sleep of intercepting, n is increased to 1, then an original vice-minister is intercepted-slept and become n+1 short intercepting-sleep, until working time of node is minimum value (MinWTime).
4. a kind of wireless sensor network dynamic channel dynamic access control method as claimed in claim 1 or 2, it is characterized in that: adopt channel utilization (CU, Channel Utilization), conflict number of times (CT, Collision Times), packet count (QPN in queue, Queued Packets Number), etc. packet node number to be sent (WNN, Want-to-send Nodes Number), a upper duty cycle successfully sends packet count (SPN, Sent Packets Number), a upper duty cycle produces the parameters such as packet count (Generated Packets Number) and calculates the work duration NextWorkTime in a following cycle,
Wherein, α and β be control coefrficient, for the desired value of channel utilization, WorkTime is the duration of working on last stage;
The packet node numbers to be sent such as employing (WNN, Want-to-send Nodes Number) calculate the initial contention window mouth InitCw of next working stage node:
InitCw=2 α×WNN×a?slottime
Wherein α is control coefrficient.
5. a kind of wireless sensor network dynamic channel dynamic access control method as claimed in claim 1 or 2, it is characterized in that: node current channel condition is divided into the state (FCS that takes place frequently that conflicts, Frequent Collision State) and the non-state that takes place frequently of conflict (ICS, Infrequent Collision State);
When node is in non-the taking place frequently when state of conflicting, the probability clashing is less, does not need competition window to take excessive adjustment, otherwise easily cause the increase of time delay after clashing; If but node meets with conflict continuously, think that present node should be accelerated to the conflict status adjustment that takes place frequently gradually by the non-state that takes place frequently of conflict, and consecutive collision number of times more regulate the speed should be faster;
When node is in conflict while taking place frequently state, the probability that conflict occurs is larger, should not take excessive adjustment to competition window after successfully sending data, otherwise the increase of the probability that easily leads to a conflict; If but node successfully transmission continuously think that present node should be accelerated to the non-status adjustment that takes place frequently of conflict gradually by the conflict state that takes place frequently, and more governing speed should be faster to send continuously number of success; While clashing, should increase fast competition window, make the network node of state under high capacity can be in best competition window state;
Node has a level and smooth transfer process at the conflict state that takes place frequently with non-the taking place frequently of conflicting between state;
Concrete grammar is as follows:
Block continuous control index stack back off algorithm several parameters are set, be respectively: competition window maximum CWmax, contention window minimum CWmin, the competition window value of defining CWlimit, competition window adjusted value CWadjust and continuous coefficients α;
Wherein the competition window value of defining CWlimit is used for defining present node in the conflict state that the takes place frequently non-state that takes place frequently that still conflicts; Competition window adjusted value CWadjust is the time slot size of each Competition adjustment window, when FCS, is CWadf, is CWadi when ICS; Continuous coefficients α is the count value that node successfully sent or recurred conflict continuously, and initial value is 1; The current contention window value of node is CW;
(1), if CW<Cwl is imit, node is current in ICS state, CWadjust=Cwadi;
While clashing:
CW=MIN(CW+2 α×CWadjust,CWlimit+2)
α=α+1
Without conflicting while successfully transmission:
α=1
(2) if CW>Cwlimit, node is current in FCS state, CWadjust=CWadf.
While clashing:
CW=MIN(2×CW,CWmax)
α=1
Without conflicting while successfully transmission:
CW=MAX(CW-2 α×CWadjust,CWlimit-2)
α=α+1?。
6. a kind of wireless sensor network dynamic channel dynamic access control method as claimed in claim 1 or 2, is characterized in that: the concrete grammar of described Local Gravity And subregion is:
In the time that management node runs into irreversible problem or predictable problem, can broadcast at once the message that a network control message informs that region interior nodes management node lost efficacy, this region in member node receive and can in the time that network is idle, notify after this information around this management node thrashing message of other member node in same region; In the time that next duty cycle starts, the node of receiving this message is broadcasted and is prepared management node challenge message within the control phase, and approximately fixes on and when management node sync period starts, manage node competition; Failed areas interior nodes can be competed by participative management node;
If can add other region while having node to receive the network control message of other management node broadcast when Local Gravity And subregion, enter the normal network operation stage after subregion completes.
CN201410129841.2A 2014-04-01 2014-04-01 A kind of wireless sensor network dynamic channel dynamic access control method Expired - Fee Related CN103957602B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410129841.2A CN103957602B (en) 2014-04-01 2014-04-01 A kind of wireless sensor network dynamic channel dynamic access control method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410129841.2A CN103957602B (en) 2014-04-01 2014-04-01 A kind of wireless sensor network dynamic channel dynamic access control method

Publications (2)

Publication Number Publication Date
CN103957602A true CN103957602A (en) 2014-07-30
CN103957602B CN103957602B (en) 2017-12-22

Family

ID=51334791

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410129841.2A Expired - Fee Related CN103957602B (en) 2014-04-01 2014-04-01 A kind of wireless sensor network dynamic channel dynamic access control method

Country Status (1)

Country Link
CN (1) CN103957602B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105657855A (en) * 2016-01-28 2016-06-08 武汉慧联无限科技有限公司 Wireless channel access control method
CN107835513A (en) * 2017-10-27 2018-03-23 西安电子科技大学 Avoiding method is blocked in a kind of association based on dynamic adjustment channel sense residence time
CN108834219A (en) * 2018-07-20 2018-11-16 东北电力大学 S-MAC Protocol of Wireless Sensor Network optimization method based on adaptive-flow
CN113490235A (en) * 2021-07-01 2021-10-08 电子科技大学 MAC layer low-delay quick reconnection method for millimeter wave ad hoc network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101296249A (en) * 2008-04-03 2008-10-29 东南大学 Media access control method for wireless sensor network
CN101594287A (en) * 2008-05-26 2009-12-02 华为技术有限公司 A kind of method and system of transfer of data, node
US20120230318A1 (en) * 2006-10-09 2012-09-13 Huawei Technologies Co., Ltd. Method and System for Determining and Optimizing Throughput of Short Range Wireless Network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120230318A1 (en) * 2006-10-09 2012-09-13 Huawei Technologies Co., Ltd. Method and System for Determining and Optimizing Throughput of Short Range Wireless Network
CN101296249A (en) * 2008-04-03 2008-10-29 东南大学 Media access control method for wireless sensor network
CN101594287A (en) * 2008-05-26 2009-12-02 华为技术有限公司 A kind of method and system of transfer of data, node

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
杨永雷,朱军: "无线传感器网络中异步成簇算法的研究", 《计算机技术与发展》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105657855A (en) * 2016-01-28 2016-06-08 武汉慧联无限科技有限公司 Wireless channel access control method
CN105657855B (en) * 2016-01-28 2018-12-28 武汉慧联无限科技有限公司 wireless channel access control method
CN107835513A (en) * 2017-10-27 2018-03-23 西安电子科技大学 Avoiding method is blocked in a kind of association based on dynamic adjustment channel sense residence time
CN107835513B (en) * 2017-10-27 2020-09-01 西安电子科技大学 Associated blocking avoidance method based on dynamic adjustment of channel interception residence time
CN108834219A (en) * 2018-07-20 2018-11-16 东北电力大学 S-MAC Protocol of Wireless Sensor Network optimization method based on adaptive-flow
CN108834219B (en) * 2018-07-20 2021-05-25 东北电力大学 Wireless sensor network S-MAC protocol optimization method based on flow self-adaption
CN113490235A (en) * 2021-07-01 2021-10-08 电子科技大学 MAC layer low-delay quick reconnection method for millimeter wave ad hoc network
CN113490235B (en) * 2021-07-01 2023-02-10 电子科技大学 MAC layer low-delay quick reconnection method for millimeter wave ad hoc network

Also Published As

Publication number Publication date
CN103957602B (en) 2017-12-22

Similar Documents

Publication Publication Date Title
CN108235437B (en) Wireless mobile self-organizing network channel time slot scheduling and distributing method
JP2018082430A (en) Device and method for routing and scheduling in multi-hop network
CN101379768B (en) Method and system for dynamic power management in wireless local area networks
Anastasi et al. Reliability and energy efficiency in multi-hop IEEE 802.15. 4/ZigBee wireless sensor networks
Wang et al. Energy-aware adaptive restricted access window for IEEE 802.11 ah based smart grid networks
Kwak et al. A traffic-adaptive MAC protocol for WBAN
CN103957602A (en) Dynamic access control method for dynamic channel of wireless sensor network
Abdeddaim et al. Adaptive IEEE 802.15. 4 MAC for throughput and energy optimization
CN102006670B (en) Dynamic polling medium access control method of emergency response supported sensor network
Rao et al. Self-adaptive implicit contention window adjustment mechanism for QoS optimization in wireless sensor networks
CN106792568B (en) Energy optimization-based wireless sensor network hybrid Z-MAC protocol optimization method
Huamei et al. An energy‐efficient MAC protocol based on receiver initiation and multi‐priority backoff for wireless sensor networks
Chu et al. Reinforcement learning based ALOHA for multi-hop wireless sensor networks with informed receiving
Raza et al. A control channel based MAC protocol for time critical and emergency communications in industrial wireless sensor networks
CN102170706A (en) Spectrum access method for distributed cognitive radio system
Wang et al. Energy-delay aware restricted access window with novel retransmission for IEEE 802.11 ah networks
CN111065169B (en) Method for time division multiplexing of autonomous network system channel
Ramadan et al. Energy-efficient dual-layer MAC protocol with adaptive layer duration for WSNs
Slama et al. A hybrid MAC with prioritization for wireless sensor networks
Lee et al. Period-controlled MAC for high performance in wireless networks
Debasis et al. A low duty cycle MAC protocol for energy conservation in wireless sensor networks
Wijesiri et al. Energy harvesting-aware backoff algorithms for distributed device-to-device communication
Hossain et al. Ad-ATMA: An efficient MAC protocol for wireless sensor and ad hoc networks
Singh et al. An improved TMAC protocol for wireless sensor networks
Rekik et al. Limitations of static autonomous scheduling for TSCH protocol and advances in adaptive scheduling

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20171222