Transmission Scheduling for CBR Traffic in Multihop Wireless Networks

Authors:
Maggie X. Cheng;Xuan Gong;Lin Cai;Ahmad Abdullah
Affiliations:
Department of Computer Science, Missouri University of Science and Technology, Rolla, MO 65401;Department of Computer Science, Missouri University of Science and Technology, Rolla, MO 65401;Department of Electrical and Computer Engineering, University of Victoria, Victoria, Canada BC V8W 3P6;Department of Electrical and Computer Engineering, University of Victoria, Victoria, Canada BC V8W 3P6
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 5
Cited 0

A new model for packet scheduling in multihop wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Comparison of routing metrics for static multi-hop wireless networks

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end performance and fairness in multihop wireless backhaul networks

Proceedings of the 10th annual international conference on Mobile computing and networking
A high-throughput path metric for multi-hop wireless routing

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In multihop wireless ad hoc networks, interference from transmissions on nearby links makes it difficult to predict available bandwidth and reserve bandwidth for Constant Bit Rate traffic. In this paper, we present a MAC layer scheme that supports constant bit rate traffic through transmission scheduling. The paper details the sufficient condition on bandwidth requirement, and presents a time slot assignment algorithm that assigns each link a number of slots proportional to the traffic load on itself. The theoretical analysis proves that the sufficient condition is indeed sufficient to provide a network-wide collision-free transmission schedule, and the time slot assignment algorithm can completely avoid the hidden and exposed terminal problems. Through extensive simulations, we verified that a TDMA scheme serves much better than a random, contention-based scheme in the context of maximizing network throughput and providing guaranteed end-to-end data rate.