Somnath Gupta, S. Anand, Mohit Kumar, Sarah Asheer, Sanjeet Kumar
{"title":"Performance evaluation of an energy efficient clustering algorithm based on heterogeneous node deployment in a wireless sensor network","authors":"Somnath Gupta, S. Anand, Mohit Kumar, Sarah Asheer, Sanjeet Kumar","doi":"10.1109/INFOCOMTECH.2018.8722421","DOIUrl":null,"url":null,"abstract":"Clustering is one of the proven technique of energy conservation in a Wireless Sensor Network. In this paper, we have proposed a Deployment Based Clustering (DBC) algorithm and its performance is compared with Low Energy Adaptive Clustering Hierarchy (LEACH). In LEACH, nodes are normally deployed in a random manner. In random deployment scenario, node deployment may be fast but holes may be present which adversely affects the performance of the network. Introducing uniform deployment can be one of the options to eliminate the holes present in network. But this can be time consuming as the nodes are deployed manually in an ordered manner for uniform distribution. So we reach a covenant between random and uniform deployment to get the benefits of both. So, we have introduced DBC, where the advanced nodes are deployed in uniform manner and the remaining nodes are deployed randomly around the advanced nodes to form several clusters. In this deployment the node density is kept uniform throughout the network. In LEACH, cluster formation is done after cluster head selection, while in DBC, cluster formation is done before cluster head selection. We have observed a significant gain in the proposed DBC performance in comparison to the LEACH protocol. The performance of DBC is examined in terms of ‘Number of Nodes Alive’ and ‘Lifetime of the Network’. The simulations show that the DBC gives 60% better performance than LEACH.","PeriodicalId":175757,"journal":{"name":"2018 Conference on Information and Communication Technology (CICT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Conference on Information and Communication Technology (CICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOMTECH.2018.8722421","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Clustering is one of the proven technique of energy conservation in a Wireless Sensor Network. In this paper, we have proposed a Deployment Based Clustering (DBC) algorithm and its performance is compared with Low Energy Adaptive Clustering Hierarchy (LEACH). In LEACH, nodes are normally deployed in a random manner. In random deployment scenario, node deployment may be fast but holes may be present which adversely affects the performance of the network. Introducing uniform deployment can be one of the options to eliminate the holes present in network. But this can be time consuming as the nodes are deployed manually in an ordered manner for uniform distribution. So we reach a covenant between random and uniform deployment to get the benefits of both. So, we have introduced DBC, where the advanced nodes are deployed in uniform manner and the remaining nodes are deployed randomly around the advanced nodes to form several clusters. In this deployment the node density is kept uniform throughout the network. In LEACH, cluster formation is done after cluster head selection, while in DBC, cluster formation is done before cluster head selection. We have observed a significant gain in the proposed DBC performance in comparison to the LEACH protocol. The performance of DBC is examined in terms of ‘Number of Nodes Alive’ and ‘Lifetime of the Network’. The simulations show that the DBC gives 60% better performance than LEACH.