无线传感器网络的自适应多跳路由

S. Tanessakulwattana, C. Pornavalai, G. Chakraborty
{"title":"无线传感器网络的自适应多跳路由","authors":"S. Tanessakulwattana, C. Pornavalai, G. Chakraborty","doi":"10.1109/JCSSE.2013.6567328","DOIUrl":null,"url":null,"abstract":"A large portion of energy-aware routing protocol for wireless sensor networks are cluster-based. In cluster based approach, energy at the cluster head nodes are drained more rapidly compared to other member nodes. Dynamically change cluster heads periodically could partialy mitigate this problem, but clusters that are far from base station still suffer from large amount of energy for directly transmit their cluster data back to base station. Multi-hop routing was introduced to reduce energy dissipation of cluster heads that far away from base station by relaying data through nearer cluster heads. However it may overload cluster heads that are near the base station. In this paper, we propose an adaptive multi-hop hierarchical routing approach where member nodes in cluster may send their data, based on distance information, to cluster head or to base station directly to reduce energy dissipation of cluster heads. This decision is independent at each node which makes this approach highly distributed. Simulation results show that the proposed routing protocol has longer node lifetime than the original LEACH and M-LEACH protocol.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Adaptive multi-hop routing for wireless sensor networks\",\"authors\":\"S. Tanessakulwattana, C. Pornavalai, G. Chakraborty\",\"doi\":\"10.1109/JCSSE.2013.6567328\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A large portion of energy-aware routing protocol for wireless sensor networks are cluster-based. In cluster based approach, energy at the cluster head nodes are drained more rapidly compared to other member nodes. Dynamically change cluster heads periodically could partialy mitigate this problem, but clusters that are far from base station still suffer from large amount of energy for directly transmit their cluster data back to base station. Multi-hop routing was introduced to reduce energy dissipation of cluster heads that far away from base station by relaying data through nearer cluster heads. However it may overload cluster heads that are near the base station. In this paper, we propose an adaptive multi-hop hierarchical routing approach where member nodes in cluster may send their data, based on distance information, to cluster head or to base station directly to reduce energy dissipation of cluster heads. This decision is independent at each node which makes this approach highly distributed. Simulation results show that the proposed routing protocol has longer node lifetime than the original LEACH and M-LEACH protocol.\",\"PeriodicalId\":199516,\"journal\":{\"name\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2013.6567328\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2013.6567328","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

无线传感器网络的能量感知路由协议很大一部分是基于集群的。在基于簇的方法中,簇头节点的能量消耗比其他成员节点更快。定期动态更改簇头可以在一定程度上缓解这个问题,但是远离基站的集群在直接将其集群数据传输回基站时仍然需要消耗大量的能量。为了减少远离基站的簇头的能量损耗,引入了多跳路由,通过较近的簇头中继数据。然而,它可能使靠近基站的簇头过载。本文提出了一种自适应多跳分层路由方法,集群中的成员节点可以根据距离信息将数据发送到簇头或直接发送到基站,以减少簇头的能量消耗。该决策在每个节点上是独立的,这使得该方法具有高度分布式。仿真结果表明,该路由协议比原有的LEACH和M-LEACH协议具有更长的节点生存期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adaptive multi-hop routing for wireless sensor networks
A large portion of energy-aware routing protocol for wireless sensor networks are cluster-based. In cluster based approach, energy at the cluster head nodes are drained more rapidly compared to other member nodes. Dynamically change cluster heads periodically could partialy mitigate this problem, but clusters that are far from base station still suffer from large amount of energy for directly transmit their cluster data back to base station. Multi-hop routing was introduced to reduce energy dissipation of cluster heads that far away from base station by relaying data through nearer cluster heads. However it may overload cluster heads that are near the base station. In this paper, we propose an adaptive multi-hop hierarchical routing approach where member nodes in cluster may send their data, based on distance information, to cluster head or to base station directly to reduce energy dissipation of cluster heads. This decision is independent at each node which makes this approach highly distributed. Simulation results show that the proposed routing protocol has longer node lifetime than the original LEACH and M-LEACH protocol.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信