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

For the effective mobility management of mobile nodes in Infrastructure-based Mobile Ad Hoc Networks, every mobile node is obliged to send a registration message to the Internet Gateway (IG) periodically. Not only do the registration messages and the additional control messages to establish paths from mobile nodes to the IG to send the registration messages incur a considerable amount of control overhead, but also they impose high traffic congestion on the mobile nodes in the vicinity of the IG which is referred to as the “funneling effect.” The control overhead and the funneling effect make it hard to handle mobility management with little impact on the performance of a routing protocol. Therefore, in this paper we propose a tree-based mobility management approach using a message aggregation technique that employs a novel timing model suitable for tree topology, referred to as a skewed wait time assignment technique, in order to maximize message aggregation. Despite its superior performance, this wait time assignment technique differs from the other techniques in that it does not require clock synchronization over nodes. By resorting to simulations, we show that the proposed approach can significantly alleviate the funneling effect as well as improve the performance of mobility management compared with the Tree-based and Quasi-tree based mobility management schemes.