End-to-end packet-scheduling in wireless ad-hoc networks

Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we study packet routing and scheduling under this model of interference. The main focus of our work is the development of fully-distributed (decentralized) protocols. We present polylogarithmic/constant factor approximation algorithms for various families of disk graphs (which capture the geometric nature of wireless-signal propagation), as well as near-optimal approximation algorithms for general graphs. A basic distributed coloring procedure, originally due to Luby (Journal of Computer and System Sciences, 47:250

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
• Keywords: Algorithms, Approximation Algorithms, Disk Graphs, Distance-2 Interference Model, SODA 2004