基于动态树冲突分解的协作随机接入方案  

Cooperative Random Access Scheme Based on Dynamic Tree Collision Resolution

作　　者：尤琛辉[1] 魏伟[2] 魏珍珍[3] 益晓新[1] 

机构地区：[1]解放军理工大学通信工程学院,南京210007 [2]南京军区通信网络技术管理中心,南京210016 [3]安徽大学电子科学与技术学院,合肥230039

出　　处：《系统仿真学报》2010年第5期1218-1221,1225,共5页Journal of System Simulation

基　　金：国家自然科学基金(60672079);江苏自然科学基金(BK2006701)

摘　　要：提出一种基于动态树冲突分解的协作随机接入方案(DTCRA)。该方案设置一个由冲突节点个数决定的信道增益门限值,若源节点与接入点间的信道增益大于该门限值,则源节点重传数据包,否则由中继节点放大转发,从而实现了动态树冲突分解,获得了多用户分集增益并降低了空时隙数量。数值与仿真结果表明,提出的方案相比于其它传统类和跨层类随机接入方案,具有更好的吞吐量、时延和能量效率性能。A novel cooperative random access scheme based on dynamic tree collision resolution （DTCRA） was proposed.This scheme sets up a threshold determined by the number of collided nodes.If the channel gain between source node and access point （AP） is bigger than this threshold,source node will resend data packets,otherwise relay nodes will amplify and forward the data packets.Therefore,dynamic tree collision resolution is carried out,multi-user diversity gain is achieved and the number of empty slots is also decreased.Numerical and simulation results indicate that the proposed scheme can outperform other conventional and cross-layer MAC random access schemes in throughput,delay and energy efficiency.

关 键 词：媒体接入控制 跨层设计 协作通信 动态树冲突分解 

分 类 号：TN911[电子电信—通信与信息系统]