Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
An efficient multicast routing protocol in wireless mobile networks
Wireless Networks
A distributed mechanism for topology discovery in ad hoc wireless networks using mobile agents
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
MARP: A Multi-Agent Routing Protocol for Mobile Wireless Ad Hoc Networks
Autonomous Agents and Multi-Agent Systems
Ad Hoc Networking
Ants and reinforcement learning: a case study in routing in dynamic networks
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Global consensus emergence in an unstructured semantic network
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Ant-based routing for wireless multimedia sensor networks using multiple QoS metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Short and robust communication paths in dynamic wireless networks
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Expert Systems with Applications: An International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
CGrAnt: a swarm intelligence-based routing protocol for delay tolerant networks
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Ant colony algorithms in MANETs: A review
Journal of Network and Computer Applications
Proceedings of the First International Conference on Security of Internet of Things
Hi-index | 0.01 |
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The effectiveness of the heuristic algorithm is supported by mathematical proofs and demonstrated by a comparison with the well-known Ad hoc On Demand Distance Vector (AODV) algorithm. The differences and the similarities of the two algorithms have been highlighted. Results obtained by a theoretical analysis and a simulation campaign show that DAR allows obtaining some important advantages that makes it a valuable candidate to operate in ad hoc networks and the same method helps in the selection of the algorithm parameters. Since the approach aims at minimizing complexity in the nodes at the expenses of the optimality of the solution, it results to be particularly suitable in environments where fast communication establishment and minimum signalling overhead are requested. These requirements are typical of ad hoc networks with critical connectivity, as described in the paper. Thus the performance of the proposed algorithm are shown in ad hoc networks with critical connectivity and compared to some existing ad hoc routing algorithms.