Scalability of routing methods in ad hoc networks

Abstract

In an ad hoc network each host (node) participates in routing packets. Ad hoc networks based on 802.11 WLAN technology have been the focus of several prior studies. These investigations were mainly based on simulations of scenarios involving up to 100 nodes (usually 50 nodes) and relaxed (too unrealistic) data traffic conditions. Many routing protocols in such setting offer the same performance, and many potential problems stay undetected. At the same time, an ad hoc network may not want (or be able) to limit the number of hosts involved in the network. As more nodes join an ad hoc network or the data traffic grows, the potential for collisions and contention increases, and protocols face the challenging task to route data packets without creating high administrative load. The investigation of protocol behavior in large scenarios exposes many hidden problems. The understanding of these problems helps not only in improving protocol scalability to large scenarios but also in increasing the throughput and other QoS metrics in small ones. This paper studies on the example of AODV and DSR protocols the influence of the network size (up to 550 nodes), nodes mobility, nodes density, suggested data traffic on protocols performance. In this paper we identify and analyze the reasons for poor absolute performance that both protocols demonstrate in the majority of studied scenarios. We also propose and evaluate restructured protocol stack that helps to improve the performance and scalability of any routing protocol in wireless ad hoc networks.

An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces

“…The performance problems of AODV occur mainly due the high administrative load (see also [26]). One problem of GPSR is that it chooses from the set of neighbors the longest possible hop, which in turn sometimes leads to a poor reception quality and as a consequence to drops of data packets.…”

“…As the size of a network (number of hosts) grows, various performance metrics start suffering from the increasing administrative load [26,27,21] that prevents successful operation of the network. Moreover, in blind flooding a lot of collisions occur, and they sometimes lead to lost transmissions and prevent the dissemination of information to all the nodes [26].…”

Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces

“…Approximate "tree-ness," which can be formally expressed solely in terms of the metric structure of a space [22], makes the hidden space hyperbolic. 2 …”

Prediction-Based Reliable Data Forwarding Method in VANET

“…It has been shown that many previous routing protocols for MANETs perform poorly in VANETs [6,7] . One of the main problems is that the previous routing protocols fail to achieve This paper is organized as follows.…”