scholarly journals Infrastructure Network Design with a Multi-Model Approach: Comparing Geometric Graph Theory with an Agent-Based Implementation of an Ant Colony Optimization

2014 ◽  
Vol 17 (4) ◽  
Author(s):  
Petra Heijnen ◽  
Émile J.L. Chappin ◽  
Igor Nikolic
Keyword(s):  
Graph Theory ◽  
Network Design ◽  
Ant Colony Optimization ◽  
Geometric Graph ◽  
Ant Colony ◽  
Agent Based ◽  
Infrastructure Network ◽  
Model Approach

scholarly journals Limiting the Excess Broadcast in Multipath Routing Using Ant Colony Optimization

2018 ◽  
Vol 7 (3.1) ◽  
pp. 70
Author(s):  
Amanpreet Kaur ◽  
Gurpreet Singh ◽  
Rohan Gupta
Keyword(s):  
Ant Colony Optimization ◽  
Multipath Routing ◽  
Ant Colony ◽  
Delivery Ratio ◽  
Agent Based ◽  
Mobile Adhoc Network ◽  
End To End Delay ◽  
Adhoc Network ◽  
Work Done ◽  
Single Path

Single path routing in mobile adhoc network (MANET) suffers from frequent disconnections due to movement of nodes. So, multipath routing evolves as a solution to the single path routing. Many researchers are working on devising multipath routing protocols with new features and strategies. Ant colony optimization is also used by many investigators for developing new solutions for multipath routing in MANET. In this paper we have worked on controlling the broadcast being done by the intermediate nodes. We improved on our work done in Amanpreet Kaur et al. titled “ACO Agent Based Routing in AOMDV Environment” by making use of channel contention and backoff technique. We compared the newly designed algorithm with three broad categories unipath, multipath and ant based algorithm. The new algorithm performs better as compared with other algorithms on the basis of various QoS metrics like throughput, jitter, end to end delay, and number of packets send, lost in packets and delivery ratio.  

A Metaheuristic Approach to the Graceful Labeling Problem

2010 ◽  
Vol 1 (4) ◽  
pp. 42-56 ◽  
Author(s):  
Houra Mahmoudzadeh ◽  
Kourosh Eshghi
Keyword(s):  
Graph Theory ◽  
Ant Colony Optimization ◽  
Optimization Problem ◽  
Ant Colony ◽  
Absolute Difference ◽  
Graceful Labeling ◽  
The Absolute

In graph theory, a graceful labeling of a graph G = (V, E) with n vertices and m edges is a labeling of its vertices with distinct integers between 0 and m inclusive, such that each edge is uniquely identified by the absolute difference between its endpoints. In this paper, the well-known graceful labeling problem of graphs is represented as an optimization problem, and an algorithm based on Ant Colony Optimization metaheuristic is proposed for finding its solutions. In this regard, the proposed algorithm is applied to different classes of graphs and the results are compared with the few existing methods inside of different literature.

Ant colony optimization for PON network design

2011 ◽  
Author(s):  
Weicheng Xiong ◽  
Chanle Wu ◽  
Libing Wu ◽  
Xiaojun Guo ◽  
Yibo Chen ◽  
...  
Keyword(s):  
Network Design ◽  
Ant Colony Optimization ◽  
Ant Colony
Sign in / Sign up

Export Citation Format

Share Document