Energy-efficient Data Dissemination Protocol for Detouring Routing Holes in Wireless Sensor Networks

무선 센서 네트워크에서 라우팅 홀을 우회하기 위한 에너지 효율적 데이타 전달 프로토콜

  • 전야 (충남대학교 컴퓨터공학과) ;
  • 우부재 (충남대학교 컴퓨터공학과) ;
  • 최영환 (충남대학교 컴퓨터공학과) ;
  • 박수창 (충남대학교 컴퓨터공학과) ;
  • 이의신 (충남대학교 컴퓨터공학과) ;
  • 진민숙 (충남대학교 컴퓨터공학과) ;
  • 김상하 (충남대학교 전기정보통신공학부)
  • Published : 2008.05.15

Abstract

Void areas(holes) as an inevitable phenomenon exist in geographic routing of wireless sensor networks, because the unpredictable and harsh nature application environment or uneven energy consumption. Most of the existing schemes for the issue tend to construct a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the perimeter of the hole; thus it may enlarge the hole. At the same time, traffic would concentrate on the peripheral node of the hole; thus the nodes on the perimeter of the hole tend to be depleted quietly. In previous work, we have proposed a hole geometric model to reduce the energy consumption and packet collisions of the nodes on the hole boundary. This scheme, however, still has the static detour path problem. Therefore, we extend the previous work by constructing a dynamic detour path hole geometric model for wireless sensor networks in this paper. The location of hole detour anchors is dynamically shifted according to Gaussian function, just generating dynamic hole detour paths.

위치정보기반 라우팅을 이용하는 무선 센서망은 자연환경 혹은 센서 노드들의 불균형적인 에너지 소비로 인한 라우팅 홀(hole)로 인해 높은 통신 장애 가능성이 존재한다. 이에 대해 연구된 대부분의 기법들은 그런 라우팅 홀을 우회하는 방법으로 접근하는 경향을 보인다. 그러나 홀 우회를 위한 라우팅은 홀 주변 센서노드들의 불균형적인 에너지 소비를 유도하기 때문에, 그들의 통신장애 및 네트워크 수명에 장애를 발생시킬 수 있다. 우리는 이미 홀 우회를 위한 라우팅 방안을 제안하였지만, 그 또한 갖는 문제점 때문에 가우시안 함수를 활용하여 그 연구에 대한 확장 방안을 새롭게 제안한다.

Keywords

References

  1. Karp B, Kung H, "GPSR: Greedy perimeter stateless routing for wireless networks," In Proc. of the 6th Annual Int'l Conf. on Mobile Computing and Networking. Boston, ACM Press, 2000. pp.243-254
  2. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric adhoc routing of theory and practice," in Proc. ACM Symposium on the Principles of Distributed Computing (PODC), Boston, MA, Jul. 2003, pp. 243-254
  3. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," in Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 48-55, 1999
  4. Y. B. Ko and N. H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks," in Proc. ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Dallas, TX, Oct. 1998, pp. 66-75
  5. Q. Fang, J. Gao, und L. J. Guibas, "Locating and bypassing routing holes in sensor networks," In Proc. of INFOCOM 2004, Vol.4, March 2004 pp. 2458-2468
  6. N. Ahmed, S. S. Kanhere and S. Jha, "The Holes Problem in Wireless. Sensor Networks: A Survey," ACM SIGMOBILE Mobile Computing. and Communications Review, Vol.9, pp.4-18, 2005
  7. E. Kranakis, H. Singh, and J. Urrutia, "Compass routing on geometric networks," In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999
  8. F.C. Yu, E. Lee, Y.Choi, S. Park, D. Lee, Y. Tian, and S. Kim, "A Modeling for Hole Problem in Wireless Sensor Networks," In Proc. of the IWCMC'07, August 12-16, 2007, Honolulu, Hawaii, USA
  9. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Elsevier North-Holland, 1976)