By Topic

Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks

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)
Hao Liang ; Department of Electrical and Computer Engineering, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, Canada N2L 3G1 ; Weihua Zhuang

In this paper, we investigate on-demand data services for high-speed trains via a cellular/infostation integrated network. Service requests and acknowledgements are sent through the cellular network to a content server, while data delivery is achieved via trackside infostations. The optimal resource allocation problem is formulated by taking account of the intermittent network connectivity and multi-service demands. In order to achieve efficient resource allocation with low computational complexity, the original problem is transformed into a single-machine preemptive scheduling problem based on a time-capacity mapping. As the service demands are not known a priori, an online resource allocation algorithm based on Smith ratio and exponential capacity is proposed. The performance bound of the online algorithm is characterized based on the theory of sequencing and scheduling. If the link from the backbone network to an infostation is a bottleneck, a service pre-downloading algorithm is also proposed to facilitate the resource allocation. The performance of the proposed algorithms is evaluated based on a real high-speed train schedule. Compared with the existing approaches, our proposed algorithms can significantly improve the quality of on-demand data service provisioning over the trip of a train.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:30 ,  Issue: 4 )