A New Comprehensive RSU Installation Strategy for Cost-Efficient VANET Deployment
Recently, studies on vehicular ad hoc networks (VANETs) are booming due to their huge potential. The road side unit (RSU) is a key component of the VANET infrastructure connecting mobile vehicles to the rest of the infrastructure. To maximize the availability of RSUs, RSUs should be densely deployed...
Uložené v:
| Vydané v: | IEEE transactions on vehicular technology Ročník 66; číslo 5; s. 4200 - 4211 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
IEEE
01.05.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 0018-9545, 1939-9359 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Recently, studies on vehicular ad hoc networks (VANETs) are booming due to their huge potential. The road side unit (RSU) is a key component of the VANET infrastructure connecting mobile vehicles to the rest of the infrastructure. To maximize the availability of RSUs, RSUs should be densely deployed. Otherwise, blind spots may exist in which vehicles lose the connection to the infrastructure. Unfortunately, the massive deployment of RSUs to seamlessly cover the whole area of interest, which could be a vast metropolitan, can be very expensive. As the effectiveness and the benefits of the VANET have yet to be fully proven, such large scale deployment can hardly be a currently viable option. Motivated by this observation, this paper investigates a new strategy of how to best deploy RSUs so that their spatiotemporal coverage is maximized under a limited budget. In detail, for the first time in the literature, we consider an innovative RSU deployment framework, which is a well-balanced combination of three different approaches: deploying RSUs on static locations, public mobile transportation, and fully controllable vehicles owned by the local government. We first introduce a new strategy to abstract a map of city area into a grid graph. Then, we formulate the problem as a new optimization problem and show its NP-hardness. To solve this problem, we transform this problem into another optimization problem. Then, we propose a new polynomial running time approximation algorithm for the problem and show that the performance ratio (the ratio between the quality of an output of the proposed algorithm and the quality of the best possible solution) is at least half of the best possible ratio. We also conduct simulations under various settings to study the effectiveness of the proposed approach. |
|---|---|
| AbstractList | Recently, studies on vehicular ad hoc networks (VANETs) are booming due to their huge potential. The road side unit (RSU) is a key component of the VANET infrastructure connecting mobile vehicles to the rest of the infrastructure. To maximize the availability of RSUs, RSUs should be densely deployed. Otherwise, blind spots may exist in which vehicles lose the connection to the infrastructure. Unfortunately, the massive deployment of RSUs to seamlessly cover the whole area of interest, which could be a vast metropolitan, can be very expensive. As the effectiveness and the benefits of the VANET have yet to be fully proven, such large scale deployment can hardly be a currently viable option. Motivated by this observation, this paper investigates a new strategy of how to best deploy RSUs so that their spatiotemporal coverage is maximized under a limited budget. In detail, for the first time in the literature, we consider an innovative RSU deployment framework, which is a well-balanced combination of three different approaches: deploying RSUs on static locations, public mobile transportation, and fully controllable vehicles owned by the local government. We first introduce a new strategy to abstract a map of city area into a grid graph. Then, we formulate the problem as a new optimization problem and show its NP-hardness. To solve this problem, we transform this problem into another optimization problem. Then, we propose a new polynomial running time approximation algorithm for the problem and show that the performance ratio (the ratio between the quality of an output of the proposed algorithm and the quality of the best possible solution) is at least half of the best possible ratio. We also conduct simulations under various settings to study the effectiveness of the proposed approach. |
| Author | Uma, R. N. Hussain, Rasheed Donghyun Kim Wei Wang Sejin Lee Velasco, Yesenia |
| Author_xml | – sequence: 1 surname: Donghyun Kim fullname: Donghyun Kim email: donghyun.kim@kennesaw.edu organization: Dept. of Comput. Sci., Kennesaw State Univ., Marietta, GA, USA – sequence: 2 givenname: Yesenia surname: Velasco fullname: Velasco, Yesenia email: yvelasco@eagles.nccu.edu organization: Dept. of Math. & Phys., North Carolina Central Univ., Durham, NC, USA – sequence: 3 surname: Wei Wang fullname: Wei Wang email: wang_weiw@163.com organization: Sch. of Math. & Stat., Xi'an Jiaotong Univ., Xi'an, China – sequence: 4 givenname: R. N. surname: Uma fullname: Uma, R. N. email: ruma@nccu.edu organization: Dept. of Math. & Phys., North Carolina Central Univ., Durham, NC, USA – sequence: 5 givenname: Rasheed surname: Hussain fullname: Hussain, Rasheed email: rasheed1984@gmail.com organization: Dept. of Comput. Sci., Innopolis Univ., Innopolis, Russia – sequence: 6 surname: Sejin Lee fullname: Sejin Lee email: sejiny3@kongju.ac.kr organization: Div. of Mech. & Automotive Eng., Kongju Nat. Univ., Cheonan, South Korea |
| BookMark | eNp9UE1PAjEUbAwmAno38dLE82LbbXe3R4KoJASjLFyb_XjVJcvu2hYN_94ixIMHT-9jZt7LzAD1mrYBhK4pGVFK5F26TkeM0GjEhEyYCM9Qn8pQBjIUsof6hNAkkIKLCzSwduNHziXto5cxXsAXnrTbzsA7NLb6BPy6XOFZY11W15mr2gYvnckcvO2xbo3nWhdMta6KChqH1-PFNMX30NXtfusXl-hcZ7WFq1MdotXDNJ08BfPnx9lkPA-KUMQuiJNSJjTOQRMdCSoI1zlhLCkgLwUtNKMsKin4hkjJI8pLyDQrCct5pnMRhkN0e7zbmfZjB9apTbszjX-pGI0552EouGdFR1ZhWmsNaFVU7seUt1TVihJ1iE_5-NQhPnWKzwvJH2Fnqm1m9v9Jbo6SCgB-6bFHuIe_AeQ1fC4 |
| CODEN | ITVTAB |
| CitedBy_id | crossref_primary_10_1109_JIOT_2024_3464746 crossref_primary_10_1088_1742_6596_1804_1_012104 crossref_primary_10_1109_TITS_2023_3273716 crossref_primary_10_1109_TITS_2022_3140801 crossref_primary_10_1109_TITS_2022_3199113 crossref_primary_10_1109_TMC_2023_3335853 crossref_primary_10_1109_TVT_2024_3490704 crossref_primary_10_1109_ACCESS_2021_3130125 crossref_primary_10_1109_COMST_2019_2894816 crossref_primary_10_1109_JIOT_2024_3360285 crossref_primary_10_2174_0122103279308939240712104505 crossref_primary_10_1109_ACCESS_2023_3323203 crossref_primary_10_1007_s12243_021_00851_1 crossref_primary_10_1109_TITS_2024_3373079 crossref_primary_10_1109_JIOT_2021_3055504 crossref_primary_10_1109_JIOT_2021_3122023 crossref_primary_10_1109_TITS_2020_3043351 crossref_primary_10_1007_s12083_025_02067_9 crossref_primary_10_1109_MITS_2020_3014124 crossref_primary_10_1109_TVT_2021_3138749 crossref_primary_10_1109_ACCESS_2019_2953529 crossref_primary_10_1109_JIOT_2020_2967568 crossref_primary_10_1109_TITS_2022_3205037 crossref_primary_10_1109_TITS_2023_3250320 crossref_primary_10_1109_COMST_2020_3029005 crossref_primary_10_1109_TNSE_2020_3029784 crossref_primary_10_1109_TVT_2019_2925849 crossref_primary_10_1109_ACCESS_2020_2987065 crossref_primary_10_1109_ACCESS_2020_3006255 crossref_primary_10_1109_TITS_2024_3407757 crossref_primary_10_1109_TVT_2020_3045693 crossref_primary_10_1155_2021_4207130 crossref_primary_10_1109_TMC_2018_2829517 crossref_primary_10_1109_TVT_2018_2828651 crossref_primary_10_1109_JIOT_2020_2982983 crossref_primary_10_1109_TITS_2021_3138975 crossref_primary_10_1109_JIOT_2021_3111048 crossref_primary_10_1109_TITS_2019_2938871 crossref_primary_10_1109_TNSM_2022_3202741 crossref_primary_10_1109_ACCESS_2021_3114646 crossref_primary_10_1109_TITS_2023_3315213 crossref_primary_10_1007_s42452_024_06174_9 crossref_primary_10_1109_TITS_2024_3509980 crossref_primary_10_1109_TVT_2018_2837033 crossref_primary_10_1109_TII_2018_2841056 crossref_primary_10_1109_JIOT_2021_3094903 crossref_primary_10_1109_TVT_2020_2964685 |
| Cites_doi | 10.1109/MCOM.2013.6685766 10.1109/ISCC.2012.6249333 10.1109/RNDM.2015.7325245 10.1109/ICC.2013.6655628 10.1007/BF01588971 10.1016/j.adhoc.2011.09.001 10.1109/MITS.2013.2253159 10.1109/TCOMM.2012.062512.100550 10.1109/ICCChina.2012.6356968 10.1109/ICC.2013.6655586 10.1109/ICCVE.2013.6799855 10.1109/Nets4CarsFall.2014.7000905 10.1109/GLOCOM.2014.7036802 10.1109/WiMOB.2011.6085384 10.1109/ICCNC.2016.7440590 10.1109/CCNC.2015.7157957 10.1109/CNSM.2010.5691198 10.1109/VETECF.2010.5594510 10.1109/ICCVE.2014.7297665 10.1109/VTCSpring.2014.7022815 10.1016/S0020-0190(99)00031-9 10.1016/j.physa.2008.11.021 10.1109/CCNC.2011.5766608 10.1109/WAINA.2012.62 10.4236/cn.2013.51B004 10.1109/TETC.2015.2395077 10.1109/WONS.2012.6152243 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD FR3 KR7 L7M |
| DOI | 10.1109/TVT.2016.2598253 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Engineering Research Database Civil Engineering Abstracts Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Engineering Research Database Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Civil Engineering Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1939-9359 |
| EndPage | 4211 |
| ExternalDocumentID | 10_1109_TVT_2016_2598253 7533425 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 11471005 funderid: 10.13039/501100001809 – fundername: US National Science Foundation grantid: HRD-1345219 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAIKC AAJGR AAMNW AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS RXW TAE TN5 VH1 AAYXX CITATION 7SP 8FD FR3 KR7 L7M RIG |
| ID | FETCH-LOGICAL-c357t-78d9817bef0f651504fb0228cebd51cf2126d1ecf20994614deaf2d02b4afb533 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 118 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000401339700054&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9545 |
| IngestDate | Mon Jun 30 10:12:00 EDT 2025 Tue Nov 18 21:44:03 EST 2025 Sat Nov 29 02:18:22 EST 2025 Tue Aug 26 16:43:26 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c357t-78d9817bef0f651504fb0228cebd51cf2126d1ecf20994614deaf2d02b4afb533 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-4845-9369 0000-0002-3771-7537 |
| PQID | 2174443354 |
| PQPubID | 85454 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1109_TVT_2016_2598253 proquest_journals_2174443354 ieee_primary_7533425 crossref_primary_10_1109_TVT_2016_2598253 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-05-01 |
| PublicationDateYYYYMMDD | 2017-05-01 |
| PublicationDate_xml | – month: 05 year: 2017 text: 2017-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on vehicular technology |
| PublicationTitleAbbrev | TVT |
| PublicationYear | 2017 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref35 ref13 ref34 ref12 ref15 ref36 ref31 ref30 ref33 ref32 ref10 lan (ref14) 0 ref16 ref18 (ref2) 2015 (ref1) 2015 (ref4) 2015 ref24 ref23 ref26 ref25 ref20 ref21 yang (ref37) 2013 yingsi (ref11) 0 ref28 ref27 ref29 ref8 hochbaum (ref22) 1997 kuang (ref19) 0 ref7 ref9 ref6 (ref3) 2015 ref5 kitani (ref17) 0 |
| References_xml | – ident: ref24 doi: 10.1109/MCOM.2013.6685766 – start-page: 3031 year: 0 ident: ref17 article-title: Efficient VANET-based traffic information sharing using buses on regular routes publication-title: Proc IEEE Veh Technol Conf – ident: ref9 doi: 10.1109/ISCC.2012.6249333 – year: 2015 ident: ref3 – ident: ref33 doi: 10.1109/RNDM.2015.7325245 – ident: ref28 doi: 10.1109/ICC.2013.6655628 – year: 2013 ident: ref37 article-title: A RSU deployment scheme based on hot spot in vehicular ad hoc networks publication-title: Unifying Electrical Engineering and Electronics Engineering – start-page: 1 year: 0 ident: ref11 article-title: Optimal placement and configuration of roadside units in vehicular networks publication-title: Proc 75th IEEE Veh Technol Conf – ident: ref35 doi: 10.1007/BF01588971 – ident: ref7 doi: 10.1016/j.adhoc.2011.09.001 – ident: ref8 doi: 10.1109/MITS.2013.2253159 – ident: ref10 doi: 10.1109/TCOMM.2012.062512.100550 – year: 1997 ident: ref22 publication-title: Approximation Algorithms for NP-Hard Problems – ident: ref12 doi: 10.1109/ICCChina.2012.6356968 – ident: ref16 doi: 10.1109/ICC.2013.6655586 – ident: ref15 doi: 10.1109/ICCVE.2013.6799855 – year: 2015 ident: ref2 – ident: ref32 doi: 10.1109/Nets4CarsFall.2014.7000905 – ident: ref27 doi: 10.1109/GLOCOM.2014.7036802 – ident: ref21 doi: 10.1109/WiMOB.2011.6085384 – ident: ref5 doi: 10.1109/ICCNC.2016.7440590 – ident: ref34 doi: 10.1109/CCNC.2015.7157957 – year: 2015 ident: ref1 – ident: ref20 doi: 10.1109/CNSM.2010.5691198 – start-page: 57 year: 0 ident: ref19 article-title: Bus assisted connectionless routing protocol for metropolitan VANET publication-title: Proc 5th Int Conf Genetic Evol Comput – ident: ref18 doi: 10.1109/VETECF.2010.5594510 – ident: ref29 doi: 10.1109/ICCVE.2014.7297665 – ident: ref30 doi: 10.1109/VTCSpring.2014.7022815 – ident: ref23 doi: 10.1016/S0020-0190(99)00031-9 – ident: ref25 doi: 10.1016/j.physa.2008.11.021 – ident: ref31 doi: 10.1109/CCNC.2011.5766608 – ident: ref13 doi: 10.1109/WAINA.2012.62 – ident: ref6 doi: 10.4236/cn.2013.51B004 – year: 2015 ident: ref4 – ident: ref36 doi: 10.1109/TETC.2015.2395077 – start-page: 979 year: 0 ident: ref14 article-title: On the feasibility of using public transport as data mules for traffic monitoring publication-title: Proc IEEE Intell Veh Symp – ident: ref26 doi: 10.1109/WONS.2012.6152243 |
| SSID | ssj0014491 |
| Score | 2.555261 |
| SecondaryResourceType | review_article |
| Snippet | Recently, studies on vehicular ad hoc networks (VANETs) are booming due to their huge potential. The road side unit (RSU) is a key component of the VANET... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 4200 |
| SubjectTerms | Algorithms Approximation algorithm Approximation algorithms Computer simulation graph theory Infrastructure Local government Mobile ad hoc networks Mobile communication Optimization Polynomials Public transportation road side unit (RSU) deployment Roads Run time (computers) Strategy Vehicle safety Vehicles Vehicular ad hoc networks vehicular ad hoc networks (VANETs) |
| Title | A New Comprehensive RSU Installation Strategy for Cost-Efficient VANET Deployment |
| URI | https://ieeexplore.ieee.org/document/7533425 https://www.proquest.com/docview/2174443354 |
| Volume | 66 |
| WOSCitedRecordID | wos000401339700054&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1939-9359 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014491 issn: 0018-9545 databaseCode: RIE dateStart: 19670101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4A8aAHX2hE0fTgxcSF0m23u0eiEE_EBxBuG_qKJgYMDxP_vZ2yEI3GxFsP093uzE5n2k6_D-AySQUzIlPROJUu4qmVUZY4HTnGUsekkkzpQDYhe710NMruS3C9uQtjrQ3FZ7aBzXCWb6Z6iVtlTYn3RpkoQ1nKZHVXa3NiwHnBjtfyDuzTgvWRJM2a_WEfa7iSBkO0OhF_C0GBU-XHRByiS3fvf-Pah90iiyTtldkPoGQnh7DzBVuwCg9t4icwgv4-s8-rMnXy-DQgWB6Au-doEVKA034Qn7t62fki6gRMCf8-Mmz3On1ya5ESGAdwBINup39zFxX8CZGOhVxEMjVZ2pLKOuqQ8ZxypxDuRltlREs7H7US07K-4dNE7uO0sWPHDGWKj53y33QMlcl0Yk-AGE0tzZSwVMVe0cov8pj2D5RCKWU4rUFzrdJcF-DiyHHxmodFBs1yb4QcjZAXRqjB1abH2wpY4w_ZKip9I1fouwb1tdXywvPmOS6xOI9jwU9_73UG2wxDcyharENlMVvac9jS74uX-ewi_FSff6TI9g |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB58gXrwLdZnDl4E16bZpNk9Fq0oavGxireleaEgrbRV8N-bSdOiKIK3HCa72ZmdzCSZfB_Afj0TzIhcJe1MuoRnViZ53enEMZY5JpVkSgeyCdlqZY-P-fUEHI7vwlhrQ_GZPcJmOMs3Xf2GW2VVifdGmZiEaWTOire1xmcGnEd-vJp3YZ8YjA4laV4tHgqs4qofMcSrE-m3IBRYVX5MxSG-nC7-b2RLsBDzSNIYGn4ZJmxnBea_oAuuwk2D-CmMoMf37NOwUJ3c3t0TLBDA_XO0CYnwtB_EZ69etj9ImgFVwr-PPDRazYKcWCQFxgGswf1pszg-SyKDQqJTIQeJzEye1aSyjjrkPKfcKQS80VYZUdPOx626qVnf8Iki95Ha2LZjhjLF2075b1qHqU63YzeAGE0tzZWwVKVe0cov85j2D5RCKWU4rUB1pNJSR3hxZLl4KcMyg-alN0KJRiijESpwMO7xOoTW-EN2FZU-lov6rsD2yGpl9L1-iYssztNU8M3fe-3B7FlxdVlenrcutmCOYaAOJYzbMDXovdkdmNHvg-d-bzf8YJ8j1cw_ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+New+Comprehensive+RSU+Installation+Strategy+for+Cost-Efficient+VANET+Deployment&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Kim%2C+Donghyun&rft.au=Velasco%2C+Yesenia&rft.au=Wang%2C+Wei&rft.au=Uma%2C+R.&rft.date=2017-05-01&rft.issn=0018-9545&rft.eissn=1939-9359&rft.spage=1&rft.epage=1&rft_id=info:doi/10.1109%2FTVT.2016.2598253&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TVT_2016_2598253 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9545&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9545&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9545&client=summon |