BROWSE

Related Researcher

Author's Photo

Joo, Changhee
Learning, Modeling, and Networking
Research Interests
  • Learning, modeling, networking, resource allocation, stochastic optimization, distributed computing, low complexity

ITEM VIEW & DOWNLOAD

Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model

Cited 15 times inthomson ciCited 24 times inthomson ci
Title
Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model
Author
Joo, ChangheeLin, XiaojunShroff, Ness B.
Keywords
Efficiency ratio; greedy maximal matching (GMM); local-pooling factor; wireless scheduling
Issue Date
2009-12
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, v.54, no.12, pp.2734 - 2744
Abstract
Greedy Maximal Matching (GMM) is an important scheduling scheme for multi-hop wireless networks. It is computationally simple, and has often been numerically shown to achieve throughput that is close to optimal. However, to date the performance limits of GMM have not been well understood. In particular, although a lower bound on its performance has been well known, this bound has been empirically found to be quite loose. In this paper, we focus on the well-established node-exclusive interference model and provide new analytical results that characterize the performance of GMM through a topological notion called the local-pooling factor. We show that for a given network graph with single-hop traffic, 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 estimate the local-pooling factor for arbitrary network graphs under the node-exclusive interference model and show that the efficiency ratio of GMM is no smaller than d*/2d* - 1 in a network topology of maximum node-degree. Using these results, we identify specific network topologies for which the efficiency ratio of GMM is strictly less than 1. We also extend the results to the more general scenario with multi-hop traffic, and show that GMM can achieve similar efficiency ratios when a flow-regulator is used at each hop.
URI
Go to Link
DOI
10.1109/TAC.2009.2031719
ISSN
0018-9286
Appears in Collections:
EE_Journal Papers
Files in This Item:
000272601600002.pdf Download

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qrcode

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU