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

G. G. Md. Nawaz Ali, Victor C. S. Lee, Yuxuan Meng, Peter H. J. Chong and Jun Chen
Additional contact information
G. G. Md. Nawaz Ali: Department of Applied Computer Science, University of Charleston, Charleston, WV 25304, USA
Victor C. S. Lee: Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Yuxuan Meng: Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Peter H. J. Chong: Department of Electrical and Electronic Engineering, Auckland University of Technology, Auckland 1010, New Zealand
Jun Chen: School of Information Management, Wuhan University, Wuhan 430072, Hubei, China

Future Internet, 2019, vol. 11, issue 12, 1-24

Abstract: 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.

Keywords: network coding; on-demand broadcasting; data scheduling algorithm; performance evaluation (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/11/12/248/pdf (application/pdf)
https://www.mdpi.com/1999-5903/11/12/248/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:11:y:2019:i:12:p:248-:d:291146

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().