Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A routing protocol for packet radio networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
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
MCR: MAC-assisted congestion-controlled routing for wireless multihop networks
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
This paper presents EARA-CG, an improved version of a swarm-intelligence ad hoc routing algorithm EARA introduced in [10]. Based on the understanding of the evolutionary cooperation in the biological swarm, we use the principle of swarm intelligence to reinforce good quality routes with only local communication. The concept of stigmergy is adopted to reduce the amount of control traffic. By locally monitoring the network transmission queue and other MAC layer information, this algorithm can forward data traffic through paths that avoid network hotspots. The datatraffic influences routing table updates at each node. We also discuss an evaluation methodology to simulate ad hoc networks, and the simulation results show that this novel routing algorithm scales well to a variety of network conditions.