Performance limits of greedy maximal matching in multi-hop wireless networks

Changhee Joo, Xiaojun Lin, Ness B. Shroff

Research output: Chapter in Book/Report/Conference proceedingConference contribution

31 Citations (Scopus)

Abstract

In this paper, we characterize the performance limits of an important class of scheduling schemes, called Greedy Maximal Matching (GMM), for multi-hop wireless networks. For simplicity, we focus on the well-established node-exclusive interference model, although many of the stated results can be readily extended to more general interference models. The study of the performance of GMM is intriguing because although a lower bound on its performance is well known, empirical observations suggest that this bound is quite loose, and that the performance of GMM is often close to optimal. In fact, recent results have shown that GMM achieves optimal performance under certain conditions. In this paper, we provide new analytic results that characterize the performance of GMM through the topological properties of the underlying graphs. To that end, we generalize a recently developed topological notion called the local pooling condition to a far weaker condition called the σ-local pooling. We then define the local-pooling factor on a graph, as the supremum of all σ such that the graph satisfies σ-local pooling. We show that for a given graph, the efficiency ratio of GMM (i.e., the worst-case ratio of the throughput of GMM to that of the optimal) is equal to its local-pooling factor. Further, we provide results on how to estimate the local-pooling factor for arbitrary graphs and show that the efficiency ratio of GMM is no smaller than d* /(2d* - 1) in a network topology of maximum node-degree d*. We also identify a specific network topology for which the efficiency ratio of GMM is strictly less than 1.

Original languageEnglish
Title of host publicationProceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1128-1133
Number of pages6
ISBN (Print)1424414989, 9781424414987
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event46th IEEE Conference on Decision and Control 2007, CDC - New Orleans, LA, United States
Duration: 2007 Dec 122007 Dec 14

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference46th IEEE Conference on Decision and Control 2007, CDC
Country/TerritoryUnited States
CityNew Orleans, LA
Period07/12/1207/12/14

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Performance limits of greedy maximal matching in multi-hop wireless networks'. Together they form a unique fingerprint.

Cite this