Topology management in dense MANET

Abstract

The ad hoc network is a temporary wireless system without a fixed infrastructure. Many routing algorithms have been proposed. This network routing should be scalable and effective because network topology changes dynamically and bandwidth is limited. Cluster-based algorithms are among the most effective and scalable methods. However, it cannot handle dense situations efficiently. To reduce redundant rebroadcasts to alleviate this problem, this paper presents a distributed gateway selection algorithm in a dense network scenario and proves its correctness. Simulations results show that the method can efficiently reduce the number of packets to transmit and delay time in the case of guaranteeing delivery rate of packets.