Mobility prediction aided dynamic multicast routing in MANET

Nodes in a mobile ad hoc network (MANET) are free to move at anytime and to anywhere. This mobility feature makes multicast in MANET a typical dynamic multicast case, where group members are likely to leave and rejoin the multicast session frequently. To provide an efficient routing scheme in such a dynamic multicast environment, we propose a mobility prediction aided dynamic multicast routing (MPADMR) algorithm. This algorithm contains two steps, the construction of a link lifetime constrained minimum hop-count multicast tree and a dynamic multicast tree maintenance procedure. We employ OPNET simulation to evaluate the performance of this dynamic multicast routing algorithm. The simulation results show that MPADMR has strong capability of handling the dynamics of group members

[1]  Nirmala Shenoy,et al.  A comparative study of mobility prediction in fixed wireless networks and mobile ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[2]  Ranveer Chandra,et al.  Anonymous Gossip: improving multicast reliability in mobile ad-hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[3]  Sriram Raghavan,et al.  A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees , 1999, TNET.

[4]  Sung-Ju Lee,et al.  Mobility prediction in wireless networks , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

[5]  Guoliang Xue,et al.  Bottom-up construction of dynamic multicast trees in WDM networks , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[6]  Mukesh Singhal,et al.  A reliable multicast algorithm for mobile ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[7]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[8]  Wanjiun Liao,et al.  Family ACK tree (FAT): a new reliable multicast protocol for mobile ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[9]  H. Baraka,et al.  ReMHoc: a reliable multicast protocol for wireless mobile multihop ad hoc networks , 2004, First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004..

[10]  Ing-Ray Chen,et al.  Simulation study of a class of autonomous host-centric mobility prediction algorithms for wireless cellular and ad hoc networks , 2003, 36th Annual Simulation Symposium, 2003..

[11]  Sung-Ju Lee,et al.  On-Demand Multicast Routing Protocol (ODMRP) for Ad-Hoc Networks , 2002 .

[12]  Wanjiun Liao,et al.  Family ACK tree (FAT): supporting reliable multicast in mobile ad hoc networks , 2003, IEEE Trans. Veh. Technol..

[13]  Patrick Th. Eugster,et al.  Route driven gossip: probabilistic reliable multicast in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Sung-Ju Lee,et al.  A reliable, congestion-control led multicast transport protocol in multimedia multi-hop networks , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[15]  George Pavlou,et al.  Stable clustering through mobility prediction for large-scale multihop intelligent ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[16]  Xiaoqiang Chen,et al.  A scalable, dynamic multicast routing algorithm in ATM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[17]  Kais Mnif,et al.  Procedure for multicast tree maintenance based on member time duration , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).