A Hybrid Routing Approach for Ad hoc Networks
Jose Costa‐Requena · Aaltodoc (Aalto University) · 2007
Ad hoc networking is a technology still under development and there are several proposals for defining the most suitable routing protocol. No single routing protocol proposed so far performs optimally under the kind of dynamic conditions possible in Ad hoc networks. We analyse the performance of existing Ad hoc routing protocols using simulations and a test bed. Based on the results, the goal of this thesis is to design a hybrid routing approach for Ad hoc networks that we name Scalable Ad hoc Routing Protocol (SARP). A novel routing algorithm that responds to the drawbacks of existing routing protocols is analysed and implemented. However, rather than proposing another protocol, this study extends the well-known routing protocol, Ad hoc On Demand Distance Vector (AODV), with a new broadcast algorithm to accommodate the new routing design. The contribution of the nodes to the routing functionality is critical for establishing Ad hoc networks. We analyse the incentives to participate in the routing functions using game theory. The Scalable Ad hoc Routing Protocol defines a novel architecture that integrates with the routing protocol a rewarding mechanism for the participating nodes. This architecture facilitates the cooperation of the nodes in the Ad hoc networks routing functionality.