P2P-based routing and data management using the virtual cord protocol (VCP)
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Advantages of virtual addressing for efficient and failure tolerant routing in sensor networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Virtual position based geographic routing for wireless sensor networks
Computer Communications
Implementation of gradient routing in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Review: A gradient based routing scheme for street lighting wireless sensor networks
Journal of Network and Computer Applications
Trap array: a unified model for scalability evaluation of geometric routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
APDV: making distance vector routing scale using adaptive publish-subscribe mechanisms
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Controlled and self-organized routing for large-scale wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hierarchical role-based data dissemination in wireless sensor networks
The Journal of Supercomputing
An efficient hop count routing protocol for wireless ad hoc networks
International Journal of Automation and Computing
| Hi-index | 0.00 |
Routing in wireless communication systems such as ad hoc networks remains a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, a thrust of research has addressed these problems--the on-demand routing, geographical routing, and virtual coordinates. In this paper, we focus on geographical routing that has been shown to achieve good scalability without flooding; however, this usually requires the availability of location information and can suffer from poor routing performance and severe dead end problems, especially in sparse networks. Specifically, we propose a new Hop ID routing scheme, which is a virtual coordinate-based routing protocol and does not require any location information. This achieves excellent routing performance comparable with that obtained by the shortest path routing schemes. In addition, we design efficient algorithms for setting up the system and adapt to the node mobility quickly, and can effectively route out of dead ends. Extensive analysis and simulation show that the Hop ID based routing achieves efficient routing for mobile ad hoc networks with various density, irregular topologies and obstacles.