## Forming Connected Topologies in Bluetooth Ad-hoc Networks - An Algorithmic Perspective (2002)

Venue: | In Proc. International Teletraffic Congress (ITC |

Citations: | 12 - 2 self |

### BibTeX

@INPROCEEDINGS{Guerin02formingconnected,

author = {R. Guerin and J. Rank and S. Sarkar and E. Vergetis},

title = {Forming Connected Topologies in Bluetooth Ad-hoc Networks - An Algorithmic Perspective},

booktitle = {In Proc. International Teletraffic Congress (ITC},

year = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper represents a first step in exploring the formation of connected topologies in ad-hoc networks built on the Bluetooth technology. Connectivity is the most basic requirement for any system aimed at allowing devices to communicate with each other and in this paper we illustrate that this seemingly innocuous goal gives rise to many significant challenges in the context of the Bluetooth technology. We start with a brief overview of Bluetooth and its operation and then identify some of the major problems the technology faces when used to build ad-hoc networks. The paper's contributions are in introducing basic algorithmic problems associated with building connected Bluetooth networks and in developing several possible solutions capable of generating "good" connected topologies

### Citations

8550 |
Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ...erformance guarantees as an MST algorithm.s7.1. Distributing an MST based algorithm A minimum weighted spanning tree can be constructed by distributed computation at the nodes, e.g., Prim’s algorith=-=m [5]-=- for constructing minimum weight spanning trees can be distributized [6]. A node only needs to know an ordering of the weights of its incident edges. In the Bluetooth setting, a node acquires this kno... |

1137 | Graph Theory - Harary - 1971 |

574 |
Approximation Algorithms for NP-hard problems
- Hochbaum
(Show Context)
Citation Context ...present next a topology design procedure based on an approximation algorithm guaranteed to generate a spanning tree with degree at most one more than the minimum possible value in any arbitrary graph =-=[11]. -=-More formally, let the degree of the spanning tree generated by this algorithm be d. Then any other spanning tree will have a maximum degree of d − 1 or more. In the Bluetooth context this means tha... |

343 |
A distributed algorithm for minimum-weight spanning trees
- Gallager, Humblet, et al.
- 1983
(Show Context)
Citation Context ...d algorithm A minimum weighted spanning tree can be constructed by distributed computation at the nodes, e.g., Prim’s algorithm [5] for constructing minimum weight spanning trees can be distributize=-=d [6]-=-. A node only needs to know an ordering of the weights of its incident edges. In the Bluetooth setting, a node acquires this knowledge while synchronizing with its neighbors. During this time, a node ... |

112 | Distributed topology construction of Bluetooth personal area networks
- Salonidis, Bhagwat, et al.
- 2001
(Show Context)
Citation Context ...n other piconets, provided that such a slave/master role limitation does not introduce significant constraints when forming and modifying topologies. Note that this requirement was also considered in =-=[19]-=-. For the same reasons, we also assume that it is desirable for a bridge node to be involved in as small a number of piconets as possible, while preserving connectivity. This criterion is incorporated... |

68 | Performance of a new Bluetooth scatternet formation protocol
- Law, Mehta, et al.
- 2001
(Show Context)
Citation Context ...t are allowed to merge different fragments. An interesting part of the paper is the model it proposes to evaluate the efficiency of a scatternet by approximating the average communication latency. In =-=[13]-=-, Law and Siu also present a scatternet formation algorithm. The problem of topology formation was also the topic of [8], where we investigated the performancesof a few simplistic topology formation a... |

56 |
Transitions in geometric minimum spanning trees
- Monma, Suri
- 1992
(Show Context)
Citation Context ...ge equaling the Euclidean distance between the nodes, is a connected logical topology graph which satisfies all the desired constraints. We first present the following result obtained by Monma et al. =-=[16]-=- which we will use in proving this lemma. Proposition 1 Consider a complete 7 graph with nodes corresponding to points in a twodimensional plane and the weight of the edges being the Euclidean distanc... |

55 | New dynamic algorithms for shortest path tree computation
- Siu, Narvaez, et al.
(Show Context)
Citation Context ...Euclidean distances between neighbors change. Thus the spanning tree needs to be updated in response to these topology alterations. There are efficient algorithms for dynamic update of spanning trees =-=[4,20]-=-). However, the complexity of a distributed and dynamic version of the MST algorithm can be fairly high 9 (see [4,6] for details). This motivates the consideration of simpler distributed algorithms th... |

54 |
Bluetooth Revealed: The Insider’s Guide to an Open Specification for Global Wireless Communications
- Miller, Bisdikian
- 2000
(Show Context)
Citation Context ...in developing several possible solutions capable of generating “good” connected topologies. 1. INTRODUCTION Bluetooth is a recently proposed standard for short range, low power wireless communicat=-=ion [15]-=- that was initially envisioned as a wire replacement technology. However, Bluetooth holds the promise of becoming a key enabling technology in allowing the widespread deployment of ad-hoc networks. Th... |

48 |
BlueMesh: degreeconstrained multihop scatternet formation for Bluetooth networks
- Petrioli, Basagni, et al.
(Show Context)
Citation Context ...ree of the nodes by a series of rearrangements. There is no guarantee that these rearrangements actually terminate and, thus, the resulting topology may not satisfy the degree constraints. In [1] and =-=[17], Basagni an-=-d Petrioli present two more algorithms, “Bluestars” and “BlueMesh”. In [21], Tan et al. present “Tree Scatternet Formation,” an online algorithm to build scatternets. However, it is unclea... |

39 |
BlueTrees-scatternet formation to enable Bluetooth-based personal area networks
- Zaruba, Basagni, et al.
- 2001
(Show Context)
Citation Context ...nquiry and the page sequences before the nodes are able to exchange their clock information) is infinite if the nodes rely on a deterministic pattern of alternating between paging and paged modes. In =-=[2], Za-=-ruba et al. present “Bluetrees,” a scatternet formation algorithm for cases in which the full reachability assumption does not hold. However, the Bluetree algorithm reduces the degree of the nodes... |

28 |
A distributed scheduling algorithm for a Bluetooth scatternet
- Johansson, Korner, et al.
- 2001
(Show Context)
Citation Context ... area of most relevance to this paper. In [3] Bhagwat et al. present a source routing mechanism for Bluetooth scatternets, i.e., networks formed from the interconnection of piconets. Johansson et al. =-=[12]-=- present a distributed scheduling policy for Bluetooth networks. The topology formation problem was first investigated in [19] by Salonidis et al. who presented a distributed topology construction sch... |

27 |
A scatternet formation protocol for ad-hoc networks of Bluetooth devices
- Basagni, Petrioli
- 2002
(Show Context)
Citation Context ... the degree of the nodes by a series of rearrangements. There is no guarantee that these rearrangements actually terminate and, thus, the resulting topology may not satisfy the degree constraints. In =-=[1] and [17], B-=-asagni and Petrioli present two more algorithms, “Bluestars” and “BlueMesh”. In [21], Tan et al. present “Tree Scatternet Formation,” an online algorithm to build scatternets. However, it ... |

27 | Optimizing the topology of Bluetooth wireless personal area networks
- Marsan, Chiasserini, et al.
- 2002
(Show Context)
Citation Context ...logy formation was also the topic of [8], where we investigated the performancesof a few simplistic topology formation algorithms from the standpoint of connectivity and convergence time. Finally, in =-=[14]-=-, Marsan et al. address the problem of determining an optimal Bluetooth topology, based on an integer linear programming formulation derived from the Bluetooth-specific constraints. However, the compl... |

24 | A routing vector method (RVM) for routing in Bluetooth scatternets
- Bhagwat, Seigal
- 1999
(Show Context)
Citation Context ...works span three major areas associated with ad-hoc networks: routing, resource management or scheduling, and topology formation. The latter being clearly the area of most relevance to this paper. In =-=[3]-=- Bhagwat et al. present a source routing mechanism for Bluetooth scatternets, i.e., networks formed from the interconnection of piconets. Johansson et al. [12] present a distributed scheduling policy ... |

22 | Forming scatternets from Bluetooth personal area networks
- Tan, Miu, et al.
- 2001
(Show Context)
Citation Context ...ngements actually terminate and, thus, the resulting topology may not satisfy the degree constraints. In [1] and [17], Basagni and Petrioli present two more algorithms, “Bluestars” and “BlueMesh=-=”. In [21], Ta-=-n et al. present “Tree Scatternet Formation,” an online algorithm to build scatternets. However, it is unclear how the degree constraints and connectivity are satisfied, since only the root nodes ... |

16 |
A protocol to maintain a minimum spanning tree in a dynamic topology
- Cheng, Cimet, et al.
- 1988
(Show Context)
Citation Context ...Euclidean distances between neighbors change. Thus the spanning tree needs to be updated in response to these topology alterations. There are efficient algorithms for dynamic update of spanning trees =-=[4,20]-=-). However, the complexity of a distributed and dynamic version of the MST algorithm can be fairly high 9 (see [4,6] for details). This motivates the consideration of simpler distributed algorithms th... |

13 | On the maximum degree of minimum spanning trees
- Robins, Salowe
- 1994
(Show Context)
Citation Context ...elaxed power level assumptions. 6. TOPOLOGY FORMATION ALGORITHMS FOR NETWORKS WITH NODES IN 3−DIMENSIONAL SPACE We focus on designing a topology where a node’s degree does not exceed 7. Robins et =-=al. [18] s-=-howed that the degree of a minimum weighted spanning tree can be as large as 13. Thus, unlike the 2−dimensional case, a MST-based algorithm is not guaranteed to satisfy the degree constraint of the ... |

10 | Bluetooth technology: Key challenges and initial research
- Guérin, Kim, et al.
- 2002
(Show Context)
Citation Context ...iciency of a scatternet by approximating the average communication latency. In [13], Law and Siu also present a scatternet formation algorithm. The problem of topology formation was also the topic of =-=[8]-=-, where we investigated the performancesof a few simplistic topology formation algorithms from the standpoint of connectivity and convergence time. Finally, in [14], Marsan et al. address the problem ... |