摘要
针对传统含入侵检测(IDS)移动Ad-Hoc网络中,簇头(CHS)及簇划分存在叶节点独立簇,导致冗余簇不利于能耗节约的问题,提出一种移动Ad-Hoc网络叶节点簇降低能源节约入侵检测算法。首先,对传统的随机簇划分方法进行分析,发现这种方式容易产生冗余划分问题,提出一种从叶节点开始进行簇划分的新方法,试图解决簇划分的冗余问题,以降低能耗;其次,针对所提方法,对算法的实现进行了研究,构建单节点消除算法,并且通过简单算例给出了簇划分过程;最后,通过在创建的实验平台中,与已有算法进行仿真对比显示,所提算法在簇划分数量上要少于对比算法30%左右,有利于提高网络使用寿命。
Some cluster heads （CHS） and clustering in traditional intrusion detection （IDS） mobile ad hoc network are independent leaf nodes clusters, which results in that redundant clusters are not conducive to energy conservation, so the leaf node cluster reduce algorithm of mobile ad-hoc network for energy saving intrusion detection is proposed to solve this problem. Firstly, the traditional method of clustering is analyzed, it is found that this method is easy to generate redundant partition problem, and a new method is then proposed to divide clusters from the leaf node, which tries to solve the redundancy problem of cluster partition to reduce energy consumption. Secondly, according to the proposed method, realization of the algorithm is studied, and the single node elimination algorithm is constructed, then the clustering process is showed through a simple example. Finally, the simulation results show that the proposed algorithm is less than 30% in the number of clusters, which is beneficial to improve the service life of the network.
出处
《控制工程》
CSCD
北大核心
2016年第7期1137-1142,共6页
Control Engineering of China
基金
国家自然科学基金(No.60873068
No.61003003)
辽宁省自然科学基金资助项目(201202089)
关键词
云组件
性能保障
副本增删
资源竞争
非线性回归
Mobile Ad-hoc
leaf node
cluster reduction
energy saving
intrusion detection
