Multi-hop scatternet formation and routing for large scale Bluetooth networks

Authors:
Wen-Zhan Song;Yu Wang;Chao Ren;Changhua Wu;Xiang-Yang Li
Affiliations:
School of Engineering and Computer Science, Washington State University, Vancouver, WA 98686, USA.;Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA.;School of Computer Science, Northwestern Polytechnical University, Xi;an, ShanXi 710072, China.;Department of Computer Science, Kettering University, Flint, MI 48504, USA.
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2009

Citing 33
Cited 1

Finding a maximum clique in an arbitrary graph

SIAM Journal on Computing
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A new approach to the design and analysis of peer-to-peer mobile networks

Wireless Networks
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance of a new Bluetooth scatternet formation protocol

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Device Discovery in Bluetooth Networks: A Scatternet Perspective

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Towards Feasible Topology Formation Algorithms for Bluetooth-based WPANs

HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
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
A Self-Stabilizing Algorithm for Finding Cliques in Distributed Systems

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
How good are genetic algorithms at finding large cliques: an experimental

How good are genetic algorithms at finding large cliques: an experimental
An efficient approximation algorithm for finding a maximum clique using Hopfield network learning

Neural Computation
Brief announcement: an overview of the content-addressable network D2B

Proceedings of the twenty-second annual symposium on Principles of distributed computing
BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks

Mobile Networks and Applications
Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation

IEEE Transactions on Parallel and Distributed Systems
Comparative performance evaluation of scatternet formation protocols for networks of bluetooth devices

Wireless Networks
dBBlue: low diameter and self-routing Bluetooth scatternet

Journal of Parallel and Distributed Computing
Distributed Construction and Maintenance of Bandwidth and Energy Efficient Bluetooth Scatternets

IEEE Transactions on Parallel and Distributed Systems
Scalable and QoS-Aware Dynamic Slot Assignment and Piconet Partitioning to Enhance the Performance of Bluetooth Ad Hoc Networks

IEEE Transactions on Mobile Computing
Hierarchical Grown Bluetrees (HGB): an effective topology for Bluetooth scatternets

International Journal of Computational Science and Engineering
Bluetooth scatternet formation: A survey

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
Configuring BlueStars: multihop scatternet formation for Bluetooth networks

IEEE Transactions on Computers
Energy-aware on-demand scatternet formation and routing for Bluetooth-based wireless sensor networks

IEEE Communications Magazine
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications
A Bluetooth scatternet-route structure for multihop ad hoc networks

IEEE Journal on Selected Areas in Communications
Distributed self-healing and variable topology optimization algorithms for QoS provisioning in scatternets

IEEE Journal on Selected Areas in Communications
Can Bluetooth succeed as a large-scale ad hoc networking technology?

IEEE Journal on Selected Areas in Communications

Building a dark piconet upon bluetooth interfaces of computers

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the scatternet formation for large scale multi-hop Bluetooth networks. We first describe an efficient method to build a Connected Dominating Set (CDS) as the backbone of multi-hop Bluetooth network, then propose new algorithms to form the dBBlue scatternets (Song et al., 2005) in each cluster. The final scatternet, M-dBBlue, guarantees the connectivity. Our experiment shows our scatternet seldom parks any node. We then propose a complete set of hierarchical routing methods for M-dBBlue which enables the self-routing inside each cluster. Moreover, our scatternet formation and routing algorithm do not necessarily require position information of the node.