分布式OFDMA网络中基于Attachment-Learning的多通道分配策略
10 浏览量
更新于2024-08-27
收藏 848KB PDF 举报
本文档标题为《分布式OFDMA网络中的多通道分配：Attachment-Learning方法》(Attachment-Learning for Multi-Channel Allocation in Distributed OFDMA-Based Networks)，发表于2013年4月的IEEE Transactions on Wireless Communications第12卷第4期。随着无线技术的日益普及，无线设备密度急剧增加，这要求宽带频道能够有效地被划分为多个窄带子频道，以支持并发传输，尤其是在分布式网络环境中。传统的多通道接入方法往往依赖于高昂的协调成本，这严重影响了网络性能。
文章的核心研究集中在设计一种称为Attachment-Learning (AT-Learning) 的跨层解决方案。AT-Learning的主要目标是实现低成本且高效地在分布式OFDMA网络中进行多通道分配。OFDMA（正交频分多址）技术在此背景下尤为重要，因为它允许多个用户同时利用不同的子载波进行数据传输，提高了频谱利用率。
AT-Learning利用了干扰管理和消除技术，通过学习和适应机制来动态调整每个用户对子频道的占用。它不依赖于复杂的中心协调，而是让每个设备根据自身的通信需求、环境条件以及与其他设备的交互进行自我调整。这种自适应策略减少了协调开销，降低了时延，提高了整体网络效率。
论文可能探讨了以下关键知识点：
1. **网络环境挑战**：高密度无线网络如何影响传统的多通道分配方法，以及为何需要更高效、低成本的解决方案。
2. **分布式OFDMA架构**：分布式网络的特点，如去中心化决策、资源管理的复杂性以及对效率的需求。
3. **AT-Learning算法设计**：基于jamming and cancellation techniques的自学习过程，包括用户行为模型、子频道选择策略和性能优化指标。
4. **成本与效率平衡**：AT-Learning如何在减少协调成本的同时，保持或提高网络的整体吞吐量和数据传输质量。
5. **仿真与评估**：通过实验验证AT-Learning在实际网络环境下的效果，包括对比现有方法的性能提升、收敛速度和稳定性分析。
6. **未来方向**：对分布式OFDMA网络多通道分配的潜在改进和应用扩展，以及AT-Learning可能带来的长期影响。
这篇论文对于研究无线网络中的分布式资源管理，特别是针对OFDMA系统的多通道分配策略具有重要意义，为无线通信网络的未来设计提供了新的思考视角和实践参考。
1712 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 12, NO. 4, APRIL 2013
Attachment-Learning for Multi-Channel Allocation
in Distributed OFDMA-Based Networks
Lu Wang, Student Member, IEEE, Kaishun Wu, Member, IEEE
Mounir Hamdi, Fellow, IEEE, and Lionel M. Ni, Fellow, IEEE
Abstract—Wireless technology has become ever more popular
in recent years, which results in a higher and higher density
of wireless devices. In order to cope with this high density,
researchers are proposing the provision of multiple concurrent
transmissions by dividing a broadband channel into separate
narrow band subchannels. In particular, a fine-grained channel
access approach calls for efficient channel allocation mechanisms,
especially in distributed networks. However, most of the current
multi-channel access methods rely on costly coordination, which
significantly degrades network performance. Motivated by this,
we propose a cross layer design, termed Attachment Learning
(AT-Learning), to achieve multi-channel allocation with low cost
and high efficiency in distributed OFDMA based networks.
AT-Learning utilizes a jamming and cancellation technique to
attach identifier signals to data traffic, without degrading the
effective throughput of the original data transmission. These
identifier signals help mobile stations learn the allocation strategy
by themselves. After the learning stage, mobile stations can
achieve a TDMA-like performance, where stations will know
exactly when to transmit and on which channel without further
collisions. We conduct comprehensive simulations, comparing AT-
Learning with a traditional multi-channel access method like
Slotted ALOHA. The experimental results demonstrate that AT-
Learning can improve the throughput by up to 300% over Slotted
ALOHA.
Index Terms—Multi-channel allocation, interference cancella-
tion, game theory, OFDMA.
I. INTRODUCTION
O
VER the last two decades, wireless technologies have
witnessed explosive growth. Accordingly, wireless de-
vices have been deployed everywhere with high density,
resulting in oversubscribed wireless resources. Consequently,
it is desirable to divide the current frequency band into
smaller channels and let more than one user share a given
frequency band. Researchers have examined variations of this
paradigm, such as Frequency Division Multiplexing (FDM)
and Orthogonal Frequency Division Multiplexing (OFDM).
Among these techniques, OFDM is considered to be the most
promising choice for the provision of multiple fin e-grained
Manuscript received May 4, 2012; revised September 29 and December
10, 2012; accepted December 11, 2012. The associate editor coordinating the
review of this paper and approving it for publication was R. Mallik.
L. Wang, M. Hamdi, and L. M. Ni are with the Department of Computer
Science and Engineering, Hong Kong University of Science and Technol-
ogy, Clear Water Bay , Kowloon, Hong Kong (e-mail: {wanglu, hamdi,
ni}@ust.hk).
K. Wu is with the Guangzhou HKUST Fok Ying Tung Research Institute.
He is also with the National Engineering Research Center of Digital Life,
State-Province Joint Laboratory of Digital Home Interactive Applications, Sun
Yat-sen University, Guangzhou 510006, China (e-mail: kwinson@ust.hk).
Digital Object Identifier 10.1109/TWC.2013.022013.120627
channels, since it is able to combat inter-symbol interference
and achieving multi-user diversity gain.
Multi-channel environments such as OFDM-based systems
call for efficient channel allocation protocols. In distr ibuted
networks, there are no authorities(e.g., Access Points) to des-
ignate the channel allocation, channel allocation simply relies
on coordination among stations (cooperative) o r historical
knowledge of themselves (non-cooperative). The former retails
with a rather high overhead, and the latter has relatively
low accuracy, thus neither of them can achieve the desired
utilization. Recently, a lo t of research is focusin g on Game
Theory to solve the contention problems in d istributed multi-
channel environments [1] [2]. They formulize the multi-
channel allocation problem as different games, and try to
achieve the Nash E quilibriu m (NE) of these games. Nash
Equilibrium is a solution co ncept of a game involving two or
more players. If each player is making the best decision that
he or she can, taking into account the decisions of the others,
then they are in Nash Equilibrium. Mahonen et al. [1] propose
a simple non-cooperative scheme for multi-channel allocation
based on Minority Game, where each station maintains an
access strategy for each channel based on transmission history.
However, with limited information of other stations’strategies,
their approach cannot ensure fairness among stations. Gao
et al. [3] formalize multi-channel allocation in multi-h op
networks as a Cooperative Game. They do achieve good
NE and fairness, yet have to consume certain resource for
coordination.
Therefore, we conclude that, for a multi-channel allocation
game in distributed networks, we need a non-cooperative
scheme with an efficient NE and guaranteed fairness. To be
specific, without coordination, stations are better off learning
an efficient access strategy b y themselves. Here we adopt a
Correlated Eq uilibrium (CE) instead of NE. CE is a probability
distribution over the joint strategy profiles of the game [4]. It
assumes a correlation device for all the players, which samples
the probability distribution and recommend s an action f or each
player. When none of the players can increase its payoff by de-
viating from the recommended action, the distribution reaches
CE. Since the corr e lation device services as an authority, it
can ensure both NE and fairness. However, it is non-trivial
to achieve CE in distributed networks: first, the coordination
device is not available in distributed networks. An alternative
that serves the same purpose is required. Second, we need a
complete MAC protocol to fully utilize a corre lation signal to
achieve CE for multi-channel allocation.
1536-1276/13$31.00
c
2013 IEEE
下载后可阅读完整内容，剩余9页未读，立即下载
2022-07-14 上传
2021-05-24 上传
2021-08-11 上传
2021-02-20 上传
2022-07-14 上传
Energy-aware Adaptive Spectrum Access and Power Allocation in LAA Networks via Lyapunov Optimization
2021-02-07 上传
2021-05-10 上传
2021-02-09 上传
2021-02-10 上传
weixin_38748207
- 粉丝: 7
- 资源: 917
我的内容管理
展开
最新资源
- 黑板风格计算机毕业答辩PPT模板下载
- CodeSandbox实现ListView快速创建指南
- Node.js脚本实现WXR文件到Postgres数据库帖子导入
- 清新简约创意三角毕业论文答辩PPT模板
- DISCORD-JS-CRUD：提升 Discord 机器人开发体验
- Node.js v4.3.2版本Linux ARM64平台运行时环境发布
- SQLight：C++11编写的轻量级MySQL客户端
- 计算机专业毕业论文答辩PPT模板
- Wireshark网络抓包工具的使用与数据包解析
- Wild Match Map: JavaScript中实现通配符映射与事件绑定
- 毕业答辩利器：蝶恋花毕业设计PPT模板
- Node.js深度解析：高性能Web服务器与实时应用构建
- 掌握深度图技术：游戏开发中的绚丽应用案例
- Dart语言的HTTP扩展包功能详解
- MoonMaker: 投资组合加固神器，助力$GME投资者登月
- 计算机毕业设计答辩PPT模板下载
