CRAL:一种基于中心性和节能的低功耗和有损网络收集协议

B. P. Santos, L. Vieira, M. Vieira
{"title":"CRAL:一种基于中心性和节能的低功耗和有损网络收集协议","authors":"B. P. Santos, L. Vieira, M. Vieira","doi":"10.1109/SBRC.2015.28","DOIUrl":null,"url":null,"abstract":"High throughput and energy are two important constraints of the Wireless Sensor Networks (WSNs). In this paper, we present the Centrality-based Routing Aware for L2Ns (CRAL)1-Low Drop and Fast Delivery to mitigate these problems. The routing protocols are centrality-based and employ link quality estimators Expected Transmission Count (ETX) and Expected Transmission Time (ETT) to find best paths in wireless links. The suitable combinations of these techniques lead the algorithms to improve the literature results in delivery rate, energy consumption, and time to delivery data packets. CRAL does this by building routing trees with high throughput and maintains low energy consumption. The simulation results show that CRAL is more reliable, efficient in energy consumption, robust, and favoring data fusion than Centrality Tree (CT) and Shortest Paths Tree (SPT).","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CRAL: A Centrality-Based and Energy Efficient Collection Protocol for Low Power and Lossy Networks\",\"authors\":\"B. P. Santos, L. Vieira, M. Vieira\",\"doi\":\"10.1109/SBRC.2015.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"High throughput and energy are two important constraints of the Wireless Sensor Networks (WSNs). In this paper, we present the Centrality-based Routing Aware for L2Ns (CRAL)1-Low Drop and Fast Delivery to mitigate these problems. The routing protocols are centrality-based and employ link quality estimators Expected Transmission Count (ETX) and Expected Transmission Time (ETT) to find best paths in wireless links. The suitable combinations of these techniques lead the algorithms to improve the literature results in delivery rate, energy consumption, and time to delivery data packets. CRAL does this by building routing trees with high throughput and maintains low energy consumption. The simulation results show that CRAL is more reliable, efficient in energy consumption, robust, and favoring data fusion than Centrality Tree (CT) and Shortest Paths Tree (SPT).\",\"PeriodicalId\":307266,\"journal\":{\"name\":\"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBRC.2015.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBRC.2015.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

高吞吐量和高能量是无线传感器网络的两个重要制约因素。在本文中,我们提出了基于中心性的L2Ns路由感知(CRAL)1-低跌落和快速交付来缓解这些问题。路由协议是基于中心性的,使用链路质量估计器期望传输计数(ETX)和期望传输时间(ETT)来寻找无线链路中的最佳路径。这些技术的适当组合使算法在传输速率、能量消耗和传输数据包的时间方面提高了文献结果。CRAL通过构建具有高吞吐量和保持低能耗的路由树来实现这一点。仿真结果表明,与中心性树(CT)和最短路径树(SPT)相比,CRAL算法具有更高的可靠性、更低的能耗和鲁棒性,更有利于数据融合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CRAL: A Centrality-Based and Energy Efficient Collection Protocol for Low Power and Lossy Networks
High throughput and energy are two important constraints of the Wireless Sensor Networks (WSNs). In this paper, we present the Centrality-based Routing Aware for L2Ns (CRAL)1-Low Drop and Fast Delivery to mitigate these problems. The routing protocols are centrality-based and employ link quality estimators Expected Transmission Count (ETX) and Expected Transmission Time (ETT) to find best paths in wireless links. The suitable combinations of these techniques lead the algorithms to improve the literature results in delivery rate, energy consumption, and time to delivery data packets. CRAL does this by building routing trees with high throughput and maintains low energy consumption. The simulation results show that CRAL is more reliable, efficient in energy consumption, robust, and favoring data fusion than Centrality Tree (CT) and Shortest Paths Tree (SPT).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信