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
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A Spatiotemporal Communication Protocol for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Telos: enabling ultra-low power wireless research
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
Sink Location Service via Inner Rectangular in Wireless Sensor Networks
AINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications
Multi-Source Temporal Data Aggregation in Wireless Sensor Networks
Wireless Personal Communications: An International Journal
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS
IEEE Communications Surveys & Tutorials
Data gathering mechanism with local sink in geographic routing for wireless sensor networks
IEEE Transactions on Consumer Electronics
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
IEEE/ACM Transactions on Networking (TON)
Adaptive Position Update for Geographic Routing in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
Geographic routing in wireless sensor networks requires sources nodes to be aware of the location information of sinks to send their data. To provide the sink location service, quorum-based schemes have been proposed, which exploit crossing points between a quorum of a sink location announcement (SLA) message from a sink and a quorum of a sink location query (SLQ) message from a source node. For guaranteeing at least one crossing point in irregular sensor networks with void areas or irregular boundaries, the previous schemes however collect and flood the network boundary information or forward a SLA and SLQ message along the whole network boundary. In this paper, we design a novel quorum-based sink location service scheme that exploits circle and line quorums, which does not require the network boundary information and send a SLA and SLQ message along the whole network boundary. In the proposed scheme, a source node sends a SLQ message to the network center and sends another SLQ message to an edge node in the network boundary, thus generating a SLQ line quorum. On the other hand, a sink node sends a SLA message along a circle path whose center is the network center, thus forming a SLQ circle quorum. By this way, it is guaranteed that the SLQ and SLA quorums have at least one crossing point in irregular sensor networks. Both numerical analysis and extensive simulation results verify that the proposed scheme outperforms the existing schemes in terms of the delivery distance, the delivery hop count, and the energy consumption for providing sink location service.