By Topic

Bounds on file delivery delay in an infostations system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. L. Iacono ; Wireless Inf. Network Lab., Rutgers Univ., Piscataway, NJ, USA ; C. Rose

The infostations system consists of high speed radios transmitting to very small and discontinuous cells. We investigate the problem of delivering information in a system where the data rate between the infostations and the fixed network is low compared to the radio rate. This situation is the reverse of the usual wireless network model. We approach this problem assuming that deliveries can be made selectively to infostations along a user path and derive bounds on minimum delivery delay for a variety of infostations geometries. We also provide a near-optimum (minimum delay) algorithm for file delivery

Published in:

Vehicular Technology Conference Proceedings, 2000. VTC 2000-Spring Tokyo. 2000 IEEE 51st  (Volume:3 )

Date of Conference: