Low complexity stable link scheduling for maximizing throughput in wireless networks

  • Authors:
  • ShaoJie Tang;Xiaobing Wu;Xufei Mao;YanWei Wu;Ping Xu;GuiHai Chen;Xiang-Yang Li

  • Affiliations:
  • Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, NanJing University, NanJing, China;Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, NanJing University, NanJing, China;Department of Computer Science, Illinois Institute of Technology, Chicago, IL

  • Venue:
  • SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents novel distributed algorithms for scheduling transmissions in multi-hop wireless networks. Our algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. Two classes of algorithms are designed: one assumes that the location information of all wireless nodes are known, and the other does not. Both classes of algorithms are parameterized by an integer k (called algorithm-k). We show that algorithm-k that uses geometry location achieves (1 - 2/k)2 of the capacity region, for every k ≥ 3; algorithm-k which does not use geometry location achieves 1/ρ of the capacity region, for every k ≥ 3 and a constant ρ depending on k. Our algorithms have small worst-case overheads. Both classes of algorithms can generate a new schedule by requiring communications within Θ(k) hops for every node, which can be implemented by letting each node transmit at most O(k) messages. The parameter k explicitly captures the tradeoff between control overhead and the throughput performance of any scheduler. Additionally, the class of algorithms with known geometry location of nodes can find a new schedule in time Θ(k2 Δ), where Δ is the minimum mini-time-slots such that each of the n nodes can communicate with its neighbors once, which is the minimum time-slots required by any scheduling algorithm.