论文信息 - Heuristic scheduling strategies for multihop radio networks with regular structure

Heuristic scheduling strategies for multihop radio networks with regular structure

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.<<ETX>>

T. G. Robertazzi | S. Chandra

[1] Leonard Kleinrock,et al. Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[2] John A. Silvester,et al. On the Capacity of Multihop Slotted ALOHA Networks with Regular Structure , 1983, IEEE Trans. Commun..

[3] Anthony Ephremides,et al. The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[4] John Jubin,et al. A Distributed Routing Design for a Broadcast Environment , 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.

[5] Bruce Hajek. LINK SCHEDULES, FLOWS, AND THE MULTICHROMATIC INDEX OF GRAPHS. , 1984 .

[6] Leonard Kleinrock,et al. Throughput - Delay Characteristics of Some Slotted-ALOHA Multihop Packet Radio Networks , 1985, IEEE Transactions on Communications.

[7] M.J. Post,et al. A Distributed Evolutionary Algorithm for Reorganizing Network Communications , 1985, MILCOM 1985 - IEEE Military Communications Conference.

[8] Ting-Chao Hou,et al. PERFORMANCE ANALYSIS OF MULTIHOP PACKET RADIO NETWORKS WITH CAPTURE. , 1985 .

[9] Imrich Chlamtac,et al. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[10] Robin Wilson,et al. Graph theory and combinatorics , 1979 .