Journal of KIISE:Information Networking (한국정보과학회논문지:정보통신)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Direction-based Geographic Routing for Wireless Sensor Networks

센서 네트워크에서 장애물 극복을 위한 방향기반의 라우팅 기법

  • 고영일 (한국과학기술원 전자전산학과) ;
  • 박창섭 (수원대학교 인터넷정보공학과) ;
  • 손인근 (방위사업청 사업관리부) ;
  • 김명호 (한국과학기술원 전자전산학과)
  • Published : 2006.12.15
Download PDF
⟨ Previous Next ⟩

Abstract

Geographic routing protocols are very attractive choice for routing in wireless sensor networks because they have been shown to scale better than other alternatives. Under certain ideal conditions, geographic routing works correctly and efficiently. The most commonly used geographic routing protocols include greedy forwarding coupled with face routing. Existing face routing algorithms use planarization techniques that rely on the unit-graph assumption. In real world, many conditions violate the unit-graph assumption of network connectivity, such as location errors, communication voids and radio irregularity, cause failure in planarization and consequently face routing. In this paper, we propose the direction-based geographic routing, which enables energy efficient routing under realistic conditions without planarization techniques. Our proposed approach is for the case in which many sensors need to collect data and send it to a central node. Simulation results show that the protocol exhibits superior performances in terms of energy consumption, delivery success rate, and outperforms the compared protocols.

센서 네트워크에서는 센서노드들 사이에 다양한 형태의 장애물들이 존재할 수 있다. 이러한 장애물들로 인하여 라우팅 과정에서 해결해야 할 여러 가지 문제점들이 발생하게 된다. 즉, 장애물을 우회하는 과정에서 극복경로가 지나치게 길어질 수 있다. 따라서, 장애물이 많은 환경에서도 에너지 효율적으로 경로를 생성할 수 있는 라우팅 기법이 요구된다. 기존의 위치기반 라우팅 기법은 장애물 극복을 위해 전체 네트워크 그래프를 평면 그래프(planar graph)로 변환하는 과정을 필요로 한다. 이 과정에서 실제 네트워크 토폴로지가 왜곡됨으로 인해 여러 가지 문제점들이 발생할 수 있다. 본 논문에서는 목적지 중심의 극 좌표계를 기반으로 센서의 위치를 결정하고, 플라나 과정 없이 장애물을 적응적으로 극복할 수 있는 방향기반의 라우팅 기법을 제안한다. 또한, 실험을 통하여 제안 방법이 장애물을 회피하는 과정에서 에너지 효율적인 경로를 생성함을 보인다.

Keywords

References

  1. Q. Fang, J. Gao, and L. J. Guibas, 'Locating and Bypassing Routing Holes in Sensor Networks,' in Proceedings of IEEE INFOCOM'04, March 2004
  2. B. Karp and H. Kung, 'GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,' in Proceedings of ACM MobiCom'00, August 2000 https://doi.org/10.1145/345910.345953
  3. Brad Karp. Geographic Routing for Wireless Networks. PhD thesis, Harvard University, 2000
  4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia 'Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,' 3rd Int'l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM'99), August 1999 https://doi.org/10.1145/313239.313282
  5. T. He, J. A.Stankovic, C. Lu, and T. F. Abdelzaher, 'SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks,' in Proceedings of International Conference on Distributed Comuting Systems (ICDCS'03), May 2003 https://doi.org/10.1109/ICDCS.2003.1203451
  6. Silvia Giordano, Ivan Stojmenovic, Position Based Routing Algorithms For Ad Hoc Networks: A Taxonomy (2001)
  7. S. Ratnasamy, D. Estrin, R. Govindan, B. Karp, S. Shenker, L. Yin, and F. Yu. Data-centric storage in sensornets. In First Workshop on Sensor Networks and Applications (WSNA), Atlanta, GA, September 2002
  8. Karim Seada, Ahmed Helmy, Ramesh Govindan, 'Modeling and Analyzing the Correctness of Geographic Face Routing under Realistic Conditions,' ACM Transactions on Sensor Networks (Submitted August 2005)
  9. B. Karp. 'Challenges in Geographic Routing: SparseNetworks, Obstacles, and Traffic Provisioning,' Slides presented at the DIMACS workshop on Pervasive Networking, May 2001. (www.icir.org/bkarp/gpsr/gpsr.htrnl)
  10. E.Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proc.11th Canadian Conference on Computational Geometry, pages 51-54, 1999
  11. Kousha Moaveninejad, Wen-Zhan Song, Xiang-Yang Li, Robust position-based routing for wireless ad hoc networks, Elsevier Journal of Ad Hoc Networks (ADHOC), 2004
  12. F. Kuhn, R. Wattenhofer, and A. Zollinger. 'Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing,' ACM Mobihoc 2003 https://doi.org/10.1145/778415.778447
  13. Ben Leong, Sayan Mitra, and Barbara Liskov, 'Path Vector Face Routing: Geographic Routing with Local Face Information,' Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005). Boston, MA, November 2005. To appear https://doi.org/10.1109/ICNP.2005.32
  14. Y.J. Kim, R. Govindan, B. Karp, S. Shenker, Geographic Routing Made Practical. Proc. of USENIX NSDI 2005
  15. Rahul C. Shah, Adam Wolisz and Jan Rabaey, 'On the performance of geographical routing in the presence of localization errors,' IEEE International Conference on Communications, 2005 https://doi.org/10.1109/ICC.2005.1494938
  16. T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher. 'Range-Free Localization Schemes for Large Scale Sensor Networks,' ACM MOBICOM 2003 https://doi.org/10.1145/938985.938995
  17. J. Newsome and D. Song, 'GEM: Graph Embedding for Routing and Data-Centric Storage in Sensor Networks without Geographic Information,' in Proceedings of First International Conference on Embedded Networked Sensor Systems (SenSys '03), November 2003
  18. A. Kroller, S.P. Fekete, D. Pfisterer, S. Fischer: Deterministic boundary recognition and topology extraction for large sensor networks, To appear in Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 06) https://doi.org/10.1145/1109557.1109668
  19. K. Chintalapudi, R. Govindan, Localized Edge Detection in Wireless Sensor Networks, Proceedings of the IEEE ICC Workshop on Sensor Network Protocols and Applications, pp. 1-11, April 2003