Algorithms for k-fault tolerant power assignments in wireless sensor networks

查看全文 作　　者：LIU Li 1,2,LI Lian 1,3 & HU Bin 1,4 1 School of Information Science and Engineering,Lanzhou University,Lanzhou 730000,China;2 LRI,Univ Paris-sud and CNRS,Orsay F-91405,France;3 School of Computer and Information,Hefei University of Technology,Hefei 230009,China;4 Department of Computing,Birmingham City University,Galton Building,Perry Barr,Birmingham B42 2SU,UK

出　　处：《Science China(Information Sciences)》索引2010年第53卷第12期,共11页

基　　金：supported by the National Natural Science Foundation of China (Grant No. 61003240);Gansu Provincial Science & Technology Department (Grant No. 1007RJYA010) 摘　　要：This paper addresses fault-tolerant many-to-many routing power assignments in heterogeneous wire-less sensor networks.We introduce the k-fault tolerant power assignments problem with the objective of assigning each sensor node transmission power such that(1) any pairwise sensor node is k-vertex connected and(2) the to-tal power consumption is minimized.We propose three solutions for this problem:two centralized algorithms,a greedy algorithm and an O(√n/ε)-approximation algorithm,and an h-hop distributed and localized algorithm.Related theorems and proofs are presented to prove the correctness of our approaches.Furthermore,simulation and experiment results are presented to verify the efficiency of our approaches. 关键词：功率分配算法无线传感器网络网络容错传感器节点传输功率分配问题功率消耗贪婪算法

相关文献

参考文献（13）
引证文献（5）
耦合文献（6）

参考文献(13)

引证文献(5)

耦合文献(6)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Algorithms for k-fault tolerant power assignments in wireless sensor networks

参考文献(13)

引证文献(5)

耦合文献(6)

用户提示