h-Hop Distributed and Localized Algorithm for Fault Tolerant Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have emerged as a new information gathering paradigm based on the collaborative effort of a large number of sensing nodes. Sensor nodes in such environments are unstable to provide services. Hence, fault tolerant is necessary for a WSN to guarantee the sensor nodes communicate with the end-users to provide information. In this paper, we consider the problem of communication range assignments for every sensor nodes while providing a k-fault tolerant WSN. We introduce a distributed and localized algorithm for solving the range assignment problem for which the total transmission power for all sensors is minimized while maintaining k-vertex disjoint paths between any pair of sensor nodes. We consider a general model of h-hop message forwarding of sensor nodes. And we also analyze the execution time complexity and the average throughput of the algorithm.
Li Liu Lian Li
School of Mathematics,Lanzhou University,P.R.China;Department of Computer Science,Lanzhou University Department of Computer Science,Lanzhou University,P.R.China
国际会议
The First IEEE International Conference on Ubi-Media Coputing and Workshops(第一届泛媒体处理国际会议)
兰州
英文
2008-07-15（万方平台首次上网日期，不代表论文的发表时间）