TY - GEN
T1 - Neighbour coverage
T2 - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008
AU - Abdulai, Jamal Deen
AU - Ould-Khaoua, Mohamed
AU - MacKenzie, Lewis M.
AU - Mohammed, Aminu
N1 - Funding Information:
We wish to express our appreciation to Dr. Robert Lavigne (Professor Emeritus, University of Wyoming, Laramie, Wyoming, U.S.A & Honorary Research Assistant, South Australian Museum) for his editorial assistance. This project was supported by Gazi University (Turkey) (Project no: 05/2006-24).
PY - 2008
Y1 - 2008
N2 - Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received Route Request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.
AB - Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received Route Request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.
KW - Collision
KW - Flooding
KW - Forwarding probability
KW - Manets
KW - Network connectivity
KW - Overhead
KW - Reactive routing
KW - Simulation
UR - http://www.scopus.com/inward/record.url?scp=84870975917&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84870975917&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:60349100841
SN - 9781622763566
T3 - Proceedings of the 2008 - International Symposium on Performance Evaluation of Computer and Telecommunication Systems, SPECTS 2008
SP - 165
EP - 172
BT - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008
Y2 - 16 June 2008 through 19 June 2008
ER -