### Abstract

We propose two distributed algorithms to maintain respectively the minimum weight spanning tree (MST) based multi-cast tree and the shortest path (SPST) multi-cast tree in a given ad hoc network for a given multi-cast group; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due to mobility of the hosts) and can readjust the multi-cast tree. Our approach is to use the paradigm of self-stabilization in distributed fault tolerance. We provide time complexity analysis of the algorithms in terms of the number of rounds needed for the algorithm to stabilize after a topology change, where a round is defined as a period of time in which each node in the system receives beacon messages from all its neighbors. In any ad hoc network, the participating nodes periodically transmit beacon messages for message transmission as well as to maintain the knowledge of the local topology at the node; as a result the nodes get the information about its neighbor nodes synchronously (at specific time intervals). Thus, the paradigm to analyze the complexity of the self-stabilizing algorithms in the context of ad hoc networks is very different from the traditional concept of adversary oracle used in proving the convergence and correctness of self-stabilizing distributed algorithms in general.

Original language | English (US) |
---|---|

Pages (from-to) | 87-96 |

Number of pages | 10 |

Journal | Journal of Parallel and Distributed Computing |

Volume | 63 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 2003 |

### Fingerprint

### Keywords

- Convergence
- Distributed system
- Fault tolerance
- Multi-cast protocol
- Self-stabilizing protocol
- System graph

### ASJC Scopus subject areas

- Computer Science Applications
- Hardware and Architecture
- Control and Systems Engineering

### Cite this

*Journal of Parallel and Distributed Computing*,

*63*(1), 87-96. https://doi.org/10.1016/S0743-7315(02)00029-1

**Self-stabilizing multicast protocols for ad hoc networks.** / Gupta, Sandeep; Srimani, Pradip K.

Research output: Contribution to journal › Article

*Journal of Parallel and Distributed Computing*, vol. 63, no. 1, pp. 87-96. https://doi.org/10.1016/S0743-7315(02)00029-1

}

TY - JOUR

T1 - Self-stabilizing multicast protocols for ad hoc networks

AU - Gupta, Sandeep

AU - Srimani, Pradip K.

PY - 2003/1/1

Y1 - 2003/1/1

N2 - We propose two distributed algorithms to maintain respectively the minimum weight spanning tree (MST) based multi-cast tree and the shortest path (SPST) multi-cast tree in a given ad hoc network for a given multi-cast group; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due to mobility of the hosts) and can readjust the multi-cast tree. Our approach is to use the paradigm of self-stabilization in distributed fault tolerance. We provide time complexity analysis of the algorithms in terms of the number of rounds needed for the algorithm to stabilize after a topology change, where a round is defined as a period of time in which each node in the system receives beacon messages from all its neighbors. In any ad hoc network, the participating nodes periodically transmit beacon messages for message transmission as well as to maintain the knowledge of the local topology at the node; as a result the nodes get the information about its neighbor nodes synchronously (at specific time intervals). Thus, the paradigm to analyze the complexity of the self-stabilizing algorithms in the context of ad hoc networks is very different from the traditional concept of adversary oracle used in proving the convergence and correctness of self-stabilizing distributed algorithms in general.

AB - We propose two distributed algorithms to maintain respectively the minimum weight spanning tree (MST) based multi-cast tree and the shortest path (SPST) multi-cast tree in a given ad hoc network for a given multi-cast group; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due to mobility of the hosts) and can readjust the multi-cast tree. Our approach is to use the paradigm of self-stabilization in distributed fault tolerance. We provide time complexity analysis of the algorithms in terms of the number of rounds needed for the algorithm to stabilize after a topology change, where a round is defined as a period of time in which each node in the system receives beacon messages from all its neighbors. In any ad hoc network, the participating nodes periodically transmit beacon messages for message transmission as well as to maintain the knowledge of the local topology at the node; as a result the nodes get the information about its neighbor nodes synchronously (at specific time intervals). Thus, the paradigm to analyze the complexity of the self-stabilizing algorithms in the context of ad hoc networks is very different from the traditional concept of adversary oracle used in proving the convergence and correctness of self-stabilizing distributed algorithms in general.

KW - Convergence

KW - Distributed system

KW - Fault tolerance

KW - Multi-cast protocol

KW - Self-stabilizing protocol

KW - System graph

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

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

U2 - 10.1016/S0743-7315(02)00029-1

DO - 10.1016/S0743-7315(02)00029-1

M3 - Article

AN - SCOPUS:0038625208

VL - 63

SP - 87

EP - 96

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 1

ER -