Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Wireless information networks
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Fault-tolerant broadcasting in radio networks
Journal of Algorithms
Maintaining a Minimum Spanning Tree Under Transient Node Failures
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
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
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
How to swap a failing edge of a single source shortest paths tree
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Range augmentation problems in static ad-hoc wireless networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
Given a communication network undergoing a transient component failure, a swap algorithm provides the maintenance of the network functionality by means of a minimum number of adjustments. Swap algorithms have recently received growing attention for managing transient failures in classic wired networks, due to their practical usefulness. In this paper, we propose efficient swap algorithms to guarantee survivability in a linear radio communication network undergoing transient station failures. More precisely, given an optimal range assignment for a set of n stations with bases spread on a line, and a bounded number of hops h, we show that, as a consequence of a single non-base station failure, the network survivability can always be guaranteed through a minimum number of adjustments, i.e., by updating either of one station in O(hlogn) time, or two stations in O(n) time, or three stations in O(hn) time, all using O(n) space, depending on the structure of the network around the failed station. Furthermore, our swap algorithms identifies the best network reconfiguration in terms of the additional required power.