Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Artificial Life
The Challenges of Mobile Computing
Computer
Using the Cross-Entropy Method to Guide/Govern Mobile Agent's Path Finding in Networks
MATA '01 Proceedings of the Third International Workshop on Mobile Agents for Telecommunication Applications
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics)
Urban multi-hop broadcast protocol for inter-vehicle communication systems
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Independent zone routing: an adaptive hybrid routing framework for ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A Biologically Inspired QoS Routing Algorithm for Mobile Ad Hoc Networks
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
Routing protocol for ad hoc mobile networks using mobility prediction
International Journal of Ad Hoc and Ubiquitous Computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Ad Hoc Networking
Performance of Expanding Ring Search Scheme in AODV Routing Algorithm
FGCN '08 Proceedings of the 2008 Second International Conference on Future Generation Communication and Networking - Volume 02
Models for Pheromone Evaluation in Ant Systems for Mobile Ad-hoc Networks
EMERGING '09 Proceedings of the 2009 First International Conference on Emerging Network Intelligence
Overhead reduction in a distributed path management system
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Computational Intelligence Magazine
Ant-Based systems for wireless networks: retrospect and prospects
IWSOS'12 Proceedings of the 6th IFIP TC 6 international conference on Self-Organizing Systems
| Hi-index | 0.00 |
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA) offers a low overhead solution, by optimizing the routing process. Three complementary strategies were used in our approach: during the route discovery we have used a new broadcast mechanism, called the Controlled Neighbor Broadcast (CNB), in which each node broadcasts a control message (FANT) to its neighbors, but only one of them broadcast this message again. During the route maintenance phase, we further reduce the overhead, by only using data packets to refresh the paths of active sessions. Finally, the route repair phase is also enhanced, by using a deep search procedure as a way of restricting the number of nodes used to recover a route. Thus, instead of discovering a new path from the source to the destination, we start by trying the discovery of a new path between the two end-nodes of the broken link. A broadest search is only executed when the deeper one fails to succeed. We simulated our proposal and we tuned it to the optimal performance. We also compared it with the classical approach of AODV and other biological routing approaches. The results achieved show that SARA offers the smallest overhead of all the protocols under evaluation and presents an overhead reduction of almost 25% of the value achieved by the other proposals. SARA also presents the best goodput, specially for TCP traffic, but it needs more time to discover the routes.