A flexible scatternet-wide scheduling algorithm for Bluetooth networks

Wensheng Zhang, Guohong Cao

Research output: Contribution to conferencePaper

23 Citations (Scopus)

Abstract

Bluetooth is a promising technology which enables the design of low-power, small-sized, low-cost radios that can be embedded in existing portable devices. Due to the limitation of a single channel capacity, scatternet techniques are proposed to increase the communication bandwidth. However, since a bridge may be shared by several piconets, simultaneous polling the bridge may result in bridge conflicts, and then seriously degrade the system performance. Thus, the potential of the scatternet may not be realized without a good scatternet-wide scheduling algorithm. In this paper, we propose a flexible scatternet-wide scheduling (FSS) scheme to address the problems associated with scatternet-wide traffic scheduling. The proposed scheme is based on a switch-table concept to avoid bridge conflicts. Further, the switch-table can be dynamically adjusted based on the traffic load to improve the system performance. Simulations are conducted to evaluate the performance of the proposed algorithms. Compared to the static scheme, the FSS scheme can significantly improve the system throughput and reduce the packet transmission delay.

Original languageEnglish (US)
Pages291-298
Number of pages8
StatePublished - Jan 1 2002
Event21st IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States
Duration: Apr 3 2002Apr 5 2002

Other

Other21st IEEE International Performance, Computing, and Communications Conference
CountryUnited States
CityPhoenix, AZ
Period4/3/024/5/02

Fingerprint

Bluetooth
Scheduling algorithms
Scheduling
Switches
Radio receivers
Channel capacity
Throughput
Bandwidth
Communication
Costs

All Science Journal Classification (ASJC) codes

  • Media Technology

Cite this

Zhang, W., & Cao, G. (2002). A flexible scatternet-wide scheduling algorithm for Bluetooth networks. 291-298. Paper presented at 21st IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United States.
Zhang, Wensheng ; Cao, Guohong. / A flexible scatternet-wide scheduling algorithm for Bluetooth networks. Paper presented at 21st IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United States.8 p.
@conference{8e05ef3e02074546a4b7c11511cbe39f,
title = "A flexible scatternet-wide scheduling algorithm for Bluetooth networks",
abstract = "Bluetooth is a promising technology which enables the design of low-power, small-sized, low-cost radios that can be embedded in existing portable devices. Due to the limitation of a single channel capacity, scatternet techniques are proposed to increase the communication bandwidth. However, since a bridge may be shared by several piconets, simultaneous polling the bridge may result in bridge conflicts, and then seriously degrade the system performance. Thus, the potential of the scatternet may not be realized without a good scatternet-wide scheduling algorithm. In this paper, we propose a flexible scatternet-wide scheduling (FSS) scheme to address the problems associated with scatternet-wide traffic scheduling. The proposed scheme is based on a switch-table concept to avoid bridge conflicts. Further, the switch-table can be dynamically adjusted based on the traffic load to improve the system performance. Simulations are conducted to evaluate the performance of the proposed algorithms. Compared to the static scheme, the FSS scheme can significantly improve the system throughput and reduce the packet transmission delay.",
author = "Wensheng Zhang and Guohong Cao",
year = "2002",
month = "1",
day = "1",
language = "English (US)",
pages = "291--298",
note = "21st IEEE International Performance, Computing, and Communications Conference ; Conference date: 03-04-2002 Through 05-04-2002",

}

Zhang, W & Cao, G 2002, 'A flexible scatternet-wide scheduling algorithm for Bluetooth networks', Paper presented at 21st IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United States, 4/3/02 - 4/5/02 pp. 291-298.

A flexible scatternet-wide scheduling algorithm for Bluetooth networks. / Zhang, Wensheng; Cao, Guohong.

2002. 291-298 Paper presented at 21st IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - A flexible scatternet-wide scheduling algorithm for Bluetooth networks

AU - Zhang, Wensheng

AU - Cao, Guohong

PY - 2002/1/1

Y1 - 2002/1/1

N2 - Bluetooth is a promising technology which enables the design of low-power, small-sized, low-cost radios that can be embedded in existing portable devices. Due to the limitation of a single channel capacity, scatternet techniques are proposed to increase the communication bandwidth. However, since a bridge may be shared by several piconets, simultaneous polling the bridge may result in bridge conflicts, and then seriously degrade the system performance. Thus, the potential of the scatternet may not be realized without a good scatternet-wide scheduling algorithm. In this paper, we propose a flexible scatternet-wide scheduling (FSS) scheme to address the problems associated with scatternet-wide traffic scheduling. The proposed scheme is based on a switch-table concept to avoid bridge conflicts. Further, the switch-table can be dynamically adjusted based on the traffic load to improve the system performance. Simulations are conducted to evaluate the performance of the proposed algorithms. Compared to the static scheme, the FSS scheme can significantly improve the system throughput and reduce the packet transmission delay.

AB - Bluetooth is a promising technology which enables the design of low-power, small-sized, low-cost radios that can be embedded in existing portable devices. Due to the limitation of a single channel capacity, scatternet techniques are proposed to increase the communication bandwidth. However, since a bridge may be shared by several piconets, simultaneous polling the bridge may result in bridge conflicts, and then seriously degrade the system performance. Thus, the potential of the scatternet may not be realized without a good scatternet-wide scheduling algorithm. In this paper, we propose a flexible scatternet-wide scheduling (FSS) scheme to address the problems associated with scatternet-wide traffic scheduling. The proposed scheme is based on a switch-table concept to avoid bridge conflicts. Further, the switch-table can be dynamically adjusted based on the traffic load to improve the system performance. Simulations are conducted to evaluate the performance of the proposed algorithms. Compared to the static scheme, the FSS scheme can significantly improve the system throughput and reduce the packet transmission delay.

UR - http://www.scopus.com/inward/record.url?scp=0036089160&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036089160&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0036089160

SP - 291

EP - 298

ER -

Zhang W, Cao G. A flexible scatternet-wide scheduling algorithm for Bluetooth networks. 2002. Paper presented at 21st IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United States.