本文選題：車(chē)載自組織網(wǎng)絡(luò) + 路邊基礎(chǔ)設(shè)施部署�。� 參考：《電信科學(xué)》2017年04期

【摘要】：針對(duì)目前城市場(chǎng)景下車(chē)載自組織網(wǎng)絡(luò)中的RSU部署問(wèn)題,提出了一種基于連接時(shí)長(zhǎng)的RSU部署方案。該方案在RSU數(shù)量受限的情況下,以保證通信連接時(shí)長(zhǎng)為前提,以最大化服務(wù)車(chē)輛數(shù)目為目的,將部署問(wèn)題建模成最大覆蓋問(wèn)題,設(shè)計(jì)了二進(jìn)制粒子群算法進(jìn)行求解,并結(jié)合真實(shí)的北京市路網(wǎng)地圖和出租車(chē)GPS數(shù)據(jù)進(jìn)行仿真實(shí)驗(yàn)。仿真結(jié)果表明,該算法是收斂、穩(wěn)定及可行的,相比貪心算法,該算法求得的部署方案能為更多的車(chē)輛提供持續(xù)性的網(wǎng)絡(luò)服務(wù)。
[Abstract]:Aiming at the problem of RSU deployment in vehicle-borne ad hoc networks in urban scenarios, a scheme of RSU deployment based on the length of connection time is proposed. In the case of limited RSU number, with the premise of ensuring the length of communication connection and maximizing the number of vehicles served, the deployment problem is modeled as a maximum coverage problem, and a binary particle swarm optimization algorithm is designed to solve the problem. Combined with real map of Beijing road network and GPS data of taxi, the simulation experiment is carried out. Simulation results show that the proposed algorithm is convergent, stable and feasible. Compared with greedy algorithm, the proposed deployment scheme can provide continuous network services for more vehicles.
【作者單位】： 合肥工業(yè)大學(xué)計(jì)算機(jī)與信息學(xué)院;安全關(guān)鍵工業(yè)測(cè)控技術(shù)教育部工程研究中心;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(No.61502142) 國(guó)家國(guó)際科技合作專項(xiàng)基金資助項(xiàng)目(No.2014DFB10060)~~
【分類號(hào)】：TN929.5;U495

【相似文獻(xiàn)】

相關(guān)期刊論文 前1條

1 楊成;;第二代路側(cè)單元(RSU)技術(shù)特征分析[J];中國(guó)交通信息化;2013年07期

相關(guān)碩士學(xué)位論文 前2條

1 朱利e，

本文編號(hào)：2059406