Heuristic scheduling strategies for multihop radio networks with regular structure.

Sudesh Chandra; Thomas G. Robertazzi

Heuristic scheduling strategies for multihop radio networks with regular structure.

Sudesh Chandra
, Thomas G. Robertazzi

Electrical Engineering

Stony Brook University

Stony Brook University

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

The performance of scheduling strategies for a Manhattan-mesh-type network is examined. Efficient routing of packets in this class of networks make scheduling the links an important criterion 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.

Original language	English
Pages	437-442
Number of pages	6
State	Published - 1988

Cite this

@conference{5c0debda26654fcbbf2ab1b0570bd44b,

title = "Heuristic scheduling strategies for multihop radio networks with regular structure.",

abstract = "The performance of scheduling strategies for a Manhattan-mesh-type network is examined. Efficient routing of packets in this class of networks make scheduling the links an important criterion 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.",

author = "Sudesh Chandra and Robertazzi, \{Thomas G.\}",

year = "1988",

language = "English",

pages = "437--442",

}

TY - CONF

T1 - Heuristic scheduling strategies for multihop radio networks with regular structure.

AU - Chandra, Sudesh

AU - Robertazzi, Thomas G.

PY - 1988

Y1 - 1988

N2 - The performance of scheduling strategies for a Manhattan-mesh-type network is examined. Efficient routing of packets in this class of networks make scheduling the links an important criterion 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.

AB - The performance of scheduling strategies for a Manhattan-mesh-type network is examined. Efficient routing of packets in this class of networks make scheduling the links an important criterion 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.

UR - https://www.scopus.com/pages/publications/0024131905

M3 - Paper

SP - 437

EP - 442

ER -

Heuristic scheduling strategies for multihop radio networks with regular structure.

Abstract

Other files and links

Fingerprint

Cite this