An Optimal Power Allocation And Relay Selection Full-Duplex Store-Carry-Forward Scheme For Intermittently Connected Vehicular Networks

IEEE ACCESS(2020)

引用 4|浏览16
暂无评分
摘要
We consider intermittently connected vehicular networks (ICVNs) in which base stations (BSs) are installed along a highway to connect moving vehicles with internet. Due to the deployment cost, it is hard to cover the entire highway with BSs. To minimize the outage time in the uncovered area (UA), several store-carry-forward (SCF) schemes have been proposed in which a vehicle is selected to act as a relay by buffering data to be relayed to a target vehicle in the UA. In this paper, we propose a full-duplex (FD) SCF scheme that exploits the relay's ability to simultaneously receive and transmit in order to improve the effective communication time (ECT) with the target vehicle and accordingly deliver more data to it in the UA. The optimal power allocation (PA) that maximizes the ergodic capacities of the links is determined and the amount of data that can be buffered inside the BS coverage and can be delivered by each relay candidate to the target vehicle in the UA is found. Since the relay cannot deliver more data in the UA than what can be buffered inside the coverage, the performance of each relay candidate is limited by the minimum of the two amounts and hence is used as a relay selection (RS) criteria. To reduce the computational complexity, an alternative RS scheme that selects the relay candidate that offers the highest ECT is proposed. As compared to half-duplex SCF schemes, simulation results show that the proposed FD schemes are capable of delivering significantly higher amount of data to the target vehicle in the UA.
更多
查看译文
关键词
Relays,Resource management,Road transportation,Buffer storage,Base stations,Computational complexity,Simulation,Intermittently connected vehicular networks (ICVNs),full-duplex,store-carry-forward,outage time,relay selection,power allocation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要