Traffic sensitive algorithms for generating self-organizing network schedules

Author

Shor, Julic ; Robertazzi, Thomas G.

Author_Institution

Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA

fYear

1990

fDate

30 Sep-3 Oct 1990

Firstpage

840

Abstract

The generation of transmission schedules for self-organizing radio networks by traffic sensitive algorithms is described. A centralized traffic algorithm is used as a basis for the comparison of other algorithms. This algorithm is based on a suggestion made by Ephremides and Truong (see IEEE INFOCOM 1988, p.1119) to construct a priority rule based on traffic requirements. Although it is not possible to implement this algorithm in a distributed form, a distributed algorithm using nodal degree to determine priority among nodes is presented and shown to produce results closer to those of the preferred traffic-based algorithm than id-number-based priority does

Keywords

radio networks; scheduling; telecommunication traffic; centralized traffic algorithm; distributed algorithm; nodal degree; priority rule; self-organizing radio networks; traffic requirements; traffic sensitive algorithms; transmission schedules; Distributed algorithms; Routing; Scheduling algorithm; Self-organizing networks; Symmetric matrices; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 1990. MILCOM '90, Conference Record, A New Era. 1990 IEEE

Conference_Location

Monterey, CA

Type

conf

DOI

10.1109/MILCOM.1990.117533

Filename

117533