自组网的网关选举算法的分布式实现

在MANET网络中，由于主机的移动，广播是一种非常重要的操作。在一个地理区域内，无线信号可能相互重叠，通过直接的广播(洪泛)操作常常花费很高的代价并将产生广播风暴问题。为了减少冗余广播以缓解该问题，该文提出并实现了基于最小id的分布网关选举方法。每两个相邻的簇之间仅仅需要一个网关。仿真结果表明，该方法可以有效地减少包转发数量，有助于减少维持拓扑信息的复杂度。通过将簇首和网关作为重播节点的机制，取得了比广播更好的可扩展性。

Distributed Implementation of Gateway Selection Algorithm in Ad Hoc Networks

In a mobile Ad Hoc network (MANET), due to host mobility, broadcast is an important operation. Because radio signals are likely to overlap with each other in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in the broadcasting storm problem. To reduce redundant rebroadcasts to alleviate this problem,this paper proposes and implements a distributed gateway selection algorithm based on least id in Ad Hoc networks . Only one gateway is needed for the each pair of two adjacent clusters. Simulations results show that the method can efficiently reduce the number of packet transmissions and helps reduce the complexity of maintaining topology information and achieves better scalability than flooding by restricting rebroadcasting nodes within clusterhead and gateways.