Performance of a new Bluetooth scatternet formation protocol

  • Authors:

  • Ching Law;Amar K. Mehta;Kai-Yeung Siu

  • Affiliations:

  • Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA;Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA;Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA

  • Venue:
  • MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challegnes in forming an ad hoc network efficiently. In this paper, we evaluate the performance of a new randomized distributed Bluetooth scatternet formation protocol. Our simulations validate the theoretical results that our scatternet formation protocol runs in O(log n) time and sends O(n) messages. The scatternets formed have the following properties: 1) any device is a member of at most two piconets, and 2) the number of piconets is close to be optimal. These properties can avoid overloading of any single device and lead to low interference between piconets. In addition, the simulations show that the scatternets formed have O(log n) diameter. As an essential part of the scatternet formation protocol, we study the problem of device discovery: establishing multiple connecitons with many masters and slaves in parallel. We investigate the collision rate and time requirement of the inquiry and page processes. Deducing from the simulation results of scatternet formation and device discovery, we can verify that the total number of packets sent is O(n) and demonstrate that the maximum number of packets sent by any single device is O(log n). At last, we give estimates of the total time requirement of the protocol and suggest further improvements