By Topic

A Distributed Probabilistic-Coverage Node Scheduling Scheme for Large Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ying Tian ; Coll. of Inf. & Electr. Eng., Dalian Maritime Univ., Dalian ; Ying Wang ; Shu-fang Zhang

In wireless sensor networks, coverage configuration is an important issue which can prolong the system lifetime significantly. Most of current literatures are based on physical coverage, i.e. deterministic detection model, which is inconsistent with the realistic application of wireless sensor networks. A distributed probabilistic coverage configuration protocol (DPCCP) is proposed in this paper. It adopts Neyman-Peason probabilistic detection model to decide whether nodes can be off or not. Our DPCCP guarantees that the system detection probability is maintained after turning off lots of unnecessary nodes. We extend LEACH by embedding DPCCP into LEACH (namely LEACHE) seamlessly without any modification of the original workflow. Simulation results show that DPCCP can effectively reduce the number of active sensor nodes, and LEACHE outperforms LEACH in terms of system lifetime and energy efficiency.

Published in:

Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Date of Conference:

21-25 Sept. 2007