Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
MIPMANET: mobile IP for mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Supporting Hierarchy and Heterogeneous Interfaces in Multi-Hop Wireless Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Enhanced Internet Connectivity for Hybrid Ad hoc Networks Through Adaptive Gateway Discovery
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Hi-index | 0.00 |
Mobile nodes in the integrated network of infrastructure networks and mobile ad hoc networks need an efficient registration mechanism since they register with Internet gateway via wireless multiple hops. Tree-based mobility management is highly dependable in that mobile nodes register with Internet gateway along tree paths from itself up to a gateway without using flooding. In this paper, we introduce a new method using a virtual multi-parent tree in which a node maintains multiple parents whenever possible. A mobile node can still retain its upstream path to a gateway even though it loses connectivity to one of its parents. The new scheme is evaluated against the tree-based method and the other traditional methods - proactive, reactive, and hybrid by resorting to simulation. The result shows that the new method outperforms the other ones and also is very robust against the change of topology.