Algorithms for routing in multicast packet radio networks

Carlos A. Pomalaza-Raez, Thomas Lee Hemminger, Eric Whitehill

Research output: Contribution to conferencePaper

1 Scopus citations

Abstract

Two solutions to the multicast transmission problem inherent in packet radio networks (PRNs) are presented. The first solution employs the Hopfield neural network while the second solution is based on heuristic algorithms. The computational time for both solutions is lower by several orders of magnitude than for most PRNs. However, the heuristic-based approach require a lower number of transmissions and minimal computational time than the neural network-based technique.

Original languageEnglish (US)
Pages243-249
Number of pages7
StatePublished - Dec 1 1996
EventProceedings of the 1996 Tactical Communications Conference - Fort Wayne, IN, USA
Duration: Apr 30 1996May 2 1996

Other

OtherProceedings of the 1996 Tactical Communications Conference
CityFort Wayne, IN, USA
Period4/30/965/2/96

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Algorithms for routing in multicast packet radio networks'. Together they form a unique fingerprint.

  • Cite this

    Pomalaza-Raez, C. A., Hemminger, T. L., & Whitehill, E. (1996). Algorithms for routing in multicast packet radio networks. 243-249. Paper presented at Proceedings of the 1996 Tactical Communications Conference, Fort Wayne, IN, USA, .