On the Scalability of on-Demand Routing Protocols for Mobile Ad Hoc Networks: An Analytical Study

Abstract

Wireless systems, and mobile ad hoc networks in particular, are more likely to experience transmission and routing errors than their wired counterpart. Factors li ke the lack of infrastructure, node mobility, and random radio link quality can contribute to significantly higher error rates in these networks. In addition, errors have a more serious impact on the network's resources, due to limitations in bandwidth and battery power inherent to the wireless ad hoc environment. This further complicates the task of designing scalable routing protocols, since larger networks are likely to experience even more errors, which may lead to slower convergence, longer end-to-end delay and unnacceptably high number of retransmissions. In this paper, we focus on the impact of error prevention and recovery on the scaling properties of on-demand protocols for ad hoc networks. Our analytical study, based on the evaluation of the Witness Aided Routing (WAR) and the Dynamic Source Routing (DSR) protocols, shows that the lack of localized intervention in handling errors translates eventually into lack of scalability, both in terms of performance and resource consumption. As route length increases, the performance of DSR degrades dramatically, especially in the presence of fluctuating wireless link quality. Even for small routes, DSR's lack of an error handling mechanism leads to very low probability of success when there is a non-zero probability that links are not bidirectional. On the other hand, WAR remains relatively insensitive both to the length of the route and to variations in mobility and call rates, and has a higher tolerance to radio link instability. This indicates that localized error correction can increase route effectiveness and alleviate the effects of short-lived radio link problems to an extent that allows the protocol to scale with the network size.2 On The Scalability of On-Demand Routing Protocols further be classified as satellite, cellular or packet radio (ad hoc) network. If both routers and endpoints are mobile, the network is referred to as mobile ad hoc network (or MANET, a term adopted by the IEEE 802.11 9 committee). This type of network is the most challenging in terms of providing connections between any two nodes, because it does not rely on any existing wired infrastructure and all nodes are mobile. The communication between nodes in a network is provided by a routing protocol. The routing protocol is responsible for maintaining a logical infrastructure which will allow communication between any two remote hosts as if they were directly connected. In mobile networks, a routing protocol must also be able to hide adverse effects of mobility and problems in radio links from the mobile nodes.An ideal routing protocol should be able to compute and recompute routes quickly, with minimum computational and transmission overhead. The routes should be the shortest possible, with no loops and should provide a good balancing of traffic in the entire network (to avoid quality of service deterioration). However, a...

Adaptive routing for mobile ad hoc networks

“…Alternatively, theoretical evaluations of the performance of routing protocols as a function of the network context could be used. Also here, much work has been done [27][28][29][30], but very accurate theoretical comparisons of ad hoc routing protocols remain difficult due to the numerous factors affecting the performance and the difficulties in modeling the underlying link layer. Consequently, approximations and heuristics should be used to obtain reasonable accurate mappings between the routing overhead and network context.…”

Energy optimization for proactive unicast route maintenance in MANETs under end-to-end reliability requirements

“…We assume the Bulk Poisson traffic generation model [2,25] for our analysis. In the Bulk Poisson model, the rate of data message generation at the source is exponentially distributed with the average λ messages per unit time.…”

“…Under the same traffic model it has been proved [2] that if, on average, there are α packets per message where the arrival of messages is distributed exponentially with the mean rate λ and if the packets in a message is generated after every constant time τ, then the average number of data packets per unit time is given by,…”

“…The probability P m that a link is broken when a packet needs to be transmitted (Case II), under the same set of assumptions [2] is given by:…”

Performance Analysis of OLSR Protocol using Pipelining and Multi-point Relay in WSN

“…A wireless sensor network (WSN) consists of a large number [15] of small and common Devices mostly sensors, which send their data within a wireless network. The general task is that these devices [27] can perform: [6] on board data processing, communication between sensors, [20] sensing capabilities and actuation applicability.…”