ACM Home Page
Please provide us with feedback. Feedback
Delay-bounded routing in vehicular ad-hoc networks
Full text PdfPdf (852 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing table of contents
Hong Kong, Hong Kong, China
SESSION: Communication latency table of contents
Pages 341-350  
Year of Publication: 2008
ISBN:978-1-60558-073-9
Authors
Antonios Skordylis  Oxford University, Oxford, United Kingdom
Niki Trigoni  Oxford University, Oxford, United Kingdom
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 55,   Downloads (12 Months): 568,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1374618.1374664
What is a DOI?

ABSTRACT

Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising and entertainment. The multitude of vehicular applications calls for routing schemes that satisfy user-defined delay requirements while at the same time maintaining a low level of channel utilization to allow their coexistence. This paper focuses on the development of carry-and-forward schemes that attempt to deliver data from vehicles to fixed infrastructure nodes in an urban setting. The proposed algorithms leverage local or global knowledge of traffic statistics to carefully alternate between the Data Muling and Multihop Forwarding strategies, in order to minimize communication overhead while adhering to delay constraints imposed by the application. We provide an extensive evaluation of our schemes using realistic vehicular traces on a real city map.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
J. Blum, A. Eskandarian, and L. Hoffman. Challenges of inter-vehicle ad hoc networks. In IEEE Transactions on Intelligent Transportation Systems, 5(4), pages 347--351, 2004.
 
3
 
4
T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5):483--502, 2002.
5
 
6
 
7
A. Goel, K. G. Ramakrishnan, D. Kataria, and D. Logothetis. Efficient computation of delay-sensitive routes from one source to all destinations. In Conf. on Computer Communications (INFOCOM), pages 854--858, 2001.
8
 
9
J. LeBrun, C.-N. Chuah, D. Ghosal, and M. Zhang. Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks. In Vehicular Technology Conference, 2005. VTC 2005-Spring. 2005 IEEE 61st, volume 4, pages 2289--2293, May/June 2005.
10
 
11
E. Royer and C. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. In IEEE Personal Communications, 1999.
 
12
J. Singh, N. Bambos, B. Srinivasan, and D. Clawin. Wireless lan performance under varied stress conditions in vehicular traffic scenarios. In IEEE VTC Fall 2002, volume 2, pages 743--747, 2002.
 
13
A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks.
14
 
15
B. Xu, A. Ouksel, and O. Wolfson. Opportunistic resource exchange in inter-vehicle ad-hoc networks. In IEEE International Conference on Mobile Data Management (MDM), 2004.
 
16
J. Zhao and G. Cao. Vadd: Vehicle-assisted data delivery in vehicular ad hoc networks. In Conf. on Computer Communications (INFOCOM), 2006.
17


Collaborative Colleagues:
Antonios Skordylis: colleagues
Niki Trigoni: colleagues