A Topology Management Routing Protocol for Mobile IP Support of Mobile Ad Hoc Networks

Authors:
Trung-Dinh Han;Hoon Oh
Affiliations:
School of Computer Engineering and Information Technology, University of Ulsan, Ulsan, South Korea (680-749);School of Computer Engineering and Information Technology, University of Ulsan, Ulsan, South Korea (680-749)
Venue:
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Year:
2009

Citing 4
Cited 4

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

Quasi-tree mobility management for internet connectivity of mobile ad hoc networks

Wireless Networks
Detecting and resolving a loop in the tree-based mobility management protocol

GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
A demand-based slot assignment algorithm for energy-aware reliable data transmission in wireless sensor networks

Wireless Networks
A tree-based mobility management using message aggregation based on a skewed wait time assignment in infrastructure based MANETs

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Management of wireless multi-hop node mobility is required for global Internet connectivity of ad hoc networks. A new tree-based network topology management approach allows for managing node mobility efficiently and finding the shortest path quickly. Every node maintains topology information that includes the members of a tree being a root itself and the neighbors of each member. Then, a node can find the shortest path for a pair of nodes that belong to its topology information. We present simulation results to show that our approach far outperforms the well-known AODV based approach and works well even with an extremely high mobility of nodes.