Data Scheduling for Vehicular Ad-hoc NetworksAugmented with Road Side Units

scheme outperforms simple scheduling schemes under various circumstances. We also examined the extension of our scheme to the case of multi-item requests.

[1]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[2]  Victor C. S. Lee,et al.  RSU-based real-time data access in dynamic vehicular networks , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

[3]  Junghoon Lee,et al.  A Roadside Unit Placement Scheme for Vehicular Telematics Networks , 2010, AST/UCMA/ISA/ACN.

[4]  Ahmed Helmy,et al.  IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  B. Scheuermann,et al.  The feasibility of information dissemination in vehicular ad-hoc networks , 2007, 2007 Fourth Annual Conference on Wireless on Demand Network Systems and Services.

[6]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[7]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[8]  Hari Balakrishnan,et al.  A measurement study of vehicular internet access using in situ Wi-Fi networks , 2006, MobiCom '06.

[9]  Jing Zhao,et al.  On scheduling vehicle-roadside data access , 2007, VANET '07.

[10]  Victor C. S. Lee,et al.  Data scheduling for multi-item requests in multi-channel on-demand broadcast environments , 2008, MobiDE '08.