ACM Transactions on Computer Systems (TOCS)
Linux Kernel Module Programming Guide
Linux Kernel Module Programming Guide
On the accuracy of MANET simulators
Proceedings of the second ACM international workshop on Principles of mobile computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On demand label switching for spontaneous edge networks
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
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
Architecture and evaluation of an unplanned 802.11b mesh network
Proceedings of the 11th annual international conference on Mobile computing and networking
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Lessons from experimental MANET research
Ad Hoc Networks
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We describe the design of MagAntA, a software suite for the implementation of probabilistic routing in ad hoc networks under Linux. MagAntA is written in C and runs completely in user space. This, together with its modular structure, makes it easy to adapt and extend with new algorithms. MagAntA makes use of the Ana4 framework [3], a set of kernel modules that provide the necessary functionalities to support ad hoc mesh networking and facilitate integration with the Linux routing protocol stack. A new version of Ana4 presented in [25] passes each data packet up to user space for routing purposes. Building on this architecture gives MagAntA the possibility to have complete control over routing in user space, so that the per-packet stochastic forwarding typical for probabilistic routing can easily be implemented. MagAntA can also be used in other types of networks such as traditional wired networks, and can easily be extended to incorporate different types of routing algorithms, other than probabilistic ones.