earticle

영어

Mobile nodes must be managed efficiently for the Internet connectivity of mobile ad hoc networks. The tree-based mobility management approach is highly dependable in that mobile nodes register with Internet gateway along tree paths from itself up to a gateway without using flooding. However, it is costly to resume on-going communication if a node belonging to an active path loses its connectivity to its parent. In this paper, we introduce a new approach 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 approach is evaluated against the tree-based method by resorting to simulation. The result shows that the new method outperforms the tree-based approach and also is very robust against the change of topology.