A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Clustering algorithms for wireless ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Performance of a new Bluetooth scatternet formation protocol
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Proximity awareness and fast connection establishment in Bluetooth
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Performance aspects of Bluetooth scatternet formation
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Bluetooth: Connect Without Cables
Bluetooth: Connect Without Cables
Arguments for Cross-Layer Optimizations in Bluetooth Scatternets
SAINT '01 Proceedings of the 2001 Symposium on Applications and the Internet (SAINT 2001)
A Performance Comparison of Scatternet Formation Protocols for Networks of Bluetooth Devices
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks
Mobile Networks and Applications
Body, personal, and local ad hoc wireless networks
The handbook of ad hoc wireless networks
Bottom-Up Construction of Bluetooth Topology under a Traffic-Aware Scheduling Scheme
IEEE Transactions on Mobile Computing
Peer to peer video streaming in Bluetooth overlays
Multimedia Tools and Applications
Enhanced AODV routing protocol for Bluetooth scatternet
Computers and Electrical Engineering
Bluetooth scatternet formation: A survey
Ad Hoc Networks
Robust topology formation using BTnodes
Computer Communications
SF-DeviL: an algorithm for energy-efficient Bluetooth scatternet formation and maintenance
Computer Communications
A Bluetooth-based JXME infrastructure
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Bluetooth scatternet formation performance: simulations vs. testbeds
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
A scatternet formation algorithm for Bluetooth networks with a non-uniform distribution of devices
Journal of Network and Computer Applications
Dynamic topology construction in bluetooth scatternets
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
| Hi-index | 0.00 |
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in forming an ad hoc network efficiently. In this paper, we present and analyze a new randomized distributed protocol for Bluetooth scatternet formation. We prove that our protocol achieves O(log n) time complexity and O(n) message complexity. The scatternets formed by our protocol 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 help prevent overloading of any single device and lead to low interference between piconets. We validate the theoretical results by simulations, which also 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 connections simultaneously with many Bluetooth devices. We investigate the collision rate and time requirement of the inquiry and page processes. Our simulation results indicate that the total number of packets sent is O(n) and that the maximum number of packets sent by any single device is O(log n).