A scheduling algorithm for bluetooth based wireless personal area networks
Of recent, most people carry at least two wireless mobile nodes such as cell phones and personal digital assistants (PDAs). Such nodes are often referred to as personal devices. Along with this trend is the issue of how to exchange information among these nodes. Bluetooth is a wireless technology that supports Wireless Personal Area Network (WP AN). The smallest unit of a Bluetooth WP AN is called a piconet and a union of piconets is referred to as a scattemet. Scattemets raise several challenging network performance issues including routing, scattemet formation, security, and scheduling. The choice of the kind of scheduling algorithm implemented in a scattemet greatly influences the overall performance of the scattemet. This subsequently translates to the level of acceptance Bluetooth will have among the users. This research addresses the scheduling problem in a Bluetooth scatternet with an objective of improving the overall network performance. The major contribution of this thesis is proposal of a new scheduling algorithm for Bluetooth scatternet and evaluates its performance. Unlike earlier works, this proposal considers the packet destination and the bridge node dwell-time as key factors. Performance of the proposed algorithm is evaluated both analytically and by simulation. Numerical results from the evaluation show that the proposed algorithm increases the network throughput, reduces packet loss/drop rate, and packet delay. This result supports the application of the proposed algorithm in future high-speed multimedia wireless networks, where high network throughput and low delay are desired.
Bibliography: p. 101-103
Agbakwuru, J. (2003). A scheduling algorithm for bluetooth based wireless personal area networks (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/19130