Bounded-Hop Strong Connectivity for Flocking Swarms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Bounded-Hop Strong Connectivity for Flocking Swarms


In this paper we consider a set of n mobile wireless nodes, which have no information about each other. The only information a single node holds is its current location and future mobility plan. We develop a two-phase distributed self-stabilizing scheme for producing a bounded hop-diameter communication graph. The first phase is dedicated to the construction of an underlying topology for the dissemination of data needed for the second phase. In the second phase the required topology is constructed by means of an asymmetric power assignment under two modes — static and dynamic. The former aims to provide a steady topology for some time interval, while the latter uses the constant node locations changes to produce a constantly changing topology, which succeeds to preserve the required property of the bounded hop-diameter.
Fichier principal
Vignette du fichier
p269-dolev.pdf (409.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00503897 , version 1 (19-07-2010)


  • HAL Id : inria-00503897 , version 1


Shlomi Dolev, Michael Segal, Hanan Shpungin. Bounded-Hop Strong Connectivity for Flocking Swarms. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.269-277. ⟨inria-00503897⟩


26 View
45 Download


Gmail Facebook X LinkedIn More