An on‐demand data broadcasting scheduling algorithm based on dynamic index strategy. Issue 5 (5th July 2013)

• Record Type: Journal Article
• Authors: Hu, Wenbin; Fan, Cunlian; Luo, Jiajia; Peng, Chao; Du, Bo
• Is Part Of: Wireless communications and mobile computing. Volume 15:Issue 5(2015)
• Page Start: 947
• Page End: 965
• Publication Date: 2013-07-05
• Subjects: Wireless communication systems -- Periodicals; Mobile communication systems -- Periodicals; 621.38205
• DOI: 10.1002/wcm.2395
• Languages: English
• ISSNs: 1530-8669

Abstract

<abstract abstract-type="main" id="wcm2395-abs-0001"> <title>Abstract</title> <p id="wcm2395-para-0006">On‐demand data broadcasting scheduling is an effective wireless data dissemination technique. Existing scheduling algorithms usually have two problems: (1) with the explosive growth of mobile users and real‐time individual requirements, broadcasting systems present a shortage of scalability, dynamics and timeliness (request drop ratio); (2) with the growth of intelligent and entertained application, energy consumption of mobile client cannot be persistent (tuning time). This paper proposes an effective scheduling algorithm LxRxW. It takes into account the number of lost requests during next item broadcasting time, the number of requests and the waiting time. LxRxW can reduce the request drop ratio. At the same time, the algorithm employs a dynamic index strategy to put forward a dynamic adjusting method on the index cycle length (DAIL) to determine the proper index cycle. Extensive experimental results show that the LxRxW algorithm has better performance than other state‐of‐the‐art scheduling algorithms and can significantly reduce the drop ratio of user requests by 40%–50%. The request drop ratio and accessing time of LxRxW with index increase by 1%–2% than LxRxW algorithm without index, but the tuning time decreases by 70%. The index strategy shows that when the index cycle length is less than 20units, it can significantly reduce the average tuning time but when the index cycle length continues increasing, the average tuning time will increase contrarily. DAIL can dynamically determine the length of index cycle. Moreover, it can reach optimal integrated performance of the request drop ratio, the average accessing time and the average tuning time. Copyright © 2013 John Wiley & Sons, Ltd.</p> </abstract>