License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09371.5
URN: urn:nbn:de:0030-drops-24273
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2427/
Go to the corresponding Portal

Resta, Giovanni ; Santi, Paolo

On the Fundamental Limits of Broadcasting in Wireless Mobile Networks

pdf-format:
09371.SantiPaolo.Paper.2427.pdf (0.2 MB)

Abstract

In this talk, we investigate the fundamental properties of broadcasting in mobile wireless networks. In particular, we characterize broadcast capacity and latency of a mobile network, subject to the condition that the stationary node spatial distribution generated by the mobility model is uniform. We first study the intrinsic properties of broadcasting, and present a broadcasting scheme, called RippleCast, that simultaneously achieves asymptotically optimal broadcast capacity and latency, subject to a weak upper bound on the maximum node velocity. This study intendedly ignores the burden related to the selection of broadcast relay nodes within the mobile network, and shows that optimal broadcasting in mobile networks is, in principle, possible. We then investigate the broadcasting problem when the relay selection burden is taken into account, and present a combined distributed leader election and broadcasting scheme achieving a broadcast capacity and latency which is within a $Theta((log n)^{1+frac{2}{alpha}})$ factor from optimal, where $n$ is the number of mobile nodes and $alpha>2$ is the path loss exponent. However, this result holds only under the assumption that the upper bound on node velocity converges to zero (although with a very slow, poly-logarithmic rate) as $n$ grows to infinity.
To the best of our knowledge, our is the first paper investigating the effects of node mobility on the fundamental properties of broadcasting, and showing that, while optimal broadcasting in a mobile network is in principle possible, the coordination efforts related to the selection of broadcast relay nodes lead to sub-optimal broadcasting performance.

BibTeX - Entry

@InProceedings{resta_et_al:DagSemProc.09371.5,
  author =	{Resta, Giovanni and Santi, Paolo},
  title =	{{On the Fundamental Limits of Broadcasting in Wireless Mobile Networks}},
  booktitle =	{Algorithmic Methods for Distributed Cooperative Systems},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9371},
  editor =	{S\'{a}ndor Fekete and Stefan Fischer and Martin Riedmiller and Suri Subhash},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2427},
  URN =		{urn:nbn:de:0030-drops-24273},
  doi =		{10.4230/DagSemProc.09371.5},
  annote =	{Keywords: Wireless networks, mobile networks, broadcast capacity, broadcast latency, SINR interference model}
}

Keywords: Wireless networks, mobile networks, broadcast capacity, broadcast latency, SINR interference model
Collection: 09371 - Algorithmic Methods for Distributed Cooperative Systems
Issue Date: 2010
Date of publication: 22.04.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI