A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad Hoc mobility management with uniform quorum systems
IEEE/ACM Transactions on Networking (TON)
A scalable location service for geographic ad hoc routing
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
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Information Dissemination in Partitionable Mobile Ad Hoc Networks
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Randomized location service in mobile ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Performance of dead reckoning-based location service for mobile ad hoc networks: Research Articles
Wireless Communications & Mobile Computing
A Spatiotemporal Communication Protocol for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Models and solutions for radio irregularity in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
Octopus: a fault-tolerant and efficient ad-hoc routing protocol
Wireless Networks
Information brokerage via location-free double rulings
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Sink location service based on circle and line paths in wireless sensor networks
IEEE Communications Letters
Energy efficient protocols for information dissemination in wireless sensor networks
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Hi-index | 0.24 |
Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure location information instead of global topology information to route data packets. Geographic routing requires a source node to be aware of the location of a sink. Most existing geographic routing protocols merely assume that the sources can obtain the location of sink by some location service. How can source node efficiently obtain the location of sink is not addressed in detail. In this paper, we propose a quorum based sink location service (QSLS) for irregular profile wireless sensor networks. In this scheme, a sink location announcement packet and a sink location query packet are sent along two trajectories respectively by geographic routing. The node which overheard these two packets near the intersection of the two trajectories informs the source about the sink location. Then the source can send data packets to the sink by geographic routing. The challenge of this paper is that how to guarantee these two trajectories having at least one intersection in arbitrary irregular profile sensor networks. Simulation results show that QSLS is significantly superior to other protocols in terms of control overhead.