A Self-Routing Topology for Bluetooth Scatternets

Authors:
Affiliations:
Venue:
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
2002

Citing 0
Cited 9

dBBlue: low diameter and self-routing bluetooth scatternet

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
dBBlue: low diameter and self-routing Bluetooth scatternet

Journal of Parallel and Distributed Computing
Hierarchical Grown Bluetrees (HGB): an effective topology for Bluetooth scatternets

International Journal of Computational Science and Engineering
Novel route maintenance protocols for the Bluetooth ad hoc network with mobility

Journal of Network and Computer Applications
A Location Aware Mobility based Routing Protocol for the Bluetooth Scatternet

Wireless Personal Communications: An International Journal
Hybrid Bluetooth Scatternet Routing

UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
Adaptive interpiconet scheduling for multipurpose scatternet scenarios

Ad Hoc Networks
Bluetooth scatternets: criteria, models and classification

Ad Hoc Networks
Hierarchical grown bluetrees (HGB) - an effective topology for bluetooth scatternets

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The emerging Bluetooth standard is considered to be the most promising technology to construct ad-hoc networks. It contains specifications on how to build a piconet but left out the details on how to automatically construct a scatternet from the piconets. Existing solutions only discussed the scatternet formation issue without considering the ease of routing in such a scatternet. We present algorithms to embed b-trees into a scatternet which enables such a network to become self-routing. It requires only fix-sized message header and no routing table at each node regardless of the size of the scatternet. These properties make our solution scalable to deal with networks of large sizes. Our solutions are of distributed control and asynchronous. We prove that our algorithm preserves the b-tree property when devices join or leave the scatternet and when one scatternet is merged into another.