{"title":"MuMHR: Multi-path, Multi-hop Hierarchical Routing","authors":"Mohammad Hammoudeh, A. Kurz, E. Gaura","doi":"10.1109/SENSORCOMM.2007.67","DOIUrl":null,"url":null,"abstract":"This paper proposes a self-organizing, cluster based protocol - multi-path, multi-hop hierarchical routing (MuMHR) - for use in large scale, distributed wireless sensor networks (WSN). With MuMHR, robustness is achieved by each node learning multiple paths and election of cluster-head backup node(s). Energy expenditure is reduced by shortening the distance between the node and its cluster-head and by reducing the setup communication overhead. This is done through incorporating the number-of-hops metric in addition to the back-off waiting time. Simulation results show that MuMHR performs better than LEACH, which is the most promising hierarchical routing algorithm to date; MuMHR reduces the total number of set-up messages by up to 65% and enhances the data delivery ratio by up to 0.83.","PeriodicalId":161788,"journal":{"name":"2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SENSORCOMM.2007.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33
Abstract
This paper proposes a self-organizing, cluster based protocol - multi-path, multi-hop hierarchical routing (MuMHR) - for use in large scale, distributed wireless sensor networks (WSN). With MuMHR, robustness is achieved by each node learning multiple paths and election of cluster-head backup node(s). Energy expenditure is reduced by shortening the distance between the node and its cluster-head and by reducing the setup communication overhead. This is done through incorporating the number-of-hops metric in addition to the back-off waiting time. Simulation results show that MuMHR performs better than LEACH, which is the most promising hierarchical routing algorithm to date; MuMHR reduces the total number of set-up messages by up to 65% and enhances the data delivery ratio by up to 0.83.