Optimising expanding ring search for multi-hop wireless networks
Optimising expanding ring search for multi-hop wireless networks
复制标题
优化多跳无线网络的扩展环搜索
DOI：
10.1109/glocom.2004.1378120
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
S. Jha
中科院分区：
文献类型：
--
作者：
J. Hassan;S. Jha
扩展环搜索（ERS）是一种在多跳无线网络（如自组网和传感器网络）中广泛使用的减少广播开销的技术。ERS的工作原理是在以广播源为中心的网络中连续搜索更大的区域。只有在L次连续搜索失败时才启动网络范围的广播。本文探讨了是否存在使ERS广播成本最小化的最优L。建立了一个理论模型来分析预期广播成本作为L的函数，使用该模型，我们证明了对于任何随机网络拓扑都存在最优L。通过大量考虑不同大小和跳长的随机网络拓扑的数值实验，验证了分析结果。通过将参数L调到最优值，根据拓扑的不同，广播成本最多可以降低52%。
Expanding ring search (ERS) is a widely used technique to reduce broadcast overhead in multi-hop wireless networks (e.g., ad-hoc and sensor networks). ERS works by searching successively larger areas in the network centred around the source of broadcast. Network-wide broadcast is initiated only if L successive searches fail. This paper explores if there exists an optimal L that would minimise the broadcast cost of ERS. A theoretical model is developed to analyse the expected broadcast cost as a function of L. Using this model, we show that an optimal L exists for any random network topology. The analytical results are validated through extensive numerical experiments that consider a large number of random network topologies of varying sizes and hop lengths. By tuning the parameter L to the optimum value, broadcast cost can be reduced up to 52% depending on the topology.