{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:04:14Z","timestamp":1754157854194,"version":"3.41.2"},"reference-count":28,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2006,12,31]],"date-time":"2006-12-31T00:00:00Z","timestamp":1167523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,5,1]]},"abstract":"<jats:p>Bluetooth wireless technology is a low power, low cost and short\u2010range RF technology that permits communication between bluetooth enabled devices, and focuses on replacement of cables between electronic devices. Communication between Bluetooth devices follows a strict master\u2010slave scheme. Each master device can have up to 7 active slaves and forms a so called piconet. In Bluetooth employing conventional scheduling policies such as Round Robin (RR), POLL or NULL packet is sent when the Master or Slave node does not have any data to send which causes a significant waste of resources. The DRR (Deficit Round Robin) scheduling algorithm can avoid the waste of time and slot of the RR scheduling at the sacrifice of fairness. In this paper we propose an improved DRR (IDRR) scheduling algorithm which effectively combines the DRR and bin packing algorithm. Computer simulation reveals that slot utilization is increased up to about 60% while the total number of used slots is decreased up to about 100%. The proposed IDRR scheduling is thus effective for not only basic data transmission but also real\u2010time multimedia data transmission.<\/jats:p>","DOI":"10.1108\/17427370780000147","type":"journal-article","created":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T07:14:49Z","timestamp":1275722089000},"page":"125-134","source":"Crossref","is-referenced-by-count":0,"title":["Combining next fit of bin packing with deficit round robin for efficient slot scheduling in Bluetooth"],"prefix":"10.1108","volume":"2","author":[{"given":"Hye","family":"Hwan Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hee","family":"Yang Youn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eung","family":"Je Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"Won Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"volume-title":"Specification of the Bluetooth","year":"2005","author":"Bluetooth Special Interest Group","key":"p_1"},{"volume-title":"Efficient Fair Queuing using","year":"1996","author":"Shreedhar M.","key":"p_3"},{"key":"p_5","unstructured":"Issue: 3pp.375-385. [3] Manish Kalia,Deepak Bansal, Rajeev Shorey (2000) Data Scheduling"},{"key":"p_6","unstructured":"and SAR for Bluetooth MAC. IEEE VTC 2000-Spring Tokyo, pp.716-720."},{"volume-title":"Efficient Polling Schemes for","year":"2001","author":"Capone A.","key":"p_7"},{"key":"p_8","unstructured":"Bluetooth Picocells. ICC, IEEE International Conference on Communication, pp.1990-1994."},{"key":"p_10","first-page":"45","volume-title":"International Conference on Parallel Processing Workshops (ICPPW02)","author":"Arunabha Sen Jayakumar","year":"2002"},{"volume-title":"Algorithms for The Variable Sized","year":"2002","author":"Kang Jangha","key":"p_13"},{"first-page":"3211","volume-title":"IEEE INFOCOM 2001","author":"Enhancing Shorey","key":"p_16"},{"volume-title":"A tight asymptotic bound for","year":"1981","author":"Baker B.S","key":"p_17"},{"first-page":"147","volume-title":"Volume: 2","author":"Bin Packing Fit-Decreasing","key":"p_18"},{"volume-title":"Class-based Packet","year":"2002","author":"Sinha Vishwanath","key":"p_22"},{"key":"p_23","unstructured":"Scheduling Policies for Bluetooth. National Conference on Communications: I.I.T. Bombay, pp.25-27."},{"volume-title":"the Internet, and The Telephone Newtork","author":"Networks ATM","key":"p_25"},{"volume-title":"Data Struc","year":"1994","author":"Mark Allen Weiss Florida International University","key":"p_26"},{"volume-title":"tures and Algorithm Analysis","key":"p_27"},{"key":"p_29","unstructured":"for Extensible Bin Packing (2001)ACM\/SIAMSymposium on Discrete Al-gorithms, pp.586-588."},{"volume-title":"Design of generalized processor sharing","year":"1999","author":"Mitro A.","key":"p_32"},{"volume-title":"Proceedings. IEEE, Volume: 3","key":"p_33","first-page":"1220"},{"volume-title":"Statistical analysis of the","year":"1996","author":"Zhang Zhi-Li","key":"p_34"},{"key":"p_35","doi-asserted-by":"publisher","DOI":"10.1109\/JQE.1977.1069223"},{"volume-title":"A Fair and Traffic","year":"2004","author":"Kapoor Rohit","key":"p_36"},{"key":"p_38","unstructured":"Networks and Applications , Volume: 9 , Issue: 1, pp.9-20. [20] ndras Racz,Gyorgy Miklos, Ferenc Kubinszky,Andras Gergely Valko"},{"volume-title":"the 2nd ACM Interational Symposium on Mobile Ad Hoc","author":"A","key":"p_39"},{"volume-title":"Volume: 1","key":"p_41","first-page":"344"},{"volume-title":"Approxima","year":"1997","author":"Coffman E. G.","key":"p_42"},{"volume-title":"degree in Shcool of Information and Communication Engineering from the Sungkyunkwan University","year":"2004","author":"Kyonggi University in 2002 and the M.S.","key":"p_44"},{"volume-title":"Computer Engineering from the University of Massachusetts at Amherst, in 1988. From 1979 to","year":"1984","author":"from Seoul National University, Seoul, Korea","key":"p_45"}],"container-title":["International Journal of Pervasive Computing and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370780000147\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17427370780000147\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:22:23Z","timestamp":1753402943000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijpcc\/article\/2\/2\/125-134\/162916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,31]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,5,1]]}},"alternative-id":["10.1108\/17427370780000147"],"URL":"https:\/\/doi.org\/10.1108\/17427370780000147","relation":{},"ISSN":["1742-7371"],"issn-type":[{"type":"print","value":"1742-7371"}],"subject":[],"published":{"date-parts":[[2006,12,31]]}}}