CN101478763B - Coverage control method for tri-dimensional wireless sensor network - Google Patents
Coverage control method for tri-dimensional wireless sensor network Download PDFInfo
- Publication number
- CN101478763B CN101478763B CN2009101054135A CN200910105413A CN101478763B CN 101478763 B CN101478763 B CN 101478763B CN 2009101054135 A CN2009101054135 A CN 2009101054135A CN 200910105413 A CN200910105413 A CN 200910105413A CN 101478763 B CN101478763 B CN 101478763B
- Authority
- CN
- China
- Prior art keywords
- node
- sensor network
- wireless sensor
- ref
- coverage control
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a method for controlling the covering of three-dimensional wireless sensor network which comprises the following procedures: initializing each node in the wireless sensor network; formulating a working schedule for each node in the wireless sensor network; regulating the working state of each node in the wireless sensor network. The three-dimensional wireless sensor network can effectively solve the problem of blind spot on covering.
Description
Technical field
The present invention relates to a kind of coverage control method for tri-dimensional wireless sensor network.
Background technology
Wireless sensor network (Wireless Sensor Network; WSN) form by being arranged in microsensor nodes a large amount of in the monitored area; Form the network system of the self-organizing of a multi-hop through communication; Its objective is the monitoring in real time of cooperation ground, gather and handle the various environment of network distributed areas or the information of monitoring target, and send the user who needs these information to.When making up wireless sensor network, the network coverage is one of basic problem of wireless sensor network.The WSN covering problem can be regarded as under the general limited situation of resources such as the energy of WSN node, radio communication, network calculations disposal ability; Through means such as network node, Route Selection; Finally make the distribution that is optimized of the various resources of WSN, and then various service quality are improved.How according to the different application environments needs, the Coverage Control that WSN is carried out different stage has just become among the WSN a basic but problem demanding prompt solution.In real physical environment, dispose wireless sensor network; Be reflected to and in three dimensions, dispose wireless sensor network in theory exactly; Thereby can more truly reflect network " aware services " quality to three dimensions covering problem research, for network monitor control provides foundation more reliably.
Fig. 1 is the sketch map of node oneself scheduling Coverage Control agreement.Shown in Fig. 1 (a), each node is neighbor node broadcasting notice message in the sensing radius at first, and this advertised information comprises node ID, position and node sensing radius (only in the not broadcasting simultaneously of sensing radius).Whether each node inspection self-sensor task can be accomplished by neighbor node, and alternative node (node e and f) returns a bar state notice message, gets into " resting state " afterwards, and the node that need work on (node a, b, c and d) is carried out the sensing task.The whole sensitive zones of node e and f (shown in the middle dotted line of Fig. 1 (a)) can be replaced covering by adjacent neighbor node; The sensing unit that node e and f will close self node gets into " resting state "; But at this moment just occurred and promptly blind spot to have been occurred in the network by the zone of WSN detection (shown in the middle dash area of Fig. 1 (b)).
Summary of the invention
In view of this, be necessary to have the problem that covers blind spot, provide a kind of effective solution to cover the coverage control method for tri-dimensional wireless sensor network of blind spot problem to node oneself scheduling Coverage Control agreement.
Each node in the intiating radio sensor network; Be divided into some equal time periods to the life span of whole network, each time period is a duty cycle, each node broadcast beacon information towards periphery in wireless sensor network described in each duty cycle; Each node in the said wireless sensor network is collected the beacon message of its neighbor node, and sets up the information of neighbor nodes table; Each node is according to the said information of neighbor nodes of collecting in the said wireless sensor network, and whether neighbours' spatial point is in the coverage of own and neighbor node around judging; Select a reference time Ref according to said information of neighbor nodes table; Each cell cube in the neighbours space is on every side judged coverage condition one by one; The reference time Ref information of the neighbor node mode with ascending order is kept among the circular list L, and the computational methods of said operating schedule are: T
F, x, i=(Re f
i-prev (Re f
i))/2 T
E, x, i=(next (Re f
i)-Re f
i)/2 are Ref wherein
iThe reference time of expression node i, T
F, x, iThe expression node i is at Ref
iOperating time before, T
E, x, iThe expression node i is at Ref
iOperating time afterwards; For any one cell cube, as long as the neighbor node that can monitor this cell cube is at [Ref
i-T
F, x, i, Ref
i+ T
E, x, i] the interior active state that keeps, then this cell cube is all monitored by a sensor node in each duty cycle; Node obtains a series of timetables behind the coverage condition of judging cell cube, utilize following formula to confirm final timetable: T
i F, x, i=max{T
F, x, iT
i E, x, i=max{T
E, x, iLike this node is at time period [Ref
i-T
i F, x, i, Ref
i+ T
i E, x, i] enliven, guaranteed that any one cell cube of node neighbours can both monitoredly arrive; Each node operating state in the scheduling wireless sensor network.
Preferably, each node comprises in the said intiating radio sensor network: find node and dead node that all backs add; The locus of each node locating oneself in the wireless sensor network; Each node carries out time synchronized in the wireless sensor network.
Preferably, this method also comprises the Coverage Control optimization mechanism, and said Coverage Control optimization mechanism comprises: on the Coverage Control basis, realize the K Coverage Control to network; In the formulation process of working time of node table, introduce the dump energy refer-mechanisms; Introduce the asynchronism(-nization) fault tolerant mechanism in step at node operating state scheduling phase; Introduce the dead fault tolerant mechanism of node at node operating state scheduling phase.
Preferably, each node operating state comprises in the said scheduling wireless sensor network: set timer; Judge whether timer is triggered,, then carry out the operating state scheduling if timer is triggered; If timer is not triggered, repeat then to judge whether timer is triggered.
Above-mentioned coverage control method for tri-dimensional wireless sensor network is employed in and rationally utilizes redundant node in the intensive on-premise network; Between " enlivening " and " dormancy " state, dispatch; Can effectively solve the blind spot problem that covers; Improve the utilance of redundant node in the intensive on-premise network, improve the network energy utilance, prolong the life span of network.
Description of drawings
Fig. 1 is the sketch map of node oneself scheduling Coverage Control agreement.
Fig. 2 is the sketch map of coverage control method for tri-dimensional wireless sensor network of the present invention.
Fig. 3 is the flow chart that node is formulated operating schedule among the present invention.
Fig. 4 is the sketch map of network configuration of the present invention.
Fig. 5 is the covering sketch map of realizing among the present invention cell cube.
Fig. 6 realizes node operating state scheduling flow figure among the present invention.
Embodiment
Fig. 2 is the sketch map of coverage control method for tri-dimensional wireless sensor network of the present invention.Coverage control method for tri-dimensional wireless sensor network may further comprise the steps:
Each node in S100, the intiating radio sensor network.
In the time of the wireless sensor network initialization, each node is confirmed own locus, between next stage will be according to the definite neighbor node of position relation to the monitoring situation of surrounding space point.Take turns the duty cycle initial phase at each; Network is found all dead nodes (because of depleted of energy or other former thereby stop perception, nodes in communication) and initiate node (afterwards being deployed to the node of network the inside), and the while is carried out time synchronized between node.
The operating schedule of each node in S200, the formulation wireless sensor network.
Be divided into some equal time periods to the life span of whole network, each time period is a duty cycle, each node broadcast beacon information towards periphery in the wireless sensor network in each duty cycle.Each node is collected the beacon message of neighbor node and is set up information of neighbor nodes table and operating schedule.As shown in Figure 3, this step mainly realizes through following steps:
The beacon message of each node broadcasts oneself in S210, the wireless sensor network.
Fig. 4 is the sketch map of network configuration of the present invention.Cube is represented the deployment region of network, and small circle is illustrated in each sensor node in the deployment region.Each node is broadcasted away as beacon message the information of oneself in the wireless sensor network to neighbor node, and beacon message comprises the reference time of position, residual energy value, node ID and the node of node.For fear of in broadcast beacon information, producing communication contention aware, each node produced a random-hysteresis time before broadcast beacon information, broadcast beacon information again after during this period of time.
Each node is set up the information of neighbor nodes table in S220, the wireless sensor network.
Each node in the wireless sensor network is collected the beacon message of its neighbor node, sets up the information of neighbor nodes table in view of the above.
Each node is confirmed the monitoring situation to the surrounding space zone in S230, the wireless sensor network.
Each node is according to the information of neighbor nodes of collecting in the wireless sensor network, and whether neighbours' spatial point is in the coverage of own and neighbor node around judging.
Fig. 5 is the covering sketch map of realizing among the present invention cell cube.Big cube is represented the deployment region of network, and small cubes is represented node cell cube to be monitored on every side, and circle is represented the sensor node monitoring range.According to the information of neighbor nodes table; Select a suitable reference time Ref; Each cell cube in the neighbours space is on every side judged coverage condition one by one; The Ref information of the neighbor node mode with ascending order is kept among the circular linked list L, and formula calculates the operating time of oneself below utilizing:
T
f，x，i＝(Ref
i-prev(Ref
i))/2 (1)
T
e，x，i＝(next(Ref
i)-Ref
i)/2 (2)
Ref wherein
iThe reference time of expression node i, T
F, x, iThe expression node i is at Ref
iOperating time before, T
E, x, iThe expression node i is at Ref
iOperating time afterwards.
For any one cell cube, as long as the neighbor node that can monitor this cell cube is at [Ref
i-T
F, x, i, Ref
i+ T
E, x, i] the interior active state that keeps, then this cell cube is all monitored by a sensor node in each duty cycle.
Each node is formulated the operating schedule of oneself in S240, the wireless sensor network.
Node obtains a series of timetables behind the coverage condition of judging cell cube, utilize following formula to confirm final timetable:
T
i f，x，i＝max{T
f，x，i} (3)
T
i e，x，i＝max{T
e，x，i} (4)
Node is at time period [Ref like this
i-T
i F, x, i, Ref
i+ T
i E, x, i] enliven, guaranteed that any one cell cube of node neighbours can both monitoredly arrive.If all nodes are carried out such operation, then whole network can be capped.
S250, Coverage Control optimization mechanism.The Coverage Control optimization mechanism comprises: on the Coverage Control basis, realize the K Coverage Control to network; In the formulation process of working time of node table, introduce the dump energy refer-mechanisms; Introduce the asynchronism(-nization) fault tolerant mechanism in step at node operating state scheduling phase; Introduce the dead fault tolerant mechanism of node at node operating state scheduling phase.
For the lack of uniformity problem of energy consumption between node, we make the big node of dump energy keep the longer operating time, and then the operating time of the little node of energy is shortened in a duty cycle.When node finds that its residual energy value is bigger than the mean value of the dump energy of its neighbor node, just select the operating time of length.Dump energy is many more, and the operating time of selection is just long more.Introducing the dump energy parameter, above revising there is (1) and (2) formula:
T
f，x，i＝(Ref
i-prev(Re?f
i))/2×(RE
i/RE′) (5)
T
e，x，i＝(next(Ref
i)-Ref
i)/2×(RE
i/RE′) (6)
Wherein RE ' is the average residual energy value of all neighbor nodes of node i.
For the asynchronous discontinuous problem of working between node that causes, introduced a random wait time T through the perception state of node because of clock
wProlong the detecting period of individual node in each duty cycle, at T
wThe time interior nodes continues to keep active state; Perception data is on the one hand monitored the state of neighbor node on the other hand, if neighbor node fails normally to get into active state; This node just continues to keep active state, gets into active state up to the effective neighbor node of the next one.
Perception that node failure has been meant node stop and deliver data, and the communication of discord neighbor node.For a failure node that is on the operating schedule, it does not send the signal that works on, because we have introduced the random wait time T
w, a node can work on on the operating schedule, and till having next node to send to work on signal, node can be at (T like this
Wc* i+Ref+T
e+ T
w) time get into sleep state, close all operational modules, only keep timer work and.Failure node is no longer participated in the formulation of new operating schedule in the next round duty cycle, and is stable thereby the inefficacy of node does not influence the topology of network.
Each node operating state in S300, the scheduling wireless sensor network.
Fig. 6 realizes node operating state scheduling flow figure among the present invention.Each node carries out the duty scheduling based on the operating schedule of oneself, specifically may further comprise the steps:
S310, setting timer.
Each node is set a timer according to the operating schedule of oneself, and the communication close sensing module gets into " sleep " state (" sleep " is meant node communication close and sensing module, do not communicate and perception work), only keeps timer work.
S320, judge whether timer is triggered.If carry out S330; If, do not carry out S320.
Each node judges whether timer is triggered, if be triggered then carry out S330, if be not triggered then keep original operating state constant.
S330, carry out operating state scheduling.
The node timer is triggered, and node gets into " enliven " state (" enliven " state is meant that node is opened and communicates by letter and sensing module, communicates by letter normally and perception work), opens all working module, carries out monitoring work by oneself operating schedule.After accomplishing the operating time of setting, carry out the operating state scheduling and get into " dormancy " state, wait for that duty cycle begins, then repeating step S100, S200 and S300 next time.
Coverage control method for tri-dimensional wireless sensor network provided by the present invention; Be employed in and rationally utilize redundant node in the intensive on-premise network; Between " enlivening " and " dormancy " state, dispatch, equalizing network energy consumption, raising network energy utilance, prolongation network lifetime and solution cover the blind spot problem when realization is carried out Coverage Control to network.
The above embodiment has only expressed several kinds of execution modes of the present invention, and it describes comparatively concrete and detailed, but can not therefore be interpreted as the restriction to claim of the present invention.Should be pointed out that for the person of ordinary skill of the art under the prerequisite that does not break away from the present invention's design, can also make some distortion and improvement, these all belong to protection scope of the present invention.Therefore, the protection range of patent of the present invention should be as the criterion with accompanying claims.
Claims (4)
1. coverage control method for tri-dimensional wireless sensor network may further comprise the steps:
Each node in the intiating radio sensor network;
Be divided into some equal time periods to the life span of whole network, each time period is a duty cycle, each node broadcast beacon information towards periphery in wireless sensor network described in each duty cycle; Each node in the said wireless sensor network is collected the beacon message of its neighbor node, and sets up the information of neighbor nodes table;
Each node is according to the said information of neighbor nodes of collecting in the said wireless sensor network, and whether neighbours' spatial point is in the coverage of own and neighbor node around judging; Select a reference time Ref according to said information of neighbor nodes table; Each cell cube in the neighbours space is on every side judged coverage condition one by one; The reference time Ref information of the neighbor node mode with ascending order is kept among the circular list L, and the computational methods of said operating schedule are:
T
f，x，i＝(Re?f
i-prev(Re?f
i))/2 T
e，x，i＝(next(Re?f
i)-Re?f
i)/2
Ref wherein
iThe reference time of expression node i, T
F, x, iThe expression node i is at Ref
iOperating time before, T
E, x, iThe expression node i is at Ref
iOperating time afterwards;
For any one cell cube, as long as the neighbor node that can monitor this cell cube is at [Ref
i-T
F, x, i, Ref
i+ T
E, x, i] the interior active state that keeps, then this cell cube is all monitored by a sensor node in each duty cycle; Node obtains a series of timetables behind the coverage condition of judging cell cube, utilize following formula to confirm final timetable:
T
i f，x，i＝max{T
f，x，i} T
i e，x，i＝max{T
e，x，i}
Node is at time period [Ref like this
i-T
i F, x, i, Ref
i+ T
i E, x, i] enliven, guaranteed that any one cell cube of node neighbours can both monitoredly arrive;
Each node operating state in the scheduling wireless sensor network.
2. coverage control method for tri-dimensional wireless sensor network according to claim 1 is characterized in that: each node comprises in the said intiating radio sensor network:
Find node and dead node that all backs add;
The locus of each node locating oneself in the wireless sensor network;
Each node carries out time synchronized in the wireless sensor network.
3. coverage control method for tri-dimensional wireless sensor network according to claim 2 is characterized in that: this method also comprises the Coverage Control optimization mechanism, and said Coverage Control optimization mechanism comprises:
On the Coverage Control basis, realize K Coverage Control to network;
In the formulation process of working time of node table, introduce the dump energy refer-mechanisms;
Introduce the asynchronism(-nization) fault tolerant mechanism in step at node operating state scheduling phase;
Introduce the dead fault tolerant mechanism of node at node operating state scheduling phase.
4. coverage control method for tri-dimensional wireless sensor network according to claim 1 is characterized in that: each node operating state comprises in the said scheduling wireless sensor network:
S1: set timer;
S2: judge whether timer is triggered, if carry out S3; If, do not carry out S2;
S3: carry out the operating state scheduling.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101054135A CN101478763B (en) | 2009-02-09 | 2009-02-09 | Coverage control method for tri-dimensional wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101054135A CN101478763B (en) | 2009-02-09 | 2009-02-09 | Coverage control method for tri-dimensional wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101478763A CN101478763A (en) | 2009-07-08 |
| CN101478763B true CN101478763B (en) | 2012-06-06 |
Family
ID=40839382
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101054135A Active CN101478763B (en) | 2009-02-09 | 2009-02-09 | Coverage control method for tri-dimensional wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101478763B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103987054B (en) * | 2014-05-27 | 2018-07-03 | 西安电子科技大学 | A kind of distributed method of the wireless network sensor network coverage |
| CN112637860B (en) * | 2020-12-21 | 2022-08-02 | 西安邮电大学 | Three-dimensional wireless sensor network coverage method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008039872A2 (en) * | 2006-09-26 | 2008-04-03 | Qualcomm Incorporated | Sensor networks based on wireless devices |
| CN101262285A (en) * | 2008-04-10 | 2008-09-10 | 杭州电子科技大学 | 3-D wireless sensor network coverage method based on probability |
| CN101345674A (en) * | 2008-08-19 | 2009-01-14 | 杭州电子科技大学 | Three-dimensional overlapping control method of sensor network |
-
2009
- 2009-02-09 CN CN2009101054135A patent/CN101478763B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008039872A2 (en) * | 2006-09-26 | 2008-04-03 | Qualcomm Incorporated | Sensor networks based on wireless devices |
| CN101262285A (en) * | 2008-04-10 | 2008-09-10 | 杭州电子科技大学 | 3-D wireless sensor network coverage method based on probability |
| CN101345674A (en) * | 2008-08-19 | 2009-01-14 | 杭州电子科技大学 | Three-dimensional overlapping control method of sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101478763A (en) | 2009-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lu et al. | Networking smartphones for disaster recovery | |
| US8707075B2 (en) | Adaptive network and method | |
| CN102149160B (en) | Energy perception routing algorithm used for wireless sensing network | |
| US8115593B2 (en) | Adaptive network and method | |
| US9167516B2 (en) | System and method for wireless sensor networks | |
| Boukerche et al. | Energy-aware data-centric routing in microsensor networks | |
| CN103262621B (en) | Network node and method | |
| Ding et al. | Aggregation tree construction in sensor networks | |
| CN102377801B (en) | Sensor network for environmental monitoring and data transmission method | |
| KR101085364B1 (en) | Wireless sensor node group affiliation method and apparatus | |
| CN101662777B (en) | Wireless sensor network distributed hibernation method based on probability statistics | |
| WO2009017985A1 (en) | Method and apparatus for resource assignment in a sensor network | |
| CN102083085A (en) | Wireless sensor network optimizing method | |
| Li et al. | A survey on topology control in wireless sensor networks | |
| CN101478763B (en) | Coverage control method for tri-dimensional wireless sensor network | |
| CN102724733A (en) | Wireless sensor network networking method | |
| Pazzi et al. | A clustered trail-based data dissemination protocol for improving the lifetime of duty cycle enabled wireless sensor networks | |
| CN101247414B (en) | Wireless sensor network dynamic topology control method based on position information | |
| CN112911519B (en) | Routing method for WSN linear coverage dormancy scheduling based on target distance | |
| KR20100032171A (en) | Wireless sensor network system and its operation method | |
| Lundén et al. | The politecast communication primitive for low-power wireless | |
| CN101098373A (en) | Mobile decision approach for data gathering set in wireless sensor network | |
| Kanhere et al. | End-to-end delay optimization in wireless sensor network (WSN) | |
| Pyun et al. | Energy-efficient scheduling for multiple-target coverage in wireless sensor networks | |
| Kang et al. | A node scheduling based on partition for WSN |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230320 Address after: 519085 101, Building 5, Longyuan Smart Industrial Park, No. 2, Hagongda Road, Tangjiawan Town, High-tech Zone, Zhuhai City, Guangdong Province Patentee after: ZHUHAI INSTITUTE OF ADVANCED TECHNOLOGY CHINESE ACADEMY OF SCIENCES Co.,Ltd. Address before: 518067 Nanshan medical equipment Industrial Park, No. 1019 Nanhai Road, Shenzhen, Guangdong, Nanshan District 3A Patentee before: SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY |
|
| TR01 | Transfer of patent right |