loading...
Probabilistic Coverage in Wireless Sensor Networks
Sydney, Australia November 15-November 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LCN.2005.109The IEEE Conference on Local Computer ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nadeem Ahmed, National ICT Australia (NICTA) Australian Technology Park, Sydney, Australia
Salil S. Kanhere, University of New South Wales, Sydney, Australia
Sanjay Jha, University of New South Wales, Sydney, Australia

The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage in order to anticipate this sensing behavior. We investigate the coverage issues in wireless sensor networks based on probabilistic coverage and propose a distributed Probabilistic Coverage Algorithm (PCA) to evaluate the degree of confidence in detection probability provided by a randomly deployed sensor network. The probabilistic approach is a deviation from the idealistic assumption of uniform circular disc for sensing coverage used in the binary detection model. Simulation results show that area coverage calculated by using PCA is more accurate than the idealistic binary detection model.

Citation:
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha, "Probabilistic Coverage in Wireless Sensor Networks," lcn, pp.672-681, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l, 2005
Usage of this product signifies your acceptance of the Terms of Use.