A lightweight adaptive multicast algorithm

In this paper, we present a multicast protocol which is built upon the temporally-ordered routing algorithm (TORA). The protocol-termed the lightweight adaptive multicast (LAM) routing algorithm-is designed for use in a Mobile Ad hoc NETwork (MANET) and, conceptually, can be thought of as an integration of the CORE based tree (CBT) multicast routing protocol and TORA. The direct coupling of LAM and TORA increases reaction efficiency (lowering protocol control overhead) as the new protocol can benefit from TORA's mechanisms while reacting to topological changes. Also during periods of stable topology and constant group membership, the LAM protocol does not introduce any additional overhead because it does not require timer-based messaging during its execution.

[1]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[2]  M. S. Corson,et al.  A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[3]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[4]  J. J. Garcia-Luna-Aceves,et al.  Improving Internet multicast with routing labels , 1997, Proceedings 1997 International Conference on Network Protocols.

[5]  L. Wei,et al.  The trade-offs of multicast trees and algorithms , 1994 .

[6]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.