Abstract
In this paper we introduce a novel and unified approach to the problems of device discovery and scatternet formation for the Bluetooth standard. We introduce a stochastic model for Bluetooth device discovery and prove that a protocol based on very simple local rules generates a topology that, with high probability, is connected and, crucially, has constant maximum degree. Based on this, we develop a new protocol for device discovery and scatternet formation for multi-hop BlueTooth networks. By means of extensive ns2 simulations we show that our solution is simple to implement, fast and requires low overhead, both for the device discovery and the scatternet formation phases, and leads to better performance when compared to the major approaches so far proposed in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen and H. Hering, Branching Processes. (Birkhäuser, Basel, Switzerland, 1983).
S. Basagni, R. Bruno and C. Petrioli, A performance comparison of scatternet formation protocols for networks of Bluetooth devices, in: Proceedings of the IEEE International Conference on Pervasive Computing and Communications, PerCom 2003, Forth Worth, TX, (2003) pp. 341–350.
C.F. Chiasserini, M.A. Marsan, E. Baralis and P. Garza, Towards feasible topology formation algorithms for Bluetooth-based WPANs, in: Proceedings of IEEE HICSS-36 2003, Big Island, Hawaii, (2003) personal communication.
I. Chlamtac and A. Faragó, A new approach to the design and analysis of peer-to-peer mobile networks, Wireless Networks 5(3) (1999) 149–156.
G. Grimmett, Percolation, volume 321 of Grundlehren der Mathematischen Wissenschaften 2nd. edition, (Springer Verlag, New York, NY, 1999).
T.E. Harris, The Theory of Branching Processes, (Springer Verlag and Prentice Hall, Inc., Berlin, Germany and Englewood Cliffs, NJ, 1963).
C. Law, A.K. Mehta and K.-Y. Siu, A new Bluetooth scatternet formation protocol. in: A. Campbell, M. Conti and S. Giordano, (eds.) ACM/Kluwer Journal on Mobile Networks and Applications (MONET), Special Issue on Mobile Ad Hoc Networks, 8(5) (2003) 485–498.
X. Li and I. Stojmenovic, Partial delaunay triangulation and degree-limited localized bluetooth scatternet formation, in: Proceedings of AD-HOC Networks and Wireless (ADHOCNOW), Fields Institute, Toronto, Canada, (2002).
T. Lindvall, Lectures on the Coupling Method. Wiley Series in Probability & Mathematical Statistics—Applied Probability & Statistics Section, (John Wiley and Sons, Inc., New York, NY, 1992).
R. Meester and R. Roy, Continuum Percolation, (Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, UK, 1996).
M. Penrose, Random Geometric Graphs, Oxford Studies in Probability, 5. (Oxford University Press, New York, NY, 2003).
C. Petrioli, S. Basagni and I. Chlamtac. Configuring BlueStars: Multihop scatternet formation for Bluetooth networks. in: Y.-B. Lin and Y.-C. Tseng, (eds.) IEEE Transactions on Computers, special issue on Wireless Internet, 52(6) (2003) 779–790.
C. Petrioli, S. Basagni and I. Chlamtac, BlueMesh: Degree-constrained multihop scatternet formation for Bluetooth networks. ACM/Kluwer Journal on Special Topics in Mobile Networking and Applications (MONET), Special Issue on Advances in Research of Wireless Personal Area Networking and Bluetooth Enabled Networks (G. Zaruba and P. Johansson, eds.) 9 (2004) 33–47.
T. Salonidis, P. Bhagwat, L. Tassiulas and R. LaMaire, Distributed topology construction of Bluetooth personal area networks, in: Proceedings of the IEEE Infocom 2001, Anchorage, AK (2001) 1577–1586.
G. Tan, A. Miu, J. Guttag and H. Balakrishnan, An efficient scatternet formation algorithm for dynamic environment, in: Proceedings of the IASTED Communications and Computer Networks (CCN), Cambridge, MA (2002).
Z. Wang, R.J. Thomas and Z. Haas. BlueNet—A new scatternet formation scheme, in: Proceedings of the 35th Hawaii International Conference on System Science (HICSS-35), Big Island, Hawaii, (2002).
F. Xue and P.R. Kumar, The number of neighbors needed for connectivity of wireless networks, ACM/Kluwer Wireless Networks, 10(2) (2004) 169–181.
A.C.-C. Yao, On constructing minimum spanning trees in $k$-dimensional spaces and related problems, SIAM Journal on Computing, 11(4) (1982) 721–736.
G.Záruba, S. Basagni and I. Chlamtac. BlueTrees—Scatternet formation to enable Bluetooth-based personal area networks, in: Proceedings of the IEEE International Conference on Communications, ICC 2001, Helsinki, Finland 1 (2001) pp. 273–277.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by EC projects MAGELLAN and DELIS.
Devdatt Dubhashi received his B.Tech. degree in Computer Science and Engineering from the Indian Institute of Technology, Delhi and his Masters and Ph.D. degrees from Cornell University, Ithaca, NY. He spent two years at the Max-Planck-Institut fur Informatik in Saarbrucken, Germany and two and a half years at BRICS (Basic Research in Computer Science) University of Aarhus, Denmark. Thereafter he was an Assistant Professor at the Indian Institute of Technology, Delhi. His random walk finally reached its current position as Associate Professor, Department of Computer Science and Engineering at Chalmers and Gothenburg University, Sweden. His main research interests are in exploring the unusual effectiveness of probability (and other discrete Mathematics) in Computer Science.
Olle Häggström is a professor of mathematical statistics at Chalmers University of Technology, Sweden. His research interests are mainly in probability theory and statistical mechanics. He is vice chairman of the Swedish Mathematical Society, and in 2004 he was elected fellow of the Nobel Prize awarding Royal Swedish Academy of Sciences.
Gabriele Mambrini received the laurea degree in Computer Science from the University of Rome, “La Sapienza,” Italy, in March 2003. He is currently with the Italian Interuniversities Consortium for Supercomputing Applications (CASPUR), in Rome. His current research interests include wireless networking, automatic text categorization and indexing, computer security.
Alessandro Panconesi is professor of Computer Science at the University “La Sapienza” of Rome. He has a PhD in Computer Science from Cornell University. He was awarded the ACM Danny Lewin Award in 1992. His main research interest is the design and analysis of probabilistic and distributed algorithms. He is the Director of BICI (Bertinoro International Center for Informatics).
Chiara Petrioli received the Laurea degree with honors in computer science in 1993, and the Ph.D. degree in computer engineering in 1998, both from Rome University “La Sapienza,” Italy. She is currently Assistant Professor at the Computer Science Department at Rome University “La Sapienza”. Her current work focuses on ad hoc and sensor networks, Bluetooth, energy-conserving protocols, QoS in IP networks and Content Delivery Networks. Prior to Rome University she was research associate at Politecnico di Milano and was working with the Italian Space agency (ASI) and Alenia Spazio. Dr. Petrioli is an area editor of the ACM/Kluwer Wireless Networks journal, the Wiley InterScience Wireless Communications & Mobile Computing journal and the Elsevier Ad Hoc Networks journal. She has served in the organizing committee and technical program committee of several leading conferences in the area of networking and mobile computing including ACM Mobicom, ACM Mobihoc, IEEE ICC. Dr. Petrioli was a Fulbright scholar, and is a member of ACM and IEEE.
Rights and permissions
About this article
Cite this article
Dubhashi, D., Häggström, O., Mambrini, G. et al. Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. Wireless Netw 13, 107–125 (2007). https://doi.org/10.1007/s11276-006-1304-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-006-1304-7