Abstract
In this letter, a reconfigurable formation algorithm is proposed for Bluetooth scatternets. First, a root node propagates parameters <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</i> in the downstream direction to construct a tree-shaped subnet and determines new roots. Each new root then sends a request to its upstream master to initiate a return connection in order to convert the first tree-shaped subnet into a mesh-shaped subnet. In addition, a peak-search method was introduced in the first root node to locate the optimum <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> layer and generate an optimum mesh-tree topology. Simulation results show that the peak-search method outperforms conventional blueHRT in the context of Bluetooth-based sensor networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
