On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks

In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the constraint that each path operates on a separate channel to maximise the fault tolerance and robustness against channel instability and malic...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 695; pp. 74 - 82
Main Authors:	Zhang, Shurong, Chen, Lin, Yang, Weihua
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 26.09.2017 Elsevier
Subjects:	Computer Science Fully polynomial-time approximation algorithms Multi-channel wireless networks Vertex- and channel-disjoint paths Multi-channel wireless networks Vertex- and channel-disjoint paths Fully polynomial-time approximation algorithms
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the constraint that each path operates on a separate channel to maximise the fault tolerance and robustness against channel instability and malicious attacks. Meanwhile, the quality of service (QoS) requirement (e.g., in terms of end-to-end delay) needs to be satisfied on each path. In this paper, we provide a comprehensive formulation and analysis on this multi-path optimization problem by casting it to the problem k-disjoint path with different colours (k-DPDC). We further formulate the Restricted MinSum k-DPDC and Restricted MinMax k-DPDC to denote the problems of finding multiple node- and channel-disjoint paths minimising the global cost and the maximum individual path cost under the QoS constraint on the path end-to-end delay. Given the NP-hardness of both problems, we focus on directed acyclic graphs and propose fully polynomial-time approximation algorithms for both problems. •We maximise the fault tolerance and robustness against channel instability.•We aim at how to seek node- and channel-disjoint paths satisfying the QoS constraint.•We consider two performance metrics, the sum and the maximum cost of the paths.•In a DAG, we propose fully polynomial-time approximation algorithms for the problems.
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2017.07.027