Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks

Authors:
Deying Li;Qinghua Zhu;Huiqiang Yang
Affiliations:
School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE,;School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE,;School of Information, Renmin University of China, Beijing, China and Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE,
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 10
Cited 1

Improved approximation algorithms for uniform connectivity problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
Algorithmic aspects of topology control problems for ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum energy disjoint path routing in wireless ad-hoc 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
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks

IEEE Transactions on Mobile Computing
FLSS: a fault-tolerant topology control algorithm for wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Algorithmic aspects of topology control problems for ad hoc networks

Mobile Networks and Applications
Energy efficient multicast routing in ad hoc wireless networks

Computer Communications
Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks

IEEE Transactions on Mobile Computing

Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of fault-tolerant many-to-one routing in static wireless networks with asymmetric links, which is important in both theoretical and practical aspects. The problem is to find a minimum energy subgraph for a given subset and a destination node such that there are k node-disjoint paths from each node in the subset to the destination node in the subgraph. We prove that the problem is NP-hard, and propose two efficient heuristic approaches, namely, the minimum weight k node-disjoint paths based (MWkNDPB) approach and the minimum energy k node-disjoint paths based (MEkNDPB) approach. Extensive simulations have been conducted to show that proposed algorithms are efficient.