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
VPDS: Virtual Home Region Based Distributed Position Service in Mobile Ad Hoc Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
MLS: an efficient location service for mobile ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Link Dynamics and Protocol Design in a Multihop Mobile Environment
IEEE Transactions on Mobile Computing
Handling asymmetry in power heterogeneous ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Many realistic Mobile Ad Hoc Networks (MANETs) is composed of nodes with heterogeneous communication capability in terms of transmission power, data rate, battery life, reliability, etc. All existing routing and Location Service (LS) protocols which exploit powerful nodes' capability in Heterogeneous MANETs (H-MANETs) need high density of powerful nodes. However, powerful nodes are more expensive and complex than low-power nodes. In this paper, we present an Intermittently Connected Backbone Location Service (ICBLS) for H-MANETs with very sparse powerful nodes. We prove the efficiency of ICBLS and drive the mathematic expression of location update distance and location registration overhead. To the best of the author's knowledge, ICBLS is the first protocol for the Intermittently Connected graph consists of powerful nodes in H-MANETs.