BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks

Authors:
Chiara Petrioli;Stefano Basagni;Imrich Chlamtac
Affiliations:
Dipartimento di Informatica, Università degli Studi di Roma, "La Sapienza," Italy;Department of Electrical and Computer Engineering, Northeastern University, MA;Center for Advanced Telecommunications Systems and Services, The University of Texas at Dallas, TX
Venue:
Mobile Networks and Applications
Year:
2004

Citing 4
Cited 18

A new approach to the design and analysis of peer-to-peer mobile networks

Wireless Networks
Introduction to Algorithms

Introduction to Algorithms
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A new Bluetooth scatternet formation protocol

Mobile Networks and Applications

Partial Delaunay Triangulation and Degree Limited Localized Bluetooth Scatternet Formation

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
BlueCube: constructing a hypercube parallel computing and communication environment over bluetooth radio systems

Journal of Parallel and Distributed Computing
Hop count based optimization of Bluetooth scatternets

Ad Hoc Networks
Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop bluetooth networks

Wireless Networks
New bluetooth interconnection methods: Overlaid Bluetooth Piconets (OBP) and Temporary Scatternets (TS)

Computer Communications
Peer to peer video streaming in Bluetooth overlays

Multimedia Tools and Applications
Connection data rate optimisation of IEEE 802.15.3 scatternets with multirate carriers

International Journal of Sensor Networks
Simplified bluetooth scatternet formation using maximal independent sets

Integrated Computer-Aided Engineering
Multi-hop scatternet formation and routing for large scale Bluetooth networks

International Journal of Ad Hoc and Ubiquitous Computing
Multi-hop mesh networking for UWB WPANs with QoS support

International Journal of Wireless and Mobile Computing
Bluetooth scatternet formation: A survey

Ad Hoc Networks
SF-DeviL: an algorithm for energy-efficient Bluetooth scatternet formation and maintenance

Computer Communications
An efficient reconstruction approach for improving Bluetree scatternet formation in personal area networks

Journal of Network and Computer Applications
Bluetooth scatternet formation performance: simulations vs. testbeds

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Bluetooth scatternet formation and scheduling: an integrated solution

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
Cube connected cycles based bluetooth scatternet formation

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe BlueMesh, a new protocol for the establishment of scatternets, i.e., multi-hop wireless networks of Bluetooth devices. BlueMesh defines rules for device discovery, piconet formation and piconet interconnection so to generate connected scatternets with the following desirable properties. BlueMesh forms scatternets without requiring the Bluetooth devices to be all in each other transmission range. BlueMesh scatternet topologies are meshes with multiple paths between any pair of nodes. BlueMesh piconets are made up of no more than 7 slaves. Simulation results in networks with over 200 nodes show that BlueMesh is effective in quickly generating a connected scatternet in which each node, on average, does not assume more than 2.4 roles. Moreover, the route length between any two nodes in the network is comparable to that of the shortest paths between the nodes.