Location aware, dependable multicast for mobile ad hoc networks

S. Basagni, I. Chlamtac, Violet Syrotiuk

Research output: Contribution to journalArticle

49 Citations (Scopus)

Abstract

This paper introduces dynamic source multicast (DSM), a new protocol for multi-hop wireless (i.e., ad hoc) networks for the multicast of a data packet from a source node to a group of mobile nodes in the network. The protocol assumes that, through the use of positioning system devices, each node knows its own geographic location and the current (global) time, and it is able to efficiently spread these measures to all other nodes. When a packet is to be multicast, the source node first locally computes a snapshot of the complete network topology from the collected node measures. A Steiner (i.e., multicast) tree for the addressed multicast group is then computed locally based on the snapshot, rather than maintained in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Prüfer sequence and is included in the packet header as in, and extending the length of the header by no more than, the header of packets in source routing (unicast) techniques. We show that all the local computations are executed in polynomial time. More specifically, the time complexity of the local operation of finding a Steiner tree, and the encoding/decoding procedures of the related Prüfer sequence, is proven to be O(n2), where n is the number of nodes in the network. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that DSM delivers packets to all the nodes in a destination group in more than 90% of the cases. Furthermore, compared to flooding, DSM achieves improvements of up to 50% on multicast completion delay.

Original languageEnglish (US)
Pages (from-to)659-670
Number of pages12
JournalComputer Networks
Volume36
Issue number5-6
DOIs
StatePublished - Aug 2001
Externally publishedYes

Fingerprint

Mobile ad hoc networks
Network protocols
Wireless ad hoc networks
Ad hoc networks
Decoding
Topology
Polynomials

Keywords

  • Global positioning system
  • Mobile ad hoc networks
  • Multicast routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Location aware, dependable multicast for mobile ad hoc networks. / Basagni, S.; Chlamtac, I.; Syrotiuk, Violet.

In: Computer Networks, Vol. 36, No. 5-6, 08.2001, p. 659-670.

Research output: Contribution to journalArticle

Basagni, S. ; Chlamtac, I. ; Syrotiuk, Violet. / Location aware, dependable multicast for mobile ad hoc networks. In: Computer Networks. 2001 ; Vol. 36, No. 5-6. pp. 659-670.
@article{feb24216a4df4d4580c229c343b0f512,
title = "Location aware, dependable multicast for mobile ad hoc networks",
abstract = "This paper introduces dynamic source multicast (DSM), a new protocol for multi-hop wireless (i.e., ad hoc) networks for the multicast of a data packet from a source node to a group of mobile nodes in the network. The protocol assumes that, through the use of positioning system devices, each node knows its own geographic location and the current (global) time, and it is able to efficiently spread these measures to all other nodes. When a packet is to be multicast, the source node first locally computes a snapshot of the complete network topology from the collected node measures. A Steiner (i.e., multicast) tree for the addressed multicast group is then computed locally based on the snapshot, rather than maintained in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Pr{\"u}fer sequence and is included in the packet header as in, and extending the length of the header by no more than, the header of packets in source routing (unicast) techniques. We show that all the local computations are executed in polynomial time. More specifically, the time complexity of the local operation of finding a Steiner tree, and the encoding/decoding procedures of the related Pr{\"u}fer sequence, is proven to be O(n2), where n is the number of nodes in the network. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that DSM delivers packets to all the nodes in a destination group in more than 90{\%} of the cases. Furthermore, compared to flooding, DSM achieves improvements of up to 50{\%} on multicast completion delay.",
keywords = "Global positioning system, Mobile ad hoc networks, Multicast routing",
author = "S. Basagni and I. Chlamtac and Violet Syrotiuk",
year = "2001",
month = "8",
doi = "10.1016/S1389-1286(01)00182-7",
language = "English (US)",
volume = "36",
pages = "659--670",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "5-6",

}

TY - JOUR

T1 - Location aware, dependable multicast for mobile ad hoc networks

AU - Basagni, S.

AU - Chlamtac, I.

AU - Syrotiuk, Violet

PY - 2001/8

Y1 - 2001/8

N2 - This paper introduces dynamic source multicast (DSM), a new protocol for multi-hop wireless (i.e., ad hoc) networks for the multicast of a data packet from a source node to a group of mobile nodes in the network. The protocol assumes that, through the use of positioning system devices, each node knows its own geographic location and the current (global) time, and it is able to efficiently spread these measures to all other nodes. When a packet is to be multicast, the source node first locally computes a snapshot of the complete network topology from the collected node measures. A Steiner (i.e., multicast) tree for the addressed multicast group is then computed locally based on the snapshot, rather than maintained in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Prüfer sequence and is included in the packet header as in, and extending the length of the header by no more than, the header of packets in source routing (unicast) techniques. We show that all the local computations are executed in polynomial time. More specifically, the time complexity of the local operation of finding a Steiner tree, and the encoding/decoding procedures of the related Prüfer sequence, is proven to be O(n2), where n is the number of nodes in the network. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that DSM delivers packets to all the nodes in a destination group in more than 90% of the cases. Furthermore, compared to flooding, DSM achieves improvements of up to 50% on multicast completion delay.

AB - This paper introduces dynamic source multicast (DSM), a new protocol for multi-hop wireless (i.e., ad hoc) networks for the multicast of a data packet from a source node to a group of mobile nodes in the network. The protocol assumes that, through the use of positioning system devices, each node knows its own geographic location and the current (global) time, and it is able to efficiently spread these measures to all other nodes. When a packet is to be multicast, the source node first locally computes a snapshot of the complete network topology from the collected node measures. A Steiner (i.e., multicast) tree for the addressed multicast group is then computed locally based on the snapshot, rather than maintained in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Prüfer sequence and is included in the packet header as in, and extending the length of the header by no more than, the header of packets in source routing (unicast) techniques. We show that all the local computations are executed in polynomial time. More specifically, the time complexity of the local operation of finding a Steiner tree, and the encoding/decoding procedures of the related Prüfer sequence, is proven to be O(n2), where n is the number of nodes in the network. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that DSM delivers packets to all the nodes in a destination group in more than 90% of the cases. Furthermore, compared to flooding, DSM achieves improvements of up to 50% on multicast completion delay.

KW - Global positioning system

KW - Mobile ad hoc networks

KW - Multicast routing

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

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

U2 - 10.1016/S1389-1286(01)00182-7

DO - 10.1016/S1389-1286(01)00182-7

M3 - Article

VL - 36

SP - 659

EP - 670

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 5-6

ER -