DocumentCode :
1727106
Title :
Scheduling in packet radio networks-a new approach
Author :
Sen, Arunabha ; Capone, Jeffrey M.
Author_Institution :
Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA
fYear :
1999
fDate :
6/21/1905 12:00:00 AM
Firstpage :
650
Abstract :
In the broadcast schedule construction problem in a radio network, a frame of minimum length provides every transceiver an opportunity for transmission after least amount delay. However, such a frame does not necessarily maximize the network throughput. The network throughput can be increased by choosing a frame of suboptimal length, although in this situation the throughput of some of the individual transceivers might decrease. We present a schedule construction scheme that takes into account the interests of the network as well as the individual transceivers and finds a balance between the two conflicting interests. The objective of this scheme is to maximize the network throughput without a significant adverse impact on the performance of individual transceivers. This scheme guarantees a network throughput that is at least as large as in the traditional scheduling schemes using the minimum length frame
Keywords :
access protocols; delays; packet radio networks; time division multiple access; transceivers; TDMA; broadcast schedule construction problem; minimum length frame; network nodes; network throughput; packet radio networks; performance; protocols; scheduling schemes; suboptimal length frame; transceiver; transmission delay; Intelligent networks; Interference; Multiaccess communication; Optimal scheduling; Packet radio networks; Processor scheduling; Protocols; Throughput; Time division multiple access; Transceivers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 1999. GLOBECOM '99
Conference_Location :
Rio de Janeireo
Print_ISBN :
0-7803-5796-5
Type :
conf
DOI :
10.1109/GLOCOM.1999.830135
Filename :
830135
Link To Document :
بازگشت