Sink location service based on circle and line paths in wireless sensor networks

Authors:
Euisin Lee;Fucai Yu;Soochang Park;Sang-Ha Kim
Affiliations:
Department of Computer Engineering, Chungnam National University, Korea;Key Lab of Broadband Optical Fiber Transmission and Communication Networks, UESTC, Chengdu, China;Department of Computer Engineering, Chungnam National University, Korea;Department of Computer Engineering, Chungnam National University, Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 1

Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks

Proceedings of the 8th annual international conference on Mobile computing and networking
A Spatiotemporal Communication Protocol for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications

Graph Theory With Applications

Quorum based sink location service for irregular wireless sensor networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless sensor networks, geographic routing requires source nodes to be aware of the location information of sinks to send their data. Since sensor nodes have limited resources, providing the sink location service through low overhead is an important challenging issue. To address this issue, in this letter, we propose a simple sink location service scheme based on circle and line paths. In the proposed scheme, a sink constructs a circle path of a Sink Location Announcement (SLA) message while a source node constructs a line path of a Sink Location Query (SLQ) message. Then, the proposed scheme guarantee that the SLQ line path and SLA circle path can have at least one crossing point. Simulation results show that the proposed scheme is superior to other schemes in terms of control overhead.