Parameterized complexity of Min-power multicast problems in wireless ad hoc networks

Authors:
Jianxin Wang;Weizhong Luo;Qilong Feng;Jiong Guo
Affiliations:
School of Information Science and Engineering, Central South University, Changsha 410083, PR China;School of Information Science and Engineering, Central South University, Changsha 410083, PR China and Hunan Financial & Economic University, Changsha 410205, PR China;School of Information Science and Engineering, Central South University, Changsha 410083, PR China;Universität des Saarlandes, Campus E 1.7, D-66123 Saarbrücken, Germany
Venue:
Theoretical Computer Science
Year:
2013

Citing 14
Cited 0

Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
The Power Range Assignment Problem in Radio Networks on the Plane

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the parameterized complexity of multiple-interval graph problems

Theoretical Computer Science
The investigation of delay-constrained multicasting with minimum-energy consumption in static ad hoc wireless networks

International Journal of Ad Hoc and Ubiquitous Computing
On problems without polynomial kernels

Journal of Computer and System Sciences
Minimum-energy all-to-all multicasting in wireless ad hoc networks

IEEE Transactions on Wireless Communications
Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Minimum-energy broadcast with few senders

DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Kernelization hardness of connectivity problems in d-degenerate graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
The min-power multicast problems in wireless ad hoc networks: a parameterized view

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	5.23

Visualization

Abstract

Power assignment in wireless ad hoc networks can be seen as a family of problems in which the task is to find in a given power requirement network a minimum power communication subnetwork that satisfies a given connectivity constraint. These problems have been extensively studied from the viewpoint of approximation, heuristic, linear programming, etc. In this paper, we add a new facet by initiating a systematic parameterized complexity study of three types of power assignment problems related to multicast: Min-power Single-source h-Multicast, Min-power Strongly Connected h-Multicast and Min-power Multi-source h-Multicast. We investigate their parameterized complexities with respect to the number of terminals and the number of senders. We show that a Min-power Single-source h-Multicast is fixed-parameter tractable with respect to the number of terminals and achieve several parameterized hardness results.