Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ant-based load balancing in telecommunications networks
Adaptive Behavior
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Ad hoc multicast routing algorithm with swarm intelligence
Mobile Networks and Applications
BeeAdHoc: an energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Bee-inspired foraging in an embodied swarm
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
BeeIP - A Swarm Intelligence based routing for wireless ad hoc networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
Mobile Ad-hoc Networks (MANETs) pose a challenging problem to routing protocols. They consist of nodes with high mobility and there is no preset infrastructure available. Instead, connections are set-up wirelessly and the radio range is limited. Therefore, each node only perceives its local environment and has no complete information about the rest of the network. Moreover, an ad-hoc created infrastructure between nodes is temporary. Due to node mobility and antenna range, nodes may become unreachable. Nodes are also limited in resources, e.g., battery power and memory. Despite these properties, routing protocols are still able to route in MANETs. However, there is a cost involved. Routing efforts may experience high end-to-end delay, low scalability, and low average performance. In this paper we present a novel Swarm Intelligence routing algorithm for Wireless Mobile Ad-hoc Networks, named Stigmergic Landmark Routing (SLR). It is inspired by the behavior of bees and uses the concept of landmarks to indicate key nodes which store routing information. Consequently, little routing information needs to be stored and maintained in the network. This results in a significant performance increase when compared to state of the art algorithms in networks up to 100 nodes with multiple data sources.