, Volume 94, Issue 11, pp 833–856 | Cite as

Coverage rate calculation in wireless sensor networks



The deployment of sensors without enough coverage can result in unreliable outputs in wireless sensor networks (WSNs). Thus sensing coverage is one of the most important quality of service factors in WSNs. A useful metric for quantifying the coverage reliability is the coverage rate that is the area covered by sensor nodes in a region of interest. The network sink can be informed about locations of all nodes and calculate the coverage rate centrally. However, this approach creates huge load on the network nodes that had to send their location information to the sink. Thus, a distributed approach is required to calculate the coverage rate. This paper is among the very first to provide a localized approach to calculate the coverage rate. We provide two coverage rate calculation (CRC) protocols, namely distributed exact coverage rate calculation (DECRC) and distributed probabilistic coverage rate calculation (DPCRC). DECRC calculates the coverage rate precisely using the idealized disk graph model. Precise calculation of the coverage rate is a unique property of DECRC compared to similar works that have used the disk graph model. In contrast, DPCRC uses a more realistic model that is probabilistic coverage model to determine an approximate coverage rate. DPCRC is in fact an extended version of DECRC that uses a set of localized techniques to make it a low cost protocol. Simulation results show significant overall performance improvement of CRC protocols compared to related works.


Wireless sensor networks Coverage rate Boundary detection Disk graph model Probabilistic coverage 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Yick J, Mukherjee B, Ghosal D (2008) Wireless sensor network survey. Comput Netw 52(12): 2292–2330CrossRefGoogle Scholar
  2. 2.
    Jaworski J, Ren M, Rybarczyk K (2009) Random key predistribution for wireless sensor networks using deployment knowledge. Computing 85(1): 57–76MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Pashazadeh S, Sharifi M (2009) A geometric modelling approach to determining the best sensing coverage for 3-dimensional acoustic target tracking in wireless sensor networks. Sensors 9(9): 6764–6794CrossRefGoogle Scholar
  4. 4.
    Aziz N, Mohemmed AW, Sagar D (2007) Particle swarm optimization and Voronoi diagram for wireless sensor networks coverage optimization. In: International conference on intelligent and advanced systems, Kuala Lumpur, Malaysia, pp 961–965Google Scholar
  5. 5.
    Zhang C, Zhang YC, Fang YG (2009) Localized algorithms for coverage boundary detection in wireless sensor networks. Wirel Netw 15(1): 3–20CrossRefGoogle Scholar
  6. 6.
    Argany M, Mostafavi MA, Karimipour F (2010) Voronoi-based approaches for geosensor networks coverage determination and optimisation: a survey. In: International symposium on Voronoi diagrams in science and engineering, Quebec, Canada, pp 115–123Google Scholar
  7. 7.
    Hughes B, Cahill V (2003) Towards real-time event-based communication in mobile ad hoc wireless networks. In: International workshop on real-time LANs in the internet age, Porto, Portugal, pp 77–80Google Scholar
  8. 8.
    Shen X, Chen J, Sun Y (2006) Grid scan: a simple and effective approach for coverage issue in wireless sensor networks. In: IEEE international conference on communications, Istanbul, Turkey, pp 3480–3484Google Scholar
  9. 9.
    Sheu JP, Chang GY, Chen YT (2008) A novel approach for k-coverage rate evaluation and re-deployment in wireless sensor networks. In: IEEE global telecommunications conference, New Orleans, LA, USA, pp 1–5Google Scholar
  10. 10.
    Tan H, Wang Y, Hao X, Hua QS, Lau F (2010) Arbitrary obstacles constrained full coverage in wireless sensor networks. In: International conference on wireless algorithms, systems, and applications, Beijing, China, pp 1–10Google Scholar
  11. 11.
    Balister B, Zheng Z, Kumar S, Sinha P (2009) Trap coverage: allowing coverage holes of bounded diameter in wireless sensor networks. In: IEEE international conference on computer communications, Rio de Janeiro, Brazil, pp 136–144Google Scholar
  12. 12.
    Pashazadeh S, Sharifi M (2009) Determining the best sensing coverage for 2-dimensional acoustic target tracking. Sensors 9(5): 3405–3436CrossRefGoogle Scholar
  13. 13.
    Watfa MK, Commuri S (2009) Energy-efficient approaches to coverage holes detection in wireless sensor networks. In: IEEE multi-conference on systems and control, Saint Petersburg, Russia, pp 131–136Google Scholar
  14. 14.
    Garetto M, Gribaudo M, Chiasserini C, Leonardi E (2007) A distributed sensor relocation scheme for environmental control. In: international conference on mobile ad hoc and sensor systems, Pisa, Italy, pp 1–10Google Scholar
  15. 15.
    Bartolini N, Calamoneri T, Fusco E, Massini A, Silvestri S (2009) Push and pull: autonomous deployment of mobile sensors for a complete coverage. Wirel Netw 16(3): 607–625CrossRefGoogle Scholar
  16. 16.
    Cheng T, Savkin A (2010) Decentralized control of mobile sensor networks for triangular blanket coverage. In: American control conference, Baltimore, MA, USA, pp 2903–2908Google Scholar
  17. 17.
    Fang Q, Gao H, Guibas LJ (2004) Locating and bypassing routing holes in sensor networks. In: Annual joint conference of the IEEE computer and communications societies, Hong Kong, China, pp 2458–2468Google Scholar
  18. 18.
    Frey H, Görgen D (2005) Planar graph routing on geographical clusters. Ad Hoc Netw 3(5): 560–574CrossRefGoogle Scholar
  19. 19.
    Huang C, Tseng Y (2005) A survey of solutions to the coverage problems in wireless sensor networks. J Internet Technol 6(1): 1–8Google Scholar
  20. 20.
    Ghosh A, Das SK (2008) Coverage and connectivity issues in wireless sensor networks: a survey. Pervasive Mob Comput 4(3): 303–334MathSciNetCrossRefGoogle Scholar
  21. 21.
    Stojmenovic I, Nayak A (2010) Wireless sensor and actuator networks: algorithms and protocols for scalable coordination and data communication. Wiley-Interscience, New YorkMATHGoogle Scholar
  22. 22.
    Liu B, Towsley D (2004) A study of the coverage of large-scale sensor networks. In: International conference on mobile ad hoc and sensor systems, FL, USA, pp 475–483Google Scholar
  23. 23.
    Chen J, Li S, Sun Y (2007) Novel deployment schemes for mobile sensor networks. Sensors 7(11): 2907–2919CrossRefGoogle Scholar
  24. 24.
    Aziz NAA, Aziz KA, Ismail WZW (2009) Coverage strategies for wireless sensor networks. World Acad Sci Eng Tech 50: 145–150Google Scholar
  25. 25.
    Li JS, Kao HC (2010) Distributed k-coverage self-location estimation scheme based on Voronoi diagram. IET Commun 4(2): 167–177MathSciNetCrossRefGoogle Scholar
  26. 26.
    Jin Y, Jo JY, Wang L, Kim Y, Yang X (2008) ECCRA: an energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks. Comput Commun 31(10): 2398–2407CrossRefGoogle Scholar
  27. 27.
    Cai YL, Li ML, Shu W, Wu MY (2007) ACOS: an area-based collaborative sleeping protocol for wireless sensor networks. Ad Hoc Sens Wirel Netw 3(1): 77–97Google Scholar
  28. 28.
    Lazos L, Poovendran R, Ritcey JA (2007) On the deployment of heterogeneous sensor networks for detection of mobile targets. In: IEEE international symposium on modeling and optimization in mobile, ad hoc and wireless networks, Limassol, Cyprus, pp 1–10Google Scholar
  29. 29.
    Killijian MO, Cunningham R, Meier R, Mazare L, Cahill V (2001) Towards group communication for mobile participants. In: Workshop on principles of mobile computing, RI, USA, pp 75–82Google Scholar
  30. 30.
    Shen F, Sun MT, Liu C, Salazar A (2009) Coverage-aware sleep scheduling for cluster-based sensor networks. In: IEEE wireless communications and networking conference, Budapest, Hungary, pp 1–6Google Scholar
  31. 31.
    Zou Y, Chakrabarty K (2003) Sensor deployment and target localization based on virtual forces. In: Annual joint conference of the IEEE computer and communications, San Franciso, USA, pp 1293–1303Google Scholar
  32. 32.
    Lambrou TP, Panayiotou CG (2009) Collaborative area monitoring using wireless sensor networks with stationary and mobile nodes. J Adv Signal Proc 750657:750651–750657:750616Google Scholar
  33. 33.
    Wan Ismail W (2010) Study on coverage in wireless sensor network using grid based strategy and particle swarm optimization. In: IEEE Asia Pacific conference on circuits and systems, Kuala Lumpur, Malaysia, pp 1175–1178Google Scholar
  34. 34.
    Akshay N, Kumar MP, Harish B, Dhanorkar S (2010) An efficient approach for sensor deployments in wireless sensor network. In: International conference on emerging trends in robotics and communication technologies, Chennai, India, pp 350–355Google Scholar
  35. 35.
    Ghosh A (2004) Estimating coverage holes and enhancing coverage in mixed sensor networks. In: IEEE international conference on local computer networks, Tampa, USA, pp 68–76Google Scholar
  36. 36.
    Wang G, Cao GH, Berman P, La Porta TF (2007) Bidding protocols for deploying mobile sensors. IEEE T Mobile Comput 6((5): 515–528Google Scholar
  37. 37.
    Wang B (2010) Coverage control in sensor networks. Springer, BerlinMATHCrossRefGoogle Scholar
  38. 38.
    Alsalih W, Islam K, Rodriguez YN, Xiao H (2008) Distributed Voronoi diagram computation in wireless sensor networks. In: ACM symposium on parallelism in algorithms and architectures, Munich, Germany, p 364Google Scholar
  39. 39.
    Boukerche A, Fei X (2007) A Voronoi approach for coverage protocols in wireless sensor networks. In: IEEE global communications conference, Washington, DC, USA, pp 5190–5194Google Scholar
  40. 40.
    Huang C, Tseng Y (2005) The coverage problem in a wireless sensor network. Mobile Netw Appl 10(4): 519–528MathSciNetCrossRefGoogle Scholar
  41. 41.
    Zhang H, Hou JC (2005) Maintaining sensing coverage and connectivity in large sensor networks. Wirel Ad hoc Sensor Netw 1(1–2): 89–123Google Scholar
  42. 42.
    Ahmed N, Kanhere SS, Jha S (2005) Probabilistic coverage in wireless sensor networks. In: IEEE conference on local computer networks, Sydney, Australia, pp 672–681Google Scholar
  43. 43.
    Hefeeda M, Ahmadi H (2007) A probabilistic coverage protocol for wireless sensor networks. In: IEEE international conference on network protocols, Beijing, China, pp 41–50Google Scholar
  44. 44.
    Mao G, Fidan B, Anderson BDO (2007) Wireless sensor network localization techniques. Comput Netw 51(10): 2529–2553MATHCrossRefGoogle Scholar
  45. 45.
    Karp B, Kung HT (2000) GPSR: greedy perimeter stateless routing for wireless networks. In: International conference on mobile computing and networking, Boston, USA, pp 243–254Google Scholar
  46. 46.
    Khan I, Mokhtar H, Merabti M (2008) A survey of boundary detection algorithms for sensor networks. In: Annual postgraduate symposium on the convergence of telecommunications, networking and broadcasting, Liverpool John Moores University, Liverpool, UKGoogle Scholar
  47. 47.
    Braden B (1986) The surveyor’s area formula. Coll Math J 17(4): 326–337CrossRefGoogle Scholar
  48. 48.
    Solovay RM (1970) A model of set-theory in which every set of reals is Lebesgue measurable. Ann Math 92(1): 1–56MathSciNetMATHCrossRefGoogle Scholar
  49. 49.
    Zou Y, Chakrabarty K (2004) Sensor deployment and target localization in distributed sensor networks. ACM Trans Embed Comput Syst 3(1): 61–91CrossRefGoogle Scholar
  50. 50.
    Zou Y, Chakrabarty K (2005) A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Trans Comput 54(8): 978–991CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  1. 1.Iran University of Science and TechnologyTehranIran

Personalised recommendations