Skip to Main content Skip to Navigation
Conference papers

Bounded-Hop Strong Connectivity for Flocking Swarms

Abstract : 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.
Complete list of metadata
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Monday, July 19, 2010 - 11:46:05 AM
Last modification on : Monday, July 22, 2019 - 11:38:09 AM
Long-term archiving on: : Friday, October 22, 2010 - 3:59:06 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads