A design concept for reliable mobile radio networks with frequency hopping signaling

The design of a packet radio network must reflect the operational requirements and environmental constraints to which it is subject. In this paper, we outline those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and we present a design concept for this network that encompasses organizational structure, waveform design, and channel access. Network survivability is achieved through the use of distributed network control and frequency hopping spread-spectrum signaling. We demonstrate how the execution of the fully distributed Linked Cluster Algorithm can enable a network to reconfigure itself when it is affected by connectivity changes such as those resulting from jamming. Additional resistance against jamming is provided by frequency hopping, which leads naturally to the use of code division mutiple access (CDMA) techniques that permit the simultaneous successful transmission by several users. Distributed algorithms that exploit CDMA properties have been developed to schedule contention-free transmissions for much of the channel access in this network. Contention-based channel access protocols can also be implemented in conjunction with the Linked Cluster network structure. The design concept presented in this paper provides a high degree of survivability and flexibility, to accommodate changing environmental conditions and user demands.

[1]  Norman Abramson,et al.  The ALOHA System-Another Alternative for Computer Communications , 1899 .

[2]  M. Spellman A Comparison between Frequency Hopping and Direct Spread PN as Antijam Techniques , 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.

[3]  L. Kleinrock,et al.  Packet Switching in Radio Channels : Part Il-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution , 2022 .

[4]  Bruce Hajek,et al.  Decentralized dynamic control of a multiaccess broadcast channel , 1982 .

[5]  N. Shacham,et al.  Future directions in packet radio architectures and protocols , 1987, Proceedings of the IEEE.

[6]  Bruce E. Hajek,et al.  Balanced Scheduling in a Packet Synchronized spread Spectrum Network , 1983, INFOCOM.

[7]  Lawrence G. Roberts,et al.  Dynamic allocation of satellite capacity through packet reservation , 1973, AFIPS National Computer Conference.

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

[9]  Nathan Ehrlich The advanced mobile phone service , 1979, IEEE Communications Magazine.

[10]  Anthony Ephremides,et al.  A Distributed Reservation Scheme for Spread Spectrum Multiple Access Channels. , 1987 .

[11]  Anthony Ephremides,et al.  Resistance to HF Jamming Interference in Mobile Radio Networks by an Adaptive, Distributed Reconfiguration Technique , 1984 .

[12]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[13]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[14]  Anthony Ephremides,et al.  The Design and Simulation of a Mobile Radio Network with Distributed Control , 1984, IEEE J. Sel. Areas Commun..

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

[16]  Fouad A. Tobagi,et al.  Multiaccess Protocols in Packet Communication Systems , 1980, IEEE Trans. Commun..

[17]  John A. Silvester,et al.  Spreading code protocols for distributed spread-spectrum packet radio networks , 1988, IEEE Trans. Commun..

[18]  Jeffrey E. Wieselthier,et al.  A new class of protocols for multiple access in satellite networks , 1980 .