Skip to main content

Advertisement

SpringerLink
Log in

Localized algorithms for coverage boundary detection in wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. Compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. The algorithms are fully distributed in the sense that only the minimal position information of one-hop neighbors and a limited number of simple local computations are needed, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R Project. http://www.r-project.org/.

  2. I. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, Wireless sensor networks: A survey, Computer Networks (Elsevier) Journal 38(4) (2002) 169–181, 393–422.

  3. X. Bai, S. Kumar, D. Xuan, Z. Yun and T. Lai, Deploying wireless sensors to achieve both coverage and connectivity, in: MobiHoc’06, Florence, Italy (May 2006).

  4. M. Berg, Computational Geometry: Algorithms and Applications (Springer, New York, 2000).

    MATH  Google Scholar 

  5. S. Borbash and E. Jennings, Distributed topology control algorithm for multihop wireless networks, in: Proc. IEEE International Joint Conference on Neural Networks, Honolulu, HI (April 2002).

  6. Q. Cao, T. Yan, J.A. Stankovic and T.F. Abdelzaher, Analysis of target detection performance for wireless sensor networks, in: International Conference on Distributed Computing in Sensor Networks (DCOSS), Los Angeles, CA (June 2005).

  7. M. Cardei and J. Wu, Handbook of Sensor Networks, chapter Coverage in Wireless Sensor Networks (CRC Press, Boca Raton, FL, 2004).

  8. M. Chan, D. Chen, F.Y. Chin and C. Wang, Construction of the nearest neighbor embracing graph of a point set, in: Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Humlebak, Denmark (July 2004).

  9. S. Chandler, Calculation of number of relay hops required in randomly located radio network, Electronics Letters 25(24) (1989) 1669–1671.

    Article  Google Scholar 

  10. S. Chiu and I. Molchanov, A new graph related to the directions of nearest neighbours in a point process, Advances in Applied Probability 35(1) (2003) 47–55.

    Article  MATH  MathSciNet  Google Scholar 

  11. Q. Fang, J. Gao and L. Guibas, Locating and bypassing routing holes in sensor networks, in: INFOCOM’04, Hong Kong, China (March 2004).

  12. M. Franceschetti, L. Booth, M. Cook, R. Meester and J. Bruck, Percolation of Multi-Hop Wireless Networks, Technical Report UCB/ERL M03/18, EECS Department, University of California, Berkeley (2003).

  13. A. Ghosh, Estimating coverage holes and enhancing coverage in mixed sensor networks, in: LCN’04, Washington, DC (November 2004).

  14. P. Gupta and P. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory 46(2) (2000) 388–404.

    Article  MATH  MathSciNet  Google Scholar 

  15. P. Gupta and P.R. Kumar, Stochastic Analysis, Control, Optimization and Applications: A volume in honor of W.H. Fleming, chapter Critical Power for Asymptotic Connectivity in Wireless Networks, Birkhauser, Boston (1998).

  16. P. Hall, Introduction to the Theory of Coverage Processes (John Wiley Sons Inc., New York, 1988).

    MATH  Google Scholar 

  17. C.F. Huang and Y.C. Tseng, The coverage problem in a wireless sensor network, in: Proc. of the 2nd ACM international Workshop on Wireless Sensor Networks and Applications (WSNA ’03), San Diego, CA (September 2003).

  18. S. Kapoor and X. Li, Proximity structures for geometric graphs, in: WADS 2003, Ottawa, Canada (July 2003).

  19. H. Karl and A. Willig, Protocols and Architectures for Wireless Sensor Networks (John Wiley Sons Inc., New York, 2005).

    Google Scholar 

  20. S. Kumar, T.H. Lai and A. Arora, Barrier coverage with wireless sensors, in: MobiCom’05, Cologne, Germany (August 2005).

  21. S. Kumar, T.H. Lai and J. Balogh, On k-coverage in a mostly sleeping sensor network, in: MobiCom’04, Philadelphia, PA (October 2004).

  22. M. Leonov, Polyboolean library (2004), http://www.complex-a5.ru/polyboolean/.

  23. L. Li, J. Halpern, P. Bahl, Y. Wang and R. Wattenhofer, A cone-based distributed topology-control algorithm for wireless multi-hop networks, IEEE/ACM Transactions on Networking 13(1) (2005) 147–159.

    Google Scholar 

  24. X. Li, G. Calinescu, P. Wan and Y. Wang, Localized delaunay triangulation with applications in wireless ad hoc networks, IEEE Transactions on Parallel and Distributed Systems 14(10) (2003) 1035–1047.

    Article  Google Scholar 

  25. B. Liu and D. Towsley, A study of the coverage of largescale sensor networks, in: IEEE 47th Annual International Vehicular Technology Conference, Fort Lauderdale, FL (October 2004).

  26. R. Meester and R. Roy, Continuum Percolation (Cambridge University Press, Cambridge, 1996).

    MATH  Google Scholar 

  27. A. Okabe, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams (Wiley, New York, 2000).

    MATH  Google Scholar 

  28. D. Peleg, Distributed Computing: A Loaclity-Sensitive Approach, Society for Industrial and Applied Mathematics (SIAM) (2000).

  29. M. Penrose, Random Geometric Graphs (Oxford University Press, Oxford, 2003).

    MATH  Google Scholar 

  30. I. Stojmenovic and X. Lin, Gedir: Loop-free location based routing in wireless networks, in: Proc. of International Conference on Parallel and Distributed Computing and Systems, Boston, MA (November 1999).

  31. D. Stoyan, W. Kendall and J. Mecke, Stochastic Geometry and its Applications, 2nd edn. (Wiley, New York, 1995).

    MATH  Google Scholar 

  32. G. Wang, G. Cao and T.L. Porta, Movement-assisted sensor deployment, in: INFOCOM’04, Hong Kong, China (March 2004).

  33. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C. Gill, Integrated coverage and connectivity configuration in wireless sensor networks, in: ACM SenSys’03, Los Angeles, CA (November 2003).

  34. C. Zhang, Y. Zhang and Y. Fang, Detecting boundary nodes in wireless sensor networks, in: Proc. of 2006 IEEE International Conference On Networking, Sensing and Control, Ft. Lauderdale, Florida (April 2006).

  35. H. Zhang and J. Hou, Maintaining sensing coverage and connectivity in large sensor networks, Wireless Ad Hoc and Sensor Network 1(1–2) (2005) 89–123.

    Google Scholar 

  36. G. Zhou, T. He, S. Krishnamurthy and J.A. Stankovic, Impact of radio irregularity on wireless sensor networks, in: ACM MobiSys, Boston, MA (June 2004).

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, 32611, USA

    Chi Zhang & Yuguang Fang

  2. Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, 07102, USA

    Yanchao Zhang

Authors
  1. Chi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yanchao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuguang Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chi Zhang.

Additional information

Chi Zhang received the B.E. and M.E. degrees in Electrical Engineering from Huazhong University of Science and Technology, Wuhan, China, in July 1999 and January 2002, respectively. Since September 2004, he has been working towards the Ph.D. degree in the Department of Electrical and Computer Engineering at the University of Florida, Gainesville, Florida, USA. His research interests are network and distributed system security, wireless networking, and mobile computing, with emphasis on mobile ad hoc networks, wireless sensor networks, wireless mesh networks, and heterogeneous wired/wireless networks.

Yanchao Zhang received the B.E. degree in computer communications from Nanjing University of Posts and Telecommunications, Nanjing, China, in July 1999, the M.E. degree in computer applications from Beijing University of Posts and Telecommunications, Beijing, China, in April 2002, and the Ph.D. degree in electrical and computer engineering from the University of Florida, Gainesville, in August 2006. Since September 2006, he has been an Assistant Professor in the Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark. His research interest include wireless and Internet security, wireless networking, and mobile computing. He is a member of the IEEE and ACM.

Yuguang Fang received the BS and MS degrees in Mathematics from Qufu Normal University, Qufu, Shandong, China, in 1984 and 1987, respectively, a Ph.D. degree in Systems and Control Engineering from Department of Systems, Control and Industrial Engineering at Case Western Reserve University, Cleveland, Ohio, in January 1994, and a Ph.D. degree in Electrical Engineering from Department of Electrical and Computer Engineering at Boston University, Massachusetts, in May 1997.

From 1987 to 1988, he held research and teaching position in both Department of Mathematics and the Institute of Automation at Qufu Normal University. From September 1989 to December 1993, he was a teaching/research assistant in Department of Systems, Control and Industrial Engineering at Case Western Reserve University, where he held a research associate position from January 1994 to May 1994. He held a post-doctoral position in Department of Electrical and Computer Engineering at Boston University from June 1994 to August 1995. From September 1995 to May 1997, he was a research assistant in Department of Electrical and Computer Engineering at Boston University. From June 1997 to July 1998, he was a Visiting Assistant Professor in Department of Electrical Engineering at the University of Texas at Dallas. From July 1998 to May 2000, he was an Assistant Professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology, Newark, New Jersey. In May 2000, he joined the Department of Electrical and Computer Engineering at University of Florida, Gainesville, Florida, where he got early promotion to Associate Professor with tenure in August 2003, and to Full Professor in August 2005. His research interests span many areas including wireless networks, mobile computing, mobile communications, wireless security, automatic control, and neural networks. He has published over one hundred and fifty (150) papers in refereed professional journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002. He also received the 2001 CAST Academic Award. He is listed in Marquis Who’s Who in Science and Engineering, Who’s Who in America and Who’s Who in World.

Dr. Fang has actively engaged in many professional activities. He is a senior member of the IEEE and a member of the ACM. He is an Editor for IEEE Transactions on Communications, an Editor for IEEE Transactions on Wireless Communications, an Editor for IEEE Transactions on Mobile Computing, an Editor for ACM Wireless Networks, and an Editor for IEEE Wireless Communications. He was an Editor for IEEE Journal on Selected Areas in Communications:Wireless Communications Series, an Area Editor for ACM Mobile Computing and Communications Review, an Editor for Wiley International Journal on Wireless Communications and Mobile Computing, and Feature Editor for Scanning the Literature in IEEE Personal Communications. He has also actively involved with many professional conferences such as ACM MobiCom’02 (Committee Co-Chair for Student Travel Award), MobiCom’01, IEEE INFOCOM’06, INFOCOM’05 (Vice-Chair for Technical Program Committee), INFOCOM’04, INFOCOM’03, INFOCOM’00, INFOCOM’98, IEEE WCNC’04, WCNC’02, WCNC’00 Technical Program Vice-Chair), WCNC’99, IEEE Globecom’04 (Symposium Co-Chair), Globecom’02, and International Conference on Computer Communications and Networking (IC3N) (Technical Program Vice-Chair).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, C., Zhang, Y. & Fang, Y. Localized algorithms for coverage boundary detection in wireless sensor networks. Wireless Netw 15, 3–20 (2009). https://doi.org/10.1007/s11276-007-0021-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-007-0021-1

Keywords

Search

Navigation