Sciweavers

Share
ADHOC
2010

Simple ant routing algorithm strategies for a (Multipurpose) MANET model

8 years 8 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
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 lin...
Fernando Correia, Teresa Vazão
Added 20 Mar 2011
Updated 20 Mar 2011
Type Journal
Year 2010
Where ADHOC
Authors Fernando Correia, Teresa Vazão
Comments (0)
books