基于中间应答的分段式扩展环搜索算法

广播是无线多跳网络的基本操作,针对现有广播算法大多存在转发冗余度高、广播开销大的问题,提出一种分段式扩展环搜索算法S-ERS。该算法从数据分组中提取距离信息,在此基础上将广播分解为两个阶段:首先寻找靠近目标的节点;然后以它为源点重启新的扩展环搜索过程。S-ERS算法使搜索限定在目标最可能出现的区域,以减少搜索的盲目性,降低广播开销。理论分析和仿真结果表明,S-ERS算法在多种场景下比传统扩展环算法的开销小,最好情况下能降低约50%。

A Segmented Expanding Ring Search Algorithm Based on Intermediate Answer

Nowadays,Ad hoc networks become very promising with their development. Since broadcast algorithm in ad hoc networks are crucial to route discovery , Broadcast is a common operation in multi-hop wireless networks. However, previous schemes either have much transmission redundancy or cost too much overhead. In this paper, The distance information is extracted from historical records. On this basis, a segmented expanding ring search (ERS )broadcast method is proposed to increase significantly the transmission efficiency. And then the approach included two stages: (1)The first Found the node meeting the destination node before a short time. (2)The second started new ERS. Simulation results show that the method exhibits much better performance in variety of network conditions, compared with existing methods. At the same time, the new scheme was also easy to implement.