Fault-Tolerant Dual Power Management in Wireless Sensor Networks

Chen Wang, M. Park, James Willson, A. Faragó, D. Du
{"title":"Fault-Tolerant Dual Power Management in Wireless Sensor Networks","authors":"Chen Wang, M. Park, James Willson, A. Faragó, D. Du","doi":"10.1109/GLOCOM.2008.ECP.91","DOIUrl":null,"url":null,"abstract":"How to adjust the transmission power at each node to achieve global energy efficiency while maintaining the network connectivity, referred as power management problem, is the major target of various topology control technologies. Moreover, fault tolerance which is often modeled as 2-edge or 2-vertex connectivity is another desired feature in many applications. In this paper, we study the fault tolerant dual power assignment problem. With the assumption of dual universal transmission power levels, we aim to minimize the total number of nodes assigned to high power level such that the resultant network topology is 2-edge or 2-vertex connected. As the problems are NP-hard, we design a novel algorithm to compute nearly-optimal solutions. From the theoretical perspective, we prove that our algorithm can guarantee 3.67-approximation for both 2-edge connectivity and 2-vertex connectivity, which improves the existing best approximation algorithm. We also conduct some numerical experiments which show that results of our algorithm are at most 2 times of optimal solutions in average and have significant improvements compared to that of existing algorithm.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2008.ECP.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

How to adjust the transmission power at each node to achieve global energy efficiency while maintaining the network connectivity, referred as power management problem, is the major target of various topology control technologies. Moreover, fault tolerance which is often modeled as 2-edge or 2-vertex connectivity is another desired feature in many applications. In this paper, we study the fault tolerant dual power assignment problem. With the assumption of dual universal transmission power levels, we aim to minimize the total number of nodes assigned to high power level such that the resultant network topology is 2-edge or 2-vertex connected. As the problems are NP-hard, we design a novel algorithm to compute nearly-optimal solutions. From the theoretical perspective, we prove that our algorithm can guarantee 3.67-approximation for both 2-edge connectivity and 2-vertex connectivity, which improves the existing best approximation algorithm. We also conduct some numerical experiments which show that results of our algorithm are at most 2 times of optimal solutions in average and have significant improvements compared to that of existing algorithm.
无线传感器网络中的容错双电源管理
如何在保持网络连通性的同时,调整各节点的传输功率以达到全局能效,即电源管理问题,是各种拓扑控制技术研究的主要目标。此外,容错性(通常建模为2边或2顶点连接)是许多应用程序中需要的另一个特性。本文研究了容错对偶功率分配问题。在双通用传输功率水平的假设下,我们的目标是最小化分配给高功率水平的节点总数,从而使所得网络拓扑是2边或2顶点连接的。由于问题是np困难的,我们设计了一种新的算法来计算近最优解。从理论角度证明了我们的算法对2边连通性和2顶点连通性都能保证3.67逼近,改进了现有的最佳逼近算法。我们还进行了一些数值实验,结果表明,我们的算法的结果平均最多是最优解的2倍,与现有算法相比有明显的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信