Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Da Zhang 0003

dblp:67/7672-3 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2017
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Content delivery and video streaming · 61% Vehicular, aerial and satellite networks · 39%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Content delivery and video streaming › content distribution
cooperative content distribution
0.212013
Enabling Efficient WiFi-Based Vehicular Content Distribution · IEEE Trans. Parallel Distributed Syst. 2013
Content delivery and video streaming
prefetching
0.212013
Enabling Efficient WiFi-Based Vehicular Content Distribution · IEEE Trans. Parallel Distributed Syst. 2013
Vehicular, aerial and satellite networks › data delivery
vehicular content distribution
0.212013
Enabling Efficient WiFi-Based Vehicular Content Distribution · IEEE Trans. Parallel Distributed Syst. 2013
Vehicular, aerial and satellite networks › roadside unit
roadside access points
0.012013
Enabling Efficient WiFi-Based Vehicular Content Distribution · IEEE Trans. Parallel Distributed Syst. 2013

Methods — techniques the papers use, named apart from their topics

representative-based prefetching · 0.2network coding · 0.2contact map · 0.2
YearPublicationVenuePosition
2017 MaxRep: Efficient Replication for Vehicular Content Distribution
abstract
We consider a vehicular content replication system which makes use of the deployed Access Points (APs) to maximize the vehicular download progress of delay-tolerant contents through replication in the APs' local storage. The transient connection period between the vehicle and the AP makes it difficult for the vehicle to download the entire file requested and thus the content retrieval is usually across several APs. We propose an efficient and distributed replication algorithm explicitly taking into account the content popularity, vehicle-AP contact pattern, and content availability among correlated APs. Simulation based on real vehicular trace proves the effectiveness of the proposed replication system. The performance in terms of download rate and completion ratio has at least 15% to 20% improvement against the algorithms under comparison.
Da Zhang 0003, Chai Kiat Yeo
GLOBECOM1
2013 Enabling Efficient WiFi-Based Vehicular Content Distribution
abstract
For better road safety and driving experience, content distribution for vehicle users through roadside Access Points (APs) becomes an important and promising complement to 3G and other cellular networks. In this paper, we introduce Cooperative Content Distribution System for Vehicles (CCDSV) which operates upon a network of infrastructure APs to collaboratively distribute contents to moving vehicles. CCDSV solves several important issues in a practical system, like the robustness to mobility prediction errors, limited resources of APs and the shared content distribution. Our system organizes the cooperative APs into a novel structure, namely, the contact map which is based on the vehicular contact patterns observed by APs. To fully utilize the wireless bandwidth provided by APs, we propose a representative-based prefetching mechanism, in which a set of representative APs are carefully selected and then share their prefetched data with others. The selection process explicitly takes into account the AP's storage capacity, storage status, inter-APs bandwidth and traffic loads on the backhaul links. We apply network coding in CCDSV to augment the distribution of shared contents. The selection of shared contents to be prefetched on an AP is based on the storage status of neighboring APs in the contact map in order to increase the information utility of each prefetched data piece. Through extensive simulations, CCDSV proves its effectiveness in vehicular content distribution under various scenarios.
Da Zhang 0003, Chai Kiat Yeo
IEEE Trans. Parallel Distributed Syst.1
2011 A Cooperative Content Distribution System for Vehicles
abstract
For vehicle users, content distribution through roadside APs is an important complement to that through 3G and other cellular networks. However, the unique features of such access scheme pose many challenges on effectively satisfying vehicles' data request. This paper proposes a cooperative content distribution system for vehicles(CCDSV), based on the network-coding, vehicle-AP contact prediction, and data-prefetching techniques. CCDSV uses network coding to distribute encoded data for the effective sharing of popular contents. CCDSV predicts the vehicle's future contact APs and adaptively prefetches requested data in advance before vehicle's arrival. The proposed system is implemented into ns-2 simulator and demonstrates its effectiveness in terms of throughput, reduced traffic load, and download volume.
Da Zhang 0003, Chai Kiat Yeo
GLOBECOM1
2011 Distributed Court System for intrusion detection in mobile ad hoc networks
Da Zhang 0003, Chai Kiat Yeo
Comput. Secur.1
2010 A Novel Architecture of Intrusion Detection System
abstract
In this paper, we propose a novel Intrusion Detection System (IDS), Court-like Cluster-based IDS (CCIDS), to secure routing protocols in Mobile Ad Hoc Networks (MANETs). After the network is divided into one-hop clusters, each of these clusters performs similar functions as a court in real-life, such as accusation, investigation and defence. We show that court like IDS is effective in many aspects, especially the capability to prevent malicious alerts and reduce false positive rate. To further prove its effectiveness, we then apply CCIDS in securing the Optimized Link State Routing (OLSR) protocol to solve two most severe attacks-link spoofing and link deletion. Through extensive simulation, four performance parameters, namely, detection rate, false positive rate, detection delay, and communication overhead are evaluated.
Da Zhang 0003, Chai Kiat Yeo
CCNC1