TY - JOUR
T1 - Throughput analysis of cooperative mobile content distribution in vehicular network using symbol level network coding
AU - Yan, Qiben
AU - Li, Ming
AU - Yang, Zhenyu
AU - Lou, Wenjing
AU - Zhai, Hongqiang
N1 - Funding Information:
Manuscript received 22 February 2011; revised 20 July 2011. This work was supported in part by the US National Science Foundation under grants CNS-1156318 and CNS-1156311. Q. Yan and W. Lou are with Department of Computer Science, Virginia Tech, VA 24061 (e-mail: [email protected],[email protected]). M. Li is with Department of Computer Science, Utah State University, UT 84322 (e-mail: [email protected]). Z. Yang is with Amazon.com, WA 98102 (e-mail: [email protected]). H. Zhai is with Philips Research North America, NY 10510 (e-mail: [email protected]). Digital Object Identifier 10.1109/JSAC.2012.120229.
PY - 2012/2
Y1 - 2012/2
N2 - This paper presents a theoretical study of the throughput of mobile content distribution (MCD) in vehicular ad hoc networks (VANETs). Since VANET is well-known for its fast-changing topology and adverse wireless channel environments, various protocols have been proposed in the literature to enhance the performance of MCD in a vehicular environment, using packet-level network coding (PLNC) and symbol-level network coding (SLNC). However, there still lacks a fundamental understanding of the limits of MCD protocols using network coding in VANETs. In this paper, we develop a theoretical model to compute the achievable throughput of cooperative MCD in VANETs using SLNC. By considering a one-dimensional road topology with an access point (AP) as the content source, the expected achievable throughput for a vehicle at a certain distance from the AP is derived, for both using PLNC and SLNC. Our proposed model is unique since it captures the effects of multiple practical factors, including vehicle distribution and mobility pattern, channel fading and packet collisions. Through numerical results, we provide insights on optimized design choices for network coding-based cooperative MCD systems in VANETs.
AB - This paper presents a theoretical study of the throughput of mobile content distribution (MCD) in vehicular ad hoc networks (VANETs). Since VANET is well-known for its fast-changing topology and adverse wireless channel environments, various protocols have been proposed in the literature to enhance the performance of MCD in a vehicular environment, using packet-level network coding (PLNC) and symbol-level network coding (SLNC). However, there still lacks a fundamental understanding of the limits of MCD protocols using network coding in VANETs. In this paper, we develop a theoretical model to compute the achievable throughput of cooperative MCD in VANETs using SLNC. By considering a one-dimensional road topology with an access point (AP) as the content source, the expected achievable throughput for a vehicle at a certain distance from the AP is derived, for both using PLNC and SLNC. Our proposed model is unique since it captures the effects of multiple practical factors, including vehicle distribution and mobility pattern, channel fading and packet collisions. Through numerical results, we provide insights on optimized design choices for network coding-based cooperative MCD systems in VANETs.
KW - Achievable Throughput
KW - Mobile Content Distribution
KW - Symbol-Level Network Coding
KW - VANET
UR - http://www.scopus.com/inward/record.url?scp=84863011122&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863011122&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2012.120229
DO - 10.1109/JSAC.2012.120229
M3 - Article
AN - SCOPUS:84863011122
SN - 0733-8716
VL - 30
SP - 484
EP - 492
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 2
M1 - 6136834
ER -