移动自组网络中采用连通支配集的有效广播技术

广播是移动自组网络(MANET)中的一种常用操作.许多移动自组网络的按需路由协议依赖于它来发现任意两个节点之间的路径.广播也是许多MANET应用中发布信息的重要手段.实现广播的直接途径是洪泛(flooding).然而,在没有有效的控制机制下,洪泛将带来严重的消息冗余、传输冲突和碰撞问题.基于图论中的连通支配集(CDS)概念,提出了一种有效的广播途径.它能较大地减小消息的冗余度,同时保持了洪泛的优点.模拟结果表明,提出的广播途径优于一个基于CDS的分布式算法和一个基于簇(cluster)的途径.

Efficient Broadcast in Mobile Ad Hoc Networks Using Connected Dominating Sets

Broadcast is a common operation in mobile ad hoc networks (MANETs). Many on-demand ad hoc routing protocols resort to it to discover the route between any two nodes. It is also an important means to disseminate information in many MANET applications. An intuitive way for broadcast is flooding. However, without well-designed control mechanisms, flooding will lead to serious message redundancy, contention and collision. This paper proposes an efficient broadcast scheme based on the concept of connected dominating set (CDS) in graph theory. The proposed scheme can reduce message redundancy significantly, while retaining the merits of flooding. Simulation results show that the proposed scheme outperforms a distributed CDS-based algorithm and a cluster-based approach.