Research Article International Journals of Advanced Research in Computer Science and Software Engineering ISSN: X (Volume-7, Issue-6)
|
|
- Shanon Armstrong
- 5 years ago
- Views:
Transcription
1 International Journals of Advanced Research in Computer Science and Software Engineering Research Article June 2017 Swarm Based Intelligence Routing Algorithm (Ant Colony) Madhusudan G Asst. Professor, Department of CS&E, SJCE, Mysore, Karnataka, India DOI: /ijarcsse/V7I6/0106 Kumar TNR Asst. Professor, Department of CS&E, MSRIT, Bangaluru, Karnataka, India Abstract: The basis of the algorithm Swarm Intelligence (SI) Protocol, gives idea to difficult and intelligent characteristic through simple, non centralized and unsupervised interactions between a large sheer of autonomous swarm intelligent members. The algorithm ant colony optimization algorithm is popular due to its dynamic and adaptive nature in the real time system. It is concerened mainly with ants which find the shortest routing path to food by secreting a substance called pheromone. All the other ants follow the initial ant which took the shortest path from source to destination. When a obstacle or disturbance is faced by any other ant, further finds a new shortest path from source to destination and all other ants follow the new ant. Keywords: Ant Colony Optimization (ACO) I. INTRODUCTION Mobile Ad hoc network is self configuring network of mobile hosts connected by wireless links, the union of which forms the topology of the network [1]. Ant algorithms are the class of optimizing algorithms under swarm intelligence (SI)[2][3]. Routing in ant algorithm [4][5] is through interaction of network exploration agents called ants.the ant-based routing algorithms follow a similar general strategy. Nodes send ant agents out at regular intervals to randomly chosen destinations. The main aim of the ants is to find the sample paths, assign a quality to them, and use this information to update the routing tables in the other nodes they passed in the given network. These routing tables contains an entry for each destination and each neighbour, indicating the goodness of going over this neighbour on the way to the other destination.some of the algorithms used for routing in ad hoc networks are destination-sequenced distance vector routing, wireless routing protocol, ad hoc on-demand distance vector routing and dynamic source routing protocol [6][7]. The specific challenges and possible applications of MANETs have proved ways to many routing algorithms in mobile adhoc networks. The People traditionally classify these algorithms as either proactive or reactive with dynamic routing nature of the network. In the purely proactive routing protocols, nodes tries to maintain all times routing path to all other nodes in the network along with source and destination nodes. This means that they need to keep track of all dynamic topology changes, which may become difficult if there are a lot of nodes in the network between source and destination or if they are very mobile in the dynamoc environment. On the there hand in Reactive routing protocols nodes only gather routing information on demand or based on the current requirement of the network only. when they have data to be sent for a certain few destination they construct a path, and only when the path current becomes infeasible they search a new path in the network environment. In this way they greatly reduce the routing overhead occured in the network. But they can suffer from oscillations in network performance since they are never prepared for disruptive events. This goodness value is called pheromone. This pheromone information is used for the routing of both ants and data packets: all packets are routed stochastically, choosing with a higher probability those links with higher pheromone values. If enough ants are sent to the different destinations, nodes keep up-to-date information about the best paths from source to destination in the network, and automatically adapt their data load spreading to this network. Ant-based routing algorithms have a number of properties which are desirable in MANETs; They are highly adaptive to network changes, use active path sampling, Ant-based routing are robust to agent failures, provide multipath routing, and take care of data load spreading. II. ANT PATH OPTIMIZATION The termites would like to build a hill from the pebbles. A termite is bound by these rules:[8]a classic Swarm Intelligent routing is that of the path optimizing behavior of ants. It is widely used to motivate applications such as routing in computer networks and optimization of path in the network. Ants have been shown to adapt to their environment and always find the most efficient path to their food source. Ant Path Optimization basic technique is explained below. Consider a number of ants all traveling between their nest along a single available path to a food source (Fig 1.(a)). As each ant returns with food, it deposits a small amount of pheromone on the trail of the visited path. The Pheromone is a volatile chemical to which ants are attracted. It evaporates over time, requiring that new pheromone be continuously laid or else it will disappear completely and the trail path will vanish. Ants leaving the nest are attracted to the pheromone trail laid by returning ants. They are biased to follow it,when they leave the nest looking for more food. This example is uninteresting with only a single path from sourced to destination. When an unevenly shaped obstacle or distract is placed between the nest called as source and the food source called as destination. the ants are forced to choose a way around it (Fig.1.(b)). Because no pheromone exists around the obstacle, ants travel in equal proportions around each side until resuming the original pheromone trail. Since it takes longer for returning ants to travel around the longer side of the All Rights Reserved Page 298
2 obstacle, pheromone has more time to decay in between ant arrivals (Fig.1.(c)). The weakened pheromone trail along the longer route around the obstacle is offset by the relatively strong trail on the shorter route; ants are able to travel that route more frequently and thus reinforce the pheromone trail there more often. Since ants are attracted to stronger pheromone trail, the shorter trail is eventually favored by nearly all ants over the longer trail (Fig.1.(d)).The global optimization problem is solved. The ants adapt to a new environment and are able to choose the shortest path between source and destination. Swarm Intelligent Framework: Swarm intelligence (SI) [9,10,11] is a relatively novel field that was originally defined as Any attempt to design algorithms or distributed problem-solving devices inspired by the collective behavior of social insects and other animal societies [9]. Wireless sensor networks (WSNs) [12] consist of a large number of autonomous nodes equipped with sensing capabilities, wireless communication interfaces, and limited processing and energy resources. The attraction of ants to pheromone represents the positive feedback in this swarm intelligent system. A stronger pheromone trail is built on the shorter path, and this allows ants to be drawn away from the suboptimal solution. Pheromone evaporation limits the amount of pheromone that can be placed on a trail. Fig.1 Ant Path Optimization Many ants are required to test the available paths to the food source. Each successive trip is a biased random choice by each ant. Each ant may have a different experience as it travels between the nest and the food source, and so these different experiences must be averaged out over time. Each trip represents a statistical test of the system. The sum of all trips and decisions by each ant is the eventual choice of the shortest path by the group. Ultimately, the act of each outgoing ant choosing the stronger pheromone trail yields an emergent shortest path algorithm. Akkaya and Younis [13] group routing protocols for WSNs into four categories: (i) data-centric, (ii) hierarchical, (iii) location based, and (iv) QoS-aware. Data-centric protocols do not require a globally unique ID for each sensor node, and perform mul-tihop routing by using attribute-based naming mechanisms. Most of the SI routing algorithms inspired by ant behaviors have been developed in the context of the framework of Ant Colony Optimization (ACO) [15,16,17], an optimization metaheuristic based on the abstraction and engineering of the basic mechanisms at work in ant colony foraging. For more comprehensive surveys, the interested reader is referred to [16,17,18,19,20] and the references therein. Pseudo Code of the algorithm: graph = {'S': {'A':1, 'B':9}, 'A': {'C':3, 'D':1}, 'B': {'D':1,'E':2}, 'C': {'F':2},'D': {'F':7,'G':8}, 'E': {'G':3}, 'F': {'T':5}, 'G': {'T':2} } newgraph ={'S':{'A':1, 'B':9},'A': {'D':1}, 'B': {'D':1,'E':2},'D': {'F':7,'G':8},'E': {'G':3},'F': {'T': 'G': {'T':2}} def findpaths(graph, start, end, path): path = path + [start]; if start == end: return [path]; if not graph.has_key(start): return []; paths = []; All Rights Reserved Page 299
3 for node in graph[start]: if node not in path: newpaths = findpaths(graph, node, end, path); for newpath in newpaths: paths.append(newpath) ; return paths; def costpairs(paths): for path in paths: i=0, cost=0 ; while i <= len(path)/2: cost=cost+calculatecost(path[i],path[i+1]) ; i=i+1 ; path.append(cost) def calculatecost(node1,node2): return graph[node1][node2] ; def findshortestpath(paths): def findshortestpath(paths): cost=9999; for path in paths: if path[len(path)-1]<cost: cost=path[len(path)-1]; i=paths.index(path); return i; def transferpackets(paths): for path in paths: packets.append(path[len(path)-1]*2) maxhopcount=max(packets); i=maxhopcount k while i>0: for packet in packets: packets[packets.index(packet)]=packets[packets.index(packet)]-1; if packets[packets.index(packet-1)]==0: return packets.index(packet-1); i=i-1; def calculatepheromone(packets,paths):i=0;for node in packets: remainder = float(node/((paths[i][len(paths[i])-1])*2.0)) *100 ; pheromone.append((100-remainder)*0.1); i=i+1 ; def display(paths): str = "-->"; print "Source:S","\n","Destination:T"; print "Different routes calculated:\n"; for path in paths: ele = path[:len(path)-1]; print "\t\t ",str.join(ele)," "; return ; #main part ; def main(graph): str="-->"; i=1; paths = findpaths(graph, 'S', 'T',path); costpairs(paths); display(paths); shortestpathindex=findshortestpath(paths); print "\npackets(ants) are transferred to destination following different paths" print "\npackets are being transferred..." ; fastestpacket=transferpackets(paths); ele = paths[fastestpacket]; ele = ele[:len(ele)-1]; print "\npacket following path ",str.join(ele)," reached first\n"; print "\npheromone of shortest path:10.0"; calculate pheromone(packets,paths); print "\npheromone of different routes:\n"; for ele in pheromone: All Rights Reserved Page 300
4 print "\troute",i,"-->",ele i=i+1 ele = paths[fastestpacket]; ele = ele[:len(ele)-1]; print "\nhighest priority is given to path",str.join(ele),"\nall the subsequent packets follow the same path" path=[]; pheromone=[]; packets=[]; main(graph); path=[]; pheromone=[]; packets=[]; print "\n case \n" print "Network changed, node C moved out of the network" main(newgraph); The Source S, Destination T, representing the initial and final nodes of the network. The different routes calculated shown above. The packets are transferred to destination folllowing different paths.n The packet are being transferred with the best one is showed seperately. The pheromone of the different routes is also shown. The highest priority is given to path and all the subsequent packets follow the same path. All Rights Reserved Page 301
5 In case 2 of the problem, the network is changed.ie., node c is moved out of the network. The source S and Destination T is taken as the source and the sink of the network. The different route calculated is shown above. The ants are transferred to destination is represented with packet with the best path is also represented. The pheromone of the different routes is shown and the highest priority is given to path is also repsented. All the subsequent packets follow the same path is shown with highest priority. III. OUTPUT ANALYSIS AND GRAPHS Comparison of Cost of the paths versus Pheromone Quantity: Representation of the Graph All Rights Reserved Page 302
6 The graph is represented with pheromone quantity is taken along the Y axis and the cost of the different routes is taken along the X axis. From the graph above, it is clear that the ants will choose the shortest path because it will have the highest pheromone intensity. IV. CONCLUSION Implementation of Swarm Intelligence Routing using Ant Colony optimization has been done and conclusions can be drawn. We can say that the act of each outgoing ant choosing the stronger pheromone trail yeilds an emergent shortest path algorithm. Ants are able to adopt to the new environment and then find the shortest path by being biased towards the pheromone gradient. REFERENCES [1] Andrew S Tannenbaum, Computer Networks, 4th Edition, Prentice-Hall of India [2] E. Bonabeau, M. Dorigo, and G. Théraulaz, Swarm intelligence: from natural to artificial systems, Oxford University Press, [3] T. White, "Swarm intelligence and problem solving in telecommunications", Canadian Artificial Intelligence Magazine, spring, International Journal of Next-Generation Networks (IJNGN),Vol.1, No.1, December 2009 [4] G. Di Caro and M. Dorigo, "Mobile agents for adaptive routing", Proc. 31st Hawaii International Conference on System Sciences, IEEE Computer Society Press, Los Alamitos, CA, pp , [5] Schoonderwoerd R, Holland O, Bruten J, Rothkrantz L. Ant-Based load Balancing in telecommunications networks, Adaptive Behavior Hewlelt-Packard Laboratories, Bristol- England, pp , [6] Nader F Mir, Computer and communication Networks, Pearson Education, 2007 [7] Liang S, Zincir Heywood A N, Heywood M I, The effect of Routing under local information using a Social insect Metaphor, IEEE International Congress of Evolutionary Computation, pp , May [8] Martin Roth and Stephen Wicker Termite: Emergent Ad-Hoc Networking " Wireless Intelligent Systems Laboratory School of Electrical and Computer Engineering Cornell University Ithaca, New York USA [9] E. Bonabeau, M. Dorigo, G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, New York, USA, [10] A. Engelbrecht, Computational Intelligence: An Introduction, second ed., Wiley, [11] J. Kennedy, R.C. Eberhart, Y. Shi, Swarm Intelligence, Morgan Kaufman, San Francisco, USA, [12] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A survey on sensor networks, IEEE Communications Magazine 40 (8) (2002) [13] K. Akkaya, M. Younis, A survey on routing protocols for wireless sensor networks, Ad Hoc Networks 3 (3) (2005) [14] J. Al-Karaki, A. Kamal, Routing techniques in wireless sensor networks: a survey, IEEE Wireless Communications 11 (6) (2004) [15] G.A. Di Caro, Ant Colony Optimization and Its Application to Adaptive Routing in Telecommunication Networks, Ph.D. Thesis, Faculté des Sciences Appliquées, Université Libre de Bruxelles (ULB), Brussels, Belgium, [16] M. Dorigo, G.A. Di Caro, The ant colony optimization metaheuristic, in: D. Corne, M. Dorigo (Eds.), New Ideas in Optimization, McGraw-Hill, 1999, pp [17] M. Dorigo, T. Stützle (Eds.), Ant Colony Optimization, MIT press, [18] A.A. Abbasi, M. Younis, A survey on clustering algorithms for wireless sensor networks, ACM Computer Communications 30 (14 15) (2007) [19] A. Boukerche, M. Ahmad, B. Turgut, D. Turgut, A taxonomy of routing protocols in sensor networks, in: A. Boukerche (Ed.), Algorithms and Protocols for Wireless Sensor Networks, Wiley, 2008, pp (Chapter 6). [20] Z. Jin, Y. Jian-Ping, Z. Si-Wang, L. Ya-Ping, L. Guang, A survey on position-based routing algorithms in wireless sensor networks, Algorithms 2 (1) (2009) All Rights Reserved Page 303
ADAPTIVE ROUTING ALGORITHM FOR MANET: TERMITE
ADAPTIVE ROUTING ALGORITHM FOR MANET: TERMITE Abstract 1 Sharvani G S, 2 Cauvery N K, 3 Dr.Rangaswamy.T Department of Computer Science & Engineering, RVCE, Bangalore, India 1 sharvanim.@yahoo.com, 2 cavi_giri@yahoo.co.in
More informationAdhoc Network Routing Optimization and Performance Analysis of ACO Based Routing Protocol
Adhoc Network Routing Optimization and Performance Analysis of ACO Based Routing Protocol Anubhuti Verma Abstract Ant Colony Optimization is based on the capability of real ant colonies of finding the
More informationANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)
ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET) DWEEPNA GARG 1 & PARTH GOHIL 2 1,2 Dept. Of Computer Science and Engineering, Babaria Institute of Technology, Varnama, Vadodara, India E-mail
More informationAnt Colony Optimization and its Application to Adaptive Routing in Telecommunication Networks
UNIVERSITÉ LIBRE DE BRUXELLES FACULTÉ DES SCIENCES APPLIQUÉES Ant Colony Optimization and its Application to Adaptive Routing in Telecommunication Networks Gianni Di Caro Dissertation présentée en vue
More information[Jagtap*, 5 (4): April, 2016] ISSN: (I2OR), Publication Impact Factor: 3.785
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY A SURVEY: ANT BASED BIO-INSPIRED ALGORITHM FOR AD-HOC NETWORK Anjali A Jagtap *, Prof. Ankita Agarwal, Prof. Dipak R Raut, Prof.
More informationAnt Colony Optimization for dynamic Traveling Salesman Problems
Ant Colony Optimization for dynamic Traveling Salesman Problems Carlos A. Silva and Thomas A. Runkler Siemens AG, Corporate Technology Information and Communications, CT IC 4 81730 Munich - Germany thomas.runkler@siemens.com
More informationNavigation of Multiple Mobile Robots Using Swarm Intelligence
Navigation of Multiple Mobile Robots Using Swarm Intelligence Dayal R. Parhi National Institute of Technology, Rourkela, India E-mail: dayalparhi@yahoo.com Jayanta Kumar Pothal National Institute of Technology,
More informationRouting in Dynamic Network using Ants and Genetic Algorithm
194 Routing in Dynamic Network using Ants and Genetic Algorithm Cauvery N K + and Dr K V Viswanatha * R V College of Engineering, Bangalore, India. Summary Routing in dynamic network is a challenging one,
More informationSWARM INTELLIGENCE -I
SWARM INTELLIGENCE -I Swarm Intelligence Any attempt to design algorithms or distributed problem solving devices inspired by the collective behaviourof social insect colonies and other animal societies
More informationNetwork routing problem-a simulation environment using Intelligent technique
Network routing problem-a simulation environment using Intelligent technique Vayalaxmi 1, Chandrashekara S.Adiga 2, H.G.Joshi 3, Harish S.V 4 Abstract Ever since the internet became a necessity in today
More informationA Review: Optimization of Energy in Wireless Sensor Networks
A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department
More informationSolving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
More informationSelf-Organization Swarm Intelligence
Self-Organization Swarm Intelligence Winter Semester 2010/11 Integrated Communication Systems Group Ilmenau University of Technology Motivation for Self-Organization Problem of today s networks Heterogeneity
More informationSwarm Intelligence (Ant Colony Optimization)
(Ant Colony Optimization) Prof. Dr.-Ing. Habil Andreas Mitschele-Thiel M.Sc.-Inf Mohamed Kalil 19 November 2009 1 Course description Introduction Course overview Concepts of System Engineering Swarm Intelligence
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationInternational Journal of Advancements in Research & Technology, Volume 2, Issue 9, September-2013 SN
International Journal of Advancements in Research & Technology, Volume 2, Issue 9, September-2013 146 Survey of Swarm Intelligence Inspired Routing Algorithms and Mobile Ad-Hoc Network Routing Protocols
More informationInternational Journal of Advanced Research Trends in Engineering and Technology (IJARTET) Vol. 4, Issue 8, August 2017
OPTANT- Optimized Ant Colony Routing For Mobile Ad-Hoc Networks P. Calduwel Newton 1, M. Syed Khaja Mohideen 2, C. Prasanna Ranjith 3 Assistant Professor, Department of CS, Government Arts College, Kulithalai,
More informationA Review of Ant Colony based Routing Algorithm in Wireless Ad-hoc Networks
A Review of Ant Colony based Routing Algorithm in Wireless Ad-hoc Networks Sai Priya Thottempudi $, Dr Syed Umar * $ Student, Department of ECE, V R Siddhartha Eng College, A.P.INDIA. * Assoc. Professor,
More informationOn-Line Scheduling Algorithm for Real-Time Multiprocessor Systems with ACO and EDF
On-Line Scheduling Algorithm for Real-Time Multiprocessor Systems with ACO and EDF Cheng Zhao, Myungryun Yoo, Takanori Yokoyama Department of computer science, Tokyo City University 1-28-1 Tamazutsumi,
More informationAnt Colony Optimization: The Traveling Salesman Problem
Ant Colony Optimization: The Traveling Salesman Problem Section 2.3 from Swarm Intelligence: From Natural to Artificial Systems by Bonabeau, Dorigo, and Theraulaz Andrew Compton Ian Rogers 12/4/2006 Traveling
More informationData Gathering for Wireless Sensor Network using PEGASIS Protocol
Data Gathering for Wireless Sensor Network using PEGASIS Protocol Kumari Kalpna a, Kanu Gopal b, Navtej katoch c a Deptt. of ECE, College of Engg.& Mgmt.,Kapurthala, b Deptt. of CSE, College of Engg.&
More informationOptimization of Ant based Cluster Head Election Algorithm in Wireless Sensor Networks
Optimization of Ant based Cluster Head Election Algorithm in Wireless Sensor Networks Siddharth Kumar M.Tech Student, Dept of Computer Science and Technology, Central University of Punjab, Punjab, India
More informationSwarm Intelligence: An Application of Ant Colony Optimization
International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) Swarm Intelligence: An Application of Ant Colony Optimization A. Ilamaran 1, S. Ganapathiram 2, R. Ashwin Kumar 3, J. Uthayakumar
More informationA New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization
A New Algorithm for the Distributed RWA Problem in WDM Networks Using Ant Colony Optimization Víctor M. Aragón, Ignacio de Miguel, Ramón J. Durán, Noemí Merayo, Juan Carlos Aguado, Patricia Fernández,
More informationInternational Journal of Current Trends in Engineering & Technology Volume: 02, Issue: 01 (JAN-FAB 2016)
Survey on Ant Colony Optimization Shweta Teckchandani, Prof. Kailash Patidar, Prof. Gajendra Singh Sri Satya Sai Institute of Science & Technology, Sehore Madhya Pradesh, India Abstract Although ant is
More informationVLSI Design of AntNet for Adaptive Network Routing
VLSI Design of Antet for Adaptive etwork Routing Jin-Ho Ahn, Jae Seuk Oh, Sungho Kang Department of Electrical and Electronic Engineering onsei University 134 Shinchon-Dong Seodaemoon-Gu, Seoul, Korea
More informationToward Self-Organizing, Self-Repairing and Resilient Large-Scale Distributed Systems
Toward Self-Organizing, Self-Repairing and Resilient Large-Scale Distributed Systems Alberto Montresor 1, Hein Meling 2, and Özalp Babaoğlu1 1 Department of Computer Science, University of Bologna, Mura
More informationAGENT-BASED ROUTING ALGORITHMS ON A LAN
AGENT-BASED ROUTING ALGORITHMS ON A LAN Y. Yang, A. N. Zincir-Heywood, M. I. Heywood, S. Srinivas Faculty of Computer Science, Dalhousie University {yang@cs.dal.ca, zincir@cs.dal.ca, mheywood@cs.dal.ca,
More informationENHANCED BEE COLONY ALGORITHM FOR SOLVING TRAVELLING SALESPERSON PROBLEM
ENHANCED BEE COLONY ALGORITHM FOR SOLVING TRAVELLING SALESPERSON PROBLEM Prateek Agrawal 1, Harjeet Kaur 2, and Deepa Bhardwaj 3 123 Department of Computer Engineering, Lovely Professional University (
More informationWireless Sensor Networks applications and Protocols- A Review
Wireless Sensor Networks applications and Protocols- A Review Er. Pooja Student(M.Tech), Deptt. Of C.S.E, Geeta Institute of Management and Technology, Kurukshetra University, India ABSTRACT The design
More informationH-ABC: A scalable dynamic routing algorithm
Chapter 1 H-ABC: A scalable dynamic routing algorithm B. Tatomir and L.J.M. Rothkrantz COMBINED Project, DECIS Lab, Delftechpark 24, 2628 XH Delft, The Netherlands, E-mail: b.tatomir@ewi.tudelft.nl Man-Machine
More informationDynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents
Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents Son-Hong Ngo 1, Xiaohong Jiang 1, Susumu Horiguchi 1, and Minyi Guo 2 1 Graduate School of Information Science, Japan Advanced
More informationReview of Bio-inspired Algorithm in Wireless Sensor Network: ACO, ACO using RSSI and Ant Clustering
Review of Bio-inspired Algorithm in Wireless Sensor Network: ACO, ACO using RSSI and Ant Clustering Niharika Sharma PG scholar DYPIT, Pimpri, Pune nehu2101@gmail.com Prof. S. D. Chavan Associate Professor,
More informationAnt Colony Optimization based Hybrid Routing Protocol for MANETs 1
Ant Colony Optimization based Hybrid Routing Protocol for MANETs 1 Essam H. Houssein, 2 Alaa A. K. Ismaeel 1 Dept. of Computer Science, Faculty of Computers and Informatics Benha University, Benha, Egypt
More informationMIRROR SITE ORGANIZATION ON PACKET SWITCHED NETWORKS USING A SOCIAL INSECT METAPHOR
MIRROR SITE ORGANIZATION ON PACKET SWITCHED NETWORKS USING A SOCIAL INSECT METAPHOR P. Shi, A. N. Zincir-Heywood and M. I. Heywood Faculty of Computer Science, Dalhousie University, Halifax NS, Canada
More informationAnt Colony based Routing for Mobile Ad-Hoc Networks towards Improved Quality of Services
Ant Colony based Routing for Mobile Ad-Hoc Networks towards Improved Quality of Services Bibhash Roy Tripura Institute of Technology, Narsingarh, Tripura, India Email: bibhashroy10@yahoo.co.in Suman Banik
More informationAnt Colonies, Self-Organizing Maps, and A Hybrid Classification Model
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 7th, 2004 Ant Colonies, Self-Organizing Maps, and A Hybrid Classification Model Michael L. Gargano, Lorraine L. Lurie, Lixin Tao,
More informationScalability of a parallel implementation of ant colony optimization
SEMINAR PAPER at the University of Applied Sciences Technikum Wien Game Engineering and Simulation Scalability of a parallel implementation of ant colony optimization by Emanuel Plochberger,BSc 3481, Fels
More informationRouting Problem: MANET And Ant Colony Algorithm
Routing Problem: MANET And Ant Colony Algorithm Dr Madhumita Dash 1, Mrs Madhusmita Balabantaray 2 Department Of Electronics & Telecommunication, OEC, Bhubaneswar,India 1 Professor, 2 Asst. Professor madhumitadash44@yahoo.com,
More informationSolving Travelling Salesmen Problem using Ant Colony Optimization Algorithm
SCITECH Volume 3, Issue 1 RESEARCH ORGANISATION March 30, 2015 Journal of Information Sciences and Computing Technologies www.scitecresearch.com Solving Travelling Salesmen Problem using Ant Colony Optimization
More informationQUERY LOCALIZATION USING PHEROMONE TRAILS: A SWARM INTELLIGENCE INSPIRED APPROACH. Nupur Kothari, Vartika Bhandari and Dheeraj Sanghi
QUERY LOCALIZATION USING PHEROMONE TRAILS: A SWARM INTELLIGENCE INSPIRED APPROACH Nupur Kothari, Vartika Bhandari and Dheeraj Sanghi Department of Computer Science & Engineering Indian Institute of Technology
More informationToward Self-Organizing, Self-Repairing and Resilient Distributed Systems
Toward Self-Organizing, Self-Repairing and Resilient Distributed Systems Alberto Montresor 1, Hein Meling 2, and Özalp Babaoğlu1 1 Department of Computer Science, University of Bologna, Mura Anteo Zamboni
More informationBee-Inspired Protocol Engineering
Muddassar Farooq Bee-Inspired Protocol Engineering From Nature to Networks With 128 Figures and 61 Tables Springer 1 Introduction 1 1.1 Motivation of the Work 2 1.2 Problem Statement 4 1.2.1 Hypotheses
More informationCOMPARISON OF ENERGY EFFICIENT DATA TRANSMISSION APPROACHES FOR FLAT WIRELESS SENSOR NETWORKS
COMPARISON OF ENERGY EFFICIENT DATA TRANSMISSION APPROACHES FOR FLAT WIRELESS SENSOR NETWORKS Saraswati Mishra 1 and Prabhjot Kaur 2 Department of Electrical, Electronics and Communication Engineering,
More informationImage Edge Detection Using Ant Colony Optimization
Image Edge Detection Using Ant Colony Optimization Anna Veronica Baterina and Carlos Oppus Abstract Ant colony optimization (ACO) is a population-based metaheuristic that mimics the foraging behavior of
More informationAntHocNet: an Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks
AntHocNet: an Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks Gianni Di Caro, Frederick Ducatelle and Luca Maria Gambardella Technical Report No. IDSIA-25-04-2004 August 2004 IDSIA / USI-SUPSI
More informationANT COLONY OPTIMIZATION FOR FINDING BEST ROUTES IN DISASTER AFFECTED URBAN AREA
ANT COLONY OPTIMIZATION FOR FINDING BEST ROUTES IN DISASTER AFFECTED URBAN AREA F Samadzadegan a, N Zarrinpanjeh a * T Schenk b a Department of Geomatics Eng., University College of Engineering, University
More informationInformation Sciences
Information Sciences 181 (2011) 4597 4624 Contents lists available at ScienceDirect Information Sciences journal homepage: www.elsevier.com/locate/ins Swarm intelligence based routing protocol for wireless
More informationPARTICLE SWARM OPTIMIZATION (PSO)
PARTICLE SWARM OPTIMIZATION (PSO) J. Kennedy and R. Eberhart, Particle Swarm Optimization. Proceedings of the Fourth IEEE Int. Conference on Neural Networks, 1995. A population based optimization technique
More informationAutomatic Programming with Ant Colony Optimization
Automatic Programming with Ant Colony Optimization Jennifer Green University of Kent jg9@kent.ac.uk Jacqueline L. Whalley University of Kent J.L.Whalley@kent.ac.uk Colin G. Johnson University of Kent C.G.Johnson@kent.ac.uk
More informationDevelopment of Swarm Intelligent Systems for MANET
Development of Swarm Intelligent Systems for MANET By Sharvani G S Supervisor Dr. T. M. Rangaswamy A Thesis submitted to Avinashilingam University for Women, Coimbatore-43 In partial fulfilment of the
More informationAnt Colony Optimization
Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It
More informationIMPLEMENTATION OF OPTIMIZED ANT BASED ROUTING ALGORITHM FOR MANET
IMPLEMENTATION OF OPTIMIZED ANT BASED ROUTING ALGORITHM FOR MANET Anjali Jagtap 1, Ashok Shinde 2, Smita Kadam 3, Dipak Raut 4, Parag Hirulkar 5 12345 Assistant Professor, Department of Electronics & Telecommunication,
More informationPerformance evaluation of AODV, DSDV and AntHocNet in video transmission
Performance evaluation of AODV, DSDV and AntHocNet in video transmission Neelam S. Labhade, S.S.Vasekar Abstract Now a days wireless technologies are important in the world of communication due to its
More informationHierarchical routing in traffic networks
Hierarchical routing in traffic networks Bogdan Tatomir ab Henrik Dibowski c Leon Rothkrantz ab a Delft University of Tehnology, Mekelweg 4, 2628 CD Delft b DECIS Lab, Delftechpark 24, 2628 XH Delft, The
More informationDynamic Robot Path Planning Using Improved Max-Min Ant Colony Optimization
Proceedings of the International Conference of Control, Dynamic Systems, and Robotics Ottawa, Ontario, Canada, May 15-16 2014 Paper No. 49 Dynamic Robot Path Planning Using Improved Max-Min Ant Colony
More informationInternational Journal of Computer Engineering and Applications, Volume XII, Special Issue, August 18, ISSN
International Journal Computer Engineering and Applications, INTELLIGENT ROUTING BASED ON ACO TECHNIQUE F FAULT RING IN 2D-MESHES Gaytri Kumari Gupta research sclar, Jharkhand Rai University, Ranchi-India
More informationNORMALIZATION OF ACO ALGORITHM PARAMETERS
U.P.B. Sci. Bull., Series C, Vol. 79, Iss. 2, 2017 ISSN 2286-3540 NORMALIZATION OF ACO ALGORITHM PARAMETERS Alina E. NEGULESCU 1 Due to the fact that Swarm Systems algorithms have been determined to be
More informationAnalysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN
Analysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN Mr. V. Narsing Rao 1, Dr.K.Bhargavi 2 1,2 Asst. Professor in CSE Dept., Sphoorthy Engineering College, Hyderabad Abstract- Wireless Sensor
More informationInternational Journal of Modern Trends in Engineering and Research e-issn No.: , Date: 2-4 July, 2015
International Journal of Modern Trends in Engineering and Research www.ijmter.com e-issn No.:2349-9745, Date: 2-4 July, 2015 A Novel Method for Edge Detection of a Color Image with ACO algorithm in Swarm
More informationAn Experimental Study of the Simple Ant Colony Optimization Algorithm
An Experimental Study of the Simple Ant Colony Optimization Algorithm MARCO DORIGO and THOMAS STÜTZLE IRIDIA Université Libre de Bruxelles Avenue Franklin Roosevelt 50, CP 194/6, 1050 Brussels BELGIUM
More informationIMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM
IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM Er. Priya Darshni Assiociate Prof. ECE Deptt. Ludhiana Chandigarh highway Ludhiana College Of Engg. And Technology Katani
More informationIntuitionistic Fuzzy Estimations of the Ant Colony Optimization
Intuitionistic Fuzzy Estimations of the Ant Colony Optimization Stefka Fidanova, Krasimir Atanasov and Pencho Marinov IPP BAS, Acad. G. Bonchev str. bl.25a, 1113 Sofia, Bulgaria {stefka,pencho}@parallel.bas.bg
More informationA Swarm-based Distance Vector Routing to Support Multiple Quality of Service (QoS) Metrics in Mobile Adhoc Networks
Journal of Computer Science 3 (9): 700-707, 2007 ISSN 1549-3636 2007 Science Publications A Swarm-based Distance Vector Routing to Support Multiple Quality of Service (QoS) Metrics in Mobile Adhoc Networks
More informationAn Ant Approach to the Flow Shop Problem
An Ant Approach to the Flow Shop Problem Thomas Stützle TU Darmstadt, Computer Science Department Alexanderstr. 10, 64283 Darmstadt Phone: +49-6151-166651, Fax +49-6151-165326 email: stuetzle@informatik.tu-darmstadt.de
More informationAnt Colony Optimization Algorithm for Robot Path Planning
Ant Colony Optimization Algorithm for Robot Path Planning I I 2 1 Michael Brand, Michael Masuda, Nicole Wehner, XiaoHua Yu 1 Department of Electrical Engineering, California Polytechnic State University
More informationSWARM INTELLIGENCE BASED DYNAMIC SOURCE ROUTING FOR IMPROVED QUALITY OF SERVICE
SWARM INTELLIGENCE BASED DYNAMIC SOURCE ROUTING FOR IMPROVED QUALITY OF SERVICE 1 N.UMAPATHI, 2 N.RAMARAJ 1 Research Scholar, Department of Electronics and Communication, GKM College of Engg and Tech,Chennai-63,,
More informationA Fuzzy Optimized, Bee inspired Routing Protocol for Improved QoS in Mobile Ad Hoc Networks
, pp.169-174 http://dx.doi.org/10.14257/astl.2016.135.41 A Fuzzy Optimized, Bee inspired Routing Protocol for Improved QoS in Mobile Ad Hoc Networks Anush Baskaran, Sushant Ramesh, Ronnie D. Caytiles*
More informationTHE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM
THE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM Adel Alinezhad Kolaei and Marzieh Ahmadzadeh Department of Computer Engineering & IT Shiraz University of Technology
More informationLocation Based Energy-Efficient Reliable Routing Protocol for Wireless Sensor Networks
Location Based Energy-Efficient Reliable Routing Protocol for Wireless Sensor Networks RAFE ALASEM 1, AHMED REDA 2 AND MAHMUD MANSOUR 3 (1) Computer Science Department Imam Muhammad ibn Saud Islamic University
More informationAn Approach Using Ant-like Agents. Alice Forehand Robert Pienta
An Approach Using Ant-like Agents Alice Forehand Robert Pienta Calls made between two points are routed through a number of intermediate nodes of limited capacity If a node is full, calls that try to pass
More informationBalanced Load Sharing Protocol for Wireless Sensor Networks
Balanced Load Sharing Protocol for Wireless Sensor Networks Maytham Safarª, Rabie Al-Mejbas b ªCollege of Engineering and Petroleum Kuwait University, Kuwait State ªE-mail: maytham@me.com, b mejbas@hotmail.com
More informationEnhanced Artificial Bees Colony Algorithm for Robot Path Planning
Enhanced Artificial Bees Colony Algorithm for Robot Path Planning Department of Computer Science and Engineering, Jaypee Institute of Information Technology, Noida ABSTRACT: This paper presents an enhanced
More informationAn Innovative Approach to increase the Life time of Wireless Sensor Networks
An Innovative Approach to increase the Life time of Wireless Sensor Networks R.Deenadhayalan [1] Department of Information Technology Kongu Engineering College Perundurai, Erode Dr.S Anandamurugan [2]
More informationAnt Colony Based Load Flow Optimisation Using Matlab
Ant Colony Based Load Flow Optimisation Using Matlab 1 Kapil Upamanyu, 2 Keshav Bansal, 3 Miteshwar Singh Department of Electrical Engineering Delhi Technological University, Shahbad Daulatpur, Main Bawana
More informationANALYSIS OF ANTHOCNET AND AODV PERFORMANCE USING NS2
ANALYSIS OF ANTHOCNET AND PERFORMANCE USING NS2 Y. Lakshmi Prasanna 1 and Dr. P. Chenna Reddy 2 1 Department of Computer Science and Engineering, JNTUACEP, Pulivendula 2 Professor of CSE Department, JNTUACEP,
More informationAn Efficient Algorithm for Improving Qos in MANETs
International Journal of Scientific and Research Publications, Volume 4, Issue 2, February 2014 1 An Efficient Algorithm for Improving Qos in MANETs 1 R.T.Thivya lakshmi, 2 R.Srinivasan, 3 G.S.Raj 1 PG
More informationAnt colony optimization with genetic operations
Automation, Control and Intelligent Systems ; (): - Published online June, (http://www.sciencepublishinggroup.com/j/acis) doi:./j.acis.. Ant colony optimization with genetic operations Matej Ciba, Ivan
More informationContents Introduction A Comprehensive Survey of Nature-Inspired Routing Protocols
1 Introduction... 1 1.1 MotivationoftheWork... 2 1.2 ProblemStatement... 4 1.2.1 Hypotheses......................................... 5 1.3 An Engineering Approach to Nature-Inspired Routing Protocols...
More informationHybrid of Ant Colony Optimization and Gravitational Emulation Based Load Balancing Strategy in Cloud Computing
Hybrid of Ant Colony Optimization and Gravitational Emulation Based Load Balancing Strategy in Cloud Computing Jyoti Yadav 1, Dr. Sanjay Tyagi 2 1M.Tech. Scholar, Department of Computer Science & Applications,
More informationSelf-Organization in Autonomous Sensor/Actuator Networks [SelfOrg]
Self-Organization in Autonomous Sensor/Actuator Networks [SelfOrg] PD Dr.-Ing. Falko Dressler Computer Networks and Communication Systems Department of Computer Science University of Erlangen http://www7.informatik.uni-erlangen.de/~dressler/
More informationAn Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm
An Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm Prabha S. 1, Arun Prabha K. 2 1 Research Scholar, Department of Computer Science, Vellalar
More informationInternational Journal of Computational Intelligence and Applications c World Scientific Publishing Company
International Journal of Computational Intelligence and Applications c World Scientific Publishing Company The Accumulated Experience Ant Colony for the Traveling Salesman Problem JAMES MONTGOMERY MARCUS
More informationAS-PUMA : ANYCAST SEMANTICS IN PARKING USING METAHEURISTIC APPROACH
AS-PUMA : ANYCAST SEMANTICS IN PARKING USING METAHEURISTIC APPROACH ABSTRACT Rahul K Dixit 1 and Rahul Johari 2 1 Research Scholar, USICT, GGS Indraprastha University, Delhi-110078 rahul.1234dixit@gmail.com
More informationAN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS
AN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS YINGHUI QIU School of Electrical and Electronic Engineering, North China Electric Power University, Beijing, 102206, China ABSTRACT
More informationProposal on Multi agent Ants based Routing Algorithm for Mobile Ad-Hoc Networks
260 Proposal on Multi agent Ants based Routing Algorithm for Mobile Ad-Hoc Networks Siva Kumar.D* Bhuvaneswaran.R.S** *Department of Electrical Electronics, Research Scholar, Anna University, Chennai 600
More informationOptimistic Path using Artificial Bee Colony Approach
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 13 (2014), pp. 1255-1261 International Research Publications House http://www. irphouse.com Optimistic Path
More informationThe Ant Colony Optimization Meta-Heuristic 1
The Ant Colony Optimization Meta-Heuristic 1 Marco Dorigo and Gianni Di Caro IRIDIA Université Libre de Bruxelles {mdorigo,gdicaro}@ulb.ac.be 1 To appear in D. Corne, M. Dorigo and F. Glover, editors,
More informationWorkflow Scheduling Using Heuristics Based Ant Colony Optimization
Workflow Scheduling Using Heuristics Based Ant Colony Optimization 1 J.Elayaraja, 2 S.Dhanasekar 1 PG Scholar, Department of CSE, Info Institute of Engineering, Coimbatore, India 2 Assistant Professor,
More informationROUTING IN MANETS USING ACO WITH MOBILITY ASSISTANCE
ISSN : 0973-7391 Vol. 3, No. 1, January-June 2012, pp. 97-101 ROUTING IN MANETS USING ACO WITH MOBILITY ASSISTANCE Praveen Biradar 1, and Sowmya K.S 2 1,2 Dept. Of Computer Science and Engineering, Dayananda
More informationStudy on Wireless Sensor Networks Challenges and Routing Protocols
International Research Journal of Applied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 5 (7): 824-828 Science Explorer Publications Study on Wireless Sensor Networks
More informationTony White, Bernard Pagurek, Dwight Deugo
From: FLAIRS-02 Proceedings. Copyright 2002, AAAI (www.aaai.org). All rights reserved. Biologically-inspired Agents for Priority Routing in Networks Tony White, Bernard Pagurek, Dwight Deugo School of
More informationEnergy Efficient Multihop Routing scheme with in Network Aggregation for WSN
International Journal of Computational Engineering & Management, Vol. 5 Issue 5, September 202 www..org 0 Energy Efficient Multihop Routing scheme with in Network Aggregation for WSN Manisha Jangra, Shamsher
More informationA new improved ant colony algorithm with levy mutation 1
Acta Technica 62, No. 3B/2017, 27 34 c 2017 Institute of Thermomechanics CAS, v.v.i. A new improved ant colony algorithm with levy mutation 1 Zhang Zhixin 2, Hu Deji 2, Jiang Shuhao 2, 3, Gao Linhua 2,
More informationAn Ant Colony Optimization approach to solve Travelling Salesman Problem
An Ant Colony Optimization approach to solve Travelling Salesman Problem Dr. K. Shyamala 1, Associate Professor, Dr. Ambedkar Government Arts College (Autonomous), Chennai. Shyamalakannan2000@gmail.com
More informationA SURVEY ON ANT SYSTEM BASED MULTICAST ROUTING IN MOBILE AD HOC NETWORKS
International Journal of Latest Trends in Engineering and Technology Special Issue SACAIM 2016, pp. 59-65 e-issn:2278-621x A SURVEY ON ANT SYSTEM BASED MULTICAST ROUTING IN MOBILE AD HOC NETWORKS Mani
More informationAnt n-queen Solver. Salabat Khan, Mohsin Bilal, Muhammad Sharif, Rauf Baig
International Journal of Artificial Intelligence, ISSN 0974-0635; Int. J. Artif. Intell. Autumn (October) 2011, Volume 7, Number A11 Copyright 2011 by IJAI (CESER Publications) Ant n-queen Solver Salabat
More informationAnt Colony Optimization for Dynamic Routing in Wireless Computer Networks for Improvement in Quality of Services
Ant Colony Optimization for Dynamic Routing in Wireless Computer Networks for Improvement in Quality of Services Anuj Sharma, PhD. Professor & Director Institute of Technology Roorkee (ITR, Roorkee) Mahendra
More informationViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing
ViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing Jaekwang Kim Department of Electrical and Computer Engineering, Sungkyunkwan University, Suwon,
More informationReview on Ant Colony Optimization Routing Algorithms in MANETs
Review on Ant Colony Optimization Routing Algorithms in MANETs 1 Jubin Sebastian E, 2 Joseena M Jose 1 Assist Professor, Department of Electronics and Communication Engineering Vimal Jyothi Engineering
More information