Capacity Assignment in Bluetooth Scatternets - Optimal and Heuristic Algorithms

Gil Zussman, Adrian Segall

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

Bluetooth enables portable electronic devices to communicate wirelessly via short-range ad-hoc networks. Initially Bluetooth will be used as a replacement for point-to-(multi)point cables. However, in due course, there will be a need for forming multihop ad-hoc networks over Bluetooth, referred to as scatternets. This paper investigates the capacity assignment problem in Bluetooth scatternets. The problem arises primarily from the special characteristics of the network and its solution requires new protocols. We formulate it as a problem of minimizing a convex function over a convex set contained in the matching polytope. We develop an optimal algorithm which is similar to the well-known flow deviation algorithm and that calls for solving a maximum-weight matching problem at each iteration. A centralized heuristic algorithm with a relatively low complexity is also developed. Then, since in an ad-hoc network there is no central authority that is responsible for network optimization, a distributed heuristic algorithm is proposed. Finally, numerical results are presented and it is shown that the heuristic algorithms usually converge to results that are relatively close to the optimal results.

Original languageEnglish
Pages (from-to)49-61
Number of pages13
JournalMobile Networks and Applications
Volume9
Issue number1
DOIs
StatePublished - Feb 2004
Externally publishedYes

Bibliographical note

Funding Information:
∗ This research was supported by a grant from the Ministry of Science, Israel.

Keywords

  • Bluetooth
  • Capacity assignment
  • Personal Area Networks (PAN)
  • Scatternet
  • Scheduling

Fingerprint

Dive into the research topics of 'Capacity Assignment in Bluetooth Scatternets - Optimal and Heuristic Algorithms'. Together they form a unique fingerprint.

Cite this