CN101478763A - Coverage control method for tri-dimensional wireless sensor network - Google Patents

Coverage control method for tri-dimensional wireless sensor network Download PDF

Info

Publication number
CN101478763A
CN101478763A CNA2009101054135A CN200910105413A CN101478763A CN 101478763 A CN101478763 A CN 101478763A CN A2009101054135 A CNA2009101054135 A CN A2009101054135A CN 200910105413 A CN200910105413 A CN 200910105413A CN 101478763 A CN101478763 A CN 101478763A
Authority
CN
China
Prior art keywords
node
sensor network
wireless sensor
coverage control
tri
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2009101054135A
Other languages
Chinese (zh)
Other versions
CN101478763B (en
Inventor
张宝利
于峰崎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhuhai Institute Of Advanced Technology Chinese Academy Of Sciences Co ltd
Original Assignee
Shenzhen Institute of Advanced Technology of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Institute of Advanced Technology of CAS filed Critical Shenzhen Institute of Advanced Technology of CAS
Priority to CN2009101054135A priority Critical patent/CN101478763B/en
Publication of CN101478763A publication Critical patent/CN101478763A/en
Application granted granted Critical
Publication of CN101478763B publication Critical patent/CN101478763B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Coverage control method for tri-dimensional wireless sensor network
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 by communication, its objective is collaboratively the various environment of monitoring, gather and handle the network distributed areas in real time 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, by 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 different applied environment 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 schematic diagram 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).Each node checks whether the self-sensor task can be finished by neighbor node, and alternative node (node e and f) returns a bar state notice message, enters " 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 enters " resting state ", but the zone that has at this moment just occurred being detected by WSN (among Fig. 1 (b) shown in the dash area) promptly blind spot occurs in the network.
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 at node oneself scheduling Coverage Control agreement.
A kind of coverage control method for tri-dimensional wireless sensor network may further comprise the steps: each node in the intiating radio sensor network; Formulate the operating schedule of each node in the wireless sensor network; Each node operating state in the scheduling wireless sensor network.
Preferably, each node comprises in the described 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, the operating schedule of each node comprises in the described formulation wireless sensor network: the beacon message of each node broadcasts oneself in the wireless sensor network; Each node is set up the information of neighbor nodes table in the wireless sensor network; Each node is determined the monitoring situation to the surrounding space zone in the wireless sensor network; Each node is formulated the operating schedule of oneself in the wireless sensor network; The Coverage Control optimization mechanism.
Preferably, described 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; In the fault tolerant mechanism of node operating state scheduling phase introducing to node death.
Preferably, each node operating state comprises in the described 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 adopts and rationally utilize redundant node in 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 schematic diagram of node oneself scheduling Coverage Control agreement.
Fig. 2 is the schematic diagram 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 schematic diagram of network configuration of the present invention.
Fig. 5 is the covering schematic diagram 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 schematic diagram 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 determined 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), carries out time synchronized simultaneously between node.
The operating schedule of each node in S200, the formulation wireless sensor network.
The life span of whole network is divided into some equal time periods, and 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 by following steps:
The beacon message of each node broadcasts oneself in S210, the wireless sensor network.
Fig. 4 is the schematic diagram 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 produce communication contention aware in broadcast beacon information, 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 determined 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 schematic diagram 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 determine 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; In the fault tolerant mechanism of node operating state scheduling phase introducing to node death.
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 long operating time.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(Ref 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 by 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 enter active state, this node just continues to keep active state, enters 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 enter sleep state, close all operational modules, only keep timer work and.Failure node no longer participates 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 operating state scheduling according to 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 enters " 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 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 enters " enlivening " state (" enlivening " state is meant that node opens communication and sensing module, communicates by letter normally and perception work), opens all working module, carries out monitoring work by oneself operating schedule.After finishing the operating time of setting, carry out the operating state scheduling and enter " 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, employing rationally utilizes redundant node in intensive on-premise network, dispatch between " enlivening " and " dormancy " state, 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 execution mode 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 without departing from the inventive concept of the premise, 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 claims.

Claims (5)

1, a kind of coverage control method for tri-dimensional wireless sensor network may further comprise the steps:
Each node in the intiating radio sensor network;
Formulate the operating schedule of each node in the wireless sensor network;
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 described 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 1 is characterized in that: the operating schedule of each node comprises in the described formulation wireless sensor network:
The beacon message of each node broadcasts oneself in the wireless sensor network;
Each node is set up the information of neighbor nodes table in the wireless sensor network;
Each node is determined the monitoring situation to the surrounding space zone in the wireless sensor network;
Each node is formulated the operating schedule of oneself in the wireless sensor network;
The Coverage Control optimization mechanism.
4, coverage control method for tri-dimensional wireless sensor network according to claim 3 is characterized in that: described 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;
In the fault tolerant mechanism of node operating state scheduling phase introducing to node death.
5, coverage control method for tri-dimensional wireless sensor network according to claim 1 is characterized in that: each node operating state comprises in the described scheduling wireless sensor network:
S1: set timer;
S2: judge whether timer is triggered, if carry out S3; If not, carry out S2;
S3: carry out the operating state scheduling.
CN2009101054135A 2009-02-09 2009-02-09 Coverage control method for tri-dimensional wireless sensor network Active CN101478763B (en)

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 true CN101478763A (en) 2009-07-08
CN101478763B 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)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103987054A (en) * 2014-05-27 2014-08-13 西安电子科技大学 Wireless network sensor network coverage distributed method
CN112637860A (en) * 2020-12-21 2021-04-09 西安邮电大学 Three-dimensional wireless sensor network coverage method and system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8886229B2 (en) * 2006-09-26 2014-11-11 Qualcomm Incorporated Sensor networks based on wireless devices
CN101262285B (en) * 2008-04-10 2011-04-06 杭州电子科技大学 3-D wireless sensor network coverage method based on probability
CN101345674B (en) * 2008-08-19 2010-07-21 杭州电子科技大学 Three-dimensional overlapping control method of sensor network

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103987054A (en) * 2014-05-27 2014-08-13 西安电子科技大学 Wireless network sensor network coverage distributed method
CN103987054B (en) * 2014-05-27 2018-07-03 西安电子科技大学 A kind of distributed method of the wireless network sensor network coverage
CN112637860A (en) * 2020-12-21 2021-04-09 西安邮电大学 Three-dimensional wireless sensor network coverage method and system

Also Published As

Publication number Publication date
CN101478763B (en) 2012-06-06

Similar Documents

Publication Publication Date Title
CN102149160B (en) Energy perception routing algorithm used for wireless sensing network
Boukerche et al. Energy-aware data-centric routing in microsensor networks
US8707075B2 (en) Adaptive network and method
CN103262621B (en) Network node and method
Junping et al. A time-based cluster-head selection algorithm for LEACH
Ding et al. Aggregation tree construction in sensor networks
US8115593B2 (en) Adaptive network and method
CN102377801B (en) Sensor network for environmental monitoring and data transmission method
CN107682905B (en) A kind of stellar chain type wireless sensor network is without layer communication method
CN104012147A (en) Method for routing data in a wireless sensor network
CN102651898A (en) Delay-constrained and energy-efficient online routing for asynchronous sensor networks
CN102883370B (en) Distributed data transmission method for power line monitoring system on basis of wireless sensor network
CN102083085A (en) Wireless sensor network optimizing method
CN102695249A (en) Energy saving method for IPv6 wireless sensor network
CN102843758B (en) Method for data energy conservation transmission between nodes in wireless sensor network
CN202406307U (en) Wireless sensor network
Li et al. A survey on topology control in wireless sensor networks
CN102724733A (en) Wireless sensor network networking method
CN104270805A (en) Dynamic-target-tracking-oriented sleeping scheduling method for nodes of energy capturing sensor network
CN102571573B (en) Router, wireless sensing network and method for monitoring terminal node
CN102186229B (en) Independent basic service set (IBSS) system and power management method thereof
CN101478763B (en) Coverage control method for tri-dimensional wireless sensor network
CN100486195C (en) Energy-saving method of wireless self-combining network
CN101547451B (en) Wireless sensor network local region covering algorithm based on delayed start
CN112911519B (en) Routing method for WSN linear coverage dormancy scheduling based on target distance

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
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