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.
Type de document :
Communication dans un congrès
WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.269-277, 2010
Liste complète des métadonnées

https://hal.inria.fr/inria-00503897
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : lundi 19 juillet 2010 - 11:46:05
Dernière modification le : samedi 17 février 2018 - 17:46:02
Document(s) archivé(s) le : vendredi 22 octobre 2010 - 15:59:06

Fichier

p269-dolev.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00503897, version 1

Collections

Citation

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, 2010. 〈inria-00503897〉

Partager

Métriques

Consultations de la notice

63

Téléchargements de fichiers

53