Multicast scaling properties in massively dense Ad Hoc networks

Philippe Jacquet; Georgios Rodolakis

doi:10.1109/ICPADS.2005.201

Multicast scaling properties in massively dense Ad Hoc networks

Philippe Jacquet^*, Georgios Rodolakis

^*Corresponding author for this work

Department of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

57 Citations (Scopus)

Abstract

We study the benefits of multicast routing in the performance of mobile ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O (√n), when used instead of unicast. One of the implications of this scaling property consists in a significant increase of the total capacity of the network for data delivery. We discuss how these results can be taken into consideration in the operation of a multicast protocol using overlay multicast trees.

Original language	English
Title of host publication	Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
Editors	J. Ma, L.T. Yang
Pages	93-97
Number of pages	5
Volume	2
DOIs	https://doi.org/10.1109/ICPADS.2005.201
Publication status	Published - 2005
Event	11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 - Fukuoka, Japan Duration: 20 Jul 2005 → 22 Jul 2005

Other

Other	11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
Country	Japan
City	Fukuoka
Period	20/07/05 → 22/07/05

Access to Document

10.1109/ICPADS.2005.201

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Multicast scaling properties in massively dense Ad Hoc networks'. Together they form a unique fingerprint.

Cite this

@inproceedings{14837c1255804f61be65e6d3f7bb1e49,

title = "Multicast scaling properties in massively dense Ad Hoc networks",

abstract = "We study the benefits of multicast routing in the performance of mobile ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O (√n), when used instead of unicast. One of the implications of this scaling property consists in a significant increase of the total capacity of the network for data delivery. We discuss how these results can be taken into consideration in the operation of a multicast protocol using overlay multicast trees.",

author = "Philippe Jacquet and Georgios Rodolakis",

year = "2005",

doi = "10.1109/ICPADS.2005.201",

language = "English",

isbn = "0769522815",

volume = "2",

pages = "93--97",

editor = "J. Ma and L.T. Yang",

booktitle = "Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005",

}

Jacquet, P & Rodolakis, G 2005, Multicast scaling properties in massively dense Ad Hoc networks. in J Ma & LT Yang (eds), Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. vol. 2, pp. 93-97, 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005, Fukuoka, Japan, 20/07/05. https://doi.org/10.1109/ICPADS.2005.201

TY - GEN

T1 - Multicast scaling properties in massively dense Ad Hoc networks

AU - Jacquet, Philippe

AU - Rodolakis, Georgios

PY - 2005

Y1 - 2005

N2 - We study the benefits of multicast routing in the performance of mobile ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O (√n), when used instead of unicast. One of the implications of this scaling property consists in a significant increase of the total capacity of the network for data delivery. We discuss how these results can be taken into consideration in the operation of a multicast protocol using overlay multicast trees.

AB - We study the benefits of multicast routing in the performance of mobile ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O (√n), when used instead of unicast. One of the implications of this scaling property consists in a significant increase of the total capacity of the network for data delivery. We discuss how these results can be taken into consideration in the operation of a multicast protocol using overlay multicast trees.

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

U2 - 10.1109/ICPADS.2005.201

DO - 10.1109/ICPADS.2005.201

M3 - Conference proceeding contribution

SN - 0769522815

VL - 2

SP - 93

EP - 97

BT - Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005

A2 - Ma, J.

A2 - Yang, L.T.

ER -