Open Access Open Access  Restricted Access Subscription or Fee Access

Multicast Routing Protocols in Mobile Ad hoc Networks: using VSMPSO (Vibrant Scalability Method for Particle Swarm Optimization)

P. Visu, J. Janet, R. Srinivasan, N. Pughazendi

Abstract


Multicasting show business a vital part in various claims of mobile ad hoc networks (MANETs). It know how to considerably perk up the recital of these networks, the strait ability (in mobile ad hoc networks, particularly single-channel ones, ability is a additional apt word than bandwidth, ability is calculated in bits/s and bandwidth in Hz) and battery muscle of which are narrow. In the precedent years, a numeral of multicast routing protocols has been planned. In spite of being Plan of an appropriate routing protocol is tricky for mobile ad hoc networks owing to its intrinsic vitality and recurrent topology revolutionize. Multicasting is flat additional multifaceted for the reason that it oblige diffusion of an information to assorted target at more or less similar instance, if feasible. vigorous investigate exertion in this field has resulted in a mixture of scheme based on vibrant scalability in run time and slipup forbearance using a new fitness function for high mobility speed and high mobile density which is implemented for many nodes by using vibrant scalability method for particle swarm optimization.

Keywords


Vibrant Scalability Method for Particle Swarm Optimization, vibrant scalability in run time, high mobility speed , high mobile density, slipup forbearance

Full Text:

PDF

References


Z.Wang, J.Crowcroft, “Quality of service for supporting multimedia applications”, IEEE Journal on Selected Areas in Communications, IEEE Press, Los Alamitos, CA, September 1996, pp.1228-1234.

H.F.Salama, D.S.Reeves, and Y.Viniotis, “Evaluation of multicast routing algorithm for real-time communication on high-speed networks”, IEEE Journal on Selected Areas in Communications, IEEE Press, Los Alamitos, CA, April 1997, pp. 332-345.

Z.Wang, B.Shi, “Solution to Qos multicast routing problem based on heuristic genetic algorithm”, Journal of Computer, China Computer Federation, Beijing China, January 2001, pp. 55-61.

L.Carrillo, J.-L.Marzo, L.Fabrega, P.Vila, and C.Guadall, “Ant colony behaviour as routing mechanism to provide quality of service”, Lecture Notes in Computer Science, Springer, Berlin, September 2004, pp.418-419.

F.Liu, X.J.Feng, “Immune algorithm for multicast routing”, Chinese Journal of Computer, Science Press, Beijing, China, June 2003,pp.676-681.

A. I. T. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,” in Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pp. 329– 350, Springer-Verlag, 2001.

J. Kennedy and R. Eberhart, “Particle swarm optimization,” in International Conference on Neural Networks, IV, pp. 1942– 1948, 1995.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, “A scalable content-addressable network,” in Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 161–172, ACM Press, 2001.

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, “Tapestry: A resilient global-scale overlay for service deployment,” IEEE Journal on Selected Areas in Communications, vol. 22, pp. 41–53, Jan. 2004.

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in Proceedings of the 2001 conference on Applications,

technologies, architectures, and protocols for computer communications, pp. 149–160, ACM Press, 2001.

T. Hagerup, “Allocating independent tasks to parallel processors: an experimental study,” in Journal of Parallel and Distributed Computing, vol. 47, pp. 185–197, December 1997.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.