Bluetooth scatternet formation: A survey
Ad Hoc Networks
Cooperative leader election algorithm for master/slave mobile ad hoc networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Study on the advanced MAC scheduling algorithm for the infrared dedicated short range communication
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
A BPP-Based scheduling algorithm in bluetooth systems
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
In this paper we propose two new Media Access Control (MAC) scheduling algorithms for Bluetooth whose objective is to achieve high channel utilization (throughput). Conventionalscheduling policies such as Round Robin (RR) in Bluetooth environment results in wastage of slots and hence poor utilization of the network resources. As Bluetooth devices are designed to carry both voice and data, scheduling becomes a complex task, as slots are reserved for voice traffic at periodic intervals and the data packets are allowed to have variable size. In this paper we view the MAC scheduling problem in Bluetooth as an online Bin Packing problem. The two scheduling policies being proposed in the paper, Look Ahead (LA) and Look Ahead Round Robin (LARR) can be viewed as online bin packing with lookahead. Inthis paper, we first analytically demonstrate that an optimal scheduling policy can have about 66% improvement in throughput over the Round Robin policy. Our extensive simulation shows that both LA and LARR achieves nearly 10% improvement in throughput over RR. As the computational complexity of LARR is lower than that of LA and also LARR avoids the possibility of starvation, we suggest the use of this algorithm over RR.