Route-lifetime assessment based routing (RABR) protocol for mobile ad-hoc networks

Agarwal, Sumeet; Ahuja, A.; Singh, Jatinder; Shorey, Rajeev

doi:10.1109/icc.2000.853783

Cited by 123 publications

(81 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Most LQP algorithms for mobile nodes either implicitly or explicitly make this assumption [6] [8]- [10] [12] [13].…”

Section: Link Quality Predictorsmentioning

confidence: 99%

Link Quality Prediction for 802.11 MANETs in Urban Microcells

Gaertner¹,

Nuallain²

2016

JCC

View full text Add to dashboard Cite

In this paper we derive the optimal link quality predictor (LQPR) whose parameters are estimated from signal power and node speed samples. We propose a fast estimator for these parameters whose computational complexity is three orders lower than that of the optimal estimator with only a slight loss in accuracy thus enabling realtime execution. We show that using the most recent local mean of the signal as a predictor of future signal strength is also a very close approximation to the optimal predictor. This is the central result of this paper. It obviates the need for complex and/or computationally intensive link quality predictors for 802.11 in urban microcells and has the advantage of not requiring node speed information. The LQPRs are evaluated against the lower error bound. We show that the LQPR based on the most recent local mean of the signal predicts the packet reception probability for pedestrians in urban microcells on average with a mean absolute error of 13.47%, 16.54%, 18.21% and 19.38% for 1 s, 2 s, 3 s and 4 s into the future respectively. This LQP accuracy resembles closely the lower error bound with, for example, a difference of only 2.47% at 2 s into the future.

show abstract

“…Most LQP algorithms for mobile nodes either implicitly or explicitly make this assumption [6] [8]- [10] [12] [13].…”

Section: Link Quality Predictorsmentioning

confidence: 99%

Link Quality Prediction for 802.11 MANETs in Urban Microcells

Gaertner¹,

Nuallain²

2016

JCC

View full text Add to dashboard Cite

show abstract

“…The RABR protocol [1] functions as follows: The lifetime of a link i-j is predicted using a metric called the "affinity," a ij , and it is a measure of the time taken by node i to move out of the range of node j. Nodes exchange beacons periodically (for every one second in our simulations).…”

Section: Route-lifetime Assessment Based Routing (Rabr) Protocolmentioning

confidence: 99%

Exploring the Performance Tradeoffs among Stability-Oriented Routing Protocols for Mobile Ad hoc Networks

Meghanathan

2010

NPA

View full text Add to dashboard Cite

In this paper, we present an extensive ns-2 simulation based performance comparison of three widely known stability-oriented on-demand MANET routing protocols: Associativity-Based Routing (ABR) protocol, Flow-Oriented Routing Protocol (FORP) and Route Assessment Based Routing (RABR) protocol. Our simulations show that FORP routes are more stable than RABR routes, which are more stable than ABR routes. This also results in an increased packet delivery ratio for FORP in comparison to that of RABR and ABR. On the other hand, based on the energy consumed per packet and the average energy used per node, ABR is better than RABR, which is better than FORP. At low network density and mobility, ABR routes incur the lowest delay and as the network density and node mobility increases, RABR incurs lower delay. FORP incurs the highest delay under all conditions. Thus, we see a stability-delay-energy consumption tradeoff among these three stability-oriented routing protocols. Regarding the fairness of node usage, we observe that routes get distributed more evenly with increase in the node mobility and network density. But, still there is an appreciable variation in the energy consumption per node as only the chain of nodes that form stable routes are exhausted to a greater extent.

show abstract

“…Caching of discovered routes is utilized by some on-demand protocols [4], [5], [6] to suppress the routing overhead and at the same time maximize delivery ratio, by further exploiting routing information collected in one route request-route reply cycle. This is achieved by allowing intermediate nodes having a cached path to destination, to reply to request packets.…”

Section: Problem Formulation and Proposed Solutionmentioning

confidence: 99%

“…Since routes are discovered only when needed, the overall overhead induced by the routing algorithm is minimized [1], [2], [3], in order to enhance network scalability. Several on-demand protocols utilize caching of discovered paths [1]- [4], [5], [6] for exploiting collected routing information in subsequent routing operations. Use of local caches in each mobile node has been proved to benefit network performance in terms of delivery ratio [3].…”

Section: Introductionmentioning

confidence: 99%

Speeding-up Cache Lookups in Wireless Ad-Hoc Routing using Bloom Filters

Papapetrou

Pitoura

Lillis

2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

Abstract-On demand routing protocols that exploit local caches have received a lot of attention lately in wireless adhoc networking. In this paper, we specifically address cache management, an issue that has been a main source of criticism for the applicability of such protocols. In particular, we tackle the problem of accessing the cache content efficiently. To this end, we propose summarizing the cache content so that we achieve efficient lookups. This not only saves both the restrictive resources of the wireless devices such as computational power and energy but also improves the overall protocol performance. We use Bloom filters as summaries. Our experimental results using the ns simulator show that both resource savings and performance improvements are attained when such filters are integrated within the DSR protocol which is one the most widely used instance of an on demand protocol.

show abstract

Route-lifetime assessment based routing (RABR) protocol for mobile ad-hoc networks

Cited by 123 publications

References 5 publications

Link Quality Prediction for 802.11 MANETs in Urban Microcells

Link Quality Prediction for 802.11 MANETs in Urban Microcells

Exploring the Performance Tradeoffs among Stability-Oriented Routing Protocols for Mobile Ad hoc Networks

Speeding-up Cache Lookups in Wireless Ad-Hoc Routing using Bloom Filters

Contact Info

Product

Resources

About