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

被引:55
作者
Liang, Hao [1 ]
Zhuang, Weihua [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Cellular/infostation integrated network; high-speed train; on-demand data service; resource allocation; JOBS;
D O I
10.1109/JSAC.2012.120512
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:780 / 791
页数:12
相关论文
共 21 条
  • [1] Ahmad A, 2010, PROCEEDINGS OF KNOWLEDGE MANAGEMENT 5TH INTERNATIONAL CONFERENCE 2010, P1
  • [2] [Anonymous], ZHEJIANG NEWS
  • [3] [Anonymous], 2009, PRINCIPLES SEQUENCIN, DOI DOI 10.1002/9780470451793
  • [4] Replication Routing in DTNs: A Resource Allocation Approach
    Balasubramanian, Aruna
    Levine, Brian Neil
    Venkataramani, Arun
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2010, 18 (02) : 596 - 609
  • [5] A branch and bound to minimize the number of late jobs on a single machine with release time constraints
    Baptiste, Philippe
    Peridy, Laurent
    Pinson, Eric
    [J]. European Journal of Operational Research, 2003, 144 (01): : 1 - 11
  • [6] BARUAH SK, 1994, REAL TIM SYST SYMP P, P228, DOI 10.1109/REAL.1994.342713
  • [7] Bin Chen B, 2009, IEEE INFOCOM SER, P1404, DOI 10.1109/INFCOM.2009.5062056
  • [8] Dewri R., 2008, P 11 INT C EXTENDING, P559
  • [9] Dürr C, 2010, LECT NOTES COMPUT SC, V5893, P116, DOI 10.1007/978-3-642-12450-1_11
  • [10] Information raining and optimal link-layer design for mobile hotspots
    Ho, DH
    Valaee, S
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2005, 4 (03) : 271 - 284