首页> 外文会议> >Network Lifetime Optimization by Duality Approach for Single-Source and Single-Sink Topology in Wireless Sensor Networks
【24h】

Network Lifetime Optimization by Duality Approach for Single-Source and Single-Sink Topology in Wireless Sensor Networks

机译:无线传感器网络中单源单宿拓扑通过对偶方法进行网络生存期优化

获取原文

摘要

The single-source and single-sink (SSSS) topology, in wireless sensor networks, is defined as the network topology, where every node behaves as a relaying node except the single source and the single sink. We consider the problem of finding a joint optimal scheme with consideration of physical, medium access control (MAC), and network layers to maximize the network lifetime (NL) for the SSSS topology in energy-constrained wireless sensor networks (WSNs). The optimization problem, when the communication link are restricted to an interference-free time division multiple access (TDMA) scheme, can be formulated as a mixed integer-convex programming and relaxed to the convex programming. In particular, this paper focuses on utilizing the Karush-Kuhn-Tucker (KKT) optimization conditions to analytically solve this convex problem for the SSSS linear topology. An analytical expression of upper bound on NL for cross-layer optimization is derived as a function of the initial energy and quantities of data held by the sources, taking the influence of data rates, link access method and routing into account. The result agrees well with numerical result of optimization solver, and can be applied to algorithms in WSNs aiming at maximizing NL.
机译:无线传感器网络中的单源和单槽(SSSS)拓扑被定义为网络拓扑,其中每个节点都表现为除单个源和单个接收器之外的中继节点。我们考虑通过考虑物理,媒体访问控制(MAC)和网络层找到关节最佳方案的问题,以最大化用于在能量受限的无线传感器网络(WSN)中的SSSS拓扑的网络寿命(NL)。优化问题,当通信链路被限制为无干扰时分多址(TDMA)方案时,可以配制为混合整数 - 凸编程并放松到凸编程。特别是,本文侧重于利用Karush-Kuhn-Tucker(KKT)优化条件来分析SSSS线性拓扑的这种凸面问题。作为源源的初始能量和数量的次数,导出了NL上限的分析表达,从而源源,采取数据速率,链接访问方法和路由的影响。结果与优化求解器的数值结果很好,并且可以应用于旨在最大化NL的WSN中的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号