Landmarks Selection Algorithm for Virtual Coordinates Routing
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Localised convex hulls to identify boundary nodes in sensor networks
International Journal of Sensor Networks
Practical connectivity-based routing in wireless sensor networks using dimension reduction
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Virtual domain and coordinate routing in wireless sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Pervasive and Mobile Computing
Optimizing end to end routing performance in wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Journal of Parallel and Distributed Computing
Greedy face routing with face identification support in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Topology mining of sensor networks for smart home environments
International Journal of Ad Hoc and Ubiquitous Computing
An efficient hop count routing protocol for wireless ad hoc networks
International Journal of Automation and Computing
| Hi-index | 0.00 |
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users驴 mobility and potentially large scale. Recently, there has been a thrust of research to address these problems, including on-demand routing [1-2], geographical routing [6- 8], virtual coordinates [15], etc. In this paper, we focus on geographical routing, which was shown to achieve good scalability without flooding, but it usually requires location information and can suffer from the severe dead end problem especially in sparse networks. Specifically, we propose a new Hop ID based routing protocol, which does not require any location information, yet achieves comparable performance with the shortest path routing. 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. The 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.