CN101547451B - Wireless sensor network local region covering algorithm based on delayed start - Google Patents
Wireless sensor network local region covering algorithm based on delayed start Download PDFInfo
- Publication number
- CN101547451B CN101547451B CN2008102364242A CN200810236424A CN101547451B CN 101547451 B CN101547451 B CN 101547451B CN 2008102364242 A CN2008102364242 A CN 2008102364242A CN 200810236424 A CN200810236424 A CN 200810236424A CN 101547451 B CN101547451 B CN 101547451B
- Authority
- CN
- China
- Prior art keywords
- node
- live
- vertex
- circle
- stage
- 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
Abstract
The invention provides a wireless sensor network local region covering algorithm based on delayed start. A cyclical mechanism is adopted when active node sets are selected, and the active node sets are dynamically selected when each cycle starts; secondly, a circle cross point covering determining algorithm is used for selecting the active node sets to ensure that the region is completely covered, and the phenomenon of covering omission is avoided; and finally, a delayed start mechanism is used for reducing the amount of active nodes in each cycle, reducing the occurrence probability of the encroaching phenomenon and prolonging the network life cycle. The application of the algorithm can reduce the occurrence probability of the encroaching phenomenon to correspondingly reduce the amount of the active nodes in each cycle; finally, the covering requirements assigned by users can be satisfied, and meanwhile, the whole life time of the network is prolonged. The wireless sensor network local region covering algorithm has better scientificity and higher application value.
Description
Technical field
The invention belongs to the Coverage Control in Wireless Sensor Networks technical field, be specifically related to a kind of wireless sensor network regional area covering method based on delay start.
Background technology
Because the perception of individual node is limited, how the cooperation between organization node effectively and reasonably realizes that the technology of the perception demand that people wish is called the wireless sensor network soverlay technique.It is the basic technology of wireless sensor network, has directly reflected the perceiving service quality of wireless sensor network to environment.Simultaneously, because the finite energy of sensor node, improving perceiving service quality and prolonging network lifetime is the key of Coverage Control in Wireless Sensor Networks art designs.
At open-air scene, particular surroundings such as desert, battlefield particularly, people often can't realize that certainty disposes.Therefore, present regional Coverage Control algorithm often adopts the mode that evenly dispenses the bulk redundancy node in the appointed area at random to carry out initial deployment.Simultaneously, utilize energy-conservation mechanism such as dormancy dispatching, when keeping original target area coverage, the life span that as far as possible prolongs network.According to its implementation strategy, can be divided into centralized algorithm and local region covering algorithm.
The covering decision-making judgement of centralized algorithm often concentrates on certain specific node (as the node of base station or certain specific type) to be carried out, and by the topology information of this node according to the whole network, judges which node dormancy, those nodes are in active state.This just requires this node that higher computing capability, storage capacity and communication capacity must be arranged.Simultaneously, the change in topology information of network node then needs to transfer to specific node in whole network, and the traffic load of network is heavier, not only has influence on normal data communication, also can cause the lot of energy waste simultaneously.Therefore, centralized control algolithm is not suitable for large scale network, is unfavorable for the expansion of network.
The regional area covering algorithm requires to cover decision-making to carry out on each node, and the node work period is divided into two stages: cover decision phase, data transfer phase (normal work stage), this is similar to the minute wheel working mechanism of sub-clustering Leach agreement.Covering the decision phase carries out when taking turns beginning every, and the topology information that each node can provide according to neighbor node judges that oneself state is dormancy or active state, finishes the Coverage Control of whole network thus.The covering decision phase begins normal data and transmits after finishing.Every live-vertex collection difference of taking turns decision-making has caused the dynamic change of network topology.Because agreement only needs neighbours' topology information, the traffic is few, amount of calculation is low, and simultaneously, the communication that Coverage Control causes is only carried out around node, and the distant place node is not had influence.Therefore, can be applicable to the network of any density, scale, have extensibility preferably.
Can see that thus the local decision making algorithm that covers is better than centralized covering algorithm, more can be fit to the application demand of actual environment, therefore, causes people's extensive concern just gradually.
Present known regional area covers decision making algorithm, though can be in the life cycle of the downward fourdrinier wire network of situation that guarantees user's perception demand.But, perhaps still have all standing that covers cavitation, can't guarantee the zone; Perhaps exist and nibble phenomenon, cause every live-vertex number of taking turns too much, shortened the life cycle of network relatively.
Summary of the invention
The objective of the invention is to overcome the shortcoming of above-mentioned prior art, a kind of all standing that utilizes minute wheel mechanism and circle crosspoint cover up rule to guarantee the zone is provided, utilize delay start mechanism to reduce the generation of nibbling phenomenon, to prolong the wireless sensor network regional area covering method based on delay start of network lifecycle.
For achieving the above object, the technical solution used in the present invention is: choosing on opportunity of live-vertex collection, adopt minute wheel mechanism, at every when beginning Dynamic Selection live-vertex collection of taking turns, node wakes up at random, at first judges whether to delay time, when time-delay occurs, dormancy again; Otherwise, declare method of determining and calculating according to covering based on the circle crosspoint, judge the state that self will change: active state or resting state, utilize delay start mechanism again, realize the screening of the live-vertex first run based on distance threshold, and then determine according to the end-state that circle crosspoint rule is carried out node;
Its detailed process is as follows: adopt minute wheel mechanism, the whole service stage of network is divided into M time period, each time period is one " wheel ", wherein, M has minimum value K, K represents the maximum node collection number that all nodes can be divided in the zone, each set of node all can cover whole zone, when M gets minimum value K, every length of taking turns is the life span of individual node, and the M value is big more, and each takes turns initial live-vertex collection, and to choose the expense that causes just many more, therefore, need between network node energy equilibrium and overhead, seek suitable M value.Take turns the starting stage every, choose and to unite the live-vertex collection of node composition that covers whole zone, other node then is in resting state, this starting stage is called the live-vertex collection and chooses the stage, live-vertex is carried out data monitoring, communication work in the remaining time that this is taken turns, this stage is called working stage, the time of working stage is chosen the stage much larger than the live-vertex collection, the every wheel carried out choosing of a live-vertex collection, make regional interior nodes Energy distribution as far as possible evenly, make full use of all nodes.
The mode of choosing live-vertex collection of the present invention adopts based on the circle crosspoint and covers the decision-making mode, node at first receives and enlivens the state information that neighbor node sends, utilize the circle crosspoint to cover then and declare gauge then, judge whether self perception zone is covered by the existing neighbor node that enlivens, when not covered fully, oneself state is set to active state; Otherwise this node can be replaced by its neighbor node, does not need work, will enter resting state.Owing to only receive the information of active state, reduced the traffic in the net, also avoided the covering cavitation simultaneously once more.
Known regional area covering algorithm is to avoid carrying out the covering cavity problem that judgement causes that covers simultaneously because of node, often adopt a random clock counter that each node is waken up successively and carry out and cover judgement, " nibbling " phenomenon that this causes live-vertex to distribute easily. by to the discovering of " nibbling " phenomenon, the reason that causes this phenomenon is that the near excessively node of the known live-vertex of distance wakes up at first and causes.For this reason, the mechanism that the present invention proposes based on delay start reduces the generation of nibbling phenomenon, to reduce every live-vertex quantity of taking turns, prolongs the life cycle of network.
The present invention utilizes delay start mechanism, realizes the screening of the live-vertex first run based on distance threshold, and then determines according to the end-state that circle crosspoint rule is carried out node.The utilization of this method, can reduce the appearance of " nibbling " phenomenon, make every live-vertex number of taking turns reduce relatively, finally when satisfying the user and specifying the covering demand, prolong the whole life span of network, had scientific preferably and higher using value.
Description of drawings
Fig. 1 is a minute wheel schematic diagram of mechanism of the present invention;
Fig. 2 is that the present invention's circle crosspoint covers the decision-making exemplary plot;
Fig. 3 is that node is nibbled the phenomenon schematic diagram;
Fig. 4 is a node regular hexagon distribution schematic diagram;
Fig. 5 is a live-vertex choice phase delay start schematic diagram;
Fig. 6 is a node state transition diagram schematic diagram.
Embodiment
Below in conjunction with accompanying drawing the present invention is described in further detail.
The present invention chooses on opportunity the live-vertex collection, adopts minute wheel mechanism, at every Dynamic Selection live-vertex collection when taking turns beginning, does not need the overall topology of awareness network in advance; Secondly,, utilize the circle crosspoint to cover and declare method of determining and calculating, guaranteed regional all standing, avoided occurring covering the leak phenomenon choosing on the mode of live-vertex collection; At last, utilize delayed startup mechanism, reduced the generation of " nibbling " phenomenon, prolonged network lifecycle.Its key technology point is:
Technology point one: adopt minute wheel mechanism
Algorithm is realized choosing of live-vertex collection based on minute wheel mechanism, the whole service stage of network is divided into some " wheels " in time, as shown in Figure 1, whenever take turns and be divided into two stages, the live-vertex collection is chosen stage (ANST) and operation phase (Work Time).Choose the stage at the live-vertex collection, each node utilization is declared gauge based on the crosspoint covering of rollback and is then judged oneself state, forms the live-vertex collection of epicycle, and is responsible for the monitoring and the transmission work of data in the operation phase.
Technology point two: the circle crosspoint covers decision rule.
The mode of choosing the live-vertex collection of this algorithm adopts based on the circle crosspoint and covers the decision-making mode: node at first receives and enlivens the state information that neighbor node sends, utilize the circle crosspoint to cover decision rule then, judge whether self perception zone is covered by the existing neighbor node that enlivens, when not covered fully, oneself state is set to active state; Otherwise, illustrate that this node can be replaced by its neighbor node, do not need work, will enter resting state.Owing to only receive the information of active state, reduced the traffic in the net, also avoided the covering cavitation simultaneously once more.
For ease of illustrating that round crosspoint covers decision rule, is defined as follows and theorem.
Definition 1: it is the disc face in the center of circle with this node that the sensing range of supposing node is one, and the perception radius of each node is identical, and the sensing range that claims this node is the perception circle.
The perception circle of 1: one node of theorem by the condition that the perception of other neighbor nodes circle covers is: in the perception circle of this node, have at least the perception circle of the neighbor node more than three to overlap with it, and the intersection point of the perception circle of 1. any two neighbor nodes in this node perceived circle all covered by the perception of the 3rd neighbor node circle; 2. the perception of any one neighbor node circle is all covered by the perception of another neighbor node circle with the intersection point of the perception circle of this node.When above-mentioned condition satisfied simultaneously, the perception circle of this node was covered by the perception of its neighbor node circle.
This theorem relates to the neighbor node more than three, when the neighbor node number less than 3 the time, or can't cover the perception circle of this node; Though can cover, neighbor node almost overlaps with node self, can't use in practice.The example of theorem 1 such as Fig. 2, broken circle 1 judges whether its perception circle is covered by three neighbours' on every side perception circle ( solid line circle 2,3,4), as long as whether see the intersection point of these neighbours' circles in broken circle 1, judge simultaneously whether the neighbours' circle and the intersection point of broken circle 1 are got final product by the 3rd circle covering by the 3rd round the covering.The intersection point A of example circle 3,4 in circle 1 covered by circle 2; Circle 3 is covered by circle 4 and circle 2 respectively with intersection point H, the E of circle 1; These 9 intersection points of A-K are all covered by the 3rd circle among the last figure, and therefore, the sensing range of circle 1 is covered by circle 2,3,4.At this moment, but the circle 1 dormancy.
Definition 2: a given monitor area A, the condition that is distributed sensor node covering within it is a bit all being covered by a sensor node at least arbitrarily in the regional A.When this condition satisfies, claim this zone A can be distributed sensor node all standing within it.
The condition that 1: one regional A of lemma is distributed sensor node all standing within it is that 1. the intersection point of arbitrary node perception circle in the A of this zone all covered by the perception of the 3rd node circle; 2. the perception of any one node circle is all covered by the perception of another node circle with the intersection point of this zone A.3. covered by the perception of node circle more at least on the regional A border.It proves similar theorem 1.
By lemma 1, regional all standing problem can be converted to round crosspoint covering problem.Therefore, after a zone was by a large amount of redundant node all standings, the node by theorem 1 covers decision rule can reduce a large amount of live-vertex quantity.
Technology point three: the live-vertex selection mechanism of delayed startup;
For avoiding carrying out the covering cavity problem that judgement causes that covers simultaneously because of node, take turns when beginning every, the node that known part covers in the decision making algorithm is not to carry out simultaneously to cover to judge, covers judgement but adopt a random clock counter that each node is waken up successively and carry out.This wakeup time is at random chosen, and the covering basis for estimation of node comes from the mode of the state information that neighbours' live-vertex sends, and the node that can cause waking up at first is in active state at first, thereby " nibbling " phenomenon that live-vertex distributes occurs.Shown in accompanying drawing 3 (a) and (b), node 1 at first wake up and according to cover up rule confirm active after, node 2 (broken circle is represented) also is waken up and becomes active state, node 3,4,5 around the node 2 wakes up successively and confirms that according to cover up rule self is active then, this coverage enlarges gradually, similar " nibbling ".Take turns end because the active state of node can last till, therefore, node 2 was covered after a while by node 3,4,5, it still is in active state.Therefore, " nibbling " process has caused a large amount of live-vertex redundancies, and live-vertex is many more, shows that the node of participation work is many more, will inevitably cause whole shortening life cycle of network.
By to the discovering of " nibbling " phenomenon, the reason that causes this phenomenon is that the near excessively node of the known live-vertex of distance wakes up at first and causes.If want to avoid this phenomenon, will convey the relative node far away of known live-vertex distance as far as possible and wake up at first.But, the wakeup time of actual node be at random, uncontrollable, for this reason, delayed startup mechanism has been proposed.
The problem that this mechanism mainly solves is:
(1) with the standard of distance threshold as delayed startup.That is, take turns when beginning, will postpone the time that covers the mechanism judgement less than the node of distance to a declared goal threshold value with known live-vertex distance every.
Distance threshold D is set
ThPurpose be to avoid nodal distance to cross closely and to nibble phenomenon with causing, still excessive if threshold value is provided with, can cause excessive node to participate in rollback.For this reason, this algorithm utilizes the computational geometry theory, as shown in Figure 4, think the optimum distance threshold value should less than
R represents the perception radius of node.
(2) mode of delay start.Promptly, the every wheel when beginning, each node is waken up at random, wake state information that posterior nodal point sends according to neighbours' live-vertex of receiving up and judge that at first whether the distance of itself and known these live-vertexs is greater than a specified threshold value, if satisfy condition, then continue XM and cover the succeeding state that this node is determined in the decision-making judgement; Otherwise, think this node and known live-vertex hypotelorism, should carry out once time-delay, after making it continue dormancy a period of time, again wake up again, node after this time wakes up is after the state information that receives live-vertex again, and directly XM covers decision rule, determines the succeeding state of this node.
The delay start mode as shown in Figure 5, ANST is that every live-vertex collection of taking turns is chosen the stage, obtains the live-vertex collection of epicycle in this time period.Wherein, NAT is the node awakening phase, and in this time period, all nodes all wake up once, the concrete moment T that node wakes up
AwakeBy the random number decision, as shown in Equation 1, T
RsBe the zero hour of epicycle.Node wakes the back up and receive the state information of enlivening the neighbor node transmission in the certain hour section, and this time period is called NRT, and promptly nodal information receives the stage.When the neighbor node distance is found and enlivened to node less than threshold value, the time-delay phenomenon can take place, will wake up again after its time period of prolongation rest period again, this time period is called DST (start-up time delay), it is worth as shown in Equation 2, and wherein DAT is the time-delay wakeup time.
T
awake＝T
rs+Random()×T
NAT (1)
T
DST＝T
NAT-T
awake+Random()×T
DAT (2)
The algorithm describe, in general terms is as follows:
Algorithm is realized choosing of live-vertex collection based on minute wheel mechanism, the whole service stage of network is divided into some " wheels " in time, as shown in Figure 1, whenever take turns and be divided into two stages, the live-vertex collection is chosen stage (ANST) and operation phase (Work Time).Choose the stage at the live-vertex collection, each node utilizes the crosspoint based on rollback to cover decision rule judgement oneself state, forms the live-vertex collection of epicycle, and is responsible for the monitoring and the transmission work of data in the operation phase.
The stage of choosing of live-vertex collection with NRT in the time period, receives and enlivens the state information that neighbor node sends after node wakes up as shown in Figure 5, and this state information mainly comprises＜position, node current state 〉.If do not occur and enliven the neighbor node distance situation less than threshold value, node will cover judgement, the decision succeeding state; Otherwise, to delay time, this node will continue to keep sleep, cross DST and wake up after the time again.Again the node after waking up will receive information again, and carry out state and judge.In this algorithm, node time-delay is at most once represented by the time-delay mark.
Cause the phenomenon that covers the cavity for avoiding node to wake up simultaneously, in the time, each node wakes up at random at the NAT (node awakening phase) that takes turns beginning.DAT (time-delay wakeup time) is that the node that time-delay takes place woke up in this time period when the time-delay phenomenon occurring.ST is lock in time, in order to the time difference of level and smooth each node.
The state exchange of node in wheel taken turns when beginning every as shown in Figure 6, and node wakes up at random, at first judges whether to delay time, and delays time when occurring dormancy again; Otherwise, declare method of determining and calculating, judge the state that self will change: active state or resting state according to covering based on the circle crosspoint.If active state, broadcasting status messages towards periphery then so that neighbours on every side receive, covers use when judging decision-making for it; If resting state, then closed node, realization dormancy.The phenomenon of once delaying time only takes place in node, by the decision of time-delay mark.When node energy exhausts, node death.
LACDS is described below based on delayed startup regional area covering algorithm.
Node q represents to carry out the node of this algorithm;
T
AwakeRepresent every waking up at random constantly of beginning posterior nodal point of taking turns;
T
NRTThe expression node receives the time of the state information of enlivening the neighbor node transmission;
Near Node q ' the expression node q the neighbor node that is in active state;
Dq represents node q and enlivens distance between the neighbor node q ';
Td represent to set apart from the rollback threshold value;
TDST represents that node q carries out the once dormancy time of time-delay;
N[] expression node q known enliven the neighbor node collection;
T
SleepExpression node q is at the residue dormancy time of epicycle.
For ease of statement, represent clock count with a circular wait herein.
Algorithm?LACDS?for?each?Node?q
Begin
Do?Loop//Round?Loop
//Each?round?start
Set?Node?wait?wake?time?T
awake?for?Node?q；
DO?Loop?//Node?carry?out?random?sleep?time
Until?T
awake?is?expire；
Set?Awake?state?for?node?q；
Set?Node?receive?message?time?T
NRT?for?Node?q；
Do?Loop
Receive?state?message?sent?by?active?neighbor?Node?q’；
If(Node?q?has?not?delayed?tag)Then
Computing?the?distance?Dq?from?Node?q?to?Node?q’；
If(Dq＜Td)Then
//Node?q?carry?out?once?delayed
Set?delayed?time?T
DST?and?Delayed?tag?For?Node?q；
Set?Sleep?state?for?node?q；
DO?Loop//Node?carry?out?de?layed?time
Until?T
DST?is?expire；
ReSet?NOde?receive?message?time?T
NRT?for?Node?q；
Endif；
Endif；
Until?T
NRT?is?expire；
Carry?out?Circle?Intersection?point?coverage?Decision-makingmethod；
If?Node?q?is?covered?by?active?Neighbor?Nodes?N[]Then
Set?sleep?time?T
sleep?and?sleep?state?for?Node?q；
Do?Loop
//Node?q?go?to?sleep?Until?current?roumd?end；
Until?T
sleep?is?expire；
Else
Set?Active?state?to?Node?q；
Broadcast?ing?node?q?state?message；
Node?q?on?duty?until?the?current?Round?end；
Endif
Until?Node?q?Dead；//Round?loop?end
End.
The present invention mainly is at known wireless sensor network regional area covering algorithm or can't guarantees regional all standing; Perhaps too much because of nibbling the live-vertex number that phenomenon causes, shorten the problem of network lifecycle relatively, proposed a part and covered decision making algorithm based on delay start.By simulating, verifying, to compare with known covering decision making algorithm, its every live-vertex number of taking turns is less relatively, and final network lifecycle prolongs relatively.Emulation shows, specifies under the situation of coverage the whole life span of network prolongs a sensor node at least than algorithm known life span in retaining zone.
Claims (2)
1. wireless sensor network regional area covering method based on delay start, it is characterized in that: choosing on opportunity of live-vertex collection, employing minute wheel mechanism is at every when beginning Dynamic Selection live-vertex collection of taking turns, wherein, choosing on the mode of live-vertex collection, employing covers the decision-making mode based on the circle crosspoint, and each node is waken up at random, and the node after waking up at first judges whether to delay time according to delay start mechanism, when time-delay occurs, the dormancy again of the node after this wakes up; Otherwise, declare gauge then, judge the state that self will change: active state or resting state based on the covering of circle crosspoint;
Detailed process is as follows: adopt minute wheel mechanism, the whole service stage of network is divided into M time period, each time period is one " wheel ", wherein, M has minimum value K, K represents the maximum node collection number that all nodes can be divided in the zone, each set of node all can cover whole zone, when M gets minimum value K, every length of taking turns is the life span of individual node, the M value is big more, each takes turns initial live-vertex collection, and to choose the expense that causes just many more, therefore, need between network node energy equilibrium and overhead, seek suitable M value, take turns the starting stage every, choose and to unite the live-vertex collection of node composition that covers whole zone, other node then is in resting state, this starting stage is called the live-vertex collection and chooses the stage, live-vertex is carried out data monitoring in the remaining time that this is taken turns, communication work, this stage is called working stage, and the time of working stage is chosen the stage much larger than the live-vertex collection, and every the wheel carried out choosing of a live-vertex collection, make regional interior nodes Energy distribution as far as possible evenly, make full use of all nodes.
2. the wireless sensor network regional area covering method based on delay start according to claim 1, it is characterized in that, the mode of choosing said live-vertex collection adopts based on the circle crosspoint and covers the decision-making mode, node at first receives and enlivens the state information that neighbor node sends, utilize the circle crosspoint to cover then and declare gauge then, judge whether self perception zone is covered by the existing neighbor node that enlivens, and when not covered fully, oneself state is set to active state; Otherwise this node can be replaced by its neighbor node, does not need work, will enter resting state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102364242A CN101547451B (en) | 2008-12-23 | 2008-12-23 | Wireless sensor network local region covering algorithm based on delayed start |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102364242A CN101547451B (en) | 2008-12-23 | 2008-12-23 | Wireless sensor network local region covering algorithm based on delayed start |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101547451A CN101547451A (en) | 2009-09-30 |
| CN101547451B true CN101547451B (en) | 2011-04-06 |
Family
ID=41194260
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008102364242A Expired - Fee Related CN101547451B (en) | 2008-12-23 | 2008-12-23 | Wireless sensor network local region covering algorithm based on delayed start |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101547451B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457867B (en) | 2010-10-21 | 2014-10-08 | 富士通株式会社 | Wireless network device, wireless network system and wireless network node control method |
| WO2013040739A1 (en) * | 2011-09-19 | 2013-03-28 | Peking University | System and method for communication in a cellular network |
| CN103108385B (en) * | 2011-11-09 | 2017-09-22 | 上海无线通信研究中心 | Control the method and system of the network node in network area |
| CN104703259B (en) * | 2013-12-10 | 2018-12-14 | 深圳先进技术研究院 | Low power consuming sensor node sleep method and system |
| CN104394202B (en) * | 2014-11-13 | 2018-01-05 | 西安交通大学 | A kind of node liveness quantization method in mobile community network |
| CN107871382A (en) * | 2017-09-29 | 2018-04-03 | 深圳市东震实业有限公司 | The method that multisensor starts |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1996918A (en) * | 2006-06-26 | 2007-07-11 | 华为技术有限公司 | A method for controlling the node density in the wireless sensor network |
-
2008
- 2008-12-23 CN CN2008102364242A patent/CN101547451B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1996918A (en) * | 2006-06-26 | 2007-07-11 | 华为技术有限公司 | A method for controlling the node density in the wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| Meguerdichian S. etc..Coverage problems in wireless ad-hoc sensor networks.《Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies》.2002,第3卷第1380-1387页. * |
| 任彦,张思东,张宏科.无线传感器网络中覆盖控制理论与算法.《软件学报》.2006,第17卷(第3期),第422-433页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101547451A (en) | 2009-09-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | A low duty cycle efficient MAC protocol based on self-adaption and predictive strategy | |
| CN101547451B (en) | Wireless sensor network local region covering algorithm based on delayed start | |
| CN101237366B (en) | Realization method of wireless sensor network for collaborative energy sensing | |
| Jun et al. | Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying | |
| Bian et al. | Research on clustering routing algorithms in wireless sensor networks | |
| JP5581038B2 (en) | Time slot allocation method for reducing energy consumption in wireless sensor networks | |
| Misra et al. | Policy controlled self-configuration in unattended wireless sensor networks | |
| CN102711206B (en) | Simulated annealing-based wireless sensor network (WSN) hierarchical routing method | |
| CN102802246B (en) | Energy saving method and dormancy decision making system of wireless sensor network | |
| CN100589424C (en) | Overlayer design based wireless sensor network energy-saving method | |
| CN104301965A (en) | Wireless sensor network inhomogeneous cluster node scheduling method | |
| WO2016008218A1 (en) | Wireless ad hoc network, center node, dynamic selection method and storage medium | |
| CN104159258A (en) | Communication node state adjusting method, apparatus and system | |
| CN108684071A (en) | The power consumption control method and system of the device node of MESH network | |
| Abasıkeleş‐Turgut et al. | A fully distributed energy‐aware multi‐level clustering and routing for WSN‐based IoT | |
| CN103338459A (en) | Wireless sensor network coverage maintaining method | |
| CN102186229B (en) | Independent basic service set (IBSS) system and power management method thereof | |
| CN101247414B (en) | Wireless sensor network dynamic topology control method based on position information | |
| Liao et al. | MMQT: Maximizing the monitoring quality for targets based on probabilistic sensing model in rechargeable wireless sensor networks | |
| CN112911519B (en) | Routing method for WSN linear coverage dormancy scheduling based on target distance | |
| WO2012060687A1 (en) | Method for use in a wireless sensor network | |
| CN102438299B (en) | Energy saving method and dormancy decision making system for wireless sensor network | |
| CN107005935B (en) | Network energy efficiency optimization method and device | |
| CN102724741A (en) | Micro-cycle-based sleep method adapted to routing nodes in wireless sensor network | |
| Aliouat et al. | Improved WSN life time duration through adaptive clustering, duty cycling and sink mobility |
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: 20110406 Termination date: 20131223 |