Theory of Computing Systems

, Volume 52, Issue 2, pp 319–339 | Cite as

On the Expansion and Diameter of Bluetooth-Like Topologies

  • Alberto Pettarin
  • Andrea Pietracaprina
  • Geppino PucciEmail author


The routing capabilities of an interconnection network are strictly related to its bandwidth and latency characteristics, which are in turn quantifiable through the graph-theoretic concepts of expansion and diameter. This paper studies expansion and diameter of a family of subgraphs of the random geometric graph, which closely model the topology induced by the device discovery phase of Bluetooth-based ad hoc networks. The main feature modeled by any such graph, denoted as BT(r(n),c(n)), is the small number c(n) of links that each of the n devices (vertices) may establish with those located within its communication range r(n). First, tight bounds are proved on the expansion of BT(r(n),c(n)) for the whole set of functions r(n) and c(n) for which connectivity has been established in previous works. Then, by leveraging on the expansion result, nearly-tight upper and lower bounds on the diameter of BT(r(n),c(n)) are derived. In particular, we show asymptotically tight bounds on the diameter when the communication range is near the minimum needed for connectivity, the typical scenario considered in practical applications.


Wireless networks Expansion Diameter Random graphs Bluetooth protocol 



Support for the authors was provided, in part, by the Italian “Ministero dell’Istruzione, dell’Università e della Ricerca” under project AlgoDEEP, and by the University of Padova under the Strategic Project STPD08JA32 and Project CPDA099949/09. Part of this work was done while the first author was visiting the Department of Computer Science of Brown University, partially supported by “Fondazione Ing. Aldo Gini”, Padova, Italy.


  1. 1.
    Pettarin, A., Pietracaprina, A., Pucci, G.: On the expansion and diameter of Bluetooth-like topologies. In: Proc. of the 17th European Symposium on Algorithms, pp. 528–539 (2009) Google Scholar
  2. 2.
    Whitaker, R., Hodge, L., Chlamtac, I.: Bluetooth scatternet formation: a survey. Ad Hoc Netw. 3, 403–450 (2005) CrossRefGoogle Scholar
  3. 3.
    Stojmenovic, I., Zaguia, N.: Bluetooth scatternet formation in ad hoc wireless networks. In: Misic, J., Misic, V. (eds.) Performance Modeling and Analysis of Bluetooth Networks, pp. 147–171. Auerbach Publications, Boca Raton (2006) Google Scholar
  4. 4.
    Basagni, S., Bruno, R., Mambrini, G., Petrioli, C.: Comparative performance evaluation of scatternet formation protocols for networks of Bluetooth devices. Wirel. Netw. 10(2), 197–213 (2004) CrossRefGoogle Scholar
  5. 5.
    Ferraguto, F., Mambrini, G., Panconesi, A., Petrioli, C.: A new approach to device discovery and scatternet formation in Bluetooth networks. In: Proc. of the 18th International Parallel and Distributed Processing Symposium, pp. 221–228 (2004) CrossRefGoogle Scholar
  6. 6.
    Crescenzi, P., Nocentini, C., Pietracaprina, A., Pucci, G.: On the connectivity of Bluetooth-based ad hoc networks. Concurr. Comput. 21(7), 875–887 (2009) CrossRefGoogle Scholar
  7. 7.
    Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003) zbMATHCrossRefGoogle Scholar
  8. 8.
    Panconesi, A., Radhakrishnan, J.: Expansion properties of (secure) wireless networks. In: Proc. of the 16th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 281–285 (2004) CrossRefGoogle Scholar
  9. 9.
    Dubhashi, D., Johansson, C., Häggström, O., Panconesi, A., Sozio, M.: Irrigating ad hoc networks in constant time. In: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 106–115 (2005) CrossRefGoogle Scholar
  10. 10.
    Ellis, R., Jia, X., Yan, C.: On random points in the unit disk. Random Struct. Algorithms 29(1), 14–25 (2005) MathSciNetCrossRefGoogle Scholar
  11. 11.
    Dubhashi, D., Häggström, O., Mambrini, G., Panconesi, A., Petrioli, C.: Blue Pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. Wirel. Netw. 13(1), 107–125 (2007) CrossRefGoogle Scholar
  12. 12.
    Broutin, N., Devroye, L., Fraiman, N., Lugosi, G.: Connectivity threshold of Bluetooth graphs. E-print arXiv:1103.0351v1 [math.PR] (2011)
  13. 13.
    Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999) MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Clementi, A.E., Monti, A., Pasquale, F., Silvestri, R.: Information spreading in stationary Markovian evolving graphs. In: Proc. of the 23rd International Parallel and Distributed Processing Symposium, pp. 1–12 (2009) Google Scholar
  15. 15.
    Bilardi, G., Preparata, F.P.: Area-time lower-bound techniques with applications to sorting. Algorithmica 1(1), 65–91 (1986) MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Mitzenmacher, M., Upfal, E.: Probability and Computing. Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2003) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Alberto Pettarin
    • 1
  • Andrea Pietracaprina
    • 1
  • Geppino Pucci
    • 1
    Email author
  1. 1.Department of Information EngineeringUniversity of PadovaPadovaItaly

Personalised recommendations