On k-connectivity for a geometric random graph
Random Structures & Algorithms
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Models and solutions for radio irregularity in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
A cross-layer approach to channel assignment in wireless ad hoc networks
Mobile Networks and Applications
| Hi-index | 0.00 |
To preserve network connectivity is an important issue especially in wireless ad hoc and sensor networks WASN, where wireless links are easy to be disturbed and tiny sensors are very easy to fail accidently. Therefore, it is necessary to design a fault-tolerant network. A feasible method is to construct a k-connected k-vertex connected topology. In this paper, we consider k-connectivity of wireless network and propose a simple global algorithm GAFTk which preserves the network k-connectivity and reduces the maximal transmission power TP. The average degree expectation of the topology generated by GAFTk is O k + 3² and the expected weight is Ok+3²12√πnnε Based on GAFTk, we further propose an efficient localised algorithm LAFTk which preserves k-vertex connectivity while maintaining bi-directionality of the network. In addition, both algorithms achieve significant reductions in energy consumption. Our simulation results show that GAFT/LAFT have better performance than some other current fault-tolerant protocols.