How Optimal are Wireless Scheduling Protocols?

DMCA

How Optimal are Wireless Scheduling Protocols? (2007)

Cached

Download Links

by Thomas Moscibroda , Yvonne Anne Oswald , Roger Wattenhofer

Venue:	IN: PROC. OF THE 26 TH ANNUAL JOINT CONF. OF THE IEEE COMPUTER AND COMMUNICATIONS SOCIETIES (INFOCOM
Citations:	34 - 1 self

BibTeX

@INPROCEEDINGS{Moscibroda07howoptimal,
    author = {Thomas Moscibroda and Yvonne Anne Oswald and Roger Wattenhofer},
    title = { How Optimal are Wireless Scheduling Protocols?},
    booktitle = {IN: PROC. OF THE 26 TH ANNUAL JOINT CONF. OF THE IEEE COMPUTER AND COMMUNICATIONS SOCIETIES (INFOCOM},
    year = {2007},
    publisher = {}
}

OpenURL

Abstract

In wireless networks mutual interference impairs the quality of received signals and might even prevent the correct reception of messages. It is therefore of paramount importance to dispose of power control and scheduling algorithms, coordinating the transmission of communication requests. We propose a new measure disturbance in order to comprise the intrinsic difficulty of finding a short schedule for a problem instance. Previously known approaches suffer from extremely bad performance in certain network scenarios even if disturbance is low. To overcome this problem, we present a novel scheduling algorithm for which we give analytical worst-case guarantees on its performance. Compared to previously known solutions, the algorithm achieves a speed up, which can be exponential in the size of the network.

Keyphrases

wireless scheduling protocol bad performance problem instance analytical worst-case guarantee power control communication request short schedule new measure disturbance wireless network mutual interference novel scheduling algorithm correct reception certain network scenario intrinsic difficulty paramount importance

DMCA