Distributed assignment algorithms for multi-hop packet-radio networks

Author

Cidon, Israel ; Sidi, Moshe

Author_Institution

IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

fYear

1988

fDate

27-31 March 1988

Firstpage

1110

Lastpage

1118

Abstract

Distributed dynamic channel assignment algorithms for a multihop packet radio network are introduced. The algorithms ensure conflict-free transmissions by the nodes of the network. The basic idea of the algorithms is to split the shared channel into a control segment and a transmission segment. The control segment is used to avoid conflicts among the nodes and to increase the utilization of the transmission segment. It is shown how these algorithms can be used to determine time-division multiaccess cycles with spatial reuse of the channel.<>

Keywords

channel capacity; mobile radio systems; multi-access systems; packet switching; radio networks; conflict-free transmissions; control segment; distributed algorithm; dynamic channel assignment algorithms; multi-hop packet-radio networks; spatial reuse; time-division multiaccess cycles; transmission segment; Access protocols; Data communication; Heuristic algorithms; Network topology; Packet radio networks; Packet switching; Polynomials; Spread spectrum communication; Telecommunication traffic; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE

Conference_Location

New Orleans, LA, USA

Print_ISBN

0-8186-0833-1

Type

conf

DOI

10.1109/INFCOM.1988.13030

Filename

13030