Distributed low-overhead energy-efficient routing for sensor networks via topology management and path diversity

Distributed low-overhead energy-efficient routing for sensor networks via topology management and path diversity
复制标题

通过拓扑管理和路径多样性为传感器网络提供分布式低开销节能路由

DOI:
10.1109/percom.2005.14
复制
发表时间:
2005
期刊:
Third IEEE International Conference on Pervasive Computing and Communications
影响因子:
--
通讯作者:
M. Srivastava
M. Srivastava
中科院分区:
--
文献类型:
--
作者:
A. Boulis;M. Srivastava

文献摘要

被引文献

相似文献

节约能源被认为是传感器网络运行各个方面最重要的问题。特别是在路由方面,研究人员关注使用拓扑控制来实现节能路由以及寻找替代路由以延长网络寿命的问题。然而,当前的方案在以下一个或多个方面失败:1) 提供解决上述问题的解决方案,2) 提供分布式算法,3) 考虑算法的开销,4) 将结果与理论计算的最优值进行比较,5) 考虑 MAC 层的影响。我们提出并评估了一种单播路由算法,该算法利用节点以多个功率级别进行传输的能力。它可以找到两个节点之间的最佳节能路由,比分布式 Bellman-Ford 算法具有更少的能量和时间开销,并且使用备用路由来延长网络的总寿命,在考虑所有开销的情况下,可达理论最佳寿命的 87%。此外,我们还讨论了传感器网络背景下的许多实际考虑因素。我们围绕三个主要支柱构建我们的案例:i) 分布式算法,ii) 对算法开销的广泛评估,以及 iii) 考虑 MAC 层的影响。
Conserving energy has been known as the most significant problem in all facets of sensor network operation. Particularly in routing, researchers were concerned with the problems of using topology control to achieve power efficient routes, as well as finding alternate routes to extend the lifetime of the network. Current schemes though, fail in one or more of the following areas: 1) provide solutions that treat both the aforementioned problems, 2) provide distributed algorithms, 3) account for the overhead of the algorithms 4) compare the results with theoretically computed optimums, 5) account for the effect of the MAC layer. We propose and evaluate a unicast routing algorithm that exploits the ability of the nodes to transmit at multiple power levels. It can find the optimal power-efficient route between two nodes, with less energy and time overheads than the distributed Bellman-Ford algorithm, as well as use alternate routes to extend the total lifetime of the network, up to 87% of the theoretical optimum lifetime, taking into account all overheads. Furthermore, we address many practical considerations in the context of sensor networks. We built our case around three main pillars: i) a distributed algorithm, ii) extensive evaluation of the overhead of the algorithm, and iii) account for the effect of the MAC layer.