Dynamical algorithm for multi-hop Bluetooth scatternet formation

Bluetooth scatternet has become one important research field of ad hoc networking since it potentially has the wide and extensive applications. The special constraints and characteristics of Bluetooth scatternet present great challenges in constructing efficiently the topology of scatternet and routing in the network. In this paper a distributed algorithm for scatternet formation that gives rise to a tree-like but "not true tree" structure is introduced. The algorithm is fully distributed and asynchronous. It can be applied in a multi-hop environment. It can also meet the requirement to dynamically adapt the topology to nodes' mobility and failures.

[1]  Hari Balakrishnan,et al.  An Efficient Scatternet Formation Algorithm for Dynamic Environments , 2002 .

[2]  Imrich Chlamtac,et al.  BlueMesh: Degree-Constrained Multi-Hop Scatternet Formation for Bluetooth Networks , 2004, Mob. Networks Appl..

[3]  Kai-Yeung Siu,et al.  A Bluetooth scatternet formation algorithm , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[4]  J. Deneubourg,et al.  The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.

[5]  Stefano Basagni,et al.  Degree-constrained multihop scatternet formation for Bluetooth networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[6]  Francesca Cuomo,et al.  SHAPER: a self-healing algorithm producing multi-hop Bluetooth scatternets , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[7]  E. Bonabeau,et al.  Swarm smarts. , 2000, Scientific American.

[8]  Jingjing Wang,et al.  Scatternet Formation Algorithm in Multi-hop Environment based on Bionics , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).