MuMHR:多路径,多跳分层路由

Mohammad Hammoudeh, A. Kurz, E. Gaura
{"title":"MuMHR:多路径,多跳分层路由","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":"{\"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}","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

摘要

本文提出了一种用于大规模分布式无线传感器网络(WSN)的自组织、基于集群的协议——多路径、多跳分层路由(MuMHR)。MuMHR通过每个节点学习多条路径和选择簇头备份节点来实现鲁棒性。通过缩短节点与其簇头之间的距离和减少设置通信开销,可以减少能量消耗。这是通过结合跳数度量和后退等待时间来实现的。仿真结果表明,MuMHR算法的性能优于LEACH算法,LEACH是目前最有前途的分层路由算法;MuMHR将设置消息的总数减少了65%,并将数据传递率提高了0.83。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MuMHR: Multi-path, Multi-hop Hierarchical Routing
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信