首页> 外文期刊>Journal of Parallel and Distributed Computing >A new distributed topology control algorithm based on optimization of delay and energy in wireless networks
【24h】

A new distributed topology control algorithm based on optimization of delay and energy in wireless networks

机译:一种基于时延和能量优化的无线网络分布式拓扑控制算法

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

摘要

Topology Control (TC) is one of the most important techniques used in wireless networks to obtain the desired network property. Most existing works with regard to TC focus on reducing energy consumption. Even though there are some works to consider delay in their resulting topologies, they do not consider the effect of radio interference on delay. Aiming at wireless sensor networks, we model a link delay as a function of the signal to interference noise ratio of the receiving node in this link and its packet forwarding time, and take a weight sum of delay and energy consumption as weight of edge (or link). The minimum weight sum of any edge can be solved by using the Getjnin-cost_of_edge_(i. j) algorithm proposed in this paper. An Optimal Edge-cost Topology Control (OETC) algorithm is proposed to ensure that all approximate minimum-edge-cost paths exist in final topology. We also propose a Distributed Symmetric Link Maintenance (DSLM) algorithm to ensure that all links are symmetric in final topology if all links in original topology are symmetric. We prove that the communication complexity and computational complexity in OETC + DLSM are O(N_u) and O(N_e * N~2_u) respectively, where N_u denotes the number of any node u's neighbors and N_e denotes the times of executing the Get_min-cost_of_edge_(i, j) algorithm. Furthermore, we verify through simulation that the network topologies produced by OETC + DLSM show good performance in terms of expected average link delay and node hop-count while keeping average energy consumption at an acceptable level.
机译:拓扑控制(TC)是无线网络中用于获取所需网络属性的最重要技术之一。现有的有关TC的大多数工作都集中在降低能耗上。即使有一些工作考虑了其结果拓扑中的延迟,但他们并未考虑无线电干扰对延迟的影响。针对无线传感器网络,我们将链路延迟建模为该链路中接收节点的信号干扰噪声比及其数据包转发时间的函数,并将延迟和能耗的权重之和作为边的权重(或链接)。可以使用本文提出的Getjnin-cost_of_edge_(i.j)算法求解任意边缘的最小权重和。为了确保最终拓扑中存在所有近似的最小边缘成本路径,提出了一种最佳边缘成本拓扑控制算法。我们还提出了一种分布式对称链路维护(DSLM)算法,以确保如果原始拓扑中的所有链路都是对称的,则所有链路在最终拓扑中都是对称的。我们证明OETC + DLSM中的通信复杂度和计算复杂度分别为O(N_u)和O(N_e * N〜2_u),其中N_u表示u的任何节点的邻居数,N_e表示执行Get_min-cost_of_edge_的次数(i,j)算法。此外,我们通过仿真验证了OETC + DLSM产生的网络拓扑在预期平均链路延迟和节点跳数方面表现出良好的性能,同时将平均能耗保持在可接受的水平。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号