Link Scheduling in Local Interference Models

Authors:
Bastian Katz;Markus Völker;Dorothea Wagner
Affiliations:
Faculty of Informatics, Universität Karlsruhe (TH),;Faculty of Informatics, Universität Karlsruhe (TH),;Faculty of Informatics, Universität Karlsruhe (TH),
Venue:
Algorithmic Aspects of Wireless Sensor Networks
Year:
2008

Citing 13
Cited 3

Locality in distributed graph algorithms

SIAM Journal on Computing
What Can Be Computed Locally?

SIAM Journal on Computing
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Comparison between graph-based and interference-based STDMA scheduling

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Models and approximation algorithms for channel assignment in radio networks

Wireless Networks
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring unstructured radio networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Sensor networks continue to puzzle: selected open problems

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Algorithmic models for sensor networks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The capacity of wireless networks

IEEE Transactions on Information Theory

Wireless Communication Is in APX

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Wireless scheduling with power control

ACM Transactions on Algorithms (TALG)
Adaptive instantiation of the protocol interference model in wireless networked sensing and control

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Choosing an appropriate interference model is crucial for link scheduling problems in sensor networks. While graph-based interference models allow for distributed and purely local coloring approaches which lead to many interesting results, a more realistic and widely agreed on model such as the signal-to-noise-plus-interference ratio (SINR) inherently makes scheduling radio transmission a non-local task, and thus impractical for the development of distributed and scalable scheduling protocols in sensor networks. In this work, we focus on interference models that are local in the sense that admissibility of transmissions only depends on local concurrent transmissions, and correct with respect to the geometric SINR model. In our analysis, we show lower bounds on the limitations that these restrictions impose an any such model as well as approximation results for greedy scheduling algorithms in a class of these models.