DocumentCode :
1970255
Title :
Heuristic scheduling strategies for multihop radio networks with regular structure
Author :
Chandra, Sudesh ; Robertazzi, Thomas G.
Author_Institution :
Dept. of Electr. Eng., State Univ, of New York, Stony Brook, NY, USA
fYear :
1988
fDate :
12-15 June 1988
Firstpage :
437
Abstract :
The performance of scheduling strategies for a Manhattan-mesh-type network is examined. Efficient routing of packets in this class of networks makes scheduling the links an important criteria for the design of such communication networks and protocols. Graph theory is used to obtain bounds on link activation in the network. An optimal technique for the determination of ´schedule delay´ is presented.<>
Keywords :
graph theory; packet switching; protocols; radio links; radio networks; scheduling; Manhattan-mesh-type network; communication networks; graph theory; heuristic scheduling strategies; link activation; multihop radio networks; packet radio; packet routing; protocols; schedule delay; Computational complexity; Delay; Graph theory; Processor scheduling; Radio networks; Routing protocols; Scheduling algorithm; Spread spectrum communication; Telecommunication traffic; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 1988. ICC '88. Digital Technology - Spanning the Universe. Conference Record., IEEE International Conference on
Conference_Location :
Philadelphia, PA, USA
Type :
conf
DOI :
10.1109/ICC.1988.13605
Filename :
13605
Link To Document :
بازگشت