An efficient counter-based broadcast scheme for mobile ad hoc networks

Aminu Mohammed, Mohamed Ould-Khaoua, Lewis Mackenzie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

39 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages275-283
Number of pages9
Volume4748 LNCS
Publication statusPublished - 2007
Event4th European Performance Engineering Workshop, EPEW 2007 - Berlin, Germany
Duration: Sep 27 2007Sep 28 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4748 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th European Performance Engineering Workshop, EPEW 2007
CountryGermany
CityBerlin
Period9/27/079/28/07

Fingerprint

Mobile ad hoc networks
Mobile Ad Hoc Networks
Broadcasting
Broadcast
Vertex of a graph
Reachability
Flooding
Time delay
Random Access
Probabilistic Approach
Delay Time
Throughput
Contention
Latency
Simplicity
Collision
Simulation

Keywords

  • Broadcast storm problem
  • Flooding
  • Latency
  • MANETs
  • Reachability
  • Saved-rebroadcast

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Mohammed, A., Ould-Khaoua, M., & Mackenzie, L. (2007). An efficient counter-based broadcast scheme for mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4748 LNCS, pp. 275-283). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4748 LNCS).

An efficient counter-based broadcast scheme for mobile ad hoc networks. / Mohammed, Aminu; Ould-Khaoua, Mohamed; Mackenzie, Lewis.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4748 LNCS 2007. p. 275-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4748 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mohammed, A, Ould-Khaoua, M & Mackenzie, L 2007, An efficient counter-based broadcast scheme for mobile ad hoc networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4748 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4748 LNCS, pp. 275-283, 4th European Performance Engineering Workshop, EPEW 2007, Berlin, Germany, 9/27/07.
Mohammed A, Ould-Khaoua M, Mackenzie L. An efficient counter-based broadcast scheme for mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4748 LNCS. 2007. p. 275-283. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Mohammed, Aminu ; Ould-Khaoua, Mohamed ; Mackenzie, Lewis. / An efficient counter-based broadcast scheme for mobile ad hoc networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4748 LNCS 2007. pp. 275-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{59a241c72a8e42939dbaac24697903d5,
title = "An efficient counter-based broadcast scheme for mobile ad hoc networks",
abstract = "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.",
keywords = "Broadcast storm problem, Flooding, Latency, MANETs, Reachability, Saved-rebroadcast",
author = "Aminu Mohammed and Mohamed Ould-Khaoua and Lewis Mackenzie",
year = "2007",
language = "English",
isbn = "9783540752103",
volume = "4748 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "275--283",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

M3 - Conference contribution

SN - 9783540752103

VL - 4748 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 275

EP - 283

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -