城市环境车联网中基于近似算法的RSU部署方案

TP393; 为了使用尽可能少的RSU实现对目标区域的有效覆盖,设计c街道模型,将对区域的覆盖转化为对区域内街道的覆盖,然后,在该模型下提出基于贪心策略的多项式(GBP,greedy-based polynomial)时间近似算法,得到RSU的部署方案以解决覆盖问题.针对城市中一些地形复杂的区域,设计Cue模型(complex urban environment model),将目标区域划分为子区域,然后提出基于shifting策略的多项式时间近似算法,并对算法的近似比率和时间复杂度进行了理论分析与证明.仿真结果表明,算法GBP能够有效地解决城市环境车联网中的区域覆盖问题....

Full description

Saved in:
Bibliographic Details
Published in通信学报 Vol. 39; no. 1; pp. 78 - 89
Main Authors 朱钧宇, 黄传河, 范茜莹, 覃匡宇, 付斌
Format Journal Article
LanguageChinese
Published 武汉大学计算机学院,湖北武汉,430072%美国得克萨斯里奥格兰德河谷大学,得克萨斯爱丁堡78539 25.01.2018
Subjects
Online AccessGet full text
ISSN1000-436X
DOI10.11959/j.issn.1000-436x.2018008

Cover

Abstract TP393; 为了使用尽可能少的RSU实现对目标区域的有效覆盖,设计c街道模型,将对区域的覆盖转化为对区域内街道的覆盖,然后,在该模型下提出基于贪心策略的多项式(GBP,greedy-based polynomial)时间近似算法,得到RSU的部署方案以解决覆盖问题.针对城市中一些地形复杂的区域,设计Cue模型(complex urban environment model),将目标区域划分为子区域,然后提出基于shifting策略的多项式时间近似算法,并对算法的近似比率和时间复杂度进行了理论分析与证明.仿真结果表明,算法GBP能够有效地解决城市环境车联网中的区域覆盖问题.
AbstractList TP393; 为了使用尽可能少的RSU实现对目标区域的有效覆盖,设计c街道模型,将对区域的覆盖转化为对区域内街道的覆盖,然后,在该模型下提出基于贪心策略的多项式(GBP,greedy-based polynomial)时间近似算法,得到RSU的部署方案以解决覆盖问题.针对城市中一些地形复杂的区域,设计Cue模型(complex urban environment model),将目标区域划分为子区域,然后提出基于shifting策略的多项式时间近似算法,并对算法的近似比率和时间复杂度进行了理论分析与证明.仿真结果表明,算法GBP能够有效地解决城市环境车联网中的区域覆盖问题.
Abstract_FL To minimize the number of RSU deployed to cover a specific area,a c street model transforming the area covering problem to streets covering problem was designed,and a greedy-based polynomial (GBP) time approximation algorithm was developed to obtain the optimal RSU deployment for area coverage.For complex urban environments,a Cue model (complex urban environments model) was proposed.In this model,the target area was divided into different partitions.Then,based on shifting strategy,a polynomial time approximation scheme was designed.Theoretical analysis that include the approximation ratio and time complexity of the proposed algorithm were also presented.Simulation results show that GBP can efficiently solve the coverage problem in urban VANET.
Author 黄传河
朱钧宇
范茜莹
付斌
覃匡宇
AuthorAffiliation 武汉大学计算机学院,湖北武汉,430072%美国得克萨斯里奥格兰德河谷大学,得克萨斯爱丁堡78539
AuthorAffiliation_xml – name: 武汉大学计算机学院,湖北武汉,430072%美国得克萨斯里奥格兰德河谷大学,得克萨斯爱丁堡78539
Author_FL QIN Kuangyu
HUANG Chuanhe
ZHU Junyu
FAN Xiying
FU Bin
Author_FL_xml – sequence: 1
  fullname: ZHU Junyu
– sequence: 2
  fullname: HUANG Chuanhe
– sequence: 3
  fullname: FAN Xiying
– sequence: 4
  fullname: QIN Kuangyu
– sequence: 5
  fullname: FU Bin
Author_xml – sequence: 1
  fullname: 朱钧宇
– sequence: 2
  fullname: 黄传河
– sequence: 3
  fullname: 范茜莹
– sequence: 4
  fullname: 覃匡宇
– sequence: 5
  fullname: 付斌
BookMark eNrjYmDJy89LZWBQNDTQMzS0NLXUz9LLLC7O0zM0MDDQNTE2q9AzMjC0MDCwYGHghIlFcDDwFhdnJhmYGhqbmxkYG3Iy2Dyd3_d0R9PzvvVPFzW_2LvsReOU53snPtmx9un8XU929b3YP_HJnj3P101_tnnq81ktQcGhL5tXPN-76dm0nc8WdvAwsKYl5hSn8kJpboZQN9cQZw9dH393T2dHH91kQyNzC92U1FSLRPMkIGloaGRsbGZgmpKYYploZm6ZapZmmGJubpBmnGiWlGJglmJoaGJsaGBunmJsaWpgaWxiYZmUlmzMzaAKMbc8MS8tMS89Piu_tCgPaGN8SUVFEtifQC9aGAMAXQJhiQ
ClassificationCodes TP393
ContentType Journal Article
Copyright Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
Copyright_xml – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
DBID 2B.
4A8
92I
93N
PSX
TCJ
DOI 10.11959/j.issn.1000-436x.2018008
DatabaseName Wanfang Data Journals - Hong Kong
WANFANG Data Centre
Wanfang Data Journals
万方数据期刊 - 香港版
China Online Journals (COJ)
China Online Journals (COJ)
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
DocumentTitle_FL RSU deployment planning based on approximation algorithm in urban VANET
EndPage 89
ExternalDocumentID txxb201801008
GrantInformation_xml – fundername: 国家自然科学基金资助项目; 美国国家科学基金会基金资助项目(No.0845376)The National Natural Science Foundation of China; The National Science Foundation Early Career Award of USA
  funderid: (61772385,61373040,61572370); (61772385,61373040,61572370); (0845376)
GroupedDBID -0Y
2B.
4A8
92I
93N
ALMA_UNASSIGNED_HOLDINGS
CCEZO
CUBFJ
GROUPED_DOAJ
PSX
TCJ
ID FETCH-LOGICAL-c1278-dee8a7bee811233605dad9a679e6f1d770f3a6bd06d11431077d395093489bfc3
ISSN 1000-436X
IngestDate Thu May 29 04:00:48 EDT 2025
IsPeerReviewed false
IsScholarly true
Issue 1
Keywords covering problem
近似算法
RSU部署
RSU deployment
区域覆盖
VANET
approximation algorithm
车联网
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c1278-dee8a7bee811233605dad9a679e6f1d770f3a6bd06d11431077d395093489bfc3
PageCount 12
ParticipantIDs wanfang_journals_txxb201801008
PublicationCentury 2000
PublicationDate 2018-01-25
PublicationDateYYYYMMDD 2018-01-25
PublicationDate_xml – month: 01
  year: 2018
  text: 2018-01-25
  day: 25
PublicationDecade 2010
PublicationTitle 通信学报
PublicationTitle_FL Journal on Communications
PublicationYear 2018
Publisher 武汉大学计算机学院,湖北武汉,430072%美国得克萨斯里奥格兰德河谷大学,得克萨斯爱丁堡78539
Publisher_xml – name: 武汉大学计算机学院,湖北武汉,430072%美国得克萨斯里奥格兰德河谷大学,得克萨斯爱丁堡78539
SSID ssib051376031
ssj0002912165
ssib058759023
ssib001102965
ssib023646527
ssib023168036
ssib036439991
ssib050281523
ssib000968473
Score 2.2403708
Snippet TP393; 为了使用尽可能少的RSU实现对目标区域的有效覆盖,设计c街道模型,将对区域的覆盖转化为对区域内街道的覆盖,然后,在该模型下提出基于贪心策略的多项...
SourceID wanfang
SourceType Aggregation Database
StartPage 78
Title 城市环境车联网中基于近似算法的RSU部署方案
URI https://d.wanfangdata.com.cn/periodical/txxb201801008
Volume 39
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  issn: 1000-436X
  databaseCode: M~E
  dateStart: 19800101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: true
  ssIdentifier: ssib058759023
  providerName: ISSN International Centre
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LaxRBEB5CBPEiiorPEME-bpzu6Z7uAi8zm1mCEA-aQG5hdx56WkE3EHIQNB48BQI-wEvQg3hRQS8xZPHPZLPxX1jV81QjRmEYenq-rkdX01010w_Hueb6cRJ7sWxBErstKTBmNV6atKRJMxwxum5q13HP3_LnFuXNJbU0MdluzFpaGfRm4rVD15X8j1UxD-1Kq2T_wbIVUczANNoX72hhvB_JxixSDDrMRJQIDTOCRZoegw7lBIIZj0WGhbMs8ClhOANJGMwBziJJpYLZgk4Y2JzAEsRSnRLTpgtLBREDzSKfhR4DRTmAYHn7ziKLgHgFpiAeCoIBIoESAWf5sXqlH2zxLhUn-h0CkMC5nD4zAQtU2RYsJRSBUyEQLNAWG7F6DKU3YYiiFOIGrpVSoKA1BNVvFxWCCaRIiQglbEKQP0EUQQqhKkbFxxFO8_Ja-UJq25ythqXoKKYBW06Wkpa1j5SIZKMeSa2ggUH9gMwm2pYUUA3msuT4X7iItvRoU3YmrDHCqGgKEJINqE3kjJACXiHJAK41krUNtRI0gyb6JIO9iItr7W1LhW5BJ9RVldrG4dqc39QU7aPxRabGmtQ2QZPXNGK4Rs8OGkMl7UkgPXsOZTWW1oCqz8gHxvycptLFgsMHb1BgR2-iP1PSX6X5lxjWmNpjqeaRDlZXe_Yttwv-jwnt-3SMyfyjqBmjowfWXDzuCqh_7Qs6uQ3duPrZl74SlU_ukcsO9YZSCh1y9HkreorTtLL6V7oymnZE8qoPvQK44PZI26rGjjtXS32v_0lbu4iwn3X7dxv-7sIp52QRqE4Hea9z2plYu3fGuTHa2hhtPxlvfBq9XT8Yvjt4_Hw83Nzb_jDa2tnb2Tj4trm3uzv--Gr_y4vx66fYL3xffz8eft5_-XX_zbOzzmInWmjPtYrzV1oxF9q0kjQ1Xd3DOwZlnue7Kukm0PU1pH7GE63dzOv6vcT1E45hF3e1TjzACMSTBnpZ7J1zJvv3--l5Z1plJhZZrBTEiUxkanqgdGwyDknCpVQXnKlC2-Wif324_JNxL_4NcMk5UXcAl53JwYOV9ArGC4PelG0PPwAElsQM
linkProvider ISSN International Centre
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=%E5%9F%8E%E5%B8%82%E7%8E%AF%E5%A2%83%E8%BD%A6%E8%81%94%E7%BD%91%E4%B8%AD%E5%9F%BA%E4%BA%8E%E8%BF%91%E4%BC%BC%E7%AE%97%E6%B3%95%E7%9A%84RSU%E9%83%A8%E7%BD%B2%E6%96%B9%E6%A1%88&rft.jtitle=%E9%80%9A%E4%BF%A1%E5%AD%A6%E6%8A%A5&rft.au=%E6%9C%B1%E9%92%A7%E5%AE%87&rft.au=%E9%BB%84%E4%BC%A0%E6%B2%B3&rft.au=%E8%8C%83%E8%8C%9C%E8%8E%B9&rft.au=%E8%A6%83%E5%8C%A1%E5%AE%87&rft.date=2018-01-25&rft.pub=%E6%AD%A6%E6%B1%89%E5%A4%A7%E5%AD%A6%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%AD%A6%E9%99%A2%2C%E6%B9%96%E5%8C%97%E6%AD%A6%E6%B1%89%2C430072%25%E7%BE%8E%E5%9B%BD%E5%BE%97%E5%85%8B%E8%90%A8%E6%96%AF%E9%87%8C%E5%A5%A5%E6%A0%BC%E5%85%B0%E5%BE%B7%E6%B2%B3%E8%B0%B7%E5%A4%A7%E5%AD%A6%2C%E5%BE%97%E5%85%8B%E8%90%A8%E6%96%AF%E7%88%B1%E4%B8%81%E5%A0%A178539&rft.issn=1000-436X&rft.volume=39&rft.issue=1&rft.spage=78&rft.epage=89&rft_id=info:doi/10.11959%2Fj.issn.1000-436x.2018008&rft.externalDocID=txxb201801008
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Ftxxb%2Ftxxb.jpg