检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹一侃 解志斌[1] 王亚军 夏本琦 CAO Yikan;XIE Zhibin;WANG Yajun;XIA Benqi(Jiangsu University of Science and Technology, Zhenjiang 212000, China)
机构地区:[1]江苏科技大学,江苏镇江212000
出 处:《电信科学》2018年第5期63-71,共9页Telecommunications Science
基 金:国家自然科学基金资助项目(No.61401180;No.61371114)~~
摘 要:密集异构网络中,大量部署的低功率基站将会带来巨大的网络能耗,基站休眠算法可以有效降低网络能耗,但在算法实施过程中存在复杂度较高、准确性易受影响以及网络信令负担大等问题。为此,提出了一种适用于密集异构网络的基于非邻区关系分簇的集中式基站休眠算法。该算法首先基于非邻区关系准则,将不存在用户直接相互切换关系的低功率基站分为一簇,然后根据每簇内基站能效均值以及用户和基站的位置关系,分别设置潜在休眠基站判决机制和基站运行模式判决机制,最后所有簇依次执行簇内判决机制。仿真结果表明,该休眠算法具有良好的网络性能。A centralized base station sleeping algorithm based on non-neighbor relation clustering was proposed for dense heterogeneous networks. Firstly, based on the non-neighbor relationship criterion, the low power base stations with no direct switching relationship were clustered into several groups. Then, the low power base station running mode decision mechanism and possible base station sleeping decision mechanism was set according to the energy efficiency mean of base station in each cluster and the position relations between the users and the base station. At last, all clusters run the decision mechanism of inner cluster according to the order of the implementation of sleeping algorithm. The simulation results show that the proposed algorithm has satisfactory network performance.
关 键 词:密集异构网络 非邻区关系分簇 基站休眠 运行模式
分 类 号:TN929[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173