TY - GEN
T1 - Improving route discovery in on-demand routing protocols using local topology information in MANETs
AU - Yassein, M. Bani
AU - Khaoua, M. Ould
AU - Mackenzie, L. M.
AU - Papanastasiou, S.
AU - Jamal, A.
PY - 2006
Y1 - 2006
N2 - Most existing routing protocols proposed for MANETs use flooding as a broadcast technique for the propagation of network control packets; a particular example of this is the dissemination of route requests (RREQs), which facilitate route discovery. In flooding, each mobile node rebroadcasts received packets, which, in this manner, are propagated network-wide with considerable overhead. This paper improves on the performance of existing routing protocols by reducing the communication overhead incurred during the route discovery process by implementing a new broadcast algorithm called the adjusted probabilistic flooding on the Ad-Hoc, on Demand Distance Vector (AODV) protocol. AODV [3] is a well-known and widely studied algorithm which has been shown over the past few years to maintain an overall lower routing overhead compared to traditional proactive schemes, even though it uses flooding to propagate RREQs. Our results, as presented in this paper, reveal that equipping AODV with fixed and adjusted probabilistic flooding, instead, helps reduce the overhead of the route discovery process whilst maintaining comparable performance levels in terms of saved rebroadcasts and reachability as achieved by conventional AODV. Moreover, the results indicate that the adjusted probabilistic technique results in better performance compared to the fixed one for both of these metrics.
AB - Most existing routing protocols proposed for MANETs use flooding as a broadcast technique for the propagation of network control packets; a particular example of this is the dissemination of route requests (RREQs), which facilitate route discovery. In flooding, each mobile node rebroadcasts received packets, which, in this manner, are propagated network-wide with considerable overhead. This paper improves on the performance of existing routing protocols by reducing the communication overhead incurred during the route discovery process by implementing a new broadcast algorithm called the adjusted probabilistic flooding on the Ad-Hoc, on Demand Distance Vector (AODV) protocol. AODV [3] is a well-known and widely studied algorithm which has been shown over the past few years to maintain an overall lower routing overhead compared to traditional proactive schemes, even though it uses flooding to propagate RREQs. Our results, as presented in this paper, reveal that equipping AODV with fixed and adjusted probabilistic flooding, instead, helps reduce the overhead of the route discovery process whilst maintaining comparable performance levels in terms of saved rebroadcasts and reachability as achieved by conventional AODV. Moreover, the results indicate that the adjusted probabilistic technique results in better performance compared to the fixed one for both of these metrics.
KW - AODV
KW - MANETs
KW - Probabilistic broadcasting
KW - Reachability
UR - http://www.scopus.com/inward/record.url?scp=34547281197&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547281197&partnerID=8YFLogxK
U2 - 10.1145/1163653.1163671
DO - 10.1145/1163653.1163671
M3 - Conference contribution
AN - SCOPUS:34547281197
SN - 1595935029
SN - 9781595935021
T3 - PM2HW2N 2006: Proceedings of 2006 ACM International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks
SP - 95
EP - 99
BT - PM2HW2N 2006
T2 - PM2HW2N 2006: 2006 ACM International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks
Y2 - 2 October 2006 through 2 October 2006
ER -