{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:54:15Z","timestamp":1725688455469},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61671169","61571150"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Veh. Technol."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tvt.2018.2837033","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T20:53:23Z","timestamp":1526417603000},"page":"7643-7657","source":"Crossref","is-referenced-by-count":39,"title":["Optimal and Greedy Algorithms for the One-Dimensional RSU Deployment Problem With New Model"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3115-6959","authenticated-orcid":false,"given":"Zhenguo","family":"Gao","sequence":"first","affiliation":[]},{"given":"Danjie","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shaobin","family":"Cai","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0178-1246","authenticated-orcid":false,"given":"Hsiao-Chun","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90111-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2451621"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MOBHOC.2006.278570"},{"key":"ref10","first-page":"259","article-title":"An effective RSU allocation strategy for maximizing vehicular network\n connectivity","volume":"6","author":"chi","year":"2013","journal-title":"Int J Control Autom"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3076032"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-015-0667-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WAINA.2012.62"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6655586"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4888-6"},{"key":"ref16","article-title":"Geometric set cover problem","year":"2017"},{"key":"ref17","article-title":"Maximum coverage problem","year":"2017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.062512.100550"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2009.11.021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502183"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2017.05.163"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2598253"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2015.01.021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.263"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2012.6249333"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MITS.2013.2253159"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"22564","DOI":"10.3390\/s141222564","article-title":"BCDP: Budget constrained\n and delay-bounded placement for hybrid roadside units in vehicular ad hoc networks","volume":"14","author":"li","year":"2014","journal-title":"SENSORS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110113"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2014.07.022"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.061411.00019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0029-5"},{"key":"ref20","first-page":"1","article-title":"VANET connectivity analysis","author":"kafsi","year":"2008","journal-title":"Proc 1st IEEE Workshop Autom Netw Appl"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14257\/ijfgcn.2016.9.11.21"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.12988\/ces.2016.6444"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062241"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/WONS.2012.6152243"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/TMC.2011.100","article-title":"Cooperative download in vehicular environments","volume":"11","author":"oscar","year":"2012","journal-title":"IEEE Trans Mobile Comput"},{"key":"ref25","first-page":"196","article-title":"A roadside unit placement scheme for vehicular telematics networks","author":"lee","year":"0","journal-title":"Proc Adv Comput Sci Inf Technol"}],"container-title":["IEEE Transactions on Vehicular Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/25\/8434070\/08359313.pdf?arnumber=8359313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:20:34Z","timestamp":1643203234000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8359313\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":33,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tvt.2018.2837033","relation":{},"ISSN":["0018-9545","1939-9359"],"issn-type":[{"value":"0018-9545","type":"print"},{"value":"1939-9359","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}