Abstract

Abstract Coverage problem is an important research topic in the field of wireless sensor network (WSN). The coverage algorithm based on event probability driven mechanism (EPDM) is put forward in this paper. First of all, the network probability model is established and the subordinate relation between sensor nodes and the target nodes is presented. Secondly, a series of probability is computed and the related theorems and reasoning are also proven. Thirdly, effective coverage for the monitoring region is achieved through scheduling mechanism of nodes themselves, thus the purpose of increasing network lifetime can be realized. Finally, experimental results show that the proposed algorithm could achieve complete coverage for networks of different scale and increase the network lifetime. It possesses the good quality of effectiveness and stability.

Highlights

  • Wireless sensor network (WSN) is a wireless distributed network system, composed of large amount of selforganized microsensor nodes which are integration of data collecting, processing and transmission units and power supply units, and performing the functions of information collecting, data processing, and transmission

  • WSN works in poor environment in which sensor nodes are usually deployed in the monitoring region through random spreading [4,5]

  • When the target node moves from the upper left to lower right of the figure to the sensor nodes 9 and 11, some region cannot be covered

Read more

Summary

Introduction

Wireless sensor network (WSN) is a wireless distributed network system, composed of large amount of selforganized microsensor nodes which are integration of data collecting, processing and transmission units and power supply units, and performing the functions of information collecting, data processing, and transmission. Due to the limited energy of every sensor node, it was a problem on how to deploy nodes in a reasonable range and how to maximize the network lifetime on the basis of target monitoring. When the target node moves from the upper left to lower right of the figure to the sensor nodes 9 and 11, some region cannot be covered Let us study the first problem: what is the relationship of the associated attributes between wireless sensor nodes and target nodes? If the coverage degree for a target node is higher than needed, there must exist many redundant nodes This will consume much energy of the entire network, and the network lifetime will be decreased. Because formula (9) is convergent when x ∈ [0, a], jf nðxÞj is convergent, i.e., f nðxÞ is absolute n1⁄40 n1⁄40 convergent

Coverage area and its expectation value
Probability model of node
The algorithm and its description
Determination of the node probability
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.