On the Connectivity of Bluetooth-Based Ad Hoc Networks

We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other devices within its visibility range in order to establish reliable communication channels yielding a connected topology. Specifi...

Full description

Saved in:
Bibliographic Details
Published inEuro-Par 2007 Parallel Processing pp. 960 - 969
Main Authors Crescenzi, Pilu, Nocentini, Carlo, Pietracaprina, Andrea, Pucci, Geppino, Sandri, Carlo
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Adjacent Cell
Connected Topology
Connectivity Property
Visibility Graph
Visibility Range
Online AccessGet full text

Cover

More Information
Summary:We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other devices within its visibility range in order to establish reliable communication channels yielding a connected topology. Specifically, we provide both analytical and experimental evidence that when the visibility range of each node (i.e., device) is limited to a vanishing function of n, the total number of nodes in the system, full connectivity can still be achieved with high probability by letting each node connect only to a “small” number of visible neighbors. Our results extend previous studies, where connectivity properties were analyzed only for the case of a constant visibility range, and provide evidence that Bluetooth can indeed be used for establishing large ad hoc networks.
Bibliography:This work was supported in part by MIUR of Italy under project MAINSTREAM, and by the EU under the EU/IST Project 15964 AEOLUS.
ISBN:9783540744658
3540744657
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-74466-5_103