Performance Evaluation of Scheduling Algorithms for Bluetooth
Niklas Johansson, Ulf Körner, Per Johansson · 2000
During the last couple of years, much attention has been brought to research and development of mobile ad hoc networks. In an ad hoc network, a collection of peer wireless mobile users within range of each other may dynamically form a temporary network without the use of any existing network infrastructure or centralized server, as opposed to cellular systems. This paper analyses the performance of a wireless ad-hoc network concept called Bluetooth which was presented in February 1998 by its five promoters — Ericsson, Nokia, IBM, Toshiba and Intel. We discuss a modified exhaustive scheduler, proposed by the authors, and show its applicability under various operating conditions. A number of scenarios are analyzed and we also address the importance of multi-slot packets to increase throughput and to keep the delays low.