• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Communications and Networks, Journal of >An energy efficient localized topology control algorithm for wireless multihop networks
【24h】

An energy efficient localized topology control algorithm for wireless multihop networks

机译：无线多跳网络的高效节能局部拓扑控制算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.
机译：局部拓扑控制对于获得具有所需特征（如稀疏连接性和降低的发射功率）的简化网络图很有吸引力。在本文中，我们专注于研究如何在无线多跳网络的局部拓扑控制的背景下延长网络寿命。为此，我们提出了一种高效节能的局部拓扑控制算法。在我们的算法中，要求每个节点保持其一跳邻域拓扑。为了实现较长的网络寿命，我们引入了一种新的指标来表征网络中每个链路的能量临界状态。每个节点独立地构建本地节能生成树，以查找减少的邻居集，同时最大程度地避免在其邻域中使用能源关键型链路进行本地生成树构造。我们介绍了我们算法的详细设计说明。推导算法的计算复杂度为O（mlog n），其中m和n分别表示节点一跳邻域中的链路和节点数。仿真结果表明，该算法在网络寿命方面明显优于现有工作。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号