Abstract
The development of vehicular ad-hoc networks has lead to several new services, such as instant messages, multi-media videos and large data transmissions. These applications have altered the pattern of data transmissions on VANETs to include larger volumes of data with different file sizes. Unstable links in vehicular networks are common due to channel fading and because of the vehicle moving, file transmissions are vulnerable to link interruption. How to utilize the limited link duration to transfer more files of different sizes successfully is a significant problem. Currently, the common practice to schedule file transmissions is a First In First Out (FIFO) mechanism defined in the DSRC (Dedicated Short Range Communication) standard. The algorithms presented in this paper show significant performance improvements. We proposed two algorithms, one based on transmission times and one based on due times. Both algorithms solve this problem by dynamically scheduling the file transmitting sequence according to selected criteria. Simulation results show that our algorithms significantly improve performance compared with FIFO mechanism for the transmission success rate and the network throughput.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ieee standard for information technology– local and metropolitan area networks– specific requirements– part 11: Wireless lan medium access control (mac) and physical layer (phy) specifications amendment 6: Wireless access in vehicular environments. IEEE Std 802.11p-2010 (Amendment to IEEE Std 802.11-2007 as amended by IEEE Std 802.11k-2008, IEEE Std 802.11r-2008, IEEE Std 802.11y-2008, IEEE Std 802.11n-2009, and IEEE Std 802.11w-2009), pp. 1–51 (2010)
Bai, F., Stancil, D.D., Krishnan, H.: Toward understanding characteristics of dedicated short range communications (dsrc) from a perspective of vehicular network engineers. In: Proceedings of the Sixteenth Annual International Conference on Mobile Computing and Networking, pp. 329–340. ACM (2010)
Briand, C., Ourari, S.: Minimizing the number of tardy jobs for the single machine scheduling problem: Mip-based lower and upper bounds. RAIRO-Operations Research 47(01), 33–46 (2013)
Castro, E., Fonseca, I.E., Kumar, A., Alencar, M.S.: A packet distribution traffic model for computer networks. In: The International Telecommunications Symposium, ITS (2010)
Cheng, L., Henty, B.E., Stancil, D.D., Bai, F., Mudalige, P.: Mobile vehicle-to-vehicle narrow-band channel measurement and characterization of the 5.9 ghz dedicated short range communication (dsrc) frequency band. IEEE Journal on Selected Areas in Communications 25(8), 1501–1516 (2007)
Hu, M., Zhong, Z., Zhu, H., Ni, M., Chang, C.Y.: Analytical modeling of link duration for vehicular ad hoc networks in urban environment. In: Proceeding of the Tenth ACM International Workshop on Vehicular Inter-networking, Systems, and Applications. pp. 61–70. ACM (2013)
Lenstra, J.K., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)
Luan, T.H., Sherman Shen, X., Bai, F.: Integrity-oriented content transmission in highway vehicular ad hoc networks. In: 2013 Proceedings IEEE INFOCOM, pp. 2562–2570. IEEE (2013)
Michael, R.G., Johnson, D.S.: Computers and intractability: A guide to the theory of np-completeness. WH Freeman & Co., San Francisco (1979)
Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15(1), 102–109 (1968)
Naboulsi, D., Fiore, M.: On the instantaneous topology of a large-scale urban vehicular network: the cologne case. In: Proceedings of the Fourteenth ACM International Symposium on Mobile Ad hoc Networking and Computing. pp. 167–176. ACM (2013)
Pustisek, M., Humar, I., Bester, J.: Empirical analysis and modeling of peer-to-peer traffic flows. In: The 14th IEEE Mediterranean Electrotechnical Conference, MELECON 2008, pp. 169–175. IEEE (2008)
Viriyasitavat, W., Bai, F., Tonguz, O.K.: Dynamics of network connectivity in urban vehicular networks. IEEE Journal on Selected Areas in Communications 29(3), 515–533 (2011)
Zhang, Y., Cao, G.: V-pada: Vehicle-platoon-aware data access in vanets. IEEE Transactions on Vehicular Technology 60(5), 2326–2339 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, C., Larson, M., Chen, Y., Fan, X. (2014). Schedule Algorithms for File Transmission in Vehicular Ad Hoc Networks. In: Cai, Z., Wang, C., Cheng, S., Wang, H., Gao, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2014. Lecture Notes in Computer Science, vol 8491. Springer, Cham. https://doi.org/10.1007/978-3-319-07782-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-07782-6_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07781-9
Online ISBN: 978-3-319-07782-6
eBook Packages: Computer ScienceComputer Science (R0)