Multicast ad hoc routing through mobility-aware Steiner tree meshes with consistency across different mobility models

References

• Deering, S., 1991, Multicast routing in a datagram internetwork, PhD thesis, Electrical Engineering Department, Stanford University, December.
   Google Scholar
• Deering , S.-E. and Cheriton , D.-R. 1990 . Multicast routing in datagram internet works and extended LANs . Transactions on Computer Systems , 8 ( 2 ) : 85 – 110 .
   Google Scholar
• Moy , J. 1994 . Multicast routing extensions for OSPF . Computer Communications of the ACM , 37 ( 8 ) : 61 – 66 .
   Google Scholar
• Ballardie , T. , Francis , P. and Crowcroft , J. 1993 . “ Core based trees (CBT)—an architecture for scalable inter-domain multicast routing ” . In Proceeding of ACM SIGCOMM'93 85 – 95 . San Francisco, CA
   Google Scholar
• Deering , S. , Estrin , D.-L. , Farinacci , D. , Jacobson , V. , Liu , C.-G. and Wei , L. 1996 . The PIM architecture for wide-area multicast routing . IEEE/ACM Transactions on Networking , 4 ( 2 ) : 153 – 162 .
   Google Scholar
• Cordeiro , C. , Gossain , H. and Agrawal , D. 2003 . Networks: present and future directions . IEEE Network , : 52 – 59 .
   Google Scholar
• C.-W., Wu, Y.-C., Tay and C.-K., Toh, 1998, Ad hoc multicast routing protocol utilizing increasing id-numberS (AMRIS) functional specification, Internet-draft, work in progress, draft-ietf-manet-amris-spec-00.txt, November.
   Google Scholar
• Royer , E.-M. and Perkins , C.-E. 1999 . “ Multicast operation of the ad-hoc on-demand distance vector routing protocol ” . In Proceedings of ACM/IEEE MOBICOM'99 207 – 218 . Seattle, WA
   Google Scholar
• Ji , L. and Corson , S. 1998 . “ A lightweight adaptive multicast algorithm ” . In Proceedings of IEEE GLOBECOM'98 1036 – 1042 . Sydney, Australia
   Google Scholar
• Jetcheva , J.-G. and Johnson , D.-B. 2001 . “ Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks ” . In Proceedings of ACM MobiHoc'01 33 – 44 . Long Beach, CA
   Google Scholar
• Lee , S.-J. , Su , W. and Gerla , M. 2002 . On-demand multicast routing protocol in multihop wireless mobile networks . ACM/Kluwer Mobile Networks and Applications , 7 ( 6 ) : 441 – 452 .
   Google Scholar
• Garcia-Luna-Aceves , J.J. and Madruga , E.-L. 1999 . The core-assisted mesh protocol . IEEE Journal on Selected Areas in Communications , 17 ( 8 ) : 1380 – 1394 .
   Google Scholar
• Toh , C.-K. , Guichala , G. and Bunchua , S. 2000 . “ ABAM: on-demand associativity-based multicast routing for mobile ad hoc networks ” . In Proceedings of IEEE VTC-2000 987 – 993 . Boston, MA
   Google Scholar
• E., Bommaiah, M., Liu, A., MacAuley and R., Talpade, 1998, AMRoute: ad hoc multicast routing protocol, Internet-draft, work in progress, draft-talpade-manet-amroute-00.txt, August.
   Google Scholar
• Sinha , P. , Sivakumar , R. and Bharghavan , V. 1999 . “ MCEDAR: multicast core-extraction distributed ad hoc routing ” . In Proceeding of IEEE Wireless Communication and Networking Conference 1313 – 1319 . New Orleans, LA
   Google Scholar
• Ji , L. and Corson , M.-S. 2001 . “ Differential destination multicast: a manet multicast routing protocol of small groups ” . In Proceeding of IEEE INFOCOM'01 1192 – 1202 . Anchorage
   Google Scholar
• J.-G., Jetcheva, Y.-C., Hu, D.A., Maltz and D.B., Johnson, 2001, A simple protocol for multicast and broadcast in mobile ad hoc networks, Internet-draft, work in progress, draft-ietf-manet-simple-mbcast-01.txt, July.
   Google Scholar
• Bharath-Kumar , K. and Jaffe , J.-M. 1983 . Routing to multiple destinations in computer networks . IEEE Transactions on Communications , 31 ( 3 ) : 343 – 351 .
   Google Scholar
• Karp , R.-M. 1975 . “ Reducibility among combinatorial problems ” . In Complexity of Computer Computations , 85 – 103 . New York : Plenum Press .
   Google Scholar
• Kou , L. , Markowsky , G. and Berman , L. 1981 . A fast algorithm for Steiner trees . Acta Informatica , 15 ( 2 ) : 141 – 145 .
   Web of Science ®Google Scholar
• Plesnik , J. 1981 . The complexity of designing a network with minimum diameter . Networks , : 77 – 85 .
   Google Scholar
• Zelikovsky , A. 1993 . An 11/6-approximation algorithm for the network Steiner problem . Algorithmica , : 463 – 470 .
   Google Scholar
• Even , S. 1979 . Graph Algorithms , 204 – 209 . Potomac, MD : Computer Science Press .
   Google Scholar
• Boleng , J. , Navidi , W. and Camp , T. 2002 . “ Metrics to enable adaptive protocols for mobile ad hoc networks ” . In Proceeding International Conference on Wireless Networks (ICWN) 293 – 298 . Las Vegas, NV
   Google Scholar
• K., Fall and K., Varadhan, 2003, ns, Notes and documentation, The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC.
   Google Scholar
• The Monarch Project, Mobile networking architectures, Rice University, Available: http://www.monarch.cs.rice.edu/
   Google Scholar
• Jia , X. 1998 . A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks . IEEE/ACM Transactions on Networking , 6 ( 6 ) : 828 – 837 .
   Google Scholar
• Waxman , B.-M. 1998 . Routing of multipoint connections . IEEE Journal on Selected Areas in Communications , 6 ( 9 ) : 1617 – 1622 .
   Google Scholar
• Chen , D. , Du , D.-Z. , Hu , X.-D. , Lin , G.-H. , Wang , L. and Xue , G. 2001 . Approximations for Steiner trees with minimum number of Steiner points . Theoretical Computer Science , : 83 – 99 .
   Google Scholar
• Lim , H. and Kim , C. 2000 . “ Multicast tree construction and flooding in wireless ad hoc networks ” . In Proceedings of the 3rd ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems 61 – 68 . Boston, MA
   Google Scholar
• Lee , S. and Kim , C. 2000 . “ Neighbor supporting ad hoc multicast routing protocol ” . In Proceedings of the 1st ACM MobiHoc 37 – 44 . Boston, MA
   Google Scholar