A. Talgini, V. Shakarami, F. Sheikholeslam, A. Chatraei
{"title":"Aerial node placement in wireless sensor networks using Fuzzy K-means clustering","authors":"A. Talgini, V. Shakarami, F. Sheikholeslam, A. Chatraei","doi":"10.1109/ECDC.2014.6836767","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks (WSN), mobility or energy constraints of nodes can lead to network partitioning. In this paper, aerial platform (AP) was used as a relay node in order to provide full connectivity to a disconnected ground WSN. Moreover, the Fuzzy K-means clustering algorithm was used to find suitable locations for placing APs so that the number of APs would be minimized. The comparison of the results of the proposed algorithm with the optimal exhaustive search algorithm characterized it as nearly optimal.","PeriodicalId":432650,"journal":{"name":"8th International Conference on e-Commerce in Developing Countries: With Focus on e-Trust","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"8th International Conference on e-Commerce in Developing Countries: With Focus on e-Trust","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECDC.2014.6836767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In wireless sensor networks (WSN), mobility or energy constraints of nodes can lead to network partitioning. In this paper, aerial platform (AP) was used as a relay node in order to provide full connectivity to a disconnected ground WSN. Moreover, the Fuzzy K-means clustering algorithm was used to find suitable locations for placing APs so that the number of APs would be minimized. The comparison of the results of the proposed algorithm with the optimal exhaustive search algorithm characterized it as nearly optimal.