Next Article in Journal
Real-Time Stream Processing in Social Networks with RAM3S
Previous Article in Journal
Learning Dynamic Factors to Improve the Accuracy of Bus Arrival Time Prediction via a Recurrent Neural Network
Open AccessArticle

Performance Analysis of On-Demand Scheduling with and without Network Coding in Wireless Broadcast

1
Department of Applied Computer Science, University of Charleston, Charleston, WV 25304, USA
2
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
3
Department of Electrical and Electronic Engineering, Auckland University of Technology, Auckland 1010, New Zealand
4
School of Information Management, Wuhan University, Wuhan 430072, Hubei, China
*
Author to whom correspondence should be addressed.
Future Internet 2019, 11(12), 248; https://doi.org/10.3390/fi11120248
Received: 16 October 2019 / Revised: 3 November 2019 / Accepted: 20 November 2019 / Published: 26 November 2019
On-demand broadcast is a scalable approach to disseminating information to a large population of clients while satisfying dynamic needs of clients, such as in vehicular networks. However, in conventional broadcast approaches, only one data item can be retrieved by clients in one broadcast tick. To further improve the efficiency of wireless bandwidth, in this work, we conduct a comprehensive study on incorporating network coding with representative on-demand scheduling algorithms while preserving their original scheduling criteria. In particular, a graph model is derived to maximize the coding benefit based on the clients’ requested and cached data items. Furthermore, we propose a heuristic coding-based approach, which is applicable for all the on-demand scheduling algorithms with low computational complexity. In addition, based on various application requirements, we classify the existing on-demand scheduling algorithms into three groups—real-time, non-real-time and stretch optimal. In view of different application-specific objectives, we implement the coding versions of representative algorithms in each group. Extensive simulation results conclusively demonstrate the superiority of coding versions of algorithms against their non-coding versions on achieving their respective scheduling objectives. View Full-Text
Keywords: network coding; on-demand broadcasting; data scheduling algorithm; performance evaluation network coding; on-demand broadcasting; data scheduling algorithm; performance evaluation
Show Figures

Figure 1

MDPI and ACS Style

Ali, G.G.M.N.; Lee, V.C.S.; Meng, Y.; Chong, P.H.J.; Chen, J. Performance Analysis of On-Demand Scheduling with and without Network Coding in Wireless Broadcast. Future Internet 2019, 11, 248.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop