5G蜂窝网络中有限反馈的设备到设备通信策略
需积分: 0 166 浏览量
更新于2024-09-09
收藏 1.43MB PDF 举报
"这篇ieee论文探讨了在有限的信道状态信息（CSI）反馈条件下，设备到设备（D2D）通信在5G蜂窝网络中的应用，同时考虑了可靠性和蜂窝保密中断约束。作者Faezeh Alavi、Nader Mokari Yamchi、Mohammad R. Javan和Kanapathippillai Cumanan提出了一个D2D通信场景，其中D2D用户和蜂窝用户（CUs）都处于离散功率率系统，并且接收器提供有限的反馈信息。"
在本文中，研究者们面临的主要挑战是存在一个试图窃听从基站到CUs信息传输的对手。由于D2D通信与蜂窝网络共享频谱，因此必须考虑交叉干扰问题。然而，当考虑到保密容量时，D2D通信产生的干扰可以有助于提高通信的保密性，因为它可以使窃听者困惑。
论文详细阐述了在有限反馈机制下，如何在D2D通信和蜂窝网络共存的情况下优化资源分配。这个问题被构建成一个优化问题，旨在最大化系统的整体性能，同时满足可靠性、保密性和对D2D通信造成的干扰限制。解决这个问题对于确保网络的效率和安全性至关重要。
为了实现这个目标，论文可能涉及了以下关键知识点：
1. **有限反馈策略**：在实际无线通信中，由于带宽和功率限制，从接收端到发送端的 CSI 反馈往往是有限的。这种情况下，如何有效地利用这些有限的信息来调整发射功率和编码方案是研究的重点。
2. **设备到设备（D2D）通信**：D2D通信允许设备直接相互通信，而无需通过基站，从而提高频谱效率和覆盖范围。但这也引入了与其他用户的潜在干扰问题。
3. **5G蜂窝网络**：5G网络引入了更高的数据速率和更低的延迟，对资源管理和干扰控制提出了新的挑战。D2D通信是5G中的一种关键技术，用于支持大规模连接和高效频谱利用。
4. **可靠性与保密性**：在设计通信系统时，不仅需要保证服务的可靠性，还要考虑信息传输的安全性，防止被未经授权的第三方窃听。
5. **干扰管理**：由于D2D通信与蜂窝网络共享频谱，如何有效地管理并减少D2D通信对蜂窝用户造成的干扰是优化的关键。
6. **优化问题**：资源分配问题通常被建模为一个优化问题，目的是在满足特定约束（如功率预算、保密要求等）的同时，最大化某种性能指标（如总吞吐量、安全性或公平性）。
7. **安全通信理论**：论文可能涉及了密码学、物理层安全策略以及干扰利用来增强系统保密性的方法。
8. **跨层设计**：在考虑有限反馈、功率控制和资源分配时，跨层设计方法可能被用来综合考虑网络的不同层次，以获得最佳性能。
这篇论文深入研究了在有限CSI反馈下的D2D通信优化，不仅关注通信的效率，还强调了在5G环境下通信的可靠性和安全性，这对未来移动通信网络的设计具有重要的指导意义。
8074 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 9, SEPTEMBER 2017
Finally, the performance of the proposed scheme in different
scenarios is investigated via simulations.
The paper is organized as follows. System model is described
in Section II. Limited rate f eedback schemes are proposed in
Section III. The limited rate feedback resource allocation prob-
lem is formulated and solved in Section IV. In Section V,
practical considerations, i.e., noisy feedback channel and CDI
estimation error, are investigated. Simulation and numerical re-
sults are provided in Section VI and finally conclusions are
drawn in Section VII.
II. S
YSTEM MODEL
We consider a D2D communication scenario underlaying an
existing cellular network. It is assumed the downlink transmis-
sion in the cellular network where the BS transmits information
to a cellular user while at the same time; the existing D2D pair
performs its own transmission on the same channel. Such a
scenario can be interpreted as there are many cellular users in
the network each of which is assigned to a channel over which
the BS sends information to them. Assuming this assignment is
performed based on some network parameters and is fixed, two
cellular users exploit one of the available cellular channels to
perform their information transmission directly. In this paper,
we assume that this assignment is predefined. In addition to cel-
lular user and D2D pair, we assume that there exists a malicious
user which wants to eavesdrop on the information transmission
of cellular network, i.e., from the BS to the CU. However, the
malicious user does not eavesdrop on the D2D pair. Such as-
sumption can be justified when the malicious user is not aware
of the existence of D2D pair as such sharing can be performed
opportunistically (i.e., D2D pair may or may not exist at any
time) when the malicious user is not interested in D2D pair in-
formation, or when the D2D pair applies upper layer security
measures, e.g., cryptography. In such case, the malicious user
treats the signals from D2D pair as noise.
Let h
BC
, h
BD
, h
DD
, h
DC
, h
BE
, and h
DE
denote, respectively,
the noise normalized channel power gain of the channel from
BS to CU, from BS to the receiver of D2D pair (RD2D), from
the transmitter of D2D pair (TD2D) to RD2D, from TD2D to
CU, from BS to the eavesdropper, and from the TD2D to the
eavesdropper. We assume that all channels undergo independent
block fading with Rayleigh distribution meaning that the chan-
nel power gains, i.e., h
BC
, h
BD
, h
DD
, h
DC
, h
BE
, and h
DE
,are
exponentially distributed with the mean of
¯
h
BC
,
¯
h
BD
,
¯
h
DD
,
¯
h
DC
,
¯
h
BE
, and
¯
h
DE
, respectively.
In this paper, we assume that the eavesdropper has complete
knowledge about the instantaneous channel power gains and
the CDI of the channels from BS to CU and from BS to it-
self. We further assume that the legitimate receivers, i.e., the
cellular user and the RD2D, know the CDI of all channels and
only the instantaneous channel power gains of their respective
channels. We assume that, the legitimate transmitters do not
have perfect values of channel power gains and the knowledge
of legitimate transmitters about their respective direct channel
power gains is obtained via their respective limited rate feed-
back channels. In this case, the space of h
BC
is divided into a
finite number of M regions, i.e., [0,
h
BC
(1)), [
h
BC
(1),
h
BC
(2)),
···, [
h
BC
(M − 1),
h
BC
(M)) where
h
BC
(M)=∞. Similarly,
for D2D pair, the space of h
DD
is divided into a finite num-
ber of N regions, i.e., [0,
h
DD
(1)), [
h
DD
(1),
h
DD
(2)), ···,
[
h
DD
(N − 1),
h
DD
(N)) where
h
DD
(N)=∞. The receiver, i.e.,
CU, measures the channel power gain h
BC
and feedbacks the in-
dex m if h
BC
lies in the region [
h
BC
(m),
h
BC
(m + 1)). Similarly,
RD2D measures the channel power gain h
DD
and feedbacks the
index n if h
DD
lies in the region [
h
DD
(n),
h
DD
(n + 1)).Inthis
paper, we assume that the feedback links are confidential. This
means that, the feedbacked index of the cellular network could
not be overheard by D2D pair and that of D2D pair could not be
overheard by the cellular network. In this case, the power-rate
tuples will depend only on the corresponding feedbacked index,
i.e., we have (p
BC
(m),r
BC
(m),r
BC
S
(m)) for cellular communi-
cation which are the transmit power, the transmission rate and
the secrecy rate at which BS transmits information to CU, re-
spectively. Moreover, we consider (p
DD
(n),r
DD
(n)) for D2D
communications which are the transmit power and the trans-
mission rate at which TD2D transmits information to RD2D,
respectively.
In fact, the proposed schemes operate in two phases. In the
first phase (off-line phase), several parameters that are later
used for resource allocation are computed. It is done before
the communication established and based on the CDIs of the
network’s links the optimum boundary regions and code-books
are designed by the base station. At the end of this phase, all
code-words are informed to users by BS. However, the channel
partitioning structure is kept at the CU. In the second phase
(on-line phase) that is employed during communication, the
transmitters use the parameters obtained in off-line phase. In
fact, in the on-line phase, the CU and D2D receiver measure the
related CSIs and based on them find the related channel partition
and boundary region. Then, they transmit back the index to the
base station and D2D transmitter in order to select the corre-
sponding code-word from the obtained code-book. Note that the
code-book, which contains a set of code-words, is designed off-
line and known by each node. The computational burden takes
place during the initialization (off-line) phase and requires a
negligible burden during the transmission (online) phase and
it is certainly desirable from an implementation perspective
[30]–[32]. In this paper, we consider that there is a central pro-
cessing unit and some assignments are performed in this step.
Then, the network uses the information prepared in the central
processing [33]–[35].
For the resource allocation, two approaches could be adopted.
One is to consider the problem of pairing the D2D and cellular
links as well as the designing limited feedback scheme jointly.
In this way, the outcome of the resource allocation problem is
which D2D link is paired with which cellular link as well as
code-books (power allocation and boundary regions). However,
this approach is much complex and would be computationally
prohibitive. Another approach which could lower the complex-
ity of the scheme is to consider the pairing problem and limited
rate feedback design separately. In this case, one first solves
the problem of pairing D2D and cellular link. Then, given this
剩余13页未读，继续阅读
2017-11-12 上传
2014-06-19 上传
2020-03-31 上传
2021-02-09 上传
2021-02-08 上传
2021-02-02 上传
2021-03-17 上传
2021-02-04 上传
2021-02-11 上传
futangtian0248
- 粉丝: 0
- 资源: 1
我的内容管理
展开
最新资源
- 高清艺术文字图标资源，PNG和ICO格式免费下载
- mui框架HTML5应用界面组件使用示例教程
- Vue.js开发利器：chrome-vue-devtools插件解析
- 掌握ElectronBrowserJS：打造跨平台电子应用
- 前端导师教程：构建与部署社交证明页面
- Java多线程与线程安全在断点续传中的实现
- 免Root一键卸载安卓预装应用教程
- 易语言实现高级表格滚动条完美控制技巧
- 超声波测距尺的源码实现
- 数据可视化与交互：构建易用的数据界面
- 实现Discourse外聘回复自动标记的简易插件
- 链表的头插法与尾插法实现及长度计算
- Playwright与Typescript及Mocha集成：自动化UI测试实践指南
- 128x128像素线性工具图标下载集合
- 易语言安装包程序增强版：智能导入与重复库过滤
- 利用AJAX与Spotify API在Google地图中探索世界音乐排行榜
