A reliable optimized clustering in MANET using Ant Colony algorithm

J. John, R. Pushpalakshmi
{"title":"A reliable optimized clustering in MANET using Ant Colony algorithm","authors":"J. John, R. Pushpalakshmi","doi":"10.1109/ICCSP.2014.6949797","DOIUrl":null,"url":null,"abstract":"The mobile ad hoc networks is an attractive field to the researchers for its ease in deployment and maintenance. In this work, we focus on the optimization of energy consumption and stability of the node which has become a critical issue in ad hoc networks. Clustering of nodes is one of the significant means to extend lifetime of the network. This paper proposes Ant Colony Optimization (ACO) approach for the optimal selection of cluster heads. This algorithm optimizes communication workload, node lifetime, and mobility. The cluster structure is optimized by the defined probability function for clusters. The probability function is calculated by using the parameters such as residual energy, energy drain rate and mobility factor. Node that has the maximum value for the probability function will select as a cluster head. The overall communication workload is calculated periodically. If its value is high, then cluster head is reassigned. The advantage of this algorithm is that it can better balance the energy consumption of the nodes and increase the stability of the node. Experiment results show that our proposed work results in more energy efficient and stabilized clusters.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Communication and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSP.2014.6949797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

The mobile ad hoc networks is an attractive field to the researchers for its ease in deployment and maintenance. In this work, we focus on the optimization of energy consumption and stability of the node which has become a critical issue in ad hoc networks. Clustering of nodes is one of the significant means to extend lifetime of the network. This paper proposes Ant Colony Optimization (ACO) approach for the optimal selection of cluster heads. This algorithm optimizes communication workload, node lifetime, and mobility. The cluster structure is optimized by the defined probability function for clusters. The probability function is calculated by using the parameters such as residual energy, energy drain rate and mobility factor. Node that has the maximum value for the probability function will select as a cluster head. The overall communication workload is calculated periodically. If its value is high, then cluster head is reassigned. The advantage of this algorithm is that it can better balance the energy consumption of the nodes and increase the stability of the node. Experiment results show that our proposed work results in more energy efficient and stabilized clusters.
基于蚁群算法的MANET可靠优化聚类
移动自组织网络因其易于部署和维护而成为研究人员关注的一个领域。在这项工作中,我们重点研究了能量消耗的优化和节点的稳定性,这已经成为自组织网络中的一个关键问题。节点聚类是延长网络寿命的重要手段之一。提出了一种基于蚁群算法的簇头优化选择方法。该算法优化了通信负载、节点生存期和可移动性。利用定义的聚类概率函数对聚类结构进行优化。利用剩余能量、能量损耗率和迁移系数等参数计算概率函数。选择概率函数值最大的节点作为簇头。定时计算总体通信负载。如果它的值很高,则重新分配簇头。该算法的优点是可以更好地平衡节点的能量消耗,增加节点的稳定性。实验结果表明,我们的工作结果更加节能和稳定的集群。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信