Due to random mobility of nodes in MANETs, the connectivity of the nodes in very sensitive environments become a serious issue and is subject to increased risk of damage. Sometimes a MANET suffers from the simultaneous failure of multiple multicast paths and gets partitioned into disjoint segments. In order to avoid poor performance of a multicast/ unicast routing protocol and to curb the adverse affect on an application performance, it is essential to restore the network connectivity. In this research work, we proposed a novel strategy, designed and implemented to restore the connectivity in MANET as well as to compute Steiner minimum spanning tree.

1. Aleksi Penttinen, “Minimum cost multicast trees in ad hoc networks”, Proceedings of the 2006 IEEE International Conference on Communications (ICC 2006), June 2006.
2. Arun Kumar B. R, Lokanatha C. Reddy, Rajan and Prakash S. Hiremath, ”Route Failure Tolerant Multicast In Mobile Ad Hoc Networks Using Disjoint Minimum Spanning Trees”, the second IEEE ICCSIT 2009, Aug. 8 - 11, 2009, Beijing, China.
3. Arun Kumar B. R, Lokanatha C. Reddy and Prakash S. Hiremath, ”Route Failure Tolerant Multicast in Mobile Ad Hoc Networks Using Disjoint Minimum Spanning Trees Based on Connectivity Index with Bandwidth constraint”, IEEE 2nd International Conference on Advance Computing Conference, IACC 2010, Tharpur University, Patiala-147004, Punjab.
4. Arun Kumar B. R, Lokanatha C. Reddy and Prakash S. Hiremath, “Analysis of K-Connected MANETS for QoS Multicasting Using Edge Disjoint Spanning Trees Based On Connectivity Index”, International Journal of Computer Applications, July 2010.
5. Eric Setton, Taesang Yoo, Xiaoqing Zhu, Andrea Goldsmith and Bernd Girod, “Cross-Layer Design Of Ad Hoc Networks For Real-Time Video Streaming,” IEEE Wireless Communications, PP.59-65, Aug. 2005, http://www.cse.ust. hk/~qianzh/COMP680H/reading-list/setton05.pdf.
6. Mohammed Saghir, Tat Chee, and Wan Rahmat Budiarto, ”Multicast Routing with Quality of Service in Mobile Ad hoc Networks”, National Computer Science Postgraduate Colloquium 2005 (NACSPC’05 , 27-28 June 2005), www.cs.usm.my/pub_list2005.php.
7. Mohammed Saghir, Tat-Chee Wan and Rahmat Budiarto, ”QoS Multicast Routing Based on Bandwidth Estimation in Mobile Ad Hoc Networks”, Proceedings of the Int. Conf. on Computer and Communication Engineering, ICCCE’06, Vol. I, 9-11 May 2006, Kuala Lumpur, Malaysia.
8. Arun Kumar B. R, Lokanatha C. Reddy, Prakash S.Hiremath and Rajeswari Sheshadri, “K-Nodes Multicasting Minimum Cost Spanning Trees In Wireless Mobile”, International Journal of Computer Applications [IJCA],www.ijcaonline.org/archives/number4/110-225.
9. Luo Junhai , Xue Liu and Ye Danxia, ”Research on multicast routing protocols for mobile ad-hoc networks”, Computer Networks 52 (2008) 988–997, www.sciencedirect.com.
10. P.Madhan Mohan, J.James Johnson, K.Murugan, and V.Ramachandran, “A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks”, http://www.hipc.org/hipc2002/2002Posters/OnDemand Multicast.pdf.
11. Patil et al , “Resource Allocation Using Multiple Edge-Sharing Multicast Trees”, Vehicular Technology, IEEE Transactions on Sept. 2008 Vol. 57 , PP. 3178 – 3186.
12. Y. Ko and N. Vaidya, ”Location-aided Routing (LAR) in Mobile Ad hoc Networks”, Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking MOBICOM), 66-75, 1998.
13. Z. Haas and M. Pearlman, ”The Performance of Query Control Schemes for the Zone Routing Protocol”, IEEE/ACM Transactions on Networking, 9(4):427–438, 2001.

Edge disjoint minimum spanning trees K-Connected MANETs Connectivity Index Route Failure Tolerance Steiner minimum spanning tree