ACM Home Page
Please provide us with feedback. Feedback
An evaluation of availability latency in carrier-based wehicular ad-hoc networks
Full text PdfPdf (229 KB)
Source International Workshop on Data Engineering for Wireless and Mobile Access archive
Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access table of contents
Chicago, Illinois, USA
SESSION: Location-based access and broadcasting table of contents
Pages: 75 - 82  
Year of Publication: 2006
ISBN:1-59593-436-7
Authors
Shahram Ghandeharizadeh  University of Southern California, Los Angeles, CA
Shyam Kapadia  University of Southern California, Los Angeles, CA
Bhaskar Krishnamachari  University of Southern California, Los Angeles, CA
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 33,   Citation Count: 0
Additional Information:

abstract   references   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/1140104.1140119
What is a DOI?

ABSTRACT

On-demand delivery of audio and video clips in peer-to-peer vehicular ad-hoc networks is an emerging area of research. Our target environment uses data carriers, termed zebroids, where a mobile device carries a data item on behalf of a server to a client thereby minimizing its availability latency. In this study, we quantify the variation in availability latency with zebroids as a function of a rich set of parameters such as car density, storage per device, repository size, and replacement policies employed by zebroids. Using analysis and extensive simulations, we gain novel insights into the design of carrier-based systems. Significant improvements in latency can be obtained with zebroids at the cost of a minimal overhead. These improvements occur even in scenarios with lower accuracy in the predictions of the car routes. Two particularly surprising findings are: (1) a naive random replacement policy employed by the zebroids shows competitive performance, and (2) latency improvements obtained with a simplified instantiation of zebroids are found to be robust to changes in the popularity distribution of the data items.


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
Federal Highway Administration. Corridor simulation. Version 5.1, http://www.ops.fhwa.dot.gov/trafficanalysistools/cors im.htm.
 
2
D. Aldous and J. Fill. Reversible markov chains and random walks on graphs. Under preparation.
 
3
A. Bar-Noy, I. Kessler, and M. Sidi. Mobile Users: To Update or Not to Update. In IEEE Infocom, 1994.
 
4
J. Burgess, B. Gallagher, D. Jensen, and B. Levine. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networking. In IEEE Infocom, April 2006.
5
 
6
7
8
 
9
S. Ghandeharizadeh, S. Kapadia, and B. Krishnamachari. An Evaluation of Availability Latency in Carrier-based Vehicular Ad-hoc Networks. Technical report, Department of Computer Science, University of Southern California,CENG-2006-1, 2006.
 
10
S. Ghandeharizadeh and B. Krishnamachari. C2p2: A peer-to-peer network for on-demand automobile information services. In Globe. IEEE, 2004.
 
11
T. Hara. Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility. In IEEE Infocom, 2001.
 
12
H. Hayashi, T. Hara, and S. Nishio. A Replica Allocation Method Adapting to Topology Changes in Ad Hoc Networks. In DEXA, 2005.
 
13
P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D. Rubenstein. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet. SIGARCH Comput. Archit. News, 2002.
 
14
 
15
 
16
R. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Networks Journal, 1, September 2003.
 
17
T. Spyropoulos, K. Psounis, and C. Raghavendra. Single-Copy Routing in Intermittently Connected Mobile Networks. In SECON, April 2004.
 
18
 
19
A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Department of Computer Science, Duke University, 2000.
20
 
21
M. Zonoozi and P. Dassanayake. User Mobility Modeling and Characterization of Mobility Pattern. IEEE Journal on Selected Areas in Communications, 15:1239--1252, September 1997.

Collaborative Colleagues:
Shahram Ghandeharizadeh: colleagues
Shyam Kapadia: colleagues
Bhaskar Krishnamachari: colleagues