检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]合肥工业大学计算机与信息学院,合肥230009 [2]合肥工业大学电气与自动化学院,合肥230009
出 处:《计算机工程与应用》2013年第17期98-102,120,共6页Computer Engineering and Applications
基 金:国家自然科学基金(No.61174186);国家国际科技合作项目(No.2011FA10440);教育部新世纪优秀人才支持计划项目(No.NCET-11-0626);教育部人文社会科学基金资助项目(No.09YJA630029);安徽高校省级自然科学研究重点项目(No.KJ2010A256;No.KJ2011A230);安徽省自然科学基金(No.090412046)
摘 要:研究了无线协作网络中的中继选择问题,允许中继具有缓存数据的能力,提出了一种带有buffer的能量有效性中继选择算法,以延长网络生命周期并提高系统吞吐量。该算法综合考虑链路信息,中继的队列状态以及节点的剩余能量信息,通过加权效用公式选择最优接收数据中继与最优发送数据中继。考虑源节点与中继节点间的功率分配,以降低因源节点到中继节点以及中继节点到目的节点间的信道速率不一致所引起的系统丢包率。仿真实验结果表明,该算法有效地延长了网络的生命周期,随着中继个数的增加网络吞吐量有明显的提高,考虑功率分配后,有效降低了系统丢包率。In this paper, the relay selection problem in the wireless cooperative networks is studied and the buffering capability of relay nodes is enabled. An energy-efficient relay select algorithm with buffer is proposed to prolong the network lifetime and the system throughput is improved. This algorithm takes into account instantaneous channel state information, remaining energy and the queuing states. The best relay for receiving and the best relay for transmitting are selected respectively by different weighting functions. The power allocation between the source node and the relay node is considered to reduce the packet loss rate caused by the difference of channel rate between source node to relay node and relay node to destination. Simulation results show that this algorithm prolongs the network lifetime efficiently and improves network throughput significantly as the number of relays increases and the packet loss rate reduces after considering the power allocation.
分 类 号:TN929[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49