稠密自组网的网关选举策略

Gateway Selection Strategy in Dense MANET

自组网是没有固定设施的临时无线系统.已经有多种路由算法被提出.因为自组网的网络拓扑动态改变且带宽有限,路由应当是可扩展且高效的.基于簇的算法是最有效和可以扩展的,然而,它不能有效地处理高密度网络环境.为了减少冗余广播以缓解该问题,该文给出了在高密度节点的网络环境下,存在隐藏网关的可能性定理,提出网关选举算法并证明了其正确性.仿真结果表明,在保证广播成功率的情况下,该方法可以有效地节省重播包比率和广播等待时间.

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 the most effective and scalable methods. However, it can not handle dense situations efficiently. To reduce redundant rebroadcasts to alleviate this problem, this paper proposes a probability theorem that there is a hidden gateway in a dense network scenario. Then it presents a distributed gateway selection algorithm and proves its correctness. Simulations results show that the method can efficiently save rebroadcast rate of packet to transmit and broadcast latency time in the case of guaranteeing broadcast success rate.