摘要
基于协作传输中的最佳功率分配,提出一种修正的积累递增广播算法(MCIA),该算法允许多个节点同时传输信息到网络中的其它节点,减小广播信息所需的总发送功率.并且给出了分布式MCIA.分布式MCIA仅需要一跳范围内节点的信息,可以自适应决定协作传输节点的数目.仿真结果表明就总的发送功率而言,MCIA优于已有的广播算法.并且,分布式MCIA能够取得近似集中式MCIA的性能.
Based on the optimal power allocation in cooperative transmission, a modified cumulative increment algorithm (MCIA) was proposed. The algorithm permits multiple nodes simultaneously transmitting the message to other nodes in the networks, and can reduce the total transmission power for broadcast. Moreover, the distributed MCIA was presented. The distributed MCIA requires only 1-hop neighborhood information, and can adaptively determine the number of nodes for transmission. Simulation results show that in terms of total transmission power, MCIA can get a better performance than the existing broadcast algorithms. Furthermore, the performance of distributed MCIA is close to that of centralized MCIA.
出处
《四川大学学报(自然科学版)》
CAS
CSCD
北大核心
2011年第6期1334-1338,共5页
Journal of Sichuan University(Natural Science Edition)
基金
国家科技重大专项(2010ZX03006-002-04)
国家863项目(2009AA01Z237)
新世纪优秀人才支持计划资助项目(NCET-07-0653)
关键词
协作广播
分布式算法
最小化发送功率
cooperative broadcasting, distributed algorithm, minimizing the transmission power