Reliable buffering management algorithm support for multicast protocol in mobile Ad-hoc networks

Tariq Alahdal, Raed Alsaqour, Maha Abdelhaq, Rashid Saeed, Ola Alsaqour

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Multicasting is one of the relevant issues of communication in infrastructure or centralized administration networks. The reliable delivery of multicast data packets needs feedback from all multicast receivers to indicate whether a retransmission is necessary. A reliable multicast delivery in the wireless Ad-hoc network requires a multicast packet to be received by all multicast receiver nodes. Thus, one or all members need to buffer data packet for possible error recovery. Furthermore, different buffer strategies are essentially used in existing reliable multicast protocols towards support error recovery and reducing buffer overflow. This study proposed two algorithms to improve the performance of the source tree reliable multicast (STRM) protocol. The first algorithm was developed to avoid buffer overflow in the sender node as the forward server (FS) nodes of STRM. This reduction is achieved by managing the buffer of the FS nodes, i.e., selecting the FS nodes depending on its empty buffer size and reducing the feedback sent from the receiver nodes to their FS node. The second algorithm was developed to decrease duplicated packets in the multicast members of the local group, which may be achieved by sending the repair packets to the requesting member. The FS in the local group should create a dynamic and temporary subgroup whose members are only those that requested the repair packet retransmission. The algorithms were tested using detailed discrete event simulation models encompassing messaging systems including error, delay, and mobility models to characterize the performance benefits of the proposed algorithms compared with the existing wireless Ad-hoc network protocols. Several experiments were conducted, revealing numerous results that verify the superior performance of the proposed algorithms over the existing algorithms.

Original languageEnglish
Pages (from-to)136-150
Number of pages15
JournalJournal of Communications
Volume8
Issue number2
DOIs
Publication statusPublished - 2013

Fingerprint

Mobile ad hoc networks
Network protocols
Servers
Wireless ad hoc networks
Repair
Feedback
Multicasting
Discrete event simulation
Computer system recovery
Communication
Experiments

Keywords

  • Ad-hoc networks
  • Buffer management
  • Forward servers
  • Reliable multicast

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Reliable buffering management algorithm support for multicast protocol in mobile Ad-hoc networks. / Alahdal, Tariq; Alsaqour, Raed; Abdelhaq, Maha; Saeed, Rashid; Alsaqour, Ola.

In: Journal of Communications, Vol. 8, No. 2, 2013, p. 136-150.

Research output: Contribution to journalArticle

Alahdal, Tariq ; Alsaqour, Raed ; Abdelhaq, Maha ; Saeed, Rashid ; Alsaqour, Ola. / Reliable buffering management algorithm support for multicast protocol in mobile Ad-hoc networks. In: Journal of Communications. 2013 ; Vol. 8, No. 2. pp. 136-150.
@article{902e376a4a9a4a7e861cd16fa1fd7db5,
title = "Reliable buffering management algorithm support for multicast protocol in mobile Ad-hoc networks",
abstract = "Multicasting is one of the relevant issues of communication in infrastructure or centralized administration networks. The reliable delivery of multicast data packets needs feedback from all multicast receivers to indicate whether a retransmission is necessary. A reliable multicast delivery in the wireless Ad-hoc network requires a multicast packet to be received by all multicast receiver nodes. Thus, one or all members need to buffer data packet for possible error recovery. Furthermore, different buffer strategies are essentially used in existing reliable multicast protocols towards support error recovery and reducing buffer overflow. This study proposed two algorithms to improve the performance of the source tree reliable multicast (STRM) protocol. The first algorithm was developed to avoid buffer overflow in the sender node as the forward server (FS) nodes of STRM. This reduction is achieved by managing the buffer of the FS nodes, i.e., selecting the FS nodes depending on its empty buffer size and reducing the feedback sent from the receiver nodes to their FS node. The second algorithm was developed to decrease duplicated packets in the multicast members of the local group, which may be achieved by sending the repair packets to the requesting member. The FS in the local group should create a dynamic and temporary subgroup whose members are only those that requested the repair packet retransmission. The algorithms were tested using detailed discrete event simulation models encompassing messaging systems including error, delay, and mobility models to characterize the performance benefits of the proposed algorithms compared with the existing wireless Ad-hoc network protocols. Several experiments were conducted, revealing numerous results that verify the superior performance of the proposed algorithms over the existing algorithms.",
keywords = "Ad-hoc networks, Buffer management, Forward servers, Reliable multicast",
author = "Tariq Alahdal and Raed Alsaqour and Maha Abdelhaq and Rashid Saeed and Ola Alsaqour",
year = "2013",
doi = "10.12720/jcm.8.2.136-150",
language = "English",
volume = "8",
pages = "136--150",
journal = "Journal of Communications",
issn = "1796-2021",
publisher = "Engineering and Technology Publishing",
number = "2",

}

TY - JOUR

T1 - Reliable buffering management algorithm support for multicast protocol in mobile Ad-hoc networks

AU - Alahdal, Tariq

AU - Alsaqour, Raed

AU - Abdelhaq, Maha

AU - Saeed, Rashid

AU - Alsaqour, Ola

PY - 2013

Y1 - 2013

N2 - Multicasting is one of the relevant issues of communication in infrastructure or centralized administration networks. The reliable delivery of multicast data packets needs feedback from all multicast receivers to indicate whether a retransmission is necessary. A reliable multicast delivery in the wireless Ad-hoc network requires a multicast packet to be received by all multicast receiver nodes. Thus, one or all members need to buffer data packet for possible error recovery. Furthermore, different buffer strategies are essentially used in existing reliable multicast protocols towards support error recovery and reducing buffer overflow. This study proposed two algorithms to improve the performance of the source tree reliable multicast (STRM) protocol. The first algorithm was developed to avoid buffer overflow in the sender node as the forward server (FS) nodes of STRM. This reduction is achieved by managing the buffer of the FS nodes, i.e., selecting the FS nodes depending on its empty buffer size and reducing the feedback sent from the receiver nodes to their FS node. The second algorithm was developed to decrease duplicated packets in the multicast members of the local group, which may be achieved by sending the repair packets to the requesting member. The FS in the local group should create a dynamic and temporary subgroup whose members are only those that requested the repair packet retransmission. The algorithms were tested using detailed discrete event simulation models encompassing messaging systems including error, delay, and mobility models to characterize the performance benefits of the proposed algorithms compared with the existing wireless Ad-hoc network protocols. Several experiments were conducted, revealing numerous results that verify the superior performance of the proposed algorithms over the existing algorithms.

AB - Multicasting is one of the relevant issues of communication in infrastructure or centralized administration networks. The reliable delivery of multicast data packets needs feedback from all multicast receivers to indicate whether a retransmission is necessary. A reliable multicast delivery in the wireless Ad-hoc network requires a multicast packet to be received by all multicast receiver nodes. Thus, one or all members need to buffer data packet for possible error recovery. Furthermore, different buffer strategies are essentially used in existing reliable multicast protocols towards support error recovery and reducing buffer overflow. This study proposed two algorithms to improve the performance of the source tree reliable multicast (STRM) protocol. The first algorithm was developed to avoid buffer overflow in the sender node as the forward server (FS) nodes of STRM. This reduction is achieved by managing the buffer of the FS nodes, i.e., selecting the FS nodes depending on its empty buffer size and reducing the feedback sent from the receiver nodes to their FS node. The second algorithm was developed to decrease duplicated packets in the multicast members of the local group, which may be achieved by sending the repair packets to the requesting member. The FS in the local group should create a dynamic and temporary subgroup whose members are only those that requested the repair packet retransmission. The algorithms were tested using detailed discrete event simulation models encompassing messaging systems including error, delay, and mobility models to characterize the performance benefits of the proposed algorithms compared with the existing wireless Ad-hoc network protocols. Several experiments were conducted, revealing numerous results that verify the superior performance of the proposed algorithms over the existing algorithms.

KW - Ad-hoc networks

KW - Buffer management

KW - Forward servers

KW - Reliable multicast

UR - http://www.scopus.com/inward/record.url?scp=84874511361&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874511361&partnerID=8YFLogxK

U2 - 10.12720/jcm.8.2.136-150

DO - 10.12720/jcm.8.2.136-150

M3 - Article

AN - SCOPUS:84874511361

VL - 8

SP - 136

EP - 150

JO - Journal of Communications

JF - Journal of Communications

SN - 1796-2021

IS - 2

ER -