Bluenet II - a detailed realization of the algorithm and performance analysis

The recent interest in ad hoc networks, in general, and in the Bluetooth technology, in particular, has stimulated much research in algorithms for topology control of such networks. In particular, the issue of scatternet formation has been addressed by a number of papers in the technical literature. In (Wang et al., 2002), we have proposed one such algorithm called the Bluenet algorithm. In this paper, we further investigate the realization and properties of the Bluenets algorithm. The performance of the resulting scatternets, such as, piconet density, usage of potential links, deviation of node degrees, average shortest path length, and maximum traffic flows are also studied. From the analysis, it is showed that the choice of p₀, the initial probability for each node to enter the page state, is very important. Since each performance index only reflects one side of the scatternet performance, we need to make trade offs when selecting p₀ to build Bluenets.