• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
【24h】

The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks

机译：r邻域图：无线自组织网络中拓扑控制的可调整结构

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

摘要

In wireless ad hoc networks, constructing and maintaining a topology with lower node degrees is usually intended to mitigate excessive traffic load on wireless nodes. However, keeping lower node degrees often prevents nodes from choosing better routes that consume less energy. Therefore, the trade-off is between the node degree and the energy efficiency. In this paper, an adjustable structure, named the r{hbox{-}}{rm neighborhood} graph, is proposed to control the topology. This structure has the flexibility to be adjusted between the two objectives through a parameter r, 0 le r le 1. More explicitly, for any set of n nodes, the maximum node degree and power stretch factor can be bounded from above by some decreasing and increasing functions of r, respectively. Specifically, the bounds can be constants in some ranges of r. Even more, the r{hbox{-}}{rm neighborhood} graph is a general structure of both RNG and GG, two well-known structures in topology control. Compared with YG_{k}, another famous adjustable structure, our method always results in a connected planar with symmetric edges. To construct this structure, we investigate a localized algorithm, named PLA, which consumes less transmitting power during construction and executes efficiently in O(nlog n) time.
机译：在无线自组织网络中，以较低的节点度构建和维护拓扑通常旨在减轻无线节点上的过多流量负载。但是，保持较低的节点度通常会阻止节点选择消耗较少能量的更好的路由。因此，要在节点度和能量效率之间进行权衡。在本文中，提出了一种可调结构，称为r {hbox {-}} {rm邻域}图，用于控制拓扑。该结构具有通过参数r 0 r r le 1在两个目标之间进行调整的灵活性。更明确地，对于n个节点的任何集合，最大节点度和功率拉伸因子可以通过一些递减和递减的方式从上方限制。 r的递增函数。具体而言，范围可以是r某些范围内的常数。更重要的是，r {hbox {-}} {rm近邻}图是RNG和GG的通用结构，这是拓扑控制中的两个众所周知的结构。与另一种著名的可调整结构YG_ {k}相比，我们的方法总是产生具有对称边的连接平面。为了构造这种结构，我们研究了一种名为PLA的本地化算法，该算法在构造过程中消耗较少的发射功率，并在O（nlog n）时间内有效执行。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号