{"title":"High Coverage of Connected Nodes routing protocol with reduced power consumption for multi-hop Wireless Sensor Network","authors":"Wassim Jerbi, Abderrahmen Guermazi, H. Trabelsi","doi":"10.1145/3293614.3293645","DOIUrl":null,"url":null,"abstract":"The Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is known as a pioneering protocol for distributed clustering. It is based on a probabilistic calculation to select cluster head. Successive LEACH protocols have involved other parameters for the selection of cluster head, such as residual energy, location, signal strength ... However, most of these protocols do not guarantee full coverage network for all cycles. Indeed, in some cycles, cluster head may be concentrated in a portion of the monitored area, some common nodes fail to reach a cluster head. They are considered orphans nodes in the network. After 100 rounds, the first dead nodes are the sensors of the clusters of low density. The major contribution of this article is to propose a solution to join the orphan nodes to the closest clusters and consequently to have a high connectivity rate of the nodes. The work in this thesis resulted in the design and development of a new distributed clustering protocol called high coverage of connected nodes (HCCN-multihop), that significantly improves connectivity of nodes in multi-hop routing protocol for wireless sensor networks. The HCCN-multihop protocol is based on the development of two scenarios. In the first scenario, a member of the cluster High density who has a minimal distance (dmin) plays the role of a Gateway allowing the joining of the sensors of low density nodes and collects their data (CH that has the shortest distance to a member of a cluster). In the second scenarios, join a single node in a cluster with a member of the neighboring cluster.","PeriodicalId":359590,"journal":{"name":"Proceedings of the Euro American Conference on Telematics and Information Systems","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Euro American Conference on Telematics and Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3293614.3293645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is known as a pioneering protocol for distributed clustering. It is based on a probabilistic calculation to select cluster head. Successive LEACH protocols have involved other parameters for the selection of cluster head, such as residual energy, location, signal strength ... However, most of these protocols do not guarantee full coverage network for all cycles. Indeed, in some cycles, cluster head may be concentrated in a portion of the monitored area, some common nodes fail to reach a cluster head. They are considered orphans nodes in the network. After 100 rounds, the first dead nodes are the sensors of the clusters of low density. The major contribution of this article is to propose a solution to join the orphan nodes to the closest clusters and consequently to have a high connectivity rate of the nodes. The work in this thesis resulted in the design and development of a new distributed clustering protocol called high coverage of connected nodes (HCCN-multihop), that significantly improves connectivity of nodes in multi-hop routing protocol for wireless sensor networks. The HCCN-multihop protocol is based on the development of two scenarios. In the first scenario, a member of the cluster High density who has a minimal distance (dmin) plays the role of a Gateway allowing the joining of the sensors of low density nodes and collects their data (CH that has the shortest distance to a member of a cluster). In the second scenarios, join a single node in a cluster with a member of the neighboring cluster.