Research on Innovating and Applying Evolutionary Algorithms Based Hierarchical Clustering and Multiple Paths Routing for Guaranteed Quality of Service on Service Based Routing
Internet of Things and Cloud Computing
Volume 3, Issue 3, October 2015, Pages: 22-28
Received: May 5, 2015; Accepted: May 6, 2015; Published: May 12, 2015
Views 3373      Downloads 64
Authors
Nguyen Thanh Long, Software development division III, Informatics Center of Hanoi Telecommunications, Hoan Kiem, Hanoi, Vietnam
Nguyen Duc Thuy, Center for applied research and technology development, Research institute of Posts and telecommunications, Hanoi, VietNam
Pham Huy Hoang, Information technology institute, Ha Noi University of Science Technology, Hanoi, Vietnam
Article Tools
Follow on us
Abstract
In Service Based Routing (SBR), data is transmitted from a source node to destination nodes are not depended on destination addresses. Hence, it is comfortable with new advanced technology as cloud computing and also flexible and reliable. Genetic and Queen-Bee algorithms (GA, QB) are artificial intelligence techniques for combinatorial optimization problems solving based on some natural rules. In which GA is a branch of the evolutionary strategies that uses some principles of evolution theory, such as natural selection, mutation and crossover. QB is performed based on GA for energy saving. The R^+ tree is an effective data structure that can be used to organize a hierarchical clustering network with fast establishing, updating, tuning algorithms. The usage of the Greedy algorithm to find cyclic routes or multiple paths on each trunk by multiple criterions to transmit data effectively.
Keywords
Service, Routing, Multi-Paths, Bandwidth, Energy, MANET, Cluster, Clustering, Cluster Head, Genetic, Queen Bee, Greedy
To cite this article
Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, Research on Innovating and Applying Evolutionary Algorithms Based Hierarchical Clustering and Multiple Paths Routing for Guaranteed Quality of Service on Service Based Routing, Internet of Things and Cloud Computing. Vol. 3, No. 3, 2015, pp. 22-28. doi: 10.11648/j.iotcc.s.2015030601.12
References
[1]
Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, “Research on Innovating, Evaluating and Applying Multicast Routing Technique for Routing messages in Service-oriented Routing”, Springer, ISBN: 978-1-936968-65-7, Volume Number 109, 2012.
[2]
VikasSiwach, Dr. Yudhvir Singh, Seema, DheerDhwaj Barak, Assistant Professor, Department of CSE, U.I.E.T, M.D.U. Rohtak -124001 (INDIA), “An Approach to Optimize QOS Routing Protocol Using Genetic Algorithm in MANET”, IJCSMS, Vol. 12, Issue 03, Sept 2012.
[3]
Sajid Hussain and Abdul W. Matin, Jodrey School of Computer Science, Acadia University Wolfville, Nova Scotia, Canada, “Hierarchical Cluster-based Routing in Wireless Sensor Networks”.
[4]
Kartheek Srungaram, Dr. MHM Krishna Prasad, Department of Information Technology, JNTUK-UCEV, Vizianagaram, A.P, India, “ENHANCED CLUSTER BASED ROUTING PROTOCOL FOR MANETS”.
[5]
Cândida Ferreira, Departamento de Ciências Agrárias, Universidade dos Açores, 9701-851 Terra-Chã, Angra do Heroísmo, Portugal, “Gene Expression Programming: A New Adaptive Algorithm for Solving Problems”.
[6]
Bibhash Roy, Tripura Institute of Technology, Narsingarh, Tripura, India, “Ant Colony based Routing for Mobile Ad-Hoc Networks towards Improved Quality of Services”.
[7]
Nguyen Thanh Long, Nguyen Duc Thuy, Pham Huy Hoang, “Innovating R Tree to Create Summary Filter for Message Forwarding Technique in Service-Based Routing”, Springer, ISBN: 978-3-642-41773-3, LNICST 121, p. 178, 2013.
[8]
Research on Innovating, Applying Multiple Paths Routing Technique Based on Fuzzy Logic and Genetic Algorithm for Routing Messages in Service - Oriented Routing: Long Thanh Nguyen, Tam Nguyen The, Chien Tran, Thuy Nguyen Duc. Journal: Scalable Information Systems EAI.
[9]
A Particle Swarm Optimization with Adaptive Multi-Swarm Strategy for Capacitated Vehicle Routing Problem. Kui-Ting Chen, Ke Fan, Yijun Dai and Takaaki Baba, 1Research Center and Graduate School of Information, Production and Systems, Waseda University, 2-7 Hibikino, Kitakyushu, Fukuoka, Japan.
[10]
An Epsilon-Greedy Mutation Operator Based on Prior Knowledge for GA Convergence and Accuracy Improvement: an Application to Networks Inference.
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186