Cube connected cycles based bluetooth scatternet formation

Authors:
Marcin Bienkowski;André Brinkmann;Miroslaw Korzeniowski;Orhan Orhan
Affiliations:
International Graduate School of Dynamic Intelligent Systems, University of Paderborn, Germany;Heinz Nixdorf Institute, University of Paderborn, Germany;International Graduate School of Dynamic Intelligent Systems, University of Paderborn, Germany;International Graduate School of Dynamic Intelligent Systems, University of Paderborn, Germany
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Year:
2005

Citing 6
Cited 1

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
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
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks

Mobile Networks and Applications
Configuring BlueStars: multihop scatternet formation for Bluetooth networks

IEEE Transactions on Computers

Degree 3 Suffices: A Large-Scale Overlay for P2P Networks

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need.