An Experimental Comparison of Routing Protocols - Murdoch ...

usual hierarchical addressing that occurs at the network layer.
Equally, routing at the data link layer is fundamentally wrong
because the data link layer will be performing routing; which
is a network layer function. Regardless of the layer chosen,
traditional layering principles will be distorted.
Upon inspection of the BATMAN L2 and BATMAN L3
results, the only major performance difference between data
link layer routing and network layer routing is the packet
size. Data link layer routing protocols will not require a
network layer IPv4/IPv6 header and may therefore be smaller.
This argument is of minimal consequence because the routing
protocol is a far bigger determinant of overheads. To illustrate
this point, Babel, which uses a large IPv6 header, increasing
the packet size of every routing message by 40 bytes, has
lower overheads than BATMAN L2 which operates without
a IP header. We conclude that the layer has few performance
benefits or drawbacks and that the decision to use one or the
other should be architectural.
VI. CONCLUSION
This research compares routing protocols, however, more
specifically, it investigates the cause of performance loss or
gain in multi hop ad hoc networks. We have confirmed the
findings of the only other peer reviewed experimental study
[24] that tested Babel. The conclusion is that in small wireless
networks, Babel offers higher throughputs. The results confirm
that the overhead of OLSR is higher than BATMAN [26],
[24], but contradict other studies that claim large throughput
differences between OLSR and BATMAN [26], [24]. The
results of this study suggest that the performance of OLSR
and BATMAN is similar.
A separate conclusion is that, in small multi hop ad hoc
networks, the overhead of the routing protocol has the largest
impact on throughput. In the future, similar tests should be
run in larger experimental set-ups. Statistics on CPU load
and convergence time could also be interesting. This study
concludes that Babel provides higher throughputs in small
networks but it is untested in larger networks. These findings
should provide the impetus for further experimentation.
REFERENCES
[1] Philippe Jacquet, Anis Laouiti, Pascale Minet, and Laurent Viennot,
“Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols”,
in NETWORKING ’02: Proceedings of the Second International
IFIP-TC6 Networking Conference on Networking Technologies,
Services, and Protocols; Performance of Computer and Communication
Networks; and Mobile and Wireless Communications, London, UK,
2002, pp. 387–398, Springer-Verlag.
[2] Juliusz Chroboczek, “The Babel Routing Protocol”, Internet-Draft, April
2009.
[3] Stefano Basagni, Imrich Chlamtac, Violet R. Syrotiuk, and Barry A.
Woodward, “A Distance Routing Effect Algorithm for Mobility
(DREAM)”, in MobiCom ’98: Proceedings of the 4th Annual ACM/IEEE
International Conference on Mobile Computing and Networking, New
York, NY, USA, 1998, pp. 76–84, ACM.
[4] Guangyu Pei Mario, Mario Gerla, and Tsu wei Chen, “Fisheye State
Routing: A Routing Scheme for Ad Hoc Wireless Networks”, in in
Proceedings of ICC 2000, 2000, pp. 70–74.
164
[5] Joseph P. Macker and Justin W. Dean, “A Study of Link State Flooding
Optimizations For Scalable Wireless Networks”, in MILCOM 2003:
Military Communications Conference. 2003, vol. 2, pp. 1262–1267,
IEEE.
[6] Cesar A. Santivanez and Ram Ramanathan, Ad Hoc Wireless Networking,
chapter Scalability of Routing in Ad Hoc Networks: Principles and
Practice, pp. 562 – 616, Kluwer Acedemic Publishers, 2003.
[7] Andreas Tonnesen and Thomas Lopatic and Hannes Gredler and Bernd
Petrovitsch and Aaron Kaplan and Sven-Ola Tucke, “OLSR development
at http://www.olsr.org/”, Internet: http://www.olsr.org/, 2009.
[8] Charles E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination-
Sequenced Distance-Vector routing (DSDV) for mobile computers”,
SIGCOMM Computer Communications Review, vol. 24, no. 4, pp. 234–
244, 1994.
[9] Thomas R. Henderson, Phillip A. Spagnolo, and Jae H. Kim, “A
Wireless Interface Type for OSPF”, MILCOM Military Communications
Conference, vol. 2, pp. 1256 – 1261, 2003.
[10] Cedric Adjih, Philippe Jacquet, and Laurent Viennot, “Computing
Connected Dominated Sets with Multipoint Relays”, Ad Hoc & Sensor
Wireless Networks, vol. 1, pp. 27–39, 2005.
[11] Amir Qayyum, Laurent Viennot, and Anis Laouiti, “Multipoint Relaying:
An Efficient Technique for Flooding in Mobile Wireless Networks”,
Tech. Rep., INRIA, 2000.
[12] Thomas Clausen and Philippe Jacquet, “Optimized Link State Routing
Protocol (OLSR)”, IETF RFC 3626, October 2003.
[13] Christopher Dearlove Thomas Clausen and Philippe Jacquet, “The
Optimized Link State Routing Protocol version 2”, IETF Draft RFC
draft-ietf-manet-olsrv2-10, September 2009.
[14] Vikas Kawadia and P. R. Kumar, “A Cautionary Perspective On Crosslayer
Design”, IEEE Wireless Communications, vol. 12, pp. 3–11, 2005.
[15] Douglas S. J. De Couto, Daniel Aguayo, John Bicket, and Robert Morris,
“A High-Throughput Path Metric for Multi-Hop Wireless Routing”, in
MobiCom ’03: Proceedings of the 9th annual international conference
on Mobile computing and networking, New York, NY, USA, 2003, pp.
134–146, ACM Press.
[16] Ian F. Akyildiz and Xudong Wang, Wireless Mesh Networks, Wiley,
2009.
[17] Richard Draves, Jitendra Padhye, and Brian Zill, “Routing in Multiradio,
Multi-hop Wireless Mesh Networks”, in MobiCom ’04: Proceedings
of the 10th annual international conference on Mobile computing
and networking, New York, NY, USA, 2004, pp. 114–128, ACM Press.
[18] Cesar A. Santivanez and Ram Ramanathan, “Scalability of Routing in
Ad Hoc Networks: Principles and Practice”, Kluwer: Ad Hoc Wireless
Networking, vol. 1, pp. –, 2003.
[19] Andreas Tonnesen, “Implementing and extending the Optimized Link
State Routing Protocol”, Master’s thesis, University of Oslo, Department
of Informatics, 2004.
[20] Marek Linder and Axel Neumann, “BATMAN (Better Approach To
Mobile Ad Hoc Networking)”, http://open-mesh.net/batman/.
[21] Axel Neumann, Corinna Aichele, and Marek Lindner, “Better Approach
To Mobile Ad-hoc Networking (B.A.T.M.A.N.)”, IETF Draft, October
2008.
[22] Gianni Di Caro and Gianni Di Caro and Frederick Ducatelle and
Frederick Ducatelle and Luca Maria Gambardella and Luca Maria
Gambardella, “AntHocNet: An Adaptive Nature-inspired Algorithm
for Routing in Mobile Ad hoc Networks”, European Transactions on
Telecommunications, vol. 16, pp. 443–455, 2005.
[23] Bob Albrightson, J.J. Garcia-Luna-Aceves, and Joanne Boyle, “EIGRP
- A Fast Routing Protocol Based On Distance Vectors”, in Networld/Interop
94, 1994.
[24] Mehran Abolhasan, Brett Hagelstein, and Jerry Wang., “Real-world
performance of current proactive multi-hop mesh protocols”, in APCC
2009: Asia Pacific Conference on Communications, 2009.
[25] open80211s, “open80211s”, http://www.open80211s.org/.
[26] David Johnson, Ntsibane Ntlatlapa, and Corinna Aichel, “Simple
pragmatic approach to mesh routing using BATMAN”, in 2nd IFIP
International Symposium on Wireless Communications and Information
Technology in Developing Countries, 2008.