Clustering Based Energy Efficient Algorithm Using Max-Heap Tree for MANET
Clustering Based Energy Efficient Algorithm Using Max-Heap Tree for MANET
复制标题
DOI：
10.1109/csnt.2014.33
复制
发表时间：
2014-04
期刊：
影响因子：
--
通讯作者：
Madhvi Saxena;Neelam Phate;K. Mathai;M. Rizvi
中科院分区：
文献类型：
--
作者：
Madhvi Saxena;Neelam Phate;K. Mathai;M. Rizvi
移动自组网（MANET）是一种由无线链路连接的移动节点组成的自配置网络。MANET中的每个设备都是动态的，可以向任何方向移动，因此会频繁地改变与其他节点的连接。能源效率和路由是该网络发展的主要障碍。本文尝试开发一种基于聚类的能量感知算法，以提高自组网的使用寿命。在这种方法中，网络被划分为小的和自管理的组，以提高网络的生存期。所提出的算法将是一种节能的聚类算法，它同时使用可扩展性和能量度量来进行聚类布局。Max-heap用于选择簇头。集群采用基于能量等级的max-heap设计，集群中能量最高的节点作为簇头。
Mobile Ad hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless links. Each device in a MANET is dynamic and can move in any direction, and will therefore change its links to other nodes frequently. Energy efficiency and routing are the main obstacles in the growth of this network. In this paper an attempt is made to develop an energy aware algorithm based on clustering for longer life of MANET. In this approach network is divided into small and self manageable groups for improving the network lifetime. The proposed algorithm would be an energy efficient clustering algorithm that uses both scalability and energy metric for cluster layout. Max-heap is used for selection of cluster head. The Clusters are designed using max-heap on the basis of energy level, the node which has the highest energy in the cluster will act as a cluster head.