An augmented graph-based coloring scheme to derive upper bounds for the performance of distributed schedulers in CSMA-based mbile ad hoc networks

Authors:
Benedito J. B. Fonseca, Jr.
Affiliations:
Motorola Labs, Schaumburg, IL
Venue:
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Year:
2006

Citing 5
Cited 0

Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
Comparison between graph-based and interference-based STDMA scheduling

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Impact of interference on multi-hop wireless network performance

Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph theory and its graph coloring schemes have been used as tools for deriving upper bounds for the performance of distributed schedulers in Mobile Ad Hoc Networks (MANET). In the context of Spatial-TDMA MANETs, studies have shown that such schemes can generate invalid schedules since they don't take into account the aggregate interference in the radio channel. Focusing on CSMA-based MANETs, such conclusions suggest that graph coloring schemes would generate too loose upper bounds. This paper proposes an augmented graph-based model that circumvents the problems highlighted in previous studies and is able to generate a tighter upper bound. We exemplify the use of the model by generating upper bounds for the performance of the distributed scheduler of 802.11b-based MANETs.