摘要
考察了接收节点通过累积信息量完成解码的单源单宿多中继无线网络,提出了一种基于动态前向解码协议的中继节点选择及传输算法.首先,给出了在给定整个网络所需传输信息量的条件下最小化信息传输时间的数学模型,并证明了其是一个完全多项式非确定性问题,进而提出了一种分布式贪婪中继节点选择算法.该算法综合考虑了被选择节点的上行和下行链路的信道增益,不仅保证了被选中节点能够容易地解码信源信息,而且使得网络终端接收到较多的有效解码信息.仿真结果表明,该算法接近集中式最优中继节点选择机制的性能,并且其分布式实现减少了系统开销.
This paper considers a wireless network with single source-destination pair and multiple potential relays,in which each node accumulates the received information to recover source information,then based on dynamic decode and for ward（DDF） protocol,a relay selection and transmission algorithm is proposed.Firstly,a corresponding mathematical problem of minimizing information＇s transmission time is exactly formulated.Moreover,it is proved to be a non-deterministic polynomial complete（NPC） problem.Secondly,a suboptimal distributed greedy algorithm is proposed,which synthetically considess the chosen relay＇s up-link and down-link gains.Not only the chosen relay is ensured to estimate the source information easily but also the network terminal is guaranteed to receive more effective decoding information.Finally,simulation results show that the proposed algorithm almost achieves the optimal network performance.Meanwhile its distributed implement decreases system overhead efficiently.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2011年第3期363-367,374,共6页
Journal of Shanghai Jiaotong University
基金
国家高技术研究发展计划(863)项目(2009AA011505)
国家自然科学基金资助项目(60872017
60832009
60872017)
关键词
动态前向解码
完全多项式非确定性问题
中继
贪婪算法
半双工
dynamic decode and forward（DDF）
non-deterministic polynomial complete（NPC） problem
relay
greedy algorithm
half-duplex
作者简介
李倩雯（1987-），女，重庆市人，硕士生，主要从事协同通信的研究．
蒋铃鸽（联系人），女，教授，博士生导师，电话（Tel）：021-34204673；Email：lgjiang@sjtu．edu．cn．
