Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Ad Hoc Routing for Bluetooth
Blekinge Institute of Technology, School of Engineering, Department of Telecommunication Systems.
Blekinge Institute of Technology, School of Engineering, Department of Telecommunication Systems.
2005 (English)Independent thesis Advanced level (degree of Master (One Year))Student thesis
Abstract [en]

The number of Bluetooth equipped devices has increased tremendously over the last couple of years and many new products using Bluetooth are expected to be launched on the market. Bluetooth is a low cost, low power, short range radio technology, developed as a cable replacement to connect devices such as cellular phones, headsets, Personal Digital Assistants (PDA's) and so on. Bluetooth is a part of the Wireless Personal Area Network (WPAN). In a WPAN the members may be constantly changing as devices move in and out of range. A basic formation of a Bluetooth network is called a piconet, consisting of maximum eight devices, where one of the devices acts as master unit. The Bluetooth specification defines a method for the interconnection of piconets: the scatternet. A scatternet can be dynamically constructed in an ad hoc manner when some nodes belong, at the same time, to more than one piconet. The current Bluetooth specification only defines the notation of a scatternet but does not provide the mechanism to construct the scatternet. In order to make Bluetooth more suitable and efficient in an ad hoc environment routing algorithms are needed. However, routing algorithms are not defined in Bluetooth specification. The time-to-connect is essential when creating an ad hoc network. An implementation of the Modified Reverse Path Forwarding (MRPF) routing algorithm based on the original Reverse Path Forwarding (RPF) routing algorithm is evaluated. Empirical data are extracted and compared to the original. The results show that MRPF uses less number of connections and decreases the time-to-connect compared to the RPF algorithm.

Place, publisher, year, edition, pages
2005. , p. 78
Keywords [en]
Bluetooth, CStack, Wireless Network, On Demand Ad Hoc Routing, Reverse Path Forwarding (RPF), Modified Reverse Path Forwarding (MRPF), Network Performance Measurement
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:bth-3503Local ID: oai:bth.se:arkivex1DC360CA506CBC5CC1256FE00027F769OAI: oai:DiVA.org:bth-3503DiVA, id: diva2:830811
Uppsok
Technology
Supervisors
Available from: 2015-04-22 Created: 2005-04-11 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(1154 kB)163 downloads
File information
File name FULLTEXT01.pdfFile size 1154 kBChecksum SHA-512
7cd1d3fa8b8047295f58a4e6e625065bd0d2f32aead92171111dda980b96ae6b79cd1ea413f5bc269bddb9837c0154a6642cab108fab512da5d10fc04e88e89e
Type fulltextMimetype application/pdf

By organisation
Department of Telecommunication Systems
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 163 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 530 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf