首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Localized topology control for unicast and broadcast in wireless ad hoc networks
【24h】

Localized topology control for unicast and broadcast in wireless ad hoc networks

机译:无线ad hoc网络中单播和广播的本地化拓扑控制

获取原文
获取原文并翻译 | 示例

摘要

We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We theoretically prove that the proposed topology is planar, which meets the requirement of certain localized routing methods to guarantee packet delivery; it is power-efficient for unicast - the energy needed to connect any pair of nodes is within a small constant factor of the minimum; it is also asymptotically optimum for broadcast - the energy consumption for broadcasting data on top of it is asymptotically the best among all structures constructed using only local information; it has a constant bounded logical degree, which will potentially save the cost of updating routing tables if used. We further prove that the expected average physical degree of all nodes is a small constant. To the best of our knowledge, this is the first localized topology-control strategy for all nodes to maintain a structure with all these desirable properties. Previously, only a centralized algorithm was reported. Moreover, by assuming that the node ID and its position can be represented in O(log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of theoretical results are corroborated in the simulations.
机译:我们为每个无线节点提出了一种新颖的局部拓扑控制算法,以在本地选择通信邻居并相应地调整其传输功率,以使所有节点共同形成一个同时为单播和广播通信高效节能的拓扑。从理论上我们证明了所提出的拓扑是平面的,可以满足某些局部路由方法的要求,以保证报文的传递;单播具有高能效-连接任何一对节点所需的能量都在最小值的很小的恒定因数之内;对于广播来说,它也是渐近最优的-在仅使用本地信息构建的所有结构中,广播数据所消耗的能量在所有之上都是渐近最好的;它具有恒定的有界逻辑度,如果使用它可以潜在地节省更新路由表的成本。我们进一步证明,所有节点的预期平均物理程度是一个小的常数。据我们所知,这是所有节点维护具有所有这些理想属性的结构的第一个本地化拓扑控制策略。以前,只报告了集中式算法。此外,通过假设节点ID及其位置可以用n个节点的无线网络的O(log n)位表示,通过我们的方法得出的消息总数在理论结果的范围内得到了仿真的证实。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号