Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
复制标题
DOI：
10.1145/381677.381686
复制
发表时间：
2001-07
影响因子：
3
通讯作者：
Benjie Chen;K. Jamieson;H. Balakrishnan;R. Morris
中科院分区：
文献类型：
--
作者：
Benjie Chen;K. Jamieson;H. Balakrishnan;R. Morris
本文介绍了 Span，一种用于多跳自组织无线网络的节能技术，可在不显着降低网络容量或连接性的情况下降低能耗。 Span 建立在以下观察基础上：当共享信道无线网络的某个区域具有足够的节点密度时，只需其中少数节点随时处于打开状态即可转发活动连接的流量。 Span 是一种分布式随机算法，其中节点在本地决定是否休眠或作为协调器加入转发骨干网。每个节点的决策基于对有多少邻居将从其唤醒中受益以及可用能量的估计。我们给出了一种随机算法，其中协调器随时间轮换，演示本地节点决策如何导致连接的、容量保持的全局拓扑。随着空闲与睡眠能耗比率的增加，Span 带来的系统寿命的改善也随之增加。我们的模拟表明，通过实际的能源模型，使用 Span 的省电模式下 802.11 网络的系统寿命比不使用 Span 的系统寿命长两倍。此外，Span 还改善了通信延迟和容量。
This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.