期刊文献+

Unveiling the Challenges in Improving Data Availability in Vehicular Networks with Network Codingin

Unveiling the Challenges in Improving Data Availability in Vehicular Networks with Network Codingin
下载PDF
导出
摘要 Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploited and is an effective technique for diffusing in- formation over a network. The use of network coding to improve data availability in vehicular networks is explored in this paper. With random linear network codes, simple replication is avoided, and instead, a node forwards a coded block that is a random combination of all data received by the node. We use a network-coding-based approach to improve data availability in vehicular networks. To deter- mine the feasibility of this approach, we conducted an empirical study with extensive simulations based on two real vehicular GPS traces, both of which contain records from thousands of vehicles over more than a year. We observed that, despite significant improve- ment in data availability, there is a serious issue with linear correlation between the received codes. This reduces the data-retrieval success rate. By analyzing the real vehicular traces, we discovered that there is a strong community structure within a real vehicular network. We verify that such a structure contributes to the issue of linear dependence. Then, we point out opportunities to improve the network-coding-based approach by developing community-aware code-distribution techniques. Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploited and is an effective technique for diffusing in- formation over a network. The use of network coding to improve data availability in vehicular networks is explored in this paper. With random linear network codes, simple replication is avoided, and instead, a node forwards a coded block that is a random combination of all data received by the node. We use a network-coding-based approach to improve data availability in vehicular networks. To deter- mine the feasibility of this approach, we conducted an empirical study with extensive simulations based on two real vehicular GPS traces, both of which contain records from thousands of vehicles over more than a year. We observed that, despite significant improve- ment in data availability, there is a serious issue with linear correlation between the received codes. This reduces the data-retrieval success rate. By analyzing the real vehicular traces, we discovered that there is a strong community structure within a real vehicular network. We verify that such a structure contributes to the issue of linear dependence. Then, we point out opportunities to improve the network-coding-based approach by developing community-aware code-distribution techniques.
出处 《ZTE Communications》 2014年第1期26-32,共7页 中兴通讯技术(英文版)
基金 supported by China 973 Program(2014CB340303) NSFC(No.61170238,60903190) National 863 Program(2013AA01A601)
关键词 vehicular networks network coding data availability vehicular networks network coding data availability
  • 相关文献

参考文献18

  • 1S. Yousefi, M. S. Mousavi, and M. Fathy, "Vehicular ad hoc networks (VANETs): challenges and perspectives," in Proc. 6th International Conference on ITS Telecommunications, Chengdu, China, 2006, pp. 761-766. doi: 10.1109/ ITST.2006.289012.
  • 2W. Zhao, 1VI. Ammar, and E. Zegura, "A message ferrying approach for data de- livery in sparse mobile ad hoc networks," in Proc. ACMMobiHoc'04, Tokyo, Ja- pan, pp. 187-198. doi: 10.1145/989459.989483.
  • 3U. Lee, E Magistretti, M. Gerla, P. Bellavista, and A. Corradi, "Dissemination and harvesting of urban data using vehicular sensing platforms," in [EEE Trans. Veh. Teehnol., vol. 58, no. 2, pp. 882-901, Feb. 2009. doi: 10.1109/ TVT.2008.928899.
  • 4B. Hull, V. Bychkovsky, Y. Zhang, K. Chen, M. Goraczko, A. Miu, E. Shih, H.Balakrishnan, and S. Madden, "Cartel: a distributed mobile sensor computing system," in Proe. ACM SenSys' 06, Boulder, CO, USA, pp. I25- 138. doi: 10.1145/1182807.1182821.
  • 5J. Eriksson, L. Girod, B. Hull, R. Newton, S. Madden, and H. Balakrishnan, "The pothole patrol: using a mobile sensor network for road surface monitoring," in Proc. ACM MobiSys' 08, Breckenridge, CO, USA, pp. 29-39. doi: 10.1145/ 1378600.1378605.
  • 6H. Zhu, M. Li, L. Fu, G. Xue, Y. Zhu, and L. Ni, "lmpact of traffic influxes: re- vealing exponential intercontact time in urban vanets," IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 8, pp. 1258-1266, Aug. 2011. doi: 10.1109/TP- DS.2010.176.
  • 7T. Hara and S. K. Madria, "Data replication for improving data accessibility in ad hoc networks," IEEE Trans. Mobile Computing, vol. 5, no. 11, pp. 1515- 1532, Nov. 2006. doi: 10.1109/TMC.2006.165.
  • 8P. Nuggehalli, V. Srinivasan, C. Chiasserini, and Ramesh R. Rao, "Efficient cache placement in muhi-hop wireless networks," IEEE/ACM Tra. Network- ing, vol. 14, no. 5, pp. 1045-1055, Oct. 2006. doi: 10.1109fFNET.2006.882863.
  • 9E.Cohen and S. Shenker, "Replication strategies in unstructured peer-to-peer networks," in Proc. ACM SIGCOMM' 02, Pittsburgh, PA, USA, pp. 177-190. doi: 10.1145/964725.633043.
  • 10S. M. Ross, A First Course in Probability, 8th ed. New 3ersey, USA: Pearson Ed- ucation, 2010.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部