Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Niklas Johansson, Ulf Körner and Per Johansson. Wireless Ad-hoc Networking with Bluetooth. 4th Workshop on Personal Wireless Communications, Copenhagen, 1999.
Per Johansson et al. Short Range Radio Based Ad-hoc Networking: Performance and Properties. ICC’99, Vancouver, 1999.
Jaap Haartsen. Bluetooth - The universal radio interface for ad hoc, wireless connectivity. Ericsson Review, no 3, 1998
The Bluetooth Special Interest Group, Documentation available at http://www.bluetooth.com/
Ashok Erramilli, Onuttom Narayan and Walter Willinger. Experimental Queueing Analysis with Long-Range Dependent Packet traffic. IEEE/A CM Transactions on Networking, 4 (2): 209–223, April 1996.
Will E. Leland, Murad S. Taqqu, Walter Willinger and Daniel V. Wilson. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Transactions on Networking, 2: 1–15, February 1994.
I. Norros. A storage model with self similar input. Queueing Syst., vol. 16, pp. 387–396, 1994.
A.Erramilli, R.P. Singh and P. Pruthi. An application of deterministic chaotic maps to model packet traffic. Queueing Syst., vol. 20, pp. 171–206, 1995.
Kerry W. Fendick and Ward Whitt. Measurements and Approximations to Describe the Offered Traffic and Predict the Average Workload in a Single-Server Queue. Proceedings of the IEEE,77(1):171–194, January 1989.
S. Keshay. An Engineering Approach to Computer Networking. part of the Addison– Wesley Professional Computing Series,1998. ISBN 0–201–63442–2.
Hideaki Takagi. Exact analysis of round-robin scheduling of services. IBM J. Res. Dev. 31,4 (July), 484–488.
Hideaki Takagi. Queuing Analysis of Polling Models. ACM Computing Surveys, Vol. 20, No. 1, March 1988.
Uri Yechiali. Optimal Dynamic Control of Polling Systems. ITC-13, Copenhagen, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Johansson, N., Körner, U., Johansson, P. (2000). Performance Evaluation of Scheduling Algorithms for Bluetooth. In: Tsang, D.H.K., Kühn, P.J. (eds) Broadband Communications. BC 1999. IFIP — The International Federation for Information Processing, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35579-5_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-35579-5_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4685-3
Online ISBN: 978-0-387-35579-5
eBook Packages: Springer Book Archive