Multiflows in multihop wireless networks

Authors:
Peng-Jun Wan
Affiliations:
Illinois Institute of Technology, Chicago, IL, USA
Venue:
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Year:
2009

Citing 21
Cited 10

A study on two geometric location problems

Information Processing Letters
Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Randomized metarounding (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for geometric graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Packing Steiner trees

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximate strong separation with application in fractional graph coloring and preemptive scheduling

Theoretical Computer Science
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem

Proceedings of the 9th annual international conference on Mobile computing and networking
Algorithmic aspects of capacity in wireless networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
An efficient approximation scheme for the one-dimensional bin-packing problem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Better approximation schemes for disk graphs

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A robust PTAS for maximum weight independent sets in unit disk graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A (1-1/e)-approximation algorithm for the generalized assignment problem

Operations Research Letters
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
Improved throughput bounds for interference-aware routing inwireless networks

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Capacity region of a wireless mesh backhaul network over the CSMA/CA MAC

INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximate capacity subregions of uniform multihop wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Longest-queue-first scheduling under SINR interference model

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Approximation algorithms for secondary spectrum auctions

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Real-Time video streaming in multi-hop wireless static ad hoc networks

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Multi-hop routing and scheduling in wireless networks in the SINR model

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Secondary spectrum auctions for symmetric and submodular bidders

Proceedings of the 13th ACM Conference on Electronic Commerce
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks

Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
On max-min fair flow optimization in wireless mesh networks

Ad Hoc Networks
Approximation algorithms for throughput maximization in wireless networks with delay constraints

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies maximum multicommodity flow and maximum concurrent flow in multihop wireless networks subject to both bandwidth and interference constraints. The existing proof of the NP-hardness of both problems is too contrived to be applicable to meaningful multihop wireless networks. In addition, all known constant-approximation algorithms for both problems restricted to various network classes are super-exponential in running time. Some of them are simply incorrect. In this paper, we first provide a rigorous proof of the NP-hardness of both problems even in very simple settings. Then, we show that both problems restricted to a broad family of multihop wireless networks admit polynomial-time approximation scheme (PTAS). After that, we develop a unified framework for the design and analysis of polynomial approximation algorithms for both problems. Following such framework, we obtain polynomial constant-approximation algorithms for both problems restricted to a broad network family. The approximation ratios of these algorithms are also better than those known in the literature.