A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
An efficient opportunistic cooperative diversity protocol for IEEE 802.11 networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Low complexity set reconciliation using Bloom filters
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
An event-based packet dropping detection scheme for wireless mesh networks
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
Experimental evaluation of a wireless community mesh network
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Improving fairness in IEEE 802.11 networks using MAC layer opportunistic retransmission
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Distributed and Collaborative Intrusion Detection Architecture for Wireless Mesh Networks
Mobile Networks and Applications
Hi-index | 0.00 |
The proliferation of mesh or ad hoc network protocols has lead to a push for protocol standardisation. While there are a number of both open-source and proprietary mesh routing protocols being developed, there is only a small amount of literature available that shows relative strengths and weaknesses of different protocols. This paper investigates the performance of a number of available routing protocols using a real-world testbed. Three routing protocols - Optimised Link State Routing (OLSR), Better Approach To Mobile Ad hoc Network (B.A.T.M.A.N.) and BABEL - were chosen for this study. Our investigations focus on the multi-hopping performance and the ability of each routing protocol to recover from link failures. Our results show that B.A.T.M.A.N. and BABEL outperform OLSR both in terms of multi-hopping performance and in route re-discovery latency.