CN106162742A - LDC ＆ LC energy-saving MAC method - Google Patents
LDC ＆ LC energy-saving MAC method Download PDFInfo
- Publication number
- CN106162742A CN106162742A CN201610405678.7A CN201610405678A CN106162742A CN 106162742 A CN106162742 A CN 106162742A CN 201610405678 A CN201610405678 A CN 201610405678A CN 106162742 A CN106162742 A CN 106162742A
- Authority
- CN
- China
- Prior art keywords
- node
- time
- beacon
- network
- frame
- 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
Classifications
-
- 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/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
- H04W52/0206—Power saving arrangements in the radio access network or backbone network of wireless communication networks in access points, e.g. base stations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
- H04W74/085—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- 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
Abstract
LDC (Low Duty Cycle, low duty ratio) &LC (Low Collision, low collision) energy-saving MAC method.The method sets up reliable transmission link, reduces Duty Cycle and Collision situation, meanwhile, adds self adaptation update mechanism, can more adapt to the network change of complexity, have more preferable robustness.It uses back off mechanism to realize internodal asynchronous, at the Scheduling of a primitive period, determines that the random beacon time of transmission and broadcast frame beacon sends, and uses self adaptation update mechanism to safeguard the concordance of network.This method is effectively reduced the overall Duty Cycle and energy consumption of network, improves transmitting and the adaptability of network of data.
Description
[technical field]
The invention belongs to the technical field that computer utility is combined with Internet of Things.
[background technology]
Wireless sensor network (WSN) is more and more attractive in different applications, owing to its monitoring range is wide,
Without advantage the most on duty, it is widely used in industrial automation, safety monitoring, synoptic analysis and some military options etc..
But the finiteness of the sensor node energy content of battery, also directly affects the existence Cycle of node and network, hinders entering of WSN
How one step development and application, therefore, improve efficiency of energy utilization, the power-economizing method that research design is relevant, becomes this field
Hot issue.
For the node in radio sensing network, energy mainly consumes on monitoring information with data transmit-receive, and except this
A little necessary energy expenditures, for Media Access Controlled layer (MAC, medium access control), as Collision weight
Pass, cross-talk, idle Snooping, control information too much, send these situations such as inefficacy and also can waste unnecessary energy.MAC
Layer method is control information and data message carries out the direct effector that receives and dispatches over the wireless channel, is determining network
Play an important role in throughput, delay, bandwidth availability ratio and energy expenditure, also can indirectly affect overlying roaduay by side
Method and the performance of transmission method.So, research design efficient MAC method is to ensure that the key issue of WSN service quality, such as figure
Shown in 1.
According to the difference of data collection mode, the application model of WSN substantially can be divided three classes: Cycle sexuality is known, event
Driving perception and query driven type perception.Cycle sexuality knows that i.e. sensor node according to fixing Cycle monitoring and transmits number
According to, remaining time enters resting state to save energy expenditure；Event driven perception i.e. when the event of concern occurs, senses
Device node just can carry out collection and the transmission of data；Query driven type perception i.e. sensor node is receiving external inquiry instruction
After, just start gather or transmit data.For different data collection modes and application scenarios, it is suitable for different MAC methods.
According to the difference of channel access mode, MAC method can be divided into again method based on Scheduling, based on competition
Method and mixed method.For MAC layer method based on Scheduling, the time of each node transmission information by
Scheduling method determines, interfering over the wireless channel is the least, has time delay guarantee, but Scheduling is difficult to adjust
Whole, autgmentability is poor, and clock synchronicity requires height.And based on the MAC method competed, it is not necessary to global network information, expansible,
Easily realize, but add the probability of conflict.
Whether the operation time according to node synchronizes, and MAC method is broadly divided into again two kinds of strategies, node synchronization policy and
The asynchronous strategy of node.The MAC method synchronized has S-MAC, T-MAC, SCP-MAC etc. than more typical, and S-MAC method uses virtual
Bunch and Snooping/ dormancy mechanism is set to improve network efficiency, in network, node uses unified dormancy strategy, fixing
Duty-Cycle, although decrease transmission delay, but himself mechanism also easily causes mass data Collision in network, wave
Take node energy, and its adaptability dynamic to network is the most poor.T-MAC method is the improvement on the basis of S-MAC, and it is right
The self-adaptative adjustment of Duty-Cycle makes the method be suitable for the dynamic change of network traffics, but its existence early sleeps problem, meeting
Increase network transmission delay, reduce network throughput.SCP-MAC, in the mechanism keeping high level of synchronization, shortens greatly
The Snooping time, improve energy saving, but owing to the higher dependence synchronized, considerably increasing system loading.Therefore to
Reduce the node dependence to synchronization mechanism, asynchronous MAC method based on Snooping/ dormancy mechanism also had more research,
Such as by sending B-MAC, X-MAC, O-MAC, Wise MAC and PB-MAC etc. that node initiates. send the asynchronous of node initiation
MAC method is by the way of sending node and sending targeting sequencing, after receiving, then returns to sending node when waiting node to be received to wake up
Multiple notification transmission data.And the asynchronous MAC method receiving node initiation is by receiving node transmission beacon frame, send
Node wakes up the mechanism of Snooping, and this is a kind of passive mechanism, but well solves the long preamble sending node
With the problem of too much busy channel, decrease the situation of Collision cross-talk simultaneously, generally, this passive different
Step mechanism has lower Duty-Cycle than what transmission node initiated.
But, this passive asynchronous MAC method, although reduce Duty-Cycle, save energy expenditure, but for
In real time complicated network condition, as node adds, local area network communication task is burst and is waited network dynamically to change, and lacks real-time oneself
Adapting to synchronize update, the latency issue brought is more uncertain relative to synchronizing MAC method.
[summary of the invention]
The purpose of the inventive method is to overcome deficiencies of the prior art, and design is a kind of to be initiated to build by reception node
The low Duty-Cycle, low Collision of vertical connect, it is possible to the asynchronous MAC method of adaptive network change update,
Use for reference on the basis of typical asynchronous MAC method, method be optimized improvement, ensure relatively low Duty-Cycle with
Collision introduces the mechanism of self adaptation update while leading, make method be suitable for network and dynamically change.
The present invention is optimized improvement on the basis of asynchronous MAC method, devises a kind of new being sent out by reception node end
The asynchronous MAC method risen, by corresponding method, the node in network wakes up according to the information table of oneself, distribution, sends node
The time that node wakes up that receives can be predicted, thus the only Snooping when receiving node and waking up, set up reliably transmission link,
Thus greatly reduce Duty-Cycle Yu Collision situation, meanwhile, for the dynamic change of network, add self adaptation
The mechanism of update, makes method can more adapt to the network change of complexity, it is ensured that network is low energy consumption's
Have more preferable robustness simultaneously.
A kind of LDC&LC energy-saving MAC method that the present invention provides mainly includes following committed step:
1st, original Cycle Scheduling:
The network starting stage, it is assumed that be a TPrimIn original Cycle, determine random transmission beacon time, Rand position
It is the produced random Cycle that wakes up next time for node, calculates Rand position, add broadcast frame beacon and send, in network
Node need the beacon sent by other node of Snooping to determine oneself neighbours' node information table；Wide in order to solve
The Collision problem broadcasting beacon frame introduces back-off mechanism, and when back-off, node can be to time interval value
Count, if counting time period value is normality value more than n, n and is more than the total number of actual node in network, illustrate close to original
Cycle latter stage, major part node has been successfully transmitted the node recovery of beacon frame, the most unsuccessful transmission beacon frame
It is spaced Snooping channel every one, if idle, sends the beacon frame of oneself immediately.
2nd, Predictwake-up:
Receive the node of beacon, for i.e. needing the node of transmission data, after the beacon receiving neighbours node,
Read the Rand position of beacon frame, receive target node and i.e. send the broadcast sent after the node of beacon wakes up up
Beacon frame, reads the information in beacon frame, calculates wakeup time next time, and Snooping channel, neighbour
Occupy in node information table, and relative to the information of this target node in update oneself neighbours' node information table；Send data
Node i.e. receives the node of beacon and sends RTS data sending request to target node, is set up by RTS, CTS, DATA and ACK
Reliable communication linkage also completes data transmission, and target node is after having received Data Concurrent and having sent confirmation frameACK, still
Keep one T of Snooping channelKeepTime i.e. node needs to keep the time of Snooping after sending beacon, if there being data
Send request, then continuing to data, if there is no any request, then entering resting state.
3rd, Collision weight connect:
The method using the random back-off time, evades node and sends request collision simultaneously, miss the node of connect
Connect request, and neighbours' node information table of update oneself is sent to target node again after the anticipated time arrives,
On corresponding target node wakeup time, increase the waiting time poor；Node is at data end of transmission in transmission, receives target node
ACK confirm after frame, enter resting state, and select the time next time waken up up according to the information table of oneself.
4th, self adaptation update:
Assume the given time, when network needs to be overall situation update, the reception waken up close to this time
Node i.e. sends the node initiation point as this overall situation update of beacon；The node being defined as initiating point keeps
Snooping state, not in use by original broadcast beacon for receiving data, but produces overall situation update beacon
Frame, is set to-1 by DST position, i.e. network is restarted beacon frame, Rand position and is set to an original Cycle；With one
Frame gap is minimum time unit, and this restarts mono-frame gap of beacon frame, Snooping to initiate some broadcast,
The numerical value of the Rand position in update beacon frame, i.e. deducts the frame gap number of experience on the basis of original Cycle,
Gradually deduct, determine final frame gap.
Advantages of the present invention and good effect
The present invention is to be optimized on the basis of asynchronous MAC method, and major design one has self adaptation update
Mechanism, and low Duty-Cycle asynchronous MAC method based on temporally predictive.Method is by an original Cycle's
Snooping, determines wake-up time at random, keeps away the mechanism of moving back and makes all node not wake up in same Cycle Snooping sending
Data, but separate busy channel.Collision weight connect mechanism strengthens the communication quality of network, self adaptation
The addition of update mechanism makes network adaptability higher.This method effectively reduces the overall Duty-Cycle of network node,
Thus reduce network energy consumption, improve the transmitting of data and the adaptability of network simultaneously.
[accompanying drawing explanation]
Fig. 1 MAC method conceptual scheme.
Fig. 2 is Method And Principle figure.
Fig. 3 is beacon structure chart.
Fig. 4 is original Cycle Scheduling figure.
Fig. 5 is Collision weight connect schematic diagram.
Fig. 6 is that overall situation update initiates schematic diagram.
Fig. 7 is network simulation topological diagram.
Fig. 8 is simulation parameter figure.
[detailed description of the invention]
In method for designing of the present invention, as shown in Figure 4, Collision weighs connect to whole original Cycle Scheduling
As shown in Figure 5.
The target of invention method for designing is a kind of low Duty-Cycle being initiated to set up connect by reception node of design,
Low Collision, it is possible to the asynchronous MAC method of adaptive network change update, on the basis using for reference typical asynchronous MAC method
On, method is optimized improvement, while relatively low Duty-Cycle Yu Collision of guarantee leads, introduces self adaptation update
Mechanism, make method be suitable for network and dynamically change.
The inventive method mainly includes following committed step:
1st, original Cycle Scheduling:
1.1st, the Scheduling by an original Cycle, determines the random beacon time that sends, calculating Rand
Position, adds broadcast frame beacon and sends, all nodeupdate target node information tables.
1.2nd, after original Cycle, node enters sleep state, receives node random interval and wakes up, and needs to be sent to
The node of target node data, calculates prediction wake-up time TS_Wake。
2nd, predict wake-up:
2.1st, node T before receiving node and waking up is sentS_WakeMoment wakes up, and Snooping beacon frame also builds
Vertical connect transmits data.Data are transmitted, and receiving node can continue mono-T of Snooping according to formulaKeepTime, in order to avoid
Miss other connect sending node requests.
If the 2.2nd reception node Snooping the most again is to request, then enter resting state, at upper once wakeup time
TR_WakeContinuation of waking up sends beacon, waits connect request.
3rd, Collision weight connect:
3.1st, the method using the random back-off time, evades node and sends request collision simultaneously, miss connect
Node after anticipated time arrives, send connect request, and the neighbours node of update oneself to target node again
Information table, on corresponding target node wakeup time, increases the waiting time poor；
3.2nd, node is sent at data end of transmission, after receiving the ACK confirmation frame of target node, entrance dormancy shape
State, and the time next time waken up up is selected according to the information table of oneself；
4th, self adaptation update:
4.1st, assume the given time, when network needs to be overall situation update, wake up close to this time
Receive node and i.e. send the node initiation point as this overall situation update of beacon；
4.2nd, the node being defined as initiating point keeps Snooping state, not in use by original for receiving data
Broadcast beacon, but produce overall situation update beacon frame, DST position is set to-1, i.e. network restarts beacon
Frame, Rand position is set to an original Cycle；
4.3rd, with a frame gap for minimum time unit, this restarts beacon frame to initiate some broadcast,
Mono-frame gap of Snooping, the numerical value of the Rand position in update beacon frame, i.e. subtract on the basis of original Cycle
Go the frame gap number of experience, gradually deduct, determine final frame gap.
5th, network simulation
5.1st, the original Cycle duration T of all nodeprimBeing set as that 10s tests, data stream generates interval
For 10s, network starting stage, the energy consumption of AP-MAC method is higher than X-MAC, RI-MAC, PB-MAC tri-
Person, in the network operation stage, the energy consumption speed of AP-MAC method is less than other three kinds of methods；
5.2nd, by original CycleTprim=10s immobilizes, and raw for data miscarriage time interval is incremented by successively, every time
Increasing 1s until increasing to 10s, comparing the change of the data traffic impact on network under distinct methods, RI-MAC and X-MAC passes through
Pay the cost of high Duty-Cycle, reduce delay, PB-MAC and AP-MAC efficient pre-check weighing connect mechanism, ensure
The low latency of network；
5.3rd, are set to fixed value raw for data miscarriage interval time, i.e. 10s, by original for node Cycle TprimArrange
For being incremented to 10s from 1s, from energy consumption growth rate level, AP-MAC is relative to other three kinds of methods more
Steadily, consumed energy is less, and it is the least that effective prediction makes node shift to an earlier date the Snooping waiting time, and adaptive update makes net
Network shows more preferable stability.
Details are as follows for the specific implementation process of the present invention:
1st, original Cycle Scheduling:
In the network starting stage, it is set to a TPrimIn original Cycle, the node in network by Snooping other
The beacon that node sends determines the neighbours' node information table of oneself.All node keep Snooping state, at TPrimCycle
It is broadcast frame that one the random time of interior selection sends beacon frame, this beacon frame, is receiving broadcast
After beacon frame, record neighbours' node information table.
Original CycleTPrimNeed to meet:
TPrim≥n×(TBroad+RTT)+TUncer (1)
Wherein, n is hypothesis node number, T in networkBroadIt is that a node transmission beacon frame completes required
Time, RTT is maximum round trip the transmission delay, T between nodeUncerFor the uncertain prolongation be between 0 to 1 random
Number, original time TPrimMust assure that the most all of node is sent completely beacon frame, to determine neighbours' node information
Table, if there is two or more node to send beacon frame simultaneously simultaneously, will produce Collision and retransmit, and
Retransmit again after needing between the node of Collision to avoid certain time slot at random, so adding the uncertain prolongation, because simply
The overall Snooping of starting stage, so during actual value, can take the sufficiently large all node of time guarantee completely
Beacon frame being successfully transmitted and receiving.
In the method, the structure of all-network link, the transmission of data are all by receiving transmission after node wakes up
Beacon frame initiates control, and about destination address, beacon type is, and predict that the next information waken up all should be arranged
At beacon frame.The beacon frame of this method is receiving the asynchronous MAC method beacon frame base that node initiates
Curve guide impeller is carried out, as shown in Figure 3 on plinth.
Wherein, FL is frame length, and FCF, FCS are original field, and SRC position is to send the node i.e. address of source node
Information, DST position is the address information of information object node.When not determining target, as sent beacon frame for broadcast
During frame, DST position can be set to 0, if sending the information of network update, then can be set to-1, as beacon frame class
Type mark, the node of Snooping detects that DST position, for broadcast frame, can receive this information and carry out update neighbours' node information
Table.Rand position be node be the produced random Cycle that wakes up next time, for calculate prediction wake up this next time receiving node time
Between.
Thus beacon structure is it can be seen that this method is relative to other asynchronous MAC methods, the structural adjustment to beacon
It is the increase in a Rand position, has been used for calculating the time waken up up next time, has been controlled by the numerical value arranging DST position different
The type of beacon, completes to broadcast update operation, and this method beacon has the feature of low overhead.
Original Cycle Scheduling is as shown in Figure 4.
In the method, it is assumed that n can not be concrete node number, no matter the network later stage is newly added node or death
Node, is used for, as one, the normality value that calculates using n, but the value of n must is fulfilled for more than or equal to the initial total number of node.
After node in network starts working, the broadcast beacon frame by the initial stage is needed to determine oneself Scheduling substantially
Cycle, after a node successful broadcast beacon frame, Cycle just brings into operation.In order to avoid starting stage network
The Collision of middle node broadcast frame, at first original CycleTPrimIn, node randomly chooses a moment TRand, make
For oneself sending the time of broadcast beacon frame, wherein,
TRand=TBroad×Random(1,n) (2)
I.e. node between 1～n according to one integer value of standard normal distribution stochastic generation, by the beacon of integral multiple
Frame is sent completely the moment as oneself the transmission beacon time, node in the network that thus can overall stagger
Scheduling Cycle.But owing to being random situation, and when subregion node is intensive, still it is likely to occur
The Collision that beacon sends, the formation of interference node Scheduling Cycle, and busy channel, affect other node
The transmission of beacon.So in order to prevent this situation, it is necessary to introduce certain back-off mechanism.When node arrives oneself
Random times when needing to send beacon, first Snooping channel is the most idle, if channel idle, then sends beacon,
If channel busy, it is spaced a T the most againBroadSnooping again after time, if again idle, sends beacon the most immediately, if
Snooping channel busy again, the then T of back-off random multipleBroadReturn after time and again detect.
During back-off mechanism, it is assumed that the channel in network is the most occupied, need to send beacon's
Node may be constantly in Snooping, back-off state, not only wastes energy, also cannot send out oneself
Beacon, for this problem, when back-off, time interval value can be counted by node, from the beginning of initial random number
Counting.If counting time period value is more than n (n is normality value and is more than the total number of actual node in network), illustrate close to original
Cycle latter stage, now major part node has been successfully transmitted beacon frame, the node of the most unsuccessful transmission beacon frame
Recover to be spaced Snooping channel every one, if idle, send the beacon frame of oneself immediately.Until original Cycle
Terminating, all node all can be successfully transmitted beacon frame, subsequently into resting state, according to the neighbours' node information of oneself
Table and random timing, the secondary time waken up under selection.
2nd, predict wake-up mechanism:
In order to reduce the Collision between node, make the active channel of the node independence that needs receive and send messages as far as possible,
Node, after original Cycle is successfully transmitted beacon, can substantially determine the Scheduling Cycle of oneself, and wake up up every time
Interval all swings based on this Cycle at random, and this mechanism can largely avoid neighbours' node wake-up time
The most close, decrease Collision probability, just save the energy dissipation caused because of cross-talk and competitive channel.
When node is after determining transmission beacon frame, a random interval can be immediately generated, write on beacon's
Rand position sends, and this time interval value is determined by following formula:
Rand=δ TPrim+TBroad×Random(-1,0,1) (3)
Wherein, TPrimIt is an original Cycle, TBroadIt is a basic time frame gap, is multiplied by between-1 to 1
Interval time, as vibration amplitude, is finely adjusted by one random number, can more effectively avoid signal overlap.In formula, δ is
Cycle adjustment factor, sets span as [0.8,1.5].
For sending the node of beacon, for i.e. receiving node, while determining random interval, just set next time
The moment T waken upR_WakeSuch as following formula, wherein TR_nowIt is reception node current time.
TR_Wake=TR_now+Rand (4)
And for receiving the node of beacon, for i.e. needing the node of transmission data, receiving neighbours node's
After beacon, read the Rand position of beacon frame, consider the factors such as error delay, calculate and dope target node
The wake-up time of next Cycle, thus wake up before target node wakes up up, Snooping channel, in neighbours' node information table,
If there being the transmission data task to target node, then calculate the wakeup time T of this nodeS_WakeIt is stored in corresponding target
In node information.
TS_Wake=TS_now-TBroad-RTT+(1-2θ)Rand (5)
Wherein, TS_nowRepresent and send the local moment after node receives beacon frame, receive the time that node sends
Interval is from TR_nowMoment starts counting up, and beacon is sent to send node and needs a TBroadTime, RTT is transmission
Delay, θ are the oscillator frequency deviation of node, owing to the deviation of frequency can bring the drift of clock between node, so will be by this
Individual time error counts, and numerically much bigger than transmission delay due to time deviation, it is possible to will transmission
Delay is ignored, and is reduced to by above formula:
TS_Wake=TS_now+(1-2θ)Rand-TBroad (6)
In formula, frequency departure θ is adopted as maximum frequency deviation value, then time 2 θ Rand is for sending node,
For the amount maximum pre-set time estimated, meet so sending wakeup time anticipated with receiving node for node:
TS_Wake＜ TR_Wake (7)
This ensures that there transmission node to wake up before receiving node, Snooping channel, in order to establish the link in time,
Send data.
Node is through oneself certain random time intervals, at the moment T setR_WakeAfter waking up, continue with the side of broadcast
Formula sends the beacon frame of oneself, still comprises the address information about source node in this beacon frame, next
The main informations such as secondary random wakeup time interval.For broadcasting the Collision problem of beacon, discussed, devised
A kind of back-off mechanism reduces Collision.Because time interval is randomly provided, and at original Cycle, each node
Have taken up measures to keep clear, it is assumed that still there is node and wake up in the identical time, will occur beacon's
Collision, in this case, still can use above keep away the mechanism of moving back, if node wake up after Snooping channel idle,
Then send broadcast beacon frame, if channel busy, then keep away and retransmit after moving back random time frame gap, now, beacon
Random time intervals in frame needs to reset update.
The node being successfully transmitted beacon can keep Snooping channel a period of time T after sending out beaconKeepIf,
During this period of time, there is the RTS request of other node to send, then make CTS response and set up communication linkage and transmit data, if
During this period of time, do not receive any request, then enter resting state, until the wakeup time next time set.Node sends
Need to keep the time T of Snooping after beaconKeepCan be expressed as:
TKeep=TBroad+TRTS+RTT+TP_off (8)
Wherein, owing to sending beginning timing from beacon, so counting a beacon to be sent completely time TBroad, come and go
Maximum delay time RTT, TRTSThe time that a RTS has asked to need, T is sent for nodeP_offThe time of moving back is prolonged, meeting for maximum
Introduce in Collision rebuilds connect mechanism.
This node is saved as target, i.e. needs to send data to the transmission node of this node, can be when setting
TS_WakeWake up, start Snooping channel, because sending wakeup time anticipated with receiving node for node to meet TS_Wake＜
TR_Wake, so sending node can wake up Snooping channel up before waking up receiving node, target node therefore can be received
The broadcast beacon frame sent after waking up up, reads the information in beacon frame, calculates wakeup time next time, and
Relative to the information of this target node in update oneself neighbours' node information table.Meanwhile, send node to send to target node
RTS data sending request, by RTS/CTS/DATA/ACK mechanism, sets up reliable communication linkage and completes data transmission.Mesh
Mark node, after having received Data Concurrent and having sent confirmation frameACK, still keeps one T of Snooping channelKeepTime, if
There is data sending request, then continue to data, if there is no any request, then entering resting state.
3rd, Collision weight connect mechanism:
Assume that target node, after waking up transmission broadcast beacon frame up, has more than one node needs in neighbours node
Send connect request to target node simultaneously, will result in the connect failure sending node and receive node, for this
The situation of kind, still uses in this method and keeps away the method moving back certain time at random, evade node and send request collision simultaneously.For just
The secondary node missing connect, according to the situation that the time missed is different, uses different pre-check weighing connect time methods,
Reduce unnecessary Snooping waste of time, improve the efficiency of weight connect.Principle process is as shown in Figure 5.
Here the back-off time is different from original Cycle, when multiple transmission node receive the broadcast of target node
After beacon frame, [0, TP_offThe most random back-off regular hour T in]P, then send to target node
Connect asks.Owing to, after target node is waken up, having certain holding Snooping time, send node and must assure that
After back-off, still will not miss the Snooping time of target node.Back-off time TPShould meet:
TP+Td+TRTS≤TKeep-TBroad-TP_off (9)
Wherein TdFor one-way transmission delay between node, i.e. RTT/2.Formula (9) can be reduced to T by convolution (8)P
≤ RTT/2, the most maximum back-off time TP_offCan be with value as RTT/2.
Assume that having two to send node is S1With S2Be simultaneously received the broadcast beacon frame of target nodeR, need to
Connect is set up in its transmission request, and the two is not to send request to R immediately simultaneously, but selects at random in scope [0, RTT/2]
Select the regular hour to keep away and move back, then retransmit connect request.
For missing the node of connect for the first time, then during request to be ready for sending, set up the node of connect for the first time
Busy channel, before the non-end of transmission of data, channel will always be in busy state.And in this process, miss connect
Node be in Snooping state, it is possible to the CTS of connect node can be issued to target node by Snooping
Frame, it is also possible to Snooping is to sending the packet that node sends to target node, different according to the time missed
Situation, uses different pre-check weighing connect time methods to calculate.
(1) if Snooping is the CTS frame that sends to target node, then the anticipated node of connect has sent number
According to and discharge the time T of connectpreFor:
Tpre=Tnow+In(RTT+2TUnit)+TCTS+TACK (10)
Wherein, TUnitThe time of unit data, I is processed for nodenFor sending the number of node packet to be sent, TCTS
And TACKIt is respectively the time sent required for an a CTS response frame and ACK confirmation frame.
(2) if Snooping is to sending the packet that node sends to target node, then anticipated connect
Node has sent data and has discharged the time T of connectpreFor:
Tpre=T'now+I'n(RTT+2TUnit)+TACK (11)
Wherein, I'nThe packet number to be sent for sending node, the present time in formula (10) and formula (11) is also
It not the identical time, but the instant time of this node clock in the case of two kinds.
According to both of these case, the node missing connect sends to target node after the anticipated time reaches again
Connect asks, and neighbours' node information table of update oneself, on corresponding target node wakeup time, and increase etc.
The time difference treated.Send node at data end of transmission, after receiving the ACK confirmation frame of target node, i.e. entrance dormancy shape
State, selects the time next time waken up up according to the information table of oneself.
4th, self adaptation update mechanism:
Dynamic due to network changes, the drift of network node clock, the addition of new node, and indivedual during network busy
The situations such as node beacon or the node beacon information not receiving target node that can not broadcast oneself in time, all can cause
The most reciprocity or the inefficacy of neighbours' node information table information, and then affect Snooping/ sleep Scheduling and the data of node
Link establishment and transmission, so safeguarding the concordance of network node, neighbours node information table Cycle is done self adaptation
Update is necessary.
For several different situations needing self adaptation update, it is discussed and proposes solution respectively:
(1) in a network, there is indivedual node, as being positioned at frontier distance target node farther out, be newly added node or by
Fail to timely receive the node of beacon in the Collision of network node, in these indivedual node, its neighbours node
Table can not find the information of corresponding target node.For this kind of indivedual node, in the case of can not find target node, permissible
Staying awake for Snooping channel, until receiving the broadcast beacon of target node, then initiating to target node
Connect, and return by the mechanism of random Cycle dormancy.This is the mode of a kind of local update, just for indivedual node,
Particularly with the node being newly added, after the Snooping time less than an original Cycle, just can enter random Cycle and follow
Ring duty.
(2) when update neighbours' node information being required for for node all in network, the referred to herein as overall situation
Update, then be equivalent to once restarting of network, and the most all node carry out the Snooping of the most original Cycle again.But
Due to needs the overall situation update time, in network, node is in running status, the most corresponding node in working order,
Independent takies channel.And this is just as the drift of node clock, it is impossible to keep absolute concordance, same time clock rings
The mechanism answered is not suitable for this network condition, so the overall update of network must have a node as initiating point.
In the method, it is assumed that the given time, when network needs to be overall situation update, wake up close to this time
The reception node come is as the initiation point of this overall situation update.The node being defined as initiating point keeps Snooping state, no
Re-use original broadcast beacon for receiving data, but produce overall situation update beacon frame, by DST position
Be set to-1, i.e. network restarts beacon frame, and wherein Rand position is set to an original Cycle, and in the process, all
With a frame gap for minimum time unit.First, initiate node to broadcast this and restart beacon frame, then
Mono-frame gap of Snooping, if do not receive other node in this frame gap restarts frame, then at this
The follow-up supervention of frame gap send one to restart frame, but the Rand position in beacon frame needs update to be new numerical value, i.e.
Deducting the frame gap number of experience on the basis of original Cycle, sending a beacon is also a frame gap time.If
Send that the frame gap after beacon receives that other node send restarts frame, then disregard beacon frame, clearly
Empty neighbours' node information table information, proceeds to resting state, and by the beacon Rand bit time originally setting or receiving, arrives
Wake up up after certain time interval, restart the monitoring of the most original Cycle.For not being transmitted across restarting beacon
Frame, and after receiving and restarting beacon, immediately Rand position is deducted a frame gap and retransmits, identical with above-mentioned principle, if
Restart frame what next frame gap received other node, then empty table and enter dormancy, if not receiving, then one, interval
Frame gap continues to send.In this process, when beacon frame is restarted in transmission every time, all successively decrease in Rand position therein
Time frame gap, during until the value of Rand position is less than a time frame gap, this process terminates, as shown in Figure 6.Setting
Interval arrive after, as initial Cycle, random time according to oneself sends beacon, be equivalent to network the most again
Start, so, the node in network all can neighbours' node information table of update oneself, if there being new node to add, also can be very
Fast incorporates network.
(3) for the dynamic change of network traffics, or in a certain region, event takes place frequently and forwards the node that focus is higher,
Being required for the change according to network traffics, dynamically adjust and run Cycle, this is the self-adaptative adjustment of a kind of instantaneity, is simply
On the premise of guaranteeing data transmission, increase the elasticity of network C ycle, and unlike local update and overall situation update
It is periodically executed for the effectiveness of network.
In the present invention, we add Cycle adjustment factor δ in random interval Cycle, in order to node
Scheduling Cycle can suitably regulate, and under network stabilization state, δ is fixed value, but when network locally flows
When amount changes or has driving event to occur, receiving node can be by the adjustment factor δ in regulation beacon Rand position, such as
δ-value is reduced, so that it may so that the operation Cycle of this node is shorter, in network traffics region occurred frequently speeding up data transmission.Owing to closing
Can increase the computation burden of node accordingly in the self adaptation update Cycle of flow, the value for δ also can affect at random
The Collision problem of Cycle, for method for simplifying, only can arrange two values to it, stable state that i.e. flow is relatively low and stream
Measuring higher event state, experiment sets interval as [0.8,1.5], can arrange different taking for different network condition
Value obtains reasonable effect.
5th, application test
The original Cycle duration T of all nodeprimBeing set as that 10s tests, data stream generates and is spaced apart 10s,
The network starting stage, the energy consumption of AP-MAC method is higher than X-MAC, RI-MAC, PB-MAC three, network
Operation phase, the energy consumption speed of AP-MAC method is less than other three kinds of methods；By original CycleTprim=10s is fixing not
Become, raw for data miscarriage time interval is incremented by successively, increasing 1s until increasing to 10s every time, comparing data traffic under distinct methods
The change impact on network, RI-MAC and X-MAC, by paying the cost of high Duty-Cycle, reduces delay, PB-MAC
Pre-check weighing connect efficient with AP-MAC mechanism, has ensured the low latency of network；Raw for data miscarriage interval time is set to
Fixed value, i.e. 10s, by original for node CycleTprimIt is set to be incremented to 10s from 1s, increases from energy consumption
In speed level, AP-MAC is more steady relative to other three kinds of methods, and consumed energy is less, and effective prediction makes node in advance
The Snooping waiting time is the least, and adaptive update makes net list reveal more preferable stability.
Claims (1)
1.LDC&LC energy-saving MAC method, it is characterised in that the method mainly includes following committed step:
1st, original Cycle Scheduling:
The network starting stage, it is assumed that be a TPrimIn original Cycle, determining random transmission beacon time, Rand position is
Node is the produced random Cycle that wakes up next time, calculates Rand position, adds broadcast frame beacon and sends, in network
Node needs the beacon sent by other node of Snooping to determine the neighbours' node information table of oneself；In order to solve broadcast
The Collision problem of beacon frame introduces back-off mechanism, and when back-off, time interval value can be done by node
Counting, if counting time period value is normality value more than n, n and is more than the total number of actual node in network, illustrates close to original
Cycle latter stage, major part node has been successfully transmitted the node recovery of beacon frame, the most unsuccessful transmission beacon frame
It is spaced Snooping channel every one, if idle, sends the beacon frame of oneself immediately.
2nd, Predict wake-up:
Receive the node of beacon, for i.e. needing the node of transmission data, after the beacon receiving neighbours node, read
The Rand position of beacon frame, receives target node and i.e. sends the broadcast beacon sent after the node of beacon wakes up up
Frame, reads the information in beacon frame, calculates wakeup time next time, Snooping channel, believes at neighbours node
In breath table, and relative to the information of this target node in update oneself neighbours' node information table；The node sending data i.e. receives
The node of beacon sends RTS data sending request to target node, is communicated reliably with ACK foundation by RTS, CTS, DATA
Linking and complete data transmission, target node, after having received Data Concurrent and having sent confirmation frameACK, still keeps
One T of Snooping channelKeepTime i.e. node needs to keep the time of Snooping after sending beacon, if there being data to send
Request, then continuing to data, if not having any request, then entering resting state.
3rd, Collision weight connect:
The method using the random back-off time, evades node and sends request collision simultaneously, misses the node of connect in advance
The time of meter sends connect request, and neighbours' node information table of update oneself to target node, again right after arriving
On the target node wakeup time answered, increase the waiting time poor；Node is at data end of transmission in transmission, receives target node
After ACK confirms frame, enter resting state, and select the time next time waken up up according to the information table of oneself.
4th, self adaptation update:
Assuming the given time, when network needs to be overall situation update, the reception node waken up close to this time is
Send the node initiation point as this overall situation update of beacon；The node being defined as initiating point keeps Snooping shape
State, not in use by original broadcast beacon for receiving data, but produces overall situation update beacon frame, will
DST position is set to-1, i.e. network is restarted beacon frame, Rand position and is set to an original Cycle；With a frame gap
For minimum time unit, this restarts mono-frame gap of beacon frame, Snooping to initiate some broadcast, update
The numerical value of the Rand position in beacon frame, i.e. deducts the frame gap number of experience on the basis of original Cycle, gradually subtracts
Go, determine final frame gap.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610405678.7A CN106162742A (en) | 2016-06-03 | 2016-06-03 | LDC ＆ LC energy-saving MAC method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610405678.7A CN106162742A (en) | 2016-06-03 | 2016-06-03 | LDC ＆ LC energy-saving MAC method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106162742A true CN106162742A (en) | 2016-11-23 |
Family
ID=57353822
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610405678.7A Pending CN106162742A (en) | 2016-06-03 | 2016-06-03 | LDC ＆ LC energy-saving MAC method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106162742A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020119322A1 (en) * | 2018-12-14 | 2020-06-18 | 重庆邮电大学 | Asynchronous wireless wake-up method and device |
| CN114916050A (en) * | 2022-04-20 | 2022-08-16 | 中南大学 | MAC protocol method based on receiver initiation and self-adaptive contention window |
-
2016
- 2016-06-03 CN CN201610405678.7A patent/CN106162742A/en active Pending
Non-Patent Citations (4)
| Title |
|---|
| YANJUN SUN等: "RI-MAC: A Receiver-Initiated Asynchronous Duty Cycle MAC Protocol for Dynamic Traffic Loads in Wireless Sensor Networks", 《SENSYS’08 PROCEEDINGS OF THE 6TH ACM CONFERENCE IN EMBEDDED NETWORK SENSORSYSTEMS》 * |
| 冯耀玲等: "多障碍环境下无线路由算法的组网研究", 《山西电子技术》 * |
| 李哲涛等: "低占空比、低碰撞的异步无线传感器网络 MAC 协议", 《通 信 学 报》 * |
| 王林，王晓哲: "接收端发起的异步无线传感器网络 MAC 协议", 《计算机应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020119322A1 (en) * | 2018-12-14 | 2020-06-18 | 重庆邮电大学 | Asynchronous wireless wake-up method and device |
| CN114916050A (en) * | 2022-04-20 | 2022-08-16 | 中南大学 | MAC protocol method based on receiver initiation and self-adaptive contention window |
| CN114916050B (en) * | 2022-04-20 | 2024-04-19 | 中南大学 | MAC protocol method based on receiver initiation and self-adaptive competition window |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | A low duty cycle efficient MAC protocol based on self-adaption and predictive strategy | |
| EP2887746B1 (en) | Data transmission method and device | |
| CN101296249B (en) | Media access control method for wireless sensor network | |
| CN107835527B (en) | Wireless sensor network communication method based on time-sharing dormancy | |
| CN101557606B (en) | Media access control (MAC) method applicable to wireless sensor network | |
| KR101450910B1 (en) | Time slot allocation method for reduction of energy losses in wireless sensor network | |
| CN102685780B (en) | Wireless sensor network channel access and bulk data transmission method | |
| Sahota et al. | An energy-efficient wireless sensor network for precision agriculture | |
| US20080049700A1 (en) | Reduced power network association in a wireless sensor network | |
| CN107682905B (en) | A kind of stellar chain type wireless sensor network is without layer communication method | |
| CN111132291B (en) | LPWAN synchronous awakening method based on LoRa | |
| CN101193016A (en) | A method for energy saving of media access control layer of wireless mesh network | |
| KR20100081321A (en) | Method for transmitting information packets within an asynchronous wireless communication network and network node implementing it | |
| CN101184005B (en) | Double cluster wireless sensor network based adaptive communication method | |
| US9980207B2 (en) | Delayed response to requesting device | |
| CN103906207A (en) | Wireless sensor network data transmission method based on self-adaptation required awakening technology | |
| CN102752843B (en) | A kind of method for synchronizing time | |
| CN104812030A (en) | Mixed media access control method for chained wireless sensor network | |
| 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 | |
| CN102740363A (en) | Method for acquiring data of wireless sensor network | |
| CN103874172A (en) | Data transmission method and system in wireless body area network | |
| CN102843758A (en) | Method for data energy conservation transmission between nodes in wireless sensor network | |
| JP2009182604A (en) | Multi-hop radio communication system | |
| CN105246137B (en) | A kind of micropower wireless network data transmission method and system | |
| Qin et al. | Cross-interface scheduling toward energy-efficient device-to-gateway communications in IoT |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20161123 |
|
| WD01 | Invention patent application deemed withdrawn after publication |