International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 2 | Year 2013 | Article Id. IJCTT-V4I2P120 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I2P120

Multicasting Over Manet Through Segmp By Secure Zone Leader Election

Bhavana.B.Turorikar, M.A.Shukla

Citation :

Bhavana.B.Turorikar, M.A.Shukla, "Multicasting Over Manet Through Segmp By Secure Zone Leader Election," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 2, pp. 153-159, 2013. Crossref, https://doi.org/10.14445/22312803/ IJCTT-V4I2P120

Abstract

To guide construction of zone structure, multicast tree construction and multicast packet forwarding, position information is utilized, which efficiently reduces the route overhead for route searching and tree structure maintenance. Many strategies have been further proposed to improve the efficiency of the protocol, by introducing the idea of zone depth used for building an optimal tree structure and integrating the location search of group members with the hierarchical group membership management. A scheme is also designed to handle empty zone problem faced by most routing protocols using a zone structure. Finally, we design a scheme to elect a zone leader through voting and handle security of votes using ECDSA algorithm for multicasting over MANETS in a virtual zone based network. The scalability and the efficiency of SEGMP are evaluated through simulations and quantitative analysis. Our results demonstrate that SEGMP has high packet delivery ratio, and low energy consumption and multicast group joining delay under all test scenarios, and is also scalable to both group size and network size. Compared to Efficient Geographic Multicast Protocol (EGMP), SEGMP has significantly high packet delivery ratio, less energy consumption and multicast group joining delay.

Keywords

Geographic Routing, Mobile Ad Hoc Networks, Multicasting, Protocol, Wireless Networks.

References

[1] X. Xiang and X. Wang, “An Efficient Geographic Multicast Protocol for Mobile Ad Hoc Networks,” Proc. IEEE Int’l Symp. World of Wireless,Mobile and Multimedia Networks (WoWMoM),  June 2006.
[2] E.M. Royer and C.E. Perkins, “Multicast Operation of the Ad Hoc OnDemand Distance Vector Routin Protocol,” Proc. ACM /IEEE   MobiCom, pp. 207-218,    Aug. 1999. 
[3] X. Zhang and L. Jacob, “Multicast Zone Routing  Protocol in Mobile Ad Hoc Wireless Networks,” Proc  Local Computer Networks (LCN ’03), Oct. 2003.
[4] C.Wu, Y.Tay, and C.K. Toh, “Ad Hoc Multicast Routing Protocol Utilizing Increasing Id-Number (AMRIS) Functional Specification,” Internet draft, Nov. 1998.
[5] S. Wu and K.S. Candan, “GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks,” Proc 26th IEEE Int’l Conf. DistributedComputing System(ICDCS ’06), 2006.
[6] S.M. Das, H. Pucha, and Y.C. Hu, “Distributed Hashin for Scalable Multicast in Wireless Ad Hoc Network,”IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 3, pp. 347-362, Mar. 2008. 
[7] C. Gui and P. Mohapatra, “Scalable Multicasting  For Mobile Ad Hoc Networks,” Proc. IEEE  INFOCOM, Mar. 2004.
[8] X. Xiang, Z. Zhou, and X. Wang, “Self-Adaptive  On Demand Geographic Routing Protocols for Mobile Ad Hoc Networks,”   Proc. IEEE INFOCOM, May 2007.
[9] M. Mauve, H. Fubler, J. Widmer, and T. Lang,“Position-Based Multicast Routing for Mobile Ad-Hoc Networks,” Proc.ACM MobiHoc, poster  section, June  2003.
[10] M. Gerla, S.J. Lee, and W. Su, “On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks,”  Internet draft, draftietf- manet- odmrp-02, 2000.
[11]H.Vijayakumar, M.Ravichandran “Efficient Location Management of Mobile Node in Wireless Mobile Ad- hoc Network” Proceedings of the National Conference on Innovations in Emerging Technology 2011. 
[12] B. Karp and H.T. Kung, “Greedy Perimeter Stateless Routing for Wireless Networks,” Proc.  ACM/IEEE  MobiCom, pp. 243-254, Aug. 2000.
[13] Shuhui Yang, Jie Wu “New Technologies of Multicasting In Manet”.
[14] Chatchai Khunboa and Robert Simon “Mobile Ad Hoc Multicasting to Support Distribute Virtual  Environments” IEEE Transactions-2004.
[15] T. Camp and Y. Liu, “An Adaptive Mesh-Based Protocol for Geocast Routing,” J. Parallel an Distributed Computing, vol. 63, no. 2, pp. 196- 213,2003.
[16] Manik Kapil “Security Issues In Mobile Ad Hoc  Networks”.
[17] M. Transier, H. Fubler, J. Widmer, M. Mauve, and W.Effelsberg, “A Hierarchical Approach to Position Based Multicast for Mobile Ad-Hoc    Networks,” Wireless Networks, vol. 13, no. 4, pp. 447-460, Aug2007.
[18] J. Li et al., “A Scalable Location Service for Geographic Ad Hoc Routing,” Proc. ACM/IEEE    MobiCom, pp.  120-130, 2000.
[19] D. B. Johnson and D. A. Maltz, “Dynamic source  routing in ad-hoc wireless networks,” Mobile   Computing, T. Imielinski and H. Korth, Eds., Kluwer,  pp. 153–81, 1996.
[20] Juan A. Sanchez, Pedro M. Ruiz, Ivan Stojmenovic “GMR: Geographic Multicast Routing for Wireless Sensor Networks” IEEE Communications Society  2006.
[21] Young-Bae Ko and Nitin H. Vaidya “Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms’
[22] S. Giordano and M. Hamdi, “Mobility Management:The Virtual Home Region,” technical report, Oct. 1999.
[23] “Modified Efficient Geographic Multicast Protocol in Multicasting over Mobile Ad HocNetworks for QOS Improvements” M.Subha, M.Manoranjani, Journal of Computer Applications (JCA)ISSN: 0974-1925, Volume IV, Issue 2, 2011 
[24] “On the Elliptic Curve Digital Signature Algorithm” Hung-Zih Liao , Yuan-Yuan Shen, July 2006