Self Organization of Sensor Networks for Energy-Efficient Border Coverage

  • Watfa, Mohamed K. (Department of Computer Science in the American University of Beirut) ;
  • Commuri, Sesh (School of Electrical and Computer Engineering at the University of Oklahoma)
  • 투고 : 2007.02.16
  • 심사 : 2008.02.10
  • 발행 : 2009.02.28

초록

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

키워드

참고문헌

  1. B. Warneke and K. Pister, "MEMS for distributed wireless sensor networks," in Proc. the 9th Int. Conf. Electron., Circuits and Syst., Sept. 2002, pp. 291–294
  2. K. Sohrabi, J. Gao, V. Ailawadhi, and G. J. Pottie, "Protocols for self organization of a wireless sensor network," IEEE Pers. Commun. Mag., pp. 16–27, Oct. 2000
  3. M. Chu, H. Haussecker, and F. Zhao, "Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks," Int. J. High-Performance Computing Appl., vol. 16, no. 3, pp. 90–110, Aug. 2002
  4. J. Aslem, Z. Butler, F. Constantin, V. Crespi, G. Cybenko, and D. Rus, "Tracking a moving object with a binary sensor network," in Proc. the 1st Int. Conf. Embedded Networked Sensor Syst., Nov. 2003, pp. 150–161
  5. Q. Fang, F. Zhao, and L. Guibas, "Lightweight sensing and communication protocols for target enumeration and aggregation," in Proc. the 4th ACM MobiHoc, June 2003, pp. 165–176
  6. P. Gupta and P. Kumar, "The capacity of wireless sensor networks," IEEE Trans. Inf. Theory, vol. 46, pp. 388–404, Mar. 2000
  7. P. Gupta and P. Kumar, "Internet in the sky: The capacity of three dimensional wireless networks," J. Commun. Inf. Syst., vol. 1, pp. 33–49, Jan. 2001
  8. H. Gupta, S. Das, and Q. Gu, "Connected sensor cover: Self-organization of sensor networks for efficient query execution," in Proc. MobiHoc, June 2003, pp. 189–200
  9. M. Cardei, D. MacCallum, X. Cheng, M. Min, X. Jia, D. Li, and D.-Z. Du, "Wireless sensor networks with energy efficient organization," J. Interconnection Netw., vol. 3, pp. 213–229, Mar. 2000
  10. Extreme scale Wireless Sensor Networking. Tech. Rep., 2004. [Online]. Available: http://www.cse.ohio-state.edu/exscal
  11. S. Kumar, T. Lai, and A. Arora. "Barrier coverage with wireless sensors," in Proc. the 11th Annual Int. Conf. Mobile Computing and Netw., June 2005, pp. 284–298
  12. B. Cbunar, A. Grama, J. Vitek, and O. bunar, "Redundancy and coverage detection in sensor networks," ACM Trans. Sensor Netw., vol. 2, no. 1, pp 94–128, Feb. 2006
  13. M. Watfa and S. Commuri, "Coverage strategies in 3D wireless sensor networks," Int. J. Distributed Sensor Netw., vol. 2, no. 4, pp. 333–353, Oct. 2006
  14. M. Watfa and S. Commuri, "An energy efficient and self-healing 3-dimensional sensor cover," Int. J. Ad Hoc and Ubiquitous Computing, vol. 2, pp. 121–138, Jan. 2007
  15. M. Watfa and S. Commuri, "The three dimensional coverage problem," J. Netw., vol. 1, no. 4, pp. 10–20, Aug. 2006
  16. S. Slijepcevic and M. Potkonjak, "Power efficient organization of wireless sensor networks," in Proc. IEEE ICC, June 2001, pp. 472–476
  17. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava, "Coverage problems in wireless ad-hoc sensor networks," in Proc. IEEE INFOCOM, Apr. 2001, pp. 1380–1387
  18. K. Lieska, E. Laitinen, and J. Lahteenmaki, "Radio coverage optimization with genetic algorithms," in Proc. IEEE PIMRC, Sept. 1998, pp.318–322
  19. D. Gage, "Command control for many-robot systems," in Proc. the 19th Annual AUVS Technical Symp., June 2002, pp. 22–24
  20. R. Ghrist and A. Muhammad, "Coverage and hole-detection in sensor networks via homology," in Proc. IPSN, Apr. 2005, pp.254–260
  21. B. Carbunar, A. Grama, and J. Vitek. "Distributed and dynamic voronoi overlays for coverage detection and distributed hash tables in ad-hoc networks," in Proc. the 10th Int. Conf. Parallel and Distrib. Syst., July 2004, pp. 549–559
  22. X. Hong, M. Gerla, R. Bagrodia, P. Estabrook, T. Kwon, and G. Pei, "The mars sensor network: Efficient, power aware communications," in Proc. IEEE MILCOM, Oct. 2001, pp. 112–117
  23. NASA Sensor Webs Project. [Online]. Available: http://sensorwebs.jpl.nasa.gov/
  24. I. F. Akyildiz, D. Pompili, and T. Melodia, "Underwater acoustic sensor networks: Research challenges," J. Ad Hoc Netw., vol. 3, pp. 257–279, May 2005
  25. D. Pompili and T. Melodia, "Three-dimensional routing in underwater acoustic sensor networks," in Proc. the 2nd ACM Int. Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Netw., Oct. 2005, pp. 214–221
  26. J. G. Proakis, E. M. Sozer, J. A. Rice, and M. Stojanovic, "Shallow water acoustic networks," IEEE Commun. Mag., vol. 39, pp. 114–119, June 2001
  27. Wireless Integrated Sensor Networks. [Online]. Available: http://www.janet.ucla.edu/WINS
  28. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: A survey," Computer Netw., vol. 38, pp. 393–422, Aug. 2002
  29. H. Zhang and J. C. Hou, "Maintaining sensing coverage and connectivity in large sensor networks," Int. J. Wireless Ad Hoc and Sensor Netw., vol. 1, no. 2, pp. 89–124, Sept. 2005
  30. R. Kershner, "The number of circles covering a set," American J. Mathematics, vol. 61, pp. 665–671, 1993
  31. S. Verblunsky, "On the least number of unit circles which can cover a square," J. London Math. Society, vol. 24, pp. 164–170, 1994 https://doi.org/10.1112/jlms/s1-24.3.164
  32. Y. Kurozumi and W. A. Davis, "Polygonal approximation by the minimax method," Computer Graphics and Image Process., vol. 19, pp. 248–264, 1982
  33. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. D. Gill, "Integrated coverage and connectivity configuration in wireless sensor networks," in Proc. the First ACM Conf. Embedded Networked Sensor Syst., Nov. 2003, pp. 28–39
  34. D. Kotwwitz "The densest packing of equal circles on a sphere," Acta. Cryst. Sect. A, pp. 158–165, 1991
  35. Y. Guo and Z. Qu, "Coverage control for a mobile robot patrolling a dynamic and uncertain environment," in Proc. the fifth World Congress on Intelligent Control and Automation, June 2004, pp. 4899–4903
  36. C. Zong and J. Talbot, Sphere Packings. New York: Springer-Verlag, 1999
  37. H. S. M. Coxeter "The problem of packing a number of equal nonoverlapping circles on a sphere," Trans. New York Acad. Science. pp. 320–331, 1962
  38. C. Savarese, K. Langendoen, and J. Rabaey, "Robust positioning algorithms for distributed ad-hoc wireless sensor networks," in Proc. USENIX Tech. Annual Conf., 2002, pp. 317–328
  39. S. Capkun, M. Hamdi, and J.-P. Hubaux, "GPS-free positioning in mobile ad-hoc networks," Cluster Comput. vol. 5, no. 2, pp. 157–167, 2002
  40. Y. Go and Z. Qu, "Coverage control for a mobile robot patrolling a dynamic and uncertain environment," in Proc. the 5th World Congress on Intelligent Control and Automation, Hangzhou, China, June 15–19, 2004