| 1 | Algorithms for k-fault tolerant power assignments in wireless sensor networks显示文摘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. | 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 | 2010 | Science China(Information Sciences)2010，53，12： | 5 |
您所在的机构暂未开通此部分的功能，请联系管理员