【作者】 蓝慧琴； 钟诚； 李智；

【Author】 LAN Hui-qin, ZHONG Cheng, LI Zhi (School of Computer and Electronics and Information, Guangxi University, Nanning 530004, China) (Guangxi Science and Technology Information Network Center, Nanning 530012, China)

【机构】 广西大学计算机与电子信息学院；

【摘要】 为了避免由洪泛搜索方法引起的大量网络流量问题,基于连通支配集的广播算法BCDS通过减少转发节点来减少查询消息数。文章对BCDS算法进行改进,选择转发节点时考虑节点间的距离,简化选择转发节点的操作,且不用维持局部两跳拓扑信息。实验结果表明当搜索结果相同时,改进的BCDS算法的消息数量平均仅为洪泛搜索方法的35％。更多还原

【Abstract】 To avoid a large volume of unnecessary network traffic, the broadcast algorithm based on connected dominating set (BCDS) can decrease the redundant messages by reducing the forwarding nodes. This paper proposes an improved BCDS algorithm, which selects the forwarding nodes with the distance between the nodes. It can simplify the operation of selecting the forwarding nodes and does not want to maintain the two-hop topology information of the nodes. The experimental results show that the messages introduced by this algorithm are averagely 35% of that by flooding -based searching technique when they have the same search results.更多还原