论文部分内容阅读
广播是移动自组网络 (MANET)中的一种常用操作 .许多移动自组网络的按需路由协议依赖于它来发现任意两个节点之间的路径 .广播也是许多 MANET应用中发布信息的重要手段 .实现广播的直接途径是洪泛 (flood-ing) .然而 ,在没有有效的控制机制下 ,洪泛将带来严重的消息冗余、传输冲突和碰撞问题 .基于图论中的连通支配集 (CDS)概念 ,提出了一种有效的广播途径 .它能较大地减小消息的冗余度 ,同时保持了洪泛的优点 .模拟结果表明 ,提出的广播途径优于一个基于 CDS的分布式算法和一个基于簇 (cluster)的途径 .
Broadcasting is a common practice in MANET, and many on-demand routing protocols in MANET rely on it to discover the path between any two nodes. Broadcasting is also important in many MANET applications However, in the absence of an effective control mechanism, flooding will bring about serious message redundancy, transmission collision and collision problems.Based on the connected dominance of graph theory (CDS) concept, an effective broadcast approach is proposed, which can greatly reduce the redundancy of messages while maintaining the advantages of flooding.The simulation results show that the proposed broadcast approach is superior to a CDS-based distribution Algorithm and a cluster-based approach.