A simple and fast algorithm for bluetooth network formation

Authors:
Yuh-Jzer Joung;Geng-Dian Hwang
Affiliations:
Dept.of Information Management;Dept.of Electrical Engineering, National Taiwan University, Taipei, Taiwan
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 3
Cited 1

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
Performance of a new Bluetooth scatternet formation protocol

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

A scatternet formation algorithm for Bluetooth networks with a non-uniform distribution of devices

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple and fast distributed algorithm for Bluetooth network formation. Our algorithm requires no knowledge on the underlying physical topology, and proceeds in only one phase to connect the devices. If the physical topology is weakly connected, then the algorithm guarantees that the resulting network will be connected with high probability. The algorithm is also symmetric in the sense that each device executes exactly the same algorithm, thereby increasing the flexibility of network deployment. In contrast, previous results (e.g.,[6,3,2,5,10,1,8,9,4]on Bluetooth network formation require the underlying physical topology to be a complete graph, nodes to be asymmetric, or proceed in more than one phase to connect disconnect components constructed in the first phase.