Dynamic global packet routing in wireless networks

Author

Kahale, Nabil ; Wright, Paul E.

Author_Institution

AT&T Labs. Res., Murray Hill, NJ, USA

Volume

3

fYear

1997

fDate

7-12 Apr 1997

Firstpage

1414

Abstract

We consider schemes for reuse-efficient packet access in wireless data networks. We show that computing the maximum ergodic packet arrival rate is NP-hard. We give an upper bound on the maximum ergodic throughput in terms of the eigenvalues of matrices related to the path-gain matrix. We present simple, practical heuristic algorithms which exhibit good throughput and packet delay and report on results of preliminary simulations. More sophisticated algorithms that yield optimal throughput are also presented. A recent result of McKeown, Anantharam and Walrand (1996) on scheduling of input-queued switches is obtained as a by-product

Keywords

data communication; eigenvalues and eigenfunctions; matrix algebra; packet radio networks; scheduling; telecommunication network routing; dynamic global packet routing; eigenvalues; heuristic algorithms; input-queued switches; maximum ergodic packet arrival rate; maximum ergodic throughput; optimal throughput; packet delay; path-gain matrix; reuse-efficient packet access; scheduling; upper bound; wireless data networks; wireless networks; Access protocols; Asynchronous transfer mode; Intelligent networks; Multiaccess communication; Quality of service; Routing; Switches; Throughput; Wireless application protocol; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE

Conference_Location

Kobe

ISSN

0743-166X

Print_ISBN

0-8186-7780-5

Type

conf

DOI

10.1109/INFCOM.1997.631182

Filename

631182