{"id":"https://openalex.org/W1997123725","doi":"https://doi.org/10.1109/tvt.2014.2362912","title":"Optimal Scheduling for Wireless On-Demand Data Packet Delivery to High-Speed Trains","display_name":"Optimal Scheduling for Wireless On-Demand Data Packet Delivery to High-Speed Trains","publication_year":2014,"publication_date":"2014-10-14","ids":{"openalex":"https://openalex.org/W1997123725","doi":"https://doi.org/10.1109/tvt.2014.2362912","mag":"1997123725"},"language":"en","primary_location":{"id":"doi:10.1109/tvt.2014.2362912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvt.2014.2362912","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100783476","display_name":"Tianyi Chen","orcid":"https://orcid.org/0000-0003-3477-1439"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tianyi Chen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota (UMN), Minneapolis, MN, USA","Dept. of Electr. & Comput. Eng, Univ. of Minnesota, Minneapolis, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota (UMN), Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Univ. of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002477413","display_name":"Hangguan Shan","orcid":"https://orcid.org/0000-0001-6264-9858"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hangguan Shan","raw_affiliation_strings":["Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China","[Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou, China]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]},{"raw_affiliation_string":"[Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou, China]","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061028507","display_name":"Xin Wang","orcid":"https://orcid.org/0000-0001-8969-1415"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]},{"id":"https://openalex.org/I63772739","display_name":"Florida Atlantic University","ror":"https://ror.org/05p8w6387","country_code":"US","type":"education","lineage":["https://openalex.org/I63772739"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"Xin Wang","raw_affiliation_strings":["Key Laboratory for Information Science of Electromagnetic Waves (MoE), Department of Communication Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA","[Dept. of Communication Science and Engineering, Fudan University, Shanghai, China]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory for Information Science of Electromagnetic Waves (MoE), Department of Communication Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA","institution_ids":["https://openalex.org/I63772739"]},{"raw_affiliation_string":"[Dept. of Communication Science and Engineering, Fudan University, Shanghai, China]","institution_ids":["https://openalex.org/I24943067"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8791,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91413264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"64","issue":"9","first_page":"4101","last_page":"4112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7165601849555969},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5898187756538391},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5531361699104309},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.52414470911026},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5202739834785461},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5158112049102783},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.507944643497467},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.5030888915061951},{"id":"https://openalex.org/keywords/train","display_name":"Train","score":0.4779115617275238},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47555798292160034},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46258780360221863},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.46039432287216187},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4603533446788788},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4415532946586609},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4300377368927002},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2730315923690796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19179022312164307},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1679249107837677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10828769207000732},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09399884939193726}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7165601849555969},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5898187756538391},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5531361699104309},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.52414470911026},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5202739834785461},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5158112049102783},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.507944643497467},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.5030888915061951},{"id":"https://openalex.org/C190839683","wikidata":"https://www.wikidata.org/wiki/Q2448197","display_name":"Train","level":2,"score":0.4779115617275238},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47555798292160034},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46258780360221863},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.46039432287216187},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4603533446788788},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4415532946586609},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4300377368927002},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2730315923690796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19179022312164307},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1679249107837677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10828769207000732},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09399884939193726},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tvt.2014.2362912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvt.2014.2362912","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.47999998927116394,"display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G6445225954","display_name":"\u65e0\u7ebf\u5bbd\u5e26\u79fb\u52a8\u7f51\u7edc\u4e2d\u9762\u5411\u7528\u6237\u4f53\u9a8c\u4fdd\u969c\u53ca\u7528\u6237\u884c\u4e3a\u9a71\u52a8\u7684\u65f6\u9891\u8d44\u6e90\u8f6c\u6362\u673a\u5236\u7814\u7a76","funder_award_id":"61201228","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334924","display_name":"Program for New Century Excellent Talents in University","ror":"https://ror.org/01mv9t934"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1965925811","https://openalex.org/W1997595976","https://openalex.org/W2011670396","https://openalex.org/W2012483235","https://openalex.org/W2038850755","https://openalex.org/W2041645394","https://openalex.org/W2059015573","https://openalex.org/W2068056265","https://openalex.org/W2070335643","https://openalex.org/W2082715560","https://openalex.org/W2091765195","https://openalex.org/W2093645013","https://openalex.org/W2118039249","https://openalex.org/W2138531585","https://openalex.org/W2140660468","https://openalex.org/W2144213317","https://openalex.org/W2145413351","https://openalex.org/W2150219483","https://openalex.org/W2168954868","https://openalex.org/W2171255205","https://openalex.org/W6649662083","https://openalex.org/W6668048629","https://openalex.org/W6673519177","https://openalex.org/W6680169695"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W2086365412"],"abstract_inverted_index":{"In":[0],"this":[1,53,101],"paper,":[2],"we":[3,39,55,92,119],"consider":[4],"a":[5,16,22,94,122,148,179],"cellular/infostation":[6],"integrated":[7],"network":[8],"that":[9,33,45,100,128,143,175],"supports":[10],"on-demand":[11],"data":[12],"service":[13,134],"delivery":[14],"over":[15],"wireless":[17,137],"link":[18],"to":[19,37,105,192],"users":[20],"in":[21,79,111],"high-speed":[23],"train.":[24],"For":[25],"the":[26,41,49,57,80,85,89,107,116,167,177,194,197],"requests":[27,184],"with":[28,75],"different":[29],"lifetimes":[30],"and":[31,98,136,185],"prices":[32],"they":[34],"are":[35,190],"willing":[36],"pay,":[38],"develop":[40,121],"optimal":[42,109,173],"packet":[43],"schedule":[44,110,174],"aims":[46],"at":[47,161],"earning":[48],"maximum":[50],"revenue.":[51],"To":[52],"end,":[54],"formulate":[56],"problem":[58,66],"as":[59,164,166],"an":[60,171],"integer":[61],"linear":[62],"program":[63],"(ILP).":[64],"The":[65],"cannot":[67],"be":[68],"solved":[69],"efficiently":[70],"by":[71,158,170],"existing":[72],"ILP":[73],"solvers":[74],"guaranteed":[76,104],"polynomial-time":[77],"complexity":[78],"worst":[81],"case.":[82],"By":[83],"exploring":[84],"special":[86],"structure":[87],"of":[88,124,133,152,182,196],"formulated":[90],"ILP,":[91],"propose":[93],"novel":[95],"Checker":[96,126],"algorithm":[97,102],"prove":[99],"is":[103,141,160],"find":[106],"offline":[108,172],"polynomial":[112],"time.":[113],"Based":[114],"on":[115],"relevant":[117],"insights,":[118],"further":[120],"class":[123],"online":[125,145],"algorithms":[127,146],"require":[129],"only":[130],"causal":[131],"knowledge":[132,181],"demands":[135],"channel":[138,186],"capacities.":[139],"It":[140],"established":[142],"these":[144],"have":[147],"worst-case":[149],"competitive":[150],"ratio":[151],"1/2,":[153],"i.e.,":[154],"total":[155],"revenue":[156,168],"earned":[157,169],"them":[159],"least":[162],"half":[163],"much":[165],"knows":[176],"complete":[178],"priori":[180],"future":[183],"conditions.":[187],"Simulation":[188],"results":[189],"provided":[191],"demonstrate":[193],"merit":[195],"proposed":[198],"algorithms.":[199]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
