协作网络的迭代干扰消除与MapReduce方法：多用户两小区模型研究

78 浏览量更新于2024-08-26 收藏 187KB PDF 举报

本文主要探讨了协作网络中的分布式迭代干扰消除方法及其与MapReduce计算模式在解决多用户、多小区通信系统中的应用。论文发表在《信息技术与计算机科学杂志》(Journal of Information & Computational Science)第11卷第15期，于2014年10月发布，可在线访问：http://www.joics.com。在研究中，作者Qian Wan、Kai Niu和Jiaru Lin提出了一个基于嵌套格子的迭代干扰消除方案。该方案旨在有效对抗协作蜂窝网络中的小区间干扰问题。在两小区、两用户模型下，每个解码器独立解码其对应用户的信息，并将结果发送给另一个解码器用于干扰消除。通过逐步迭代的解码过程，干扰得以逐步减小。一旦一个用户的消息被成功解码，对其他接收器的干扰就能完全消除。论文的核心贡献在于理论分析了这种简化模型下的可行率区域，并给出了实现算法的步骤。对于更复杂的多小区、多用户网络，作者还提出了一个关于该方案收敛性的充分条件，这对于理解和优化大规模协作网络的性能具有重要意义。 MapReduce范式在此论文中扮演了关键角色，它提供了一种并行处理大量数据的有效框架，使得分布式网络能够在处理干扰问题时实现高效资源管理和任务分解。通过结合嵌套格子的干扰消除策略和MapReduce的并行计算特性，论文展示了如何在协作网络环境中实现复杂通信任务的分布式处理，这对于提高网络效率和用户体验具有实际价值。这篇研究论文深入探讨了协作网络中的分布式干扰管理策略，以及如何将其与MapReduce计算模型相结合，为解决无线通信系统的复杂干扰问题提供了创新的解决方案和技术支持。

Q. Wan et al. / Journal of Information & Computational Science 11:15 (2014) 5447–5457 5449

general scenario and a suﬃcient condition of convergence is derived. Due to the distributed nature

of the interference cancellation scheme, the MapReduce paradigm is obtained for remote cloud

processors.

2 System Model and Iterative Interference Cancellation

In this section, we propose an inter-cell interference cancellation scheme based on the nested

lattice for the two-cell scenario illustrated in Fig. 1 (a). First, some preliminary knowledge about

nested lattice coding is intro duced. For more details about nested lattice, [10] can be referred to.

Then, we describe the iterative interference cancellation scheme with cooperation between two

BSs.

The physical layer on the uplink is focused on. Fig. 2 shows our transmission model which con-

sists of N

= 2 users and N

= 2 corresponding BSs. Each user indep endently sends integer mes-

sages to the corresponding serving BS. The n-dimensional integer vector u

∈ {0, 1, . . . , m

− 1}

of user i ∈ {1, 2} is ﬁrstly encoded by the generator matrix M

of the ﬁne n-dimensional lattice

to obtain the unshaped lattice point c

= M

. To achieve the shaping gain, c

is rounded to

in the fundamental Voronoi cell V

of a coarse lattice Λ

nested in Λ

, i.e., Λ

is a sublattice of

Lattice

dec

Lattice

dec

Shaping

[k]

Information

exchange

−

Fig. 2: Simpliﬁed inter-cell interference model with BS cooperation

Fig. 3 shows the two-dimensional nested lattice, and the shaping region. The fundamental

Voronoi region of Λ

and Λ

are denoted by V

and V

, respectively; their corresponding volumes

are denoted by V

and V

. According to the deﬁnition of [10], the constellation C

, {Λ

} for

user i is the set of lattice points which belong to the ﬁne lattice Λ

and are contained in V

. The

second moment per dimension associated with V

is deﬁned as

) ,

∫

∥x∥

dx. (1)

The normalized second moment of Λ

is deﬁned as

G (Λ

) , σ

)/V

2/n

. (2)

As in [10], the coding rate per dimension of the nested lattice code of user i is deﬁned as

, 1/n log(V

) = 1/n log|C

| (3)

剩余10页未读，继续阅读

weixin_38645198

粉丝: 5
资源: 956

协作网络的迭代干扰消除与MapReduce方法：多用户两小区模型研究

Summingbird：Scala与分布式MapReduce的无缝整合

MRGanterPlus:分布式FCA算法实现及优化研究

Apache Spark：内存计算新范式，驱动迭代与实时应用

PageRank:Google 的 PageRank 算法在 MapReduce 范式中的实现。 Apache Hadoop、Java

MapReduce-algorithms

基于MapReduce的频繁项集挖掘方法

基于Spark GraphX构建分布式微博推荐系统

Scala与Spark实现的DBSCAN分布式集群算法

【分布式计算Join策略对比】：MapReduce vs Spark，如何选择

【分布式计算新视角】：探索MapReduce以外的数据倾斜解决方案

最新资源