...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of communication systems >On the construction of maximum residual energy resource broadcast trees with minimum diameter in static ad hoc wireless networks
【24h】

On the construction of maximum residual energy resource broadcast trees with minimum diameter in static ad hoc wireless networks

机译：静态自组织无线网络中最大直径最小剩余能量资源广播树的构建

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

摘要

Each node in a wireless ad hoc network runs on a local energy source that has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In addition, it is in general desirable to construct routes with low hop counts as a route with a high hop count is more likely to be unstable (because the probability that intermediate nodes will move away is higher). In this paper, we address these two issues concurrently with energy conservation as the primary objective and low hop count as the secondary objective. One way of addressing the energy conservation issue is to construct routes that maximize the minimum residual battery capacity available among all nodes in each route. A broadcast tree with all routes satisfying this condition is referred to as a maximum residual energy resource broadcast tree. A maximum residual energy resource broadcast tree with the least diameter is referred to as a minimum diameter maximum residual energy resource broadcast tree and the problem of constructing such a tree is referred to as the minimum diameter maximum residual energy resource broadcast routing problem (MDMRERBRP). We propose an algorithm for MDMRERBRP and prove that MDMRERBRP is optimally solvable in polynomial time using the proposed algorithm.
机译：无线自组织网络中的每个节点都在能量寿命有限的本地能源上运行。因此，节能是此类网络中的关键问题。另外，通常希望构造具有低跳数的路由，因为具有高跳数的路由更可能不稳定（因为中间节点将移开的可能性更高）。在本文中，我们同时解决这两个问题，同时以节能为主要目标，以低跳数为次要目标。解决节能问题的一种方法是构建使每个路线中所有节点之间可用的最小剩余电池容量最大化的路线。所有路由都满足此条件的广播树称为最大剩余能量资源广播树。具有最小直径的最大剩余能量资源广播树被称为最小直径最大剩余能量资源广播树，并且构造这种树的问题被称为最小直径最大剩余能量资源广播路由问题（MDMRERBRP）。我们提出了一种针对MDMRERBRP的算法，并证明了MDMRERBRP在多项式时间内可以最优地求解。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号