Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Algorithms for routing in multicast packet radio networks

By: Pomalaza-Raez, C.A.; Whitehill, E.; Hemminger, T.L.;

1996 / IEEE / 0-7803-3658-5

Description

This item was taken from the IEEE Periodical ' Algorithms for routing in multicast packet radio networks ' In a packet radio network (PRN), transmission of packets involves both the transmission of information the end user needs and the transmission of additional or ""overhead"" information necessary for proper operation of the network. Two solutions to the multicast transmission problem have been presented, one which employs the Hopfield network, and the other based on heuristic algorithms. Although both approaches usually yield suboptimal performance when compared to an exhaustive search, the time required by these methods to reach a solution is lower by several orders of magnitude for all but the simplest PRNs. The Hopfield method is extremely easy to implement and converged to a valid solution in over 98% of our simulations. This is considered a high success rate for this type of network, which we attribute to the sparseness of the configuration and careful choice of parameters. The heuristic is an improvement over the neural network yielding the lowest number of transmissions and requiring the least amount of time. Either approach may be suitable for determining solutions to this NP-complete problem depending on the actual application and computational resources available.