An optimal topology-transparent scheduling method in multihoppacket radio networks
Ji-Her Ju
Li, V.O.K.
Chung Shan Inst. of Sci. & Technol., Lung-Tan ;
This paper appears in: Networking, IEEE/ACM Transactions on
Publication Date: Jun 1998
Volume: 6,
Issue: 3
On page(s): 298-306
ISSN: 1063-6692
References Cited: 16
CODEN: IEANEP
INSPEC Accession Number: 5951843
Digital Object Identifier: 10.1109/90.700893
Current Version Published: 2002-08-06
Abstract
Many transmission scheduling algorithms have been proposed to
maximize the spatial reuse and minimize the time-division
multiple-access (TDMA) frame length in multihop packet radio networks.
Almost all existing algorithms assume exact network topology information
and do not adapt to different traffic requirements. Chlamtac and Farago
(1994) proposed a topology-transparent algorithm. Following their
approach, but with a different design strategy, we propose another
algorithm which is optimal in that it maximizes the minimum throughput.
We compare our algorithm with that of Chlamtac and Farago's and with the
TDMA algorithm, and find that it gives better performance in terms of
minimum throughput and minimum and maximum delay times. Our algorithm
requires estimated values of the number of nodes and the maximum nodal
degree in the network. However, we show that the performance of our
algorithm is insensitive to these design parameters
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
