CN101232518B - Low-power dissipation media access control method of node dynamic state resting - Google Patents
Low-power dissipation media access control method of node dynamic state resting Download PDFInfo
- Publication number
- CN101232518B CN101232518B CN2008100573008A CN200810057300A CN101232518B CN 101232518 B CN101232518 B CN 101232518B CN 2008100573008 A CN2008100573008 A CN 2008100573008A CN 200810057300 A CN200810057300 A CN 200810057300A CN 101232518 B CN101232518 B CN 101232518B
- Authority
- CN
- China
- Prior art keywords
- node
- period
- data
- bunch
- channel
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Small-Scale Networks (AREA)
Abstract
一种节点动态休眠的低功耗媒体访问控制方法：1)将网络拓扑组织成分簇拓扑结构，在各簇簇内节点和各簇簇首间实现粗粒度的时钟同步，并让节点进行周期性工作和休眠；2)节点有3种工作模式：发送模式、接收模式和周期工作模式，其中节点在周期性工作模式中具有周期性执行和休眠、节点的实际工作和休眠时段动态变化、邻节点间可相互计算对方下一工作周期内的执行子时段等特点；3)在一个工作周期内，任意两个邻节点的执行子时段能重叠以保证通信；4)邻节点间可侦听彼此发送的分组，并根据分组携带的信息自适应地调整各自的休眠时段，减少载波侦听次数；5)针对不同的数据采样率动态调整节点的忙闲度，在保证吞吐量，的同时降低功耗。本发明简单可靠，具有功耗低，时延短和自适应能力强等优点，能有效延长整个网络的生存周期。
A low-power media access control method for dynamic dormancy of nodes: 1) organize the network topology into cluster topologies, implement coarse-grained clock synchronization between nodes in each cluster and cluster heads, and allow nodes to perform periodic Working and sleeping; 2) The node has three working modes: sending mode, receiving mode and periodic working mode, in which the node has periodic execution and sleeping in the periodic working mode, the actual work of the node and the dynamic change of the sleeping period, the neighboring nodes 3) In a working cycle, the execution sub-periods of any two neighboring nodes can overlap to ensure communication; 4) Neighboring nodes can listen to each other’s sending groups, and adaptively adjust their respective sleep periods according to the information carried by the packets to reduce the number of carrier senses; 5) dynamically adjust the busyness of nodes according to different data sampling rates, and reduce power consumption while ensuring throughput . The invention is simple and reliable, has the advantages of low power consumption, short time delay and strong self-adaptive ability, and can effectively prolong the life cycle of the whole network.
Description
Technical field
The invention belongs to the communication protocol technical field of wireless sensor network, specifically a kind of low-power dissipation media access control method of node dynamic state resting.
Background technology
In (Wireless Sensor Networks is called for short WSN), network life cycle is to weigh the primary standard of the various communication technologys in the wireless sensor network field.Just must reduce power consumption in order to prolong network life cycle, comprising node hardware power consumption and communication power consumption etc.The reduction of communication power consumption then relates to radio frequency control, physical layer, Study on Technology such as medium access control protocol and Routing Protocol.Medium access control protocol (Media Access Control Protocol is called for short the MAC agreement) is used for solving the problem of wireless sensor network channel contention.MAC design of protocol in the WSN field must be considered energy efficiency, extensibility and fair and utilize problem such as link bandwidth efficiently.
Existing MAC protocols can be divided into following two classes at present: based on competition with based on the scheduling type.MAC agreement based on competition is a kind of agreement of using channel as required.Its advantage is a simple and flexible, has extensibility preferably, and shortcoming is to adopt competitive way to use channel, can need to retreat re-transmission when producing collision, will waste more energy like this, can not guarantee real-time.Typical case's representative based on competition at present has: S-MAC, T-MAC and B-MAC agreement etc.In the MAC agreement based on scheduling, node determines whether sending data by a dispatching algorithm.Do not send data at wireless channel with just can conflicting simultaneously between a plurality of like this nodes.In this quasi-protocol, mainly contain TRAMA, D-MAC and DEANA etc.Though its shortcoming is to have solved the channel contention collision problem effectively, autgmentability is poor, and ratio is low based on the MAC agreement of state of conflict on energy efficiency.And energy efficiency is to weigh the primary standard of MAC design of protocol, and the present invention is under the jurisdiction of the MAC agreement based on state of conflict, below will introduce the background technology based on the MAC agreement of state of conflict.
Energy consumption is present in the following aspects in the channel contention process: the idle monitoring, contention conflict, data re-transmitting, agreement control expense and signal cross-talk etc.Wherein idle the monitoring is again the main factor that influences energy consumption, because volume of transmitted data is less usually in the WSN application, only requires low data transmission rate, and a large amount of unnecessary free time monitor and will waste energy.Therefore need to reduce the idle number of times of monitoring, at present main way is at first to realize all internodal clock synchronizations, allows node carry out periodic duty and dormancy synchronously then, promptly in one-period interior nodes one section dormancy time and operating time regularly.This way can significantly reduce idle monitoring number of times and cut down the consumption of energy, and main representative has S-MAC.The shortcoming of this agreement is that the dormancy time section is fixed, and can not dynamically change dormancy time to average out between throughput and energy consumption according to data transmission rate.At this shortcoming, T-MAC has proposed the MAC agreement that a kind of self adaptation is adjusted buty cycle, promptly dynamically changes dormancy time according to actual conditions.At first whether monitor channel is idle when sending node sends data for this agreement, when hearing channel busy, just determines next listening period according to monitoring backoff interval and RTS frame transmitting time, and node enters sleep and waits for that next listening period arrives simultaneously.The T-MAC agreement has further reduced energy consumption.But the shortcoming of this agreement is defining node while contention channel when entering the operating time in each cycle, compares the time delay that S-MAC has increased channel contention conflict and transfer of data again.Compare above two kinds, B-MAC has then adopted clear channel-monitoring and transmission pilot tone byte to combine to be increased the listening period interval and reduces the monitoring number of times.The shortcoming of this agreement be listening period at interval and pilot tone byte quantity be directly proportional, promptly reducing the monitoring number of times and be with the energy consumption that increase transmits and receive data is cost.
From as can be known above-mentioned, various MAC agreements all are indexs such as balance throughput, time delay when making every effort to cut down the consumption of energy, and pluses and minuses are respectively arranged, and still do not have a kind of MAC agreement can be applicable to various scenes at present, and the MAC protocol technology is still a difficult point.
Summary of the invention
The objective of the invention is: overcome the deficiencies in the prior art, a kind of low-power dissipation media access control method of node dynamic state resting is provided, need energy consumption so that reduce signal post when high-quality is finished data communication, it is strong to have adaptivity simultaneously, the characteristics of favorable expandability.
For finishing purpose of the present invention, the technical scheme that the present invention takes is: the low-power dissipation media access control method of node dynamic state resting, and step is as follows:
At first network topology structure is organized as the sub-clustering topology, and give all nodes given according to the order of sequence positive integer numbering, then carry out each bunch interior nodes and the internodal coarseness clock synchronization of each bunch head, finish posterior nodal point in clock synchronization and number the offset direction of selecting execution sub-period in work period next time according to self, node carries out work in one-period then, and work comprises process of transmitting and receiving course:
Wherein the source node cycling flow process of process of transmitting is as follows:
(1) if the data sampling rate of source node changes, then adjusts the work buty cycle of node, then execution in step (3);
(2) if the data sampling rate of source node does not change, then direct execution in step (3);
(3) the execution sub-period with source node is offset a time window W;
(4) judge whether source node has data to send, and carries out step (5) if free of data will send,, then carry out step (6) if there are data to send;
(5) execution and the dormancy that allows source node be scheduled in remaining time this week enters next cycling after finishing;
(6) source node calculating self and the common execution sub-period of destination node in this cycle;
(7) the common execution sub-period in this cycle arrives when source node and destination node, source node elder generation's random wait a period of time, judges then whether channel is idle;
(8) if channel idle, source node switches to sending mode (this moment, destination node can correspondingly switch to receiving mode), source node sends grouping to destination node, finish that source node and destination node all switch to the periodic duty pattern and finish clock synchronization after the data communication, then turn to step (5);
(9) if channel busy, source node and destination node just receive the grouping that third party's node sends, and grouping calculates remaining idle time of channel section in this cycle in view of the above, all enter resting state then reducing unnecessary channel-monitoring, and turn to step (6).
The node cycling flow process of receiving course is as follows:
(10) if the data sampling rate of node changes, then adjust the buty cycle of node work after, execution in step (12);
(11) if the data sampling rate of node does not change, then direct execution in step (12);
(12) node is carried out time window W of sub-period skew;
(13) arrive when carrying out sub-period, judge whether channel is busy, if channel busy, then node turns to step (15) after receiving a grouping, otherwise turns to step (14);
(14) execution and the dormancy that allows node be scheduled in remaining time this week enters next cycling after finishing;
(15) judge according to receiving block data whether oneself is the destination node of transmit leg, if then continue receiving block data until finishing data communication, switches to the periodic duty pattern then, finishes clock synchronization, then turns to step (14); If not then turning to step (16);
(16) node calculates according to grouped data and estimates remaining execution sub-period in this cycle, turns to step (13) then.
The present invention's beneficial effect compared with prior art is:
(1) described by claim 1 is the sub-clustering topology with network organization in the netinit process, comparing existing S-MAC and D-MAC etc. carries out whole network and carries out clock synchronization, the present invention only need carry out the clock synchronization of bunch head and bunch interior nodes respectively, improved clock synchronization accuracy, reduced of the transmission of clock synchronization frame, reduced required time, control frame expense and the energy consumption of clock synchronization effectively at whole network.
(2) by step (3), (6) ~ (9) in the node periodic duty in the claim 1, (12) and (16) allow node dynamically dormancy and work, common execution sub-period between the neighbors is staggered mutually, the execution period between the interior neighbors of each cycle of S-MAC and T-MAC of comparing is all identical, the present invention has reduced the number of times of keeping out of the way of channel contention conflict and channel-monitoring effectively, has reduced energy consumption and data transmission delay simultaneously.In addition, the precision clock of comparing time-multiplexed MAC agreement needs is synchronous, and the present invention only needs the coarseness clock synchronization can make the common execution sub-period distribution between the neighbors different, has the good fault-tolerance of clocking error.
(3) by the step 1) and 10 in the node periodic duty in the claim 1), the present invention can adjust the dormancy time of node adaptively according to the volume of transmitted data of practical application scene in the fixing work period, compare the cycle dynamics adjustment of S-MAC fixed sleep time and T-MAC, the present invention has guaranteed network throughput and time delay not influencing under the clock synchronization prerequisite, reduce the clock synchronization expense, improved energy consumption efficiency effectively.
Description of drawings
Fig. 1 is the inventive method realization flow figure, and wherein a is for sending out the flow chart of process, and b is the flow chart of receiving course;
Fig. 2 organizes schematic diagram for sub-clustering network topology of the present invention;
Fig. 3 is an attribute definition schematic diagram of the present invention; Wherein a is the definition of node associated period, and b is a packet configuration;
Fig. 4 is the specific embodiment of attribute definition of the present invention;
Fig. 5 is a clock synchronization flow chart of the present invention, and wherein a is the flow process that each bunch bunch first node is finished clock synchronization, and b finishes the flow process of clock synchronization for each bunch bunch interior nodes;
Fig. 6 is the day part distribution situation signal of the node among Fig. 2 of the present invention in certain work period, and wherein a is the day part distribution situation of node 11 in certain work period, the day part distribution situation of b node 12 in certain work period.
Embodiment
The low-power dissipation media access control method of node dynamic state resting of the present invention comprises following concrete steps:
(1) network topology is organized into the sub-clustering topology, for each node sequence in the network is distributed unique positive integer numbering;
(2) set each required property value of node periodic duty;
(3) finish clock synchronization between each bunch bunch interior nodes and each bunch bunch first node;
(4) node periodic duty comprises following steps:
4.1) if the data sampling rate of node changes, then adjust the buty cycle of node work;
4.2) the work sub-period of node is offset a time window;
4.3) have data to send as source node, then it calculated self and destination node and hold sub-period jointly in this cycle, and turned to 4.4) send, otherwise turn to 4.6) receive;
4.4) the common execution sub-period of source node and destination node arrives, and source node elder generation's random wait a period of time, judges then whether channel idle;
4.4.1) if channel idle, then source node switches to sending mode (destination node correspondingly switches to receiving mode); Source node sends grouping to destination node then, all switches to the periodic duty pattern after finishing data communication, and finishes clock synchronization, and turn to 4.5);
4.4.2) if channel busy, the execution channel contention is kept out of the way, and turns to 4.3);
4.5) node execution and the dormancy in rest period, be scheduled to;
4.6) carry out the sub-period arrival, node enters accepting state, judges that whether channel is busy, if busy, then receive a grouped data and then turns to 4.7), otherwise turn to 4.5);
4.7) judge according to grouped data whether the destination node of transmit leg is oneself, if, then receive the packets remaining data, all switch to the periodic duty pattern after finishing data communication, and turn to step 4.5 after finishing clock synchronization); If not, then turn to 4.8);
4.8) node calculates in this cycle according to grouped data and estimate remaining execution sub-period, turns to step 4.6 then).
Wherein the sub-clustering network topology in the step 1) can adopt following steps to realize:
1.1) the link channel information exchange stage.Each node carries out the packet loss statistics to receiving packet, thereby has obtained the estimation to the channel quality of its up channel.Exchange estimated result then between adjacent node again, obtain objective evaluation each bar link channel quality according to certain assessment algorithm.
1.2) the node cluster stage.Dump energy and channel quality with node are choice criteria, are combined into cluster between one group of neighbor node, from bunch in select a bunch of first node, the communication between bunch intermediate node must be undertaken by bunch head.
1.3) topological establishment stage.Set up topology by the inundation mode between bunch head.Form mechanism by this topology and can form a hierarchy type structure.In addition, because bunch first dead or owing to bunch first elect a unreasonable communication disruption that causes, can adapt to the variation of network topology structure for adapting to by re-electing bunch head.
Sub-clustering network topology that forms after step 1) is finished and node serial number example are as shown in Figure 2.4 sub-clustering topologys are wherein arranged, node 4,7,8,10 is respectively each sub-clustering bunch head.The data of bunch interior nodes all are forwarded to the Sink node by a bunch head.Each bunch bunch head is organized as layer-stepping, is in the 1st layer as among Fig. 2 bunch of first node 4,7,8, can be directly and the Sink node communication.Bunch first node 10 is in the 2nd layer, and its data must be transmitted just by a bunch first node 7 can deliver to the Sink node.
Step 2) attribute definition as shown in Figure 3, wherein related definition is shown in 3a the node cycle, specifically describes as follows:
Time window: the least unit of express time segment length among the present invention is designated as W.
The node work period: by the fixed sleep period, the virtual work period is formed, and is designated as T
i(n), wherein i represents i node, and n represents n the cycle (i, n are the positive integer since 1), and the work period size of all nodes is identical.
The fixed sleep period: at T
iThe time period of interior fixed-site, node at this moment between the section in dormancy, be designated as T
Is(n).
The virtual work period: at T
i(n) time period of interior fixed-site, form by carrying out sub-period and paulospore period, be designated as T
Iv(n).
Carry out sub-period: at T
Iv(n) time period of interior position changeable, for node at this moment between the section in work, be designated as T
Ive(n).
The paulospore period: at T
Iv(n) time period of interior position changeable, node at this moment between the section in dormancy, be designated as T
Ive(n).
Regular as follows according to attribute definition: T
i(n)=T
Is(n)+T
Iv(n), T
Iv(n)=T
Ive(n)+T
Ivs(n), T wherein
i(n), T
Is(n), T
Iv(n), T
Ive(n), T
Ivs(n) all be defined as the multiple of time window W.
The present invention's regulation: T
Iv(n)+2*W＜2*T
Ive(n), to guarantee that two adjacent nodes can both have an opportunity to communicate by letter in each cycle.
Shown in Fig. 3 b, packet configuration is: by synchronization character, and block length, the spare word joint number that node sends, data are carried in grouping and CRC check result seven parts constitute.This seven part is used symbol SYNC_WORD respectively, DEST_ID, and SRC_ID, PKT_LEN, DATA_TO_SEND, DATA, CRC represents.Tuple P (SYNC_WORD, DEST_ID, SRC_ID, PKT_LEN, DATA_TO_SEND, DATA, CRC) expression are then adopted in grouping.The maximum length that data DATA is carried in each grouping is a DATA_MAX_LEN byte.
In this example, suppose that time window length is 1ms, the node work period is 16ms, and the fixed sleep period is 8ms, and virtual work period 8ms wherein carries out sub-period 5ms, paulospore period 3ms, as shown in Figure 4.
Step 3) is subdivided into following steps, as shown in Figure 5:
3.1) each bunch bunch first node finishes the process of clock synchronization shown in Fig. 5 a, specific as follows: as (to be the Sink node at first by aggregation node, the connected node of wireless sensor network and external network, be equivalent to gateway) clock synchronization of going on the air frame, each bunch be first then to be monitored a period of time and waits for whether receiving the clock synchronization frame.As receive, then select the clock-time scheduling of this clock synchronization frame as oneself.As do not receive, then begin periodic scheduling voluntarily, and the clock synchronization frame is broadcasted away.In addition, the clock synchronization between bunch head also can realize by added high-power radio clock synchronization frame by aggregation node.
3.2) each bunch bunch interior nodes finish clock synchronization process shown in Fig. 5 b, specific as follows: at first by bunch first opening beginning radio clock synchronization frame, bunch interior nodes receives the clock synchronization frame from bunch first node, finishes the clock synchronization scheduling with bunch head.
After finishing topology constructing and clock synchronization, each node begins periodic duty.Concrete node sends and receives flow process as shown in Figure 1.Node periodic duty step is as follows:
Step 4.1) process of adjustment node buty cycle is as follows:
It is as follows at first to provide definition and mark:
Buty cycle: node is carried out sub-period and the ratio of node work period, is designated as T
Ive(n)/T
i(n).The buty cycle of all nodes is identical.According to each time period regulation of front, can calculate buty cycle is 31.25% in this example.
The sampling number of sample rate: sampling type i in each time window W is designated as R
iThe byte number of each sampled data of sampling type i is designated as D
i
Then the sampled data total bytes of all k kind sampling types in time window W is designated as:
2) when the sample rate of sampling type i from R
iAdjust R '
i, each sampled data byte number is from D
iBe adjusted into D '
iThe time, T then
Iv(n+1), T
Ive(n+1) adjustment is as follows:
Adjust T
Iv(n+1), T
Ive(n+1) the also corresponding thereupon change of the buty cycle of posterior nodal point.
The hypothesis sampling type is a kind in this example, and sample rate was 10 times before sampling was adjusted, and is 2 bytes behind each sample quantization; Adjusting the post-sampling rate is 12 times, is 3 bytes behind each sample quantization.Virtual work period and execution sub-period thereof are respectively 8* (12*3)/(10*2)=15ms and 5* (12*3)/(10*2)=9ms so.
Step 4.3) source node and destination node are in the common execution sub-period calculation procedure following (suppose that source node is numbered i, destination node is numbered j) in this cycle in:
4.3.1) as the current time channel idle, then turn to 4.3.2), if channel busy, source node and destination node just receive the grouping that third party's node sends, calculate remaining idle time of channel section in this cycle in view of the above, all enter resting state then reducing unnecessary channel-monitoring, and turn to 4.3.3).
4.3.2) the common execution sub-period of destination node and source node is: T
Ive(n) ∩ T
Jve(n).
4.3.3) the common execution sub-period of destination node and source node is: destination node is carried out sub-period T
Ive(n), source node is carried out sub-period T
Jve(n) and estimate threes' such as remaining channel idle period intersection in this cycle.
Step 4.3.3 wherein) estimates in this cycle that remaining channel idle period computational methods are as follows: grouped data total amount of byte to be sent (is contained the interior sync byte of grouping, CRC check and block length) can draw third party's node busy channel with the duration divided by message transmission rate, use symbol T
BusyExpression estimates in this cycle that the remaining channel idle period is
, so step 3.3) in the common execution sub-period of source node and destination node can be expressed as:
For step 4.3) case description as follows:
According to network topology shown in Figure 2, suppose that certain work period interior nodes 11 day part distributes shown in Fig. 6 a, then carry out the skew rule and the odd even symmetry principle of sub-period according to node, node 12 day parts distribute shown in Fig. 6 b.Existing node 11 will give 12 to send data, the 4th, 5 time window when node 11 at first calculates their common execution sub-period and is at this moment.When the 3rd time window arrives the zero hour, 11 first random wait a period of times of node, intercept channel then, if channel idle, then node 11 switches to sending mode, the data communication of beginning and node 12.If channel busy, then node 11 and 12 receives the grouping that the third party sends (suppose it is node 13, its destination node is not a node 11 and 12 simultaneously), and judging node 13 according to this packet node 11 also will busy channel 1ms, i.e. T
Busy Be 1ms.Node 11 and 12 will enter sleep state this moment, and the interior common execution sub-period of this cycle that can calculate them simultaneously is the 5th time window, and promptly in the zero hour of the 5th time window, the two will attempt to carry out again data communication.
Step 4.7) judge that according to receiving block data whether the transmit leg destination node is that self case description is as follows in: suppose that the DEST_ID that node 12 receives in the grouping is 12, then the destination node of transmit leg is self, otherwise is not self.
Step 4.8) estimate that the case description of remaining execution sub-period is as follows in node rises this week in: node 12 day parts distribute shown in Fig. 6 b, suppose that node 12 receives the grouping that node 13 sends, and judge node 13 according to this grouping also will busy channel 1ms, i.e. T
Busy Be 1ms.Node 12 will enter sleep state this moment, and can calculate interior remaining execution sub-period of this cycle simultaneously is the 5th, 6,7,8 time windows, and promptly in the zero hour of the 5th time window, node will reenter accepting state.
The above only is an acquiescence execution mode of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (11)
1. the low-power dissipation media access control method of node dynamic state resting is characterized in that comprising following steps:
At first network topology structure is organized as the sub-clustering topology, and give all nodes given according to the order of sequence positive integer numbering, then carry out each bunch interior nodes and the internodal coarseness clock synchronization of each bunch head, finish posterior nodal point in clock synchronization and number the offset direction of selecting execution sub-period in work period next time according to self, node carries out work in one-period then, and work comprises process of transmitting and receiving course:
Wherein the source node cycling flow process of process of transmitting is as follows:
(1) if the data sampling rate of source node changes, then adjusts the work buty cycle of node, then execution in step (3);
(2) if the data sampling rate of source node does not change, then direct execution in step (3);
(3) the execution sub-period with source node is offset a time window W;
(4) judge whether source node has data to send, and carries out step (5) if free of data will send,, then carry out step (6) if there are data to send;
(5) execution and the dormancy that allows source node be scheduled in remaining time this week enters next cycling after finishing;
(6) source node calculating self and the common execution sub-period of destination node in this cycle;
(7) the common execution sub-period in this cycle arrives when source node and destination node, source node elder generation's random wait a period of time, judges then whether channel is idle;
(8) if channel idle, source node switches to sending mode, this moment, destination node can correspondingly switch to receiving mode, source node sends grouping to destination node, finish that source node and destination node all switch to the periodic duty pattern and finish clock synchronization after the data communication, then turn to step (5);
(9) if channel busy, source node and destination node just receive the grouping that third party's node sends, and grouping calculates remaining idle time of channel section in this cycle in view of the above, all enter resting state then reducing unnecessary channel-monitoring, and turn to step (6);
The node cycling flow process of receiving course is as follows:
(10) if the data sampling rate of node changes, then adjust the buty cycle of node work after, execution in step (12);
(11) if the data sampling rate of node does not change, then direct execution in step (12);
(12) node is carried out time window W of sub-period skew;
(13) arrive when carrying out sub-period, judge whether channel is busy, if channel busy, then node turns to step (15) after receiving a grouping, otherwise turns to step (14);
(14) execution and the dormancy that allows node be scheduled in remaining time this week enters next cycling after finishing;
(15) judge according to receiving block data whether oneself is the destination node of transmit leg, if then continue receiving block data until finishing data communication, switches to the periodic duty pattern then, finishes clock synchronization, then turns to step (14); If not then turning to step (16);
(16) node calculates according to grouped data and estimates remaining execution sub-period in this cycle, turns to step (13) then;
The process of adjusting the node buty cycle in described step (1) or the step (10) is as follows:
(a) provide the definition and mark as follows:
Buty cycle: node is carried out sub-period and the ratio of node work period, is designated as T
Ive(n)/T
i(n), the buty cycle of all nodes is identical;
The sampling number of sample rate: sampling type i in each time window W is designated as R
i, the byte number of each sampled data of sampling type i is designated as D
i, then the sampled data total bytes of all k kind sampling types in time window W is designated as:
(b) when the sample rate of sampling type i from R
iAdjust R '
i, each sampled data byte number is from D
iBe adjusted into D '
iThe time, T then
Iv(n+1), T
Ive(n+1) adjustment is as follows:
T wherein
Iv(n) be the virtual work period, adjust T
Iv(n+1), T
Ive(n+1) the also corresponding thereupon change of the buty cycle of posterior nodal point.
2. the low-power dissipation media access control method of node dynamic state resting according to claim 1 is characterized in that: described sub-clustering network topology adopts following steps to realize:
1. link channel information exchange stage: each node carries out the packet loss statistics to receiving packet, thereby obtained estimation to the channel quality of its up channel, exchange estimated result then between adjacent node again, obtain objective evaluation each bar link channel quality according to certain assessment algorithm;
2. node cluster stage: dump energy and channel quality with node are choice criteria, are combined into cluster between one group of neighbor node, from bunch in select a bunch of first node, the communication between bunch intermediate node must be undertaken by bunch head;
3. topological establishment stage: set up topology by the inundation mode between bunch head, form mechanism by this topology and can form a hierarchy type structure.
3. the low-power dissipation media access control method of node dynamic state resting according to claim 2, it is characterized in that: described step 2. in for adapting to because bunch first dead or owing to bunch first elect a unreasonable communication disruption that causes, can adapt to the variation of network topology structure by re-electing bunch head.
4. the low-power dissipation media access control method of node dynamic state resting according to claim 1, it is characterized in that: the process that described each bunch bunch first node is finished the coarseness clock synchronization is as follows: be the Sink node by aggregation node at first, the clock synchronization of going on the air frame, each bunch be first then to be monitored a period of time and waits for whether receiving the clock synchronization frame, as receive, then select the clock-time scheduling of this clock synchronization frame as oneself, as do not receive, then begin periodic scheduling voluntarily, and the clock synchronization frame is broadcasted away.
5. the low-power dissipation media access control method of node dynamic state resting according to claim 1, it is characterized in that: the coarseness clock synchronization between described each bunch head also can realize by added high-power radio clock synchronization frame by aggregation node.
6. the low-power dissipation media access control method of node dynamic state resting according to claim 1, it is characterized in that: the process that described each bunch bunch interior nodes is finished the coarseness clock synchronization is as follows: at first by bunch first opening beginning radio clock synchronization frame, bunch interior nodes receives the clock synchronization frame from bunch first node, finishes the clock synchronization scheduling with bunch head.
7. the low-power dissipation media access control method of node dynamic state resting according to claim 1, it is characterized in that: the processing procedure of a time window W of node execution sub-period skew is as follows in described step (3) or the step (12): as node serial number is even number, then next work period T
Ive(n) from offset direction T
Iv(n) starting point begins, and along starting point time window W of direction skew to terminal, just is called and is offset; As node serial number is odd number, then next work period T
Ive(n) from offset direction T
Iv(n) terminal point begins, and time window W of skew is called negative bias and moves, instantly the task period T along terminal point to the starting point direction
Ive(n) be positioned at offset direction T
IvDuring (n) border, then change again work period T next time immediately
Ive(n+1) offset direction is promptly in the opposite direction skew with current direction.
8. the low-power dissipation media access control method of node dynamic state resting according to claim 1 is characterized in that: the organization definition of grouping is as follows in described step (8) or step (9) or (13) or (15):
Grouping is by synchronization character, and source node is numbered, the destination node numbering, block length, the spare word joint number that node sends, grouping are carried seven parts such as data and CRC check result and are constituted, and this seven part is used symbol SYNC_WORD respectively, DEST_ID, SRC_ID, PKT_LEN, DATA_TO_SEND, DATA, CRC represents that tuple P (SYNC_WORD, DEST_ID are then adopted in grouping, SRC_ID, PKT_LEN, DATA_TO_SEND, DATA, CRC) expression, the maximum length that data DATA is carried in each grouping is a DATA_MAX_LEN byte.
9. the low-power dissipation media access control method of node dynamic state resting according to claim 1, it is characterized in that: calculating source node and destination node are as follows in the common execution sub-period step in this cycle in the described step (6): suppose that source node is numbered i, destination node is numbered j:
(1) as the current time channel idle, then turn to next step (2), if channel busy, source node and destination node just receive the grouping that third party's node sends, calculate remaining idle time of channel section in this cycle in view of the above, all enter resting state then reducing unnecessary channel-monitoring, and turn to step (3);
(2) the common execution sub-period of source node and destination node is: T
Ive(n) ∩ T
Jve(n);
(3) the common execution sub-period of source node and destination node is: source node is carried out sub-period T
Jve(n), destination node is carried out sub-period T
Ive(n) and estimate remaining channel idle period three's intersection in this cycle.
10. the low-power dissipation media access control method of node dynamic state resting according to claim 1, it is characterized in that: estimate in this cycle in the described step (9) that remaining channel idle period computational methods are as follows: suppose that source node is numbered i, destination node is numbered j;
With grouped data total amount of byte to be sent, contain the sync byte in the grouping, the source node numbering, the destination node numbering, CRC check and block length can draw third party's node busy channel with the duration divided by message transmission rate, use symbol T
BusyExpression estimates in this cycle that the remaining channel idle period is
Therefore the common execution sub-period of source node and destination node can be expressed as:
11. the low-power dissipation media access control method of node dynamic state resting according to claim 1, it is characterized in that: estimate in this cycle in the described step (16) that the following hypothesis node serial number of remaining execution sub-period computational methods is j: grouped data total amount of byte to be sent, contain the sync byte in the grouping, the source node numbering, the destination node numbering, CRC check and block length can draw third party's node busy channel with the duration divided by message transmission rate, use symbol T
BusyExpression, estimate in this cycle that remaining execution sub-period can be expressed as:
T
Jve(n) it is the work period for node j.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100573008A CN101232518B (en) | 2008-01-31 | 2008-01-31 | Low-power dissipation media access control method of node dynamic state resting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100573008A CN101232518B (en) | 2008-01-31 | 2008-01-31 | Low-power dissipation media access control method of node dynamic state resting |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101232518A CN101232518A (en) | 2008-07-30 |
| CN101232518B true CN101232518B (en) | 2011-03-23 |
Family
ID=39898690
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100573008A Expired - Fee Related CN101232518B (en) | 2008-01-31 | 2008-01-31 | Low-power dissipation media access control method of node dynamic state resting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101232518B (en) |
Families Citing this family (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883455B (en) * | 2009-05-08 | 2014-11-05 | 北京时代凌宇科技有限公司 | Lighting power-saving measurement and control system based on wireless sensor network |
| US8285519B2 (en) * | 2009-12-03 | 2012-10-09 | Osocad Remote Limited Liability Company | System and method for operating a network of sensors |
| CN102638874B (en) * | 2012-03-28 | 2015-08-19 | 华为技术有限公司 | Idle method and mobile router |
| CN102843758B (en) * | 2012-08-28 | 2015-04-29 | 苏州博联科技有限公司 | Method for data energy conservation transmission between nodes in wireless sensor network |
| CN102938929B (en) * | 2012-11-23 | 2015-04-08 | 西安电子科技大学 | Energy-saving-considered scheduling method for wireless local area network (LAN) |
| CN102970716B (en) * | 2012-12-17 | 2015-02-04 | 中国科学技术大学 | Transmission method with optimal energy efficiency under actual power consumption model |
| CN103281162A (en) * | 2013-05-15 | 2013-09-04 | 电子科技大学 | Method for broadcasting by introducing network coding based on synchronization mechanism into WSN |
| CN103619048B (en) * | 2013-12-18 | 2017-02-08 | 北京工业大学 | Routing method of linear wireless sensor network |
| CN105007225A (en) * | 2015-07-31 | 2015-10-28 | 东北大学 | Network dynamic topology control system and method thereof |
| CN106102138B (en) * | 2016-05-23 | 2019-06-25 | 重庆英卡电子有限公司 | State machine and operating method for field wireless detector managing power consumption |
| JP6357509B2 (en) * | 2016-08-10 | 2018-07-11 | 株式会社Ｎｔｔドコモ | User device and signal transmission method |
| JP6223625B1 (en) * | 2016-08-29 | 2017-11-01 | 三菱電機株式会社 | COMMUNICATION DEVICE, COMMUNICATION METHOD, AND COMMUNICATION PROGRAM |
| CN107809747B (en) * | 2016-09-09 | 2021-06-04 | 松下电器（美国）知识产权公司 | Communication method, radio base station, server, and radio distribution system |
| CN107809746B (en) * | 2016-09-09 | 2021-06-04 | 松下电器（美国）知识产权公司 | Communication method, server and wireless distribution system |
| CN109698843A (en) * | 2017-10-20 | 2019-04-30 | 中兴通讯股份有限公司 | A kind of method and device for realizing data transmission |
| CN110710186B (en) * | 2018-04-09 | 2024-12-06 | 鲁门无线电通信公司 | Method for reducing the sampling rate of streaming protocol in mesh network and wireless mesh network |
| CN108632963B (en) * | 2018-05-08 | 2019-04-02 | 北京理工大学 | A variable granularity feature sampling method based on multimedia sensor |
| CN109271396B (en) * | 2018-09-27 | 2020-06-12 | 杭州数梦工场科技有限公司 | Processing method, device and equipment for call chain data and storage medium |
| CN110346729B (en) * | 2019-06-21 | 2021-01-19 | 惠州市亿兆能源科技有限公司 | Method for dynamically adjusting dormancy process of battery management system |
| CN114967552B (en) * | 2022-05-25 | 2024-08-23 | 重庆长安汽车股份有限公司 | Vehicle operation system and method for balancing power consumption and performance |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1719803A (en) * | 2005-07-28 | 2006-01-11 | 武汉大学 | Multi-scale routing correction method and application for scalable large-scale sensor networks |
| CN1794687A (en) * | 2006-01-06 | 2006-06-28 | 中国人民解放军理工大学 | Adaptive dormancy method of network data chain circuit layer of cluster structured radio sensor |
-
2008
- 2008-01-31 CN CN2008100573008A patent/CN101232518B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1719803A (en) * | 2005-07-28 | 2006-01-11 | 武汉大学 | Multi-scale routing correction method and application for scalable large-scale sensor networks |
| CN1794687A (en) * | 2006-01-06 | 2006-06-28 | 中国人民解放军理工大学 | Adaptive dormancy method of network data chain circuit layer of cluster structured radio sensor |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101232518A (en) | 2008-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101232518B (en) | Low-power dissipation media access control method of node dynamic state resting | |
| Zheng et al. | PMAC: an adaptive energy-efficient MAC protocol for wireless sensor networks | |
| Miller et al. | A MAC protocol to reduce sensor network energy consumption using a wakeup radio | |
| Yang et al. | Utilization based duty cycle tuning MAC protocol for wireless sensor networks | |
| CN101217381A (en) | Energy saving method for wireless sensor network based on cross-layer | |
| CN103024849A (en) | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method | |
| CN103906207A (en) | Wireless sensor network data transmission method based on self-adaptation required awakening technology | |
| CN102740365B (en) | Single-stream bulk data acquisition method suitable for wireless sensor network | |
| CN101557606A (en) | Media access control (MAC) method applicable to wireless sensor network | |
| Oliveira et al. | A duty cycle self-adaptation algorithm for the 802.15. 4 wireless sensor networks | |
| CN102833834B (en) | Implementation method for wireless sensor network energy-saving MAC (media access control) | |
| CN101296249A (en) | Media Access Control Method for Wireless Sensor Networks | |
| CN102843758A (en) | Method for data energy conservation transmission between nodes in wireless sensor network | |
| Lei et al. | Reinforcement learning based multi-parameter joint optimization in dense multi-hop wireless networks | |
| CN103139073A (en) | Cognitive routing method based on Ad Hoc network form | |
| Wang et al. | DPS-MAC: An asynchronous MAC protocol for wireless sensor networks | |
| CN110121206B (en) | A multi-hop wireless wake-up method based on a queuing model with limited queue length | |
| Chi et al. | Implementation and study of a greenhouse environment surveillance system based on wireless sensor network | |
| CN105050136B (en) | Light wirelessly mixes the adaptive delay perception power-economizing method of broadband access network | |
| Annabel et al. | An energy efficient wakeup schedule and power management algorithm for wireless sensor networks | |
| Chang et al. | An energy conservation MAC protocol in wireless sensor networks | |
| CN104320181B (en) | A kind of maximization network encodes the EPON energy-saving scheduling methods of NC benefits | |
| CN107222913A (en) | The self-adapting dormancy method based on random depth of navel orange orchard monitoring node | |
| CN100452742C (en) | Multiple access method for moving target detection wireless sensor network | |
| CN115396991A (en) | Adaptive dormancy wakeup scheduling method for underwater acoustic sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110323 Termination date: 20140131 |