基于剩余能量等级的MANET分簇算法

A clustering algorithm based on residual energy-level in MANET

摘要:

移动自组织网络具有自组织、动态拓扑、多跳通信和分布式控制等特点,可应用于小型区域战场和灾后现场的通信。然而通常由于节点能源受限,网络生存时间短暂,最大化利用现有资源是研究自组织网络的重要方向。自适应分簇算法是根据监测区域和节点位置划分网格,通过比较不同簇数下LBF值,得到最合理的分簇结构,进而以剩余能量等级最高的节点作为簇头。通过对100个节点时指定簇头、轮换簇头和自适应分簇三种算法下的网络节点生存时间和每轮节点的能量方差进行仿真,得出自适应分簇算法将网络生存时间明显延长,并平衡了簇头的负载。

Abstract:

Mobile Ad Hoc Network (MANET) has several characteristics, self-organization, dynamic topology, multi-hop communication and distributed coercion. And it can be applied in small area battlefields or post-disaster scenes. Because the energies of nodes usually are limited, the survival time of network is very short; it is an important direction of doing research to maximize the utilization of existing resources. According to the location of the monitoring areas and the nodes, the adaptive clustering algorithm divides the areas into several clusters. It is obtained that reasonable clustering structure based on the comparison of the LBF under different cluster numbers. By comparing with survival time of 100 nodes and energy variances in each round of three algorithms, it is concluded that the adaptive clustering algorithm obviously prolongs the network lifetime and balance the load of the cluster head than specified cluster head algorithm and cluster head rotation algorithm..