Determining the minimum number of transmissions in multicast packet radio networks

Thomas L. Hemminger, Carlos A. Pomalaza-Raez

Research output: Contribution to conferencePaper

1 Scopus citations

Abstract

The objective of this paper is to develop and implement a practical technique to compute optimum or near optimum paths from a single source to multiple destinations in a packet radio network (PRN) environment. This problem is common and is usually solved by making copies of the packet, then addressing and sending them independently to each destination. This type of solution makes for very inefficient use of the communications channel bandwidth yet is frequently tolerated because determination of an optimal solution yielding a minimal number of transmissions is NP-complete. This paper proposes a resolution to this problem by employment of the Hopfield neural network.

Original languageEnglish (US)
Pages571-576
Number of pages6
Publication statusPublished - Jan 1 1996
EventProceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) - Washington, DC, USA
Duration: Jun 3 1996Jun 6 1996

Other

OtherProceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4)
CityWashington, DC, USA
Period6/3/966/6/96

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Hemminger, T. L., & Pomalaza-Raez, C. A. (1996). Determining the minimum number of transmissions in multicast packet radio networks. 571-576. Paper presented at Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, .