Efficient processing of requests with network coding in on-demand data broadcast environments

Chen, Jun; Lee, Victor C. S.; Li, Kai; Ali, G. G. Md. Nawaz; Chan, Edward

doi:10.1016/j.ins.2012.12.044

Cited by 28 publications

(30 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…6 shows the I2V broadcast productivity of algorithms under different traffic scenarios. As demonstrated in previous work [24], the effectiveness of broadcast effect increases by giving preference of scheduling hot data items. MRF always schedules the data item with the most pending requests.…”

Section: Simulation Resultssupporting

confidence: 55%

Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network

Liu

Lee

et al. 2016

IEEE/ACM Trans. Networking

Self Cite

254

107

View full text Add to dashboard Cite

This paper presents the first study on scheduling for cooperative data dissemination in a hybrid infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communication environment. We formulate the novel problem of cooperative data scheduling (CDS). Each vehicle informs the road-side unit (RSU) the list of its current neighboring vehicles and the identifiers of the retrieved and newly requested data. The RSU then selects sender and receiver vehicles and corresponding data for V2V communication, while it simultaneously broadcasts a data item to vehicles that are instructed to tune into the I2V channel. The goal is to maximize the number of vehicles that retrieve their requested data. We prove that CDS is NP-hard by constructing a polynomial-time reduction from the Maximum Weighted Independent Set (MWIS) problem. Scheduling decisions are made by transforming CDS to MWIS and using a greedy method to approximately solve MWIS. We build a simulation model based on realistic traffic and communication characteristics and demonstrate the superiority and scalability of the proposed solution. The proposed model and solution, which are based on the centralized scheduler at the RSU, represent the first known vehicular ad hoc network (VANET) implementation of software defined network (SDN) concept.Index Terms-Cooperative data dissemination, scheduling, software defined network, vehicular ad hoc networks.

show abstract

Section: Simulation Resultssupporting

confidence: 55%

Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network

Liu

Lee

et al. 2016

IEEE/ACM Trans. Networking

Self Cite

254

107

View full text Add to dashboard Cite

show abstract

“…NC has shown great potential to improve the bandwidth efficiency of wireless broadcast systems. The design of NC-based on-demand data broadcast schemes has received significant research interests and many network coding-based data scheduling algorithms have been proposed for on-demand single-item requests environment [35][36][37][38][39][40]. Hou studied a model that jointly considers the application requirements on traffic patterns, delay constraints, and throughput requirements, as well as wireless limitations, including the unreliable wireless links and the lack of feedback information.…”

Section: Networkmentioning

confidence: 99%

“…Based on this model, a general framework was developed for designing feasibility-optimal broadcasting policies that apply to systems with various network coding mechanisms [35]. In [36], a coding assisted scheduling algorithm for on-demand data broadcast named ADC-1 and its enhanced version ADC-2 are proposed for single-item requests environment. In [37], Zhan et al propose a generalized encoding framework for incorporating network coding into data scheduling algorithms for on-demand broadcast.…”

Section: Networkmentioning

confidence: 99%

Efficient Coding-Based Scheduling for Multi-Item Requests in Real-Time On-Demand Data Dissemination

Wang¹,

Yan²,

Yu³

2016

Mobile Information Systems

View full text Add to dashboard Cite

On-demand broadcast is an effective data dissemination technique to enhance the system ability to handle dynamic client access patterns. With the development of real-time wireless applications, it is practical for clients to request multiple related data items with time constraint in one request. For real-time data broadcast, items are only useful if they can be received by clients before expiration; otherwise, the related requests become invalid. Hence, minimizing the number of requests that miss their deadlines becomes an important task in on-demand broadcast, especially for multi-item scenario, where more requests are inclined to miss their deadlines due to the heavier workload and greater complexity, compared with single-item scenario. In this paper, we propose a network coding-based scheduling algorithm for real-time multi-item data dissemination. The proposed algorithm exploits the coding opportunities between cached and requested data items and integrates network coding with data scheduling to minimize the deadline miss ratio. Extensive simulation results demonstrate that the proposed algorithm achieves the lowest deadline miss ratio under various circumstances. In addition, the high efficiency of the proposed algorithm in utilizing the transmission bandwidth is proved for that fewer instances of ineffective service are provided for satisfying clients' requests within time constraints.

show abstract

“…Although great efforts have been devoted to investigating data dissemination in conventional mobile computing systems [Hu and Chen 2009;Aksoy and Franklin 1999;Xu et al 2006;Chen et al 2013], they are not sufficient when considering the unique requirements and challenges of data scheduling arising in VCPSs. First, the time constraint on information retrieval in vehicular networks is more stringent than many mobile applications due to the high mobility of vehicles.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Temporal Data with Dynamic Snapshot Consistency Requirement in Vehicular Cyber-Physical Systems

Lee

et al. 2014

ACM Trans. Embed. Comput. Syst.

Self Cite

View full text Add to dashboard Cite

Timely and efficient data dissemination is one of the fundamental requirements to enable innovative applications in vehicular cyber-physical systems (VCPS). In this work, we intensively analyze the characteristics of temporal data dissemination in VCPS. On this basis, we formulate the static and dynamic snapshot consistency requirements on serving real-time requests for temporal data items. Two online algorithms are proposed to enhance the system performance with different requirements. In particular, a reschedule mechanism is developed to make the scheduling adaptable to the dynamic snapshot consistency requirement. A comprehensive performance evaluation demonstrates the superiority of the proposed algorithms. . 2014. Scheduling temporal data with dynamic snapshot consistency requirement in vehicular cyber-physical systems. ACM Trans. Embedd.

show abstract

Efficient processing of requests with network coding in on-demand data broadcast environments

Cited by 28 publications

References 24 publications

Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network

Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network

Efficient Coding-Based Scheduling for Multi-Item Requests in Real-Time On-Demand Data Dissemination

Scheduling Temporal Data with Dynamic Snapshot Consistency Requirement in Vehicular Cyber-Physical Systems

Contact Info

Product

Resources

About