Browse > Article

Sink Location Service via Circle Path for Geographic Routing in Wireless Sensor Networks  

Park, Ho-Sung (충남대학교 컴퓨터공학과 컴퓨터네트워크 연구실)
Lee, Jeong-Cheol (충남대학교 컴퓨터공학과 컴퓨터네트워크 연구실)
Oh, Seung-Min (충남대학교 컴퓨터공학과 컴퓨터네트워크 연구실)
Yim, Young-Bin (충남대학교 컴퓨터공학과 컴퓨터네트워크 연구실)
Kim, Sang-Ha (충남대학교 컴퓨터공학과 컴퓨터네트워크 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.35, no.6A, 2010 , pp. 585-593 More about this Journal
Abstract
Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure local location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of sinks. Most existing geographic routing protocols merely assume that source nodes are aware of the locations of sinks. How can source nodes get the locations of sinks was not addressed in detail. In this paper, we propose a sink location service via circle path for geographic routing in wireless sensor networks. In this scheme, a sink sends a Sink Location Announcement (SLA) message along a circle path, and a source node sends a Sink Location Query (SLQ) message along a straight path that certainly passes through the circle path. By this way we can guarantee the SLQ path and SLA path have at least one crossing point. The node located on the crossing point of the two paths informs the source node the sink location. This procedure can correctly work in any irregular profile sensor networks such as network that has holes or irregular shape by some rules. Simulation results show that our protocol is superior to other protocols in terms of energy consumption and control overhead.
Keywords
Sink Location Service; Geographic Routing; Wireless Sensor Networks; Irregular Networks;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Polastre, R. Szewczyk, and D. Culler, "Telos: Enabling Ultra-Low Power Wireless Research," in Proc. IEEE IPSN, Apr. 2005.
2 J. Hightower and G. Borriello, "Location Systems for Ubiquitous Computing," IEEE Computer, vol. 34, no. 8, August 2001, pp. 57-66.   DOI   ScienceOn
3 A. Savvides and M. B. Strivastava, "Distributed Fine-grained localization in ad-hoc networks," IEEE Transactions of Mobile Computing, 2003.
4 S. P. Fekete, A. Kroeller, D. Pfisterer, S. Fischer, and C. Buschmann, "Neighborhoodbased topology recognition in sensor networks," In Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004, pp.123-136.
5 J.A. Bondy and U.S.R. Murty, "Graph Theory with Applications," (Elsevier North-Holland, 1976).
6 Scalable Network Technologies, Qualnet, [online] available: http://www.scalable-networ ks.com.
7 H.S. Kim, T.F. Abdelzaher, and W.H. Kwon, "Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks", In Proc. of the 1st ACM international conference on Embedded networked sensor systems, November 2003, pp.193-204.
8 Y. Yu, R. Govindan, and D. Estrin, "Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks," UCLA Computer Science Department Technical Report, UCLA-CSD TR-01-0023, May 2001.
9 C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," In Proc. of the 6th Annual Int'l Conf. on Mobile Computing and Networking. Boston: ACM Press, 2000, pp.56-67.
10 F. Ye, H. Luo, J. Cheng, S. Lu, L. Zhang, "TTDD: A Two-tier Data Dissemination Model for Large-Scale Wireless Sensor Networks," In Proc. of ACM/IEEE MOBICOM, Sep, 2002. pp.148-159.
11 T. He, J.A. Stankovic, C. Lu, and T.F. Abdelzaher, "A Spatiotemporal Communication Protocol for Wireless Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, Vol.16, No.10, October 2005, pp. 995-1006.
12 B. Karp and H.T. Kung. "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.