{"title":"一种基于蚁群算法的自适应聚类算法","authors":"Ying-Wei Chen, Xin Xia, Rongxi Wang","doi":"10.1109/GrC.2013.6740382","DOIUrl":null,"url":null,"abstract":"This paper proposes a new Ad Hoc clustering algorithm based on ant colony algorithm. The protocol has introduced the node reliability to reflect the node communication environment situation and how busy the node is. At the same time, the node reliability is one of the node pheromone factors. In the process of clustering and cluster maintenance, it elects the optimal node as cluster head to management cluster members with the guidance of the node pheromone which is cumulative and updating timely to increase the stability of the clusters formed. The clusters are based on multi-hop which can be adjusted according to the size of network. In the cluster, the cluster heads found the best route to the destination node on-demand with ant colony algorithm to reduce the burden on the cluster head and the routing overhead.","PeriodicalId":415445,"journal":{"name":"2013 IEEE International Conference on Granular Computing (GrC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An ad-hoc clustering algorithm based on ant colony algorithm\",\"authors\":\"Ying-Wei Chen, Xin Xia, Rongxi Wang\",\"doi\":\"10.1109/GrC.2013.6740382\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new Ad Hoc clustering algorithm based on ant colony algorithm. The protocol has introduced the node reliability to reflect the node communication environment situation and how busy the node is. At the same time, the node reliability is one of the node pheromone factors. In the process of clustering and cluster maintenance, it elects the optimal node as cluster head to management cluster members with the guidance of the node pheromone which is cumulative and updating timely to increase the stability of the clusters formed. The clusters are based on multi-hop which can be adjusted according to the size of network. In the cluster, the cluster heads found the best route to the destination node on-demand with ant colony algorithm to reduce the burden on the cluster head and the routing overhead.\",\"PeriodicalId\":415445,\"journal\":{\"name\":\"2013 IEEE International Conference on Granular Computing (GrC)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Granular Computing (GrC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GrC.2013.6740382\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Granular Computing (GrC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GrC.2013.6740382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An ad-hoc clustering algorithm based on ant colony algorithm
This paper proposes a new Ad Hoc clustering algorithm based on ant colony algorithm. The protocol has introduced the node reliability to reflect the node communication environment situation and how busy the node is. At the same time, the node reliability is one of the node pheromone factors. In the process of clustering and cluster maintenance, it elects the optimal node as cluster head to management cluster members with the guidance of the node pheromone which is cumulative and updating timely to increase the stability of the clusters formed. The clusters are based on multi-hop which can be adjusted according to the size of network. In the cluster, the cluster heads found the best route to the destination node on-demand with ant colony algorithm to reduce the burden on the cluster head and the routing overhead.