Cart (Loading....) | Create Account
Close category search window
 

Time-efficient algorithms for the outdegree limited bluetooth scatternet formation problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

We present in this paper three Bluetooth Scatternet Formation (BSF) algorithms which forms deterministically connected and outdegree limited scatternets. Our algorithms improve the execution time of algorithm BlueMIS, which consists of two consecutive phases called BlueMIS I and BlueMIS II. The first phase, BlueMIS I, is a BSF algorithm that forms connected and outdegree limited scatternets in a time-efficient manner. Our algorithms improve BlueMIS by improving BlueMIS I. First, we introduce a time-efficient implementation of communication rounds, called OrderedExchange, that is more suitable for Bluetooth networks, where in a communication round each node sends and receives a message to and from all its neighbors. Using OrderedExchange, we introduce algorithms ComputeMIS I and ComputeMIS II which form the same scatternet as those formed by BlueMIS I but with less execution time. We also introduce algorithm Eliminate. Instead of letting each node u forms a maximal independent set of all its neighbors and then considers them as slaves, as in the case of BlueMIS I, Eliminate let each node u forms a maximal independent set of all its neighbors that have smaller identifiers. Eliminate forms scatternets that are similiar to those formed by BlueMIS I, and more efficient with respect to some performance metrics. Eliminate improves the execution time of ComputeMIS I and ComputeMIS II by about 60%.

Published in:

Computers and Communications (ISCC), 2012 IEEE Symposium on

Date of Conference:

1-4 July 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.