Opportunistic medium access for wireless networking adapted to decentralized CSI

Yingqun Yu; Georgios B Giannakis

doi:10.1109/TWC.2006.1638665

Opportunistic medium access for wireless networking adapted to decentralized CSI

Yingqun Yu, Georgios B Giannakis

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

35 Scopus citations

Abstract

Relative to a centralized operation, opportunistic medium access capitalizing on decentralized multiuser diversity in a channel-aware homogeneous slotted Aloha system with analog-amplitude channels has been shown to incur only partial loss in throughput due to contention. In this context, we provide sufficient conditions for stability as well as upper bounds on average queue sizes, and address three equally important questions. The first one is whether there exist decentralized scheduling algorithms for homogeneous users with higher throughputs than available ones. We prove that binary scheduling maximizes the sum-throughput. The second issue pertains to heterogeneous systems where users may have different channel statistics. Here we establish that binary scheduling not only maximizes the sum of the logs of the average throughputs, but also asymptotically guarantees fairness among users. The last issue we address is extending the results to finite state Markov chain (FSMC) channels. We provide a convex formulation of the corresponding throughput optimization problem, and derive a simple binarylike access strategy.

Original language	English (US)
Article number	1638665
Pages (from-to)	1445-1455
Number of pages	11
Journal	IEEE Transactions on Wireless Communications
Volume	5
Issue number	6
DOIs	https://doi.org/10.1109/TWC.2006.1638665
State	Published - Jun 2006

Bibliographical note

Funding Information:
Manuscript received May 7, 2004; revised October 25, 2004 and March 9, 2005; accepted May 6, 2005. The editor coordinating the review of this paper and approving it for publication was J. Zhang. Work in this paper was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. Part of the work in this paper was presented at the GLOBECOM Conf., Dallas, TX, November 29-December 3, 2004.

Keywords

Decentralized multiuser diversity
Fairness
Maximum stable throughput
Scheduling
Slotted aloha
Stability

Publisher link

10.1109/TWC.2006.1638665

Find It

Find It at U of M Libraries

Cite this

@article{ec4959cb621341beaac4c05b7e219053,

title = "Opportunistic medium access for wireless networking adapted to decentralized CSI",

abstract = "Relative to a centralized operation, opportunistic medium access capitalizing on decentralized multiuser diversity in a channel-aware homogeneous slotted Aloha system with analog-amplitude channels has been shown to incur only partial loss in throughput due to contention. In this context, we provide sufficient conditions for stability as well as upper bounds on average queue sizes, and address three equally important questions. The first one is whether there exist decentralized scheduling algorithms for homogeneous users with higher throughputs than available ones. We prove that binary scheduling maximizes the sum-throughput. The second issue pertains to heterogeneous systems where users may have different channel statistics. Here we establish that binary scheduling not only maximizes the sum of the logs of the average throughputs, but also asymptotically guarantees fairness among users. The last issue we address is extending the results to finite state Markov chain (FSMC) channels. We provide a convex formulation of the corresponding throughput optimization problem, and derive a simple binarylike access strategy.",

keywords = "Decentralized multiuser diversity, Fairness, Maximum stable throughput, Scheduling, Slotted aloha, Stability",

author = "Yingqun Yu and Giannakis, {Georgios B}",

note = "Funding Information: Manuscript received May 7, 2004; revised October 25, 2004 and March 9, 2005; accepted May 6, 2005. The editor coordinating the review of this paper and approving it for publication was J. Zhang. Work in this paper was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. Part of the work in this paper was presented at the GLOBECOM Conf., Dallas, TX, November 29-December 3, 2004.",

year = "2006",

month = jun,

doi = "10.1109/TWC.2006.1638665",

language = "English (US)",

volume = "5",

pages = "1445--1455",

journal = "IEEE Transactions on Wireless Communications",

issn = "1536-1276",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Opportunistic medium access for wireless networking adapted to decentralized CSI

AU - Yu, Yingqun

AU - Giannakis, Georgios B

N1 - Funding Information: Manuscript received May 7, 2004; revised October 25, 2004 and March 9, 2005; accepted May 6, 2005. The editor coordinating the review of this paper and approving it for publication was J. Zhang. Work in this paper was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U. S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. The U. S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. Part of the work in this paper was presented at the GLOBECOM Conf., Dallas, TX, November 29-December 3, 2004.

PY - 2006/6

Y1 - 2006/6

N2 - Relative to a centralized operation, opportunistic medium access capitalizing on decentralized multiuser diversity in a channel-aware homogeneous slotted Aloha system with analog-amplitude channels has been shown to incur only partial loss in throughput due to contention. In this context, we provide sufficient conditions for stability as well as upper bounds on average queue sizes, and address three equally important questions. The first one is whether there exist decentralized scheduling algorithms for homogeneous users with higher throughputs than available ones. We prove that binary scheduling maximizes the sum-throughput. The second issue pertains to heterogeneous systems where users may have different channel statistics. Here we establish that binary scheduling not only maximizes the sum of the logs of the average throughputs, but also asymptotically guarantees fairness among users. The last issue we address is extending the results to finite state Markov chain (FSMC) channels. We provide a convex formulation of the corresponding throughput optimization problem, and derive a simple binarylike access strategy.

AB - Relative to a centralized operation, opportunistic medium access capitalizing on decentralized multiuser diversity in a channel-aware homogeneous slotted Aloha system with analog-amplitude channels has been shown to incur only partial loss in throughput due to contention. In this context, we provide sufficient conditions for stability as well as upper bounds on average queue sizes, and address three equally important questions. The first one is whether there exist decentralized scheduling algorithms for homogeneous users with higher throughputs than available ones. We prove that binary scheduling maximizes the sum-throughput. The second issue pertains to heterogeneous systems where users may have different channel statistics. Here we establish that binary scheduling not only maximizes the sum of the logs of the average throughputs, but also asymptotically guarantees fairness among users. The last issue we address is extending the results to finite state Markov chain (FSMC) channels. We provide a convex formulation of the corresponding throughput optimization problem, and derive a simple binarylike access strategy.

KW - Decentralized multiuser diversity

KW - Fairness

KW - Maximum stable throughput

KW - Scheduling

KW - Slotted aloha

KW - Stability

UR - http://www.scopus.com/inward/record.url?scp=33744534485&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744534485&partnerID=8YFLogxK

U2 - 10.1109/TWC.2006.1638665

DO - 10.1109/TWC.2006.1638665

M3 - Article

AN - SCOPUS:33744534485

VL - 5

SP - 1445

EP - 1455

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 6

M1 - 1638665

ER -

Opportunistic medium access for wireless networking adapted to decentralized CSI

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this