Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2010.17C.3.259

A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks  

Bang, Min-Young ((주)에피콤)
Lee, Bong-Hwan (대전대학교 정보통신공학과)
Abstract
In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.
Keywords
Location-Based; Ad Hoc Networks; Routing; Ubiquitous; Protocol;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 J. N. Al-Karaki and A. E. Kamal, “Routing Techniques in Wireless Sensor Networks: a Survey,” IEEE Communication Magazine, Dec., 2004.   DOI   ScienceOn
2 X. Hong, K. Xu, and M. Gerla, “Scalable Routing Protocols for Mobile Ad Hoc Networks,” IEEE Network, Vol.16, No.4, 2002.   DOI   ScienceOn
3 Anish Arora et al, “ExScal: Elements of an Extreme Scale Wireless Sensor Network,” In Proc. of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp.102-108, 2005.   DOI
4 A. P. Ruhil, D. K. Lobiyal, and I. Stojmenovic, “Position Based Gradient Routing in Mobile Ad Hoc Networks,” ICDCIT 2005, LNCS 3816, pp.39-49, 2005.   DOI   ScienceOn
5 E. Kranakis, D. Pompili, and J. Urrutia, “Compass Routing on Geometric Networks,” In Proc. of 11th Canadian Conference on Computational Geometry, Canada, 1999.
6 C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” In Workshop on Mobile Computing and Systems Applications, 1999.   DOI
7 C. E. Perkins and P. Bhagwat, “Destination Sequenced Distance-Vector Routing(DSDV) for Mobile Computers,” In proceedings of ACM SIGCOMM Conference on Communication Architectures, pp.234-244, Aug., 1994.   DOI
8 Y. -R. Choi, M. Gouda, H. Zhang, and A. Arora, “Routing on a Logical Grid in Sensor Networks,” Technical Report UTCS TR-04-49, University of Texas at Austin, 2004.
9 M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A Review of Routing Protocols for Mobile Ad Hoc Networks,” Ad Hoc Networks, Vol.2, pp.1-22, Jan., 2004.   DOI   ScienceOn
10 이종민, 김성우, “애드혹 네트워크에서의 가상 그리드 기반 라우팅 알고리즘,” 한국시뮬레이션학회논문지, 제16권 2호, pp.17-26, 2007. 6.   과학기술학회마을
11 이병건, 윤원식, “무선 Ad Hoc 네트워크를 위한 위치정보 기반에너지 고려 라우팅 프로토콜,” 전자공학회논문지, 제 45권 TC편, 제7호, 2008. 7.
12 박혜미, 박광진, 추현승, “하이브리드 애드 혹 네트워크에서의 에너지 효율성을 고려한 라우팅 알고리즘,” 한국인터넷정보학회, 8권 5호, 2007. 10.   과학기술학회마을
13 http://www.isi.edu/nsnam/ns/
14 임화정, 차영환, “이동 애드 혹 네트워크를 위한 다중경로 소스라우팅 프로토콜,” 정보처리학회논문지C, 제12-C권, 2005.   과학기술학회마을   DOI   ScienceOn
15 N. S. Yadav and R. P. Yadav, “Performance Comparison and Analysis of Table-Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks,” International Journal of Information Technology, Vol.4, No.2, pp.101-109, 2007.