Routing strategies for multicast packet radio networks

Thomas L. Hemminger, Chris Coulston, Carlos A. Pomalazza-Raez

Research output: Contribution to journalArticle

Abstract

A common problem in a packet radio network (PRN) environment is to construct a multicasting network from a single source to a set of remote destinations which minimizes the number of transmissions. This problem is known to be NP-complete, thus computing an optimal solution may be infeasible for sizable networks. This paper provides two alternative solutions to this problem. The first is a heuristic algorithm which iteratively builds a spanning tree from the destinations to the source. A second solution, included for comparative purposes, is based on the Hopfield neural network whose dynamics are governed by a motion equation and a set of constraints. Both solutions are tested on a variety of instances against an optimal algorithm. Results show the approaches form good solutions (the number of transmissions is within about 3% of the optimum) and run in a fraction of the time required to form the optimal solution.

Original languageEnglish (US)
Pages (from-to)215-223
Number of pages9
JournalInternational Journal of Smart Engineering System Design
Volume4
Issue number3
DOIs
StatePublished - Jan 1 2002

Fingerprint

Radio Networks
Multicast
Routing
Optimal Solution
Hopfield neural networks
Multicasting
Hopfield Neural Network
Network Dynamics
Heuristic algorithms
Optimal Algorithm
Spanning tree
Heuristic algorithm
Equations of motion
NP-complete problem
Minimise
Motion
Computing
Alternatives
Strategy

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Hemminger, Thomas L. ; Coulston, Chris ; Pomalazza-Raez, Carlos A. / Routing strategies for multicast packet radio networks. In: International Journal of Smart Engineering System Design. 2002 ; Vol. 4, No. 3. pp. 215-223.
@article{ad002ea002cb4d1dac39db0bd37e478a,
title = "Routing strategies for multicast packet radio networks",
abstract = "A common problem in a packet radio network (PRN) environment is to construct a multicasting network from a single source to a set of remote destinations which minimizes the number of transmissions. This problem is known to be NP-complete, thus computing an optimal solution may be infeasible for sizable networks. This paper provides two alternative solutions to this problem. The first is a heuristic algorithm which iteratively builds a spanning tree from the destinations to the source. A second solution, included for comparative purposes, is based on the Hopfield neural network whose dynamics are governed by a motion equation and a set of constraints. Both solutions are tested on a variety of instances against an optimal algorithm. Results show the approaches form good solutions (the number of transmissions is within about 3{\%} of the optimum) and run in a fraction of the time required to form the optimal solution.",
author = "Hemminger, {Thomas L.} and Chris Coulston and Pomalazza-Raez, {Carlos A.}",
year = "2002",
month = "1",
day = "1",
doi = "10.1080/10255810213479",
language = "English (US)",
volume = "4",
pages = "215--223",
journal = "International Journal of General Systems",
issn = "0308-1079",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

Routing strategies for multicast packet radio networks. / Hemminger, Thomas L.; Coulston, Chris; Pomalazza-Raez, Carlos A.

In: International Journal of Smart Engineering System Design, Vol. 4, No. 3, 01.01.2002, p. 215-223.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Routing strategies for multicast packet radio networks

AU - Hemminger, Thomas L.

AU - Coulston, Chris

AU - Pomalazza-Raez, Carlos A.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - A common problem in a packet radio network (PRN) environment is to construct a multicasting network from a single source to a set of remote destinations which minimizes the number of transmissions. This problem is known to be NP-complete, thus computing an optimal solution may be infeasible for sizable networks. This paper provides two alternative solutions to this problem. The first is a heuristic algorithm which iteratively builds a spanning tree from the destinations to the source. A second solution, included for comparative purposes, is based on the Hopfield neural network whose dynamics are governed by a motion equation and a set of constraints. Both solutions are tested on a variety of instances against an optimal algorithm. Results show the approaches form good solutions (the number of transmissions is within about 3% of the optimum) and run in a fraction of the time required to form the optimal solution.

AB - A common problem in a packet radio network (PRN) environment is to construct a multicasting network from a single source to a set of remote destinations which minimizes the number of transmissions. This problem is known to be NP-complete, thus computing an optimal solution may be infeasible for sizable networks. This paper provides two alternative solutions to this problem. The first is a heuristic algorithm which iteratively builds a spanning tree from the destinations to the source. A second solution, included for comparative purposes, is based on the Hopfield neural network whose dynamics are governed by a motion equation and a set of constraints. Both solutions are tested on a variety of instances against an optimal algorithm. Results show the approaches form good solutions (the number of transmissions is within about 3% of the optimum) and run in a fraction of the time required to form the optimal solution.

UR - http://www.scopus.com/inward/record.url?scp=0036649482&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036649482&partnerID=8YFLogxK

U2 - 10.1080/10255810213479

DO - 10.1080/10255810213479

M3 - Article

AN - SCOPUS:0036649482

VL - 4

SP - 215

EP - 223

JO - International Journal of General Systems

JF - International Journal of General Systems

SN - 0308-1079

IS - 3

ER -