A Bluetooth Scatternet Reformation Algorithm

  • Lee Han-Wook (School of Mechanical and Aerospace Engineering, Seoul National University) ;
  • Kauh Sang-Ken (School of Mechanical and Aerospace Engineering, Seoul National University)
  • Published : 2006.03.01

Abstract

Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

Keywords

References

  1. Bluetooth SIG, 'Specification of the Bluetooth system ver1.1,' available at http://www.bluetooth.org, 2001
  2. Bluetooth SIG, 'Specification of the Bluetooth system ver1.2.' available at http://www.bluetooth.org, 2003
  3. L. Ramachandran, M. Kapoor, A. Sarkar, and A. Aggarwal, 'Clustering algorithms for wireless ad-hoc networks,' in Proc. 4th DIALM 2000, Boston, USA, Aug. 2000, pp. 54-63
  4. T. Salonidis, P. Bhagwat, L. Tassiulas, and R. LaMaire, 'Distributed topology construction of Bluetooth personal area networks,' in Proc. IEEE INFOCOM 2001, Anchorage, USA, Apr. 2001, pp. 1577-1586
  5. G. Zaruba and S. Basagni, 'Bluetress-scatternet formation to enable Bluetooth-based ad-hoc networks,' in Proc. IEEE ICC 2001, Helsinki, Finland, June 2001, pp. 273-277
  6. C. C. Foo and K. C. Chua, 'Blucring-Bluetooth scatternets with ring structures,' in Proc. 2nd WOC 2002, Banff, Canada, July 2002
  7. C. Petrioli, S. Basagni, and I. Chlamtac, 'Configuring blueStars: Multihop scatternet formation for Bluetooth networks,' IEEE Computer, vol. 52, pp. 779-790, June 2003 https://doi.org/10.1109/TC.2003.1204833
  8. Z. Wang, R. J. Thomas, and Z. J. Haas, 'Bluenet-a new scatternet formation scheme,' in Proc. 35th HICSS 2002, Hawaii, USA, Jan. 2002
  9. C. Petrioli, S. Basagni, and I. Chlamtac, 'BlueMesh: Degree-constrained multihop scatternet formation for Bluetooth networks,' Mobile Networking and Appl., vol. 9, pp. 33-47, Feb. 2004 https://doi.org/10.1023/A:1027317722864
  10. C. Lay and K. Y. Siu, 'A Bluetooth scatternet formation algorithm,' in Proc. 44th GLOBECOM 2001, San Antonio, USA, Nov. 2001, pp. 2864-2869
  11. C. Law, A. K. Mehta, and K. Y. Siu, 'Performance of a new Bluetooth scatternet formation protocol,' in Proc. 2nd MobiHoc 2001, Long Beach, USA, Nov. 2001, pp. 182-192
  12. G. Tan, A. Miu, J. Guttag, and H. Balakrishnan, 'Forming scatternets from Bluetooth personal area networks,' MIT Technical Report MIT _LCS-TR-826, Oct. 2001
  13. T. Y. Lin, Y. C. Tseng, K. M. Chang, and C.L Tu, 'Formation, routing, and maintenance protocols for the blueRing scatternet of Bluetooths,' in Proc. 36th HICSS 2003, Hawaii, USA, Jan. 2003, pp. 313-322
  14. H. Zhang, J. C. Hou, and L. Sha, 'A Bluetooth loop scatternet formation algorithm,' in Proc. IEEE ICC 2003, Anchorage, USA, May. 2003, pp. 1174-1180
  15. S. Basagni, R. Bruno, and C. Petrioli, 'A performance comparison of scatternet formation protocols for networks of Bluetooth devices,' in Proc. 1st PerCom 2003, Fort Worth, USA, Mar. 2003, pp. 341-350