TY - GEN
T1 - An efficient counter-based broadcast scheme for mobile ad hoc networks
AU - Mohammed, Aminu
AU - Ould-Khaoua, Mohamed
AU - Mackenzie, Lewis
PY - 2007
Y1 - 2007
N2 - In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency.
AB - In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency.
KW - Broadcast storm problem
KW - Flooding
KW - Latency
KW - MANETs
KW - Reachability
KW - Saved-rebroadcast
UR - http://www.scopus.com/inward/record.url?scp=38149097010&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149097010&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75211-0_20
DO - 10.1007/978-3-540-75211-0_20
M3 - Conference contribution
AN - SCOPUS:38149097010
SN - 9783540752103
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 275
EP - 283
BT - Formal Methods and Stochastic Models for Performance Evaluation - Fourth European Performance Engineering Workshop, EPEW 2007, Proceedings
PB - Springer Verlag
T2 - 4th European Performance Engineering Workshop, EPEW 2007
Y2 - 27 September 2007 through 28 September 2007
ER -