DAlPaS: A performance aware congestion control algorithm in Wireless Sensor Networks

Charalambos Sergiou, V. Vassiliou
{"title":"DAlPaS: A performance aware congestion control algorithm in Wireless Sensor Networks","authors":"Charalambos Sergiou, V. Vassiliou","doi":"10.1109/CTS.2011.5898912","DOIUrl":null,"url":null,"abstract":"As Wireless Sensor Networks are evolving to applications where high load demands dominate and performance becomes a crucial factor, congestion remains a serious problem that has to be effectively and efficiently tackled. Congestion in WSNs is mitigated either by reducing the data load or by increasing capacity (employing sleep nodes). In either case due to the energy constraints and low processing capabilities of sensor nodes, congestion control and avoidance algorithms has to be kept as simple and efficient as possible while overhead must be limited. In this paper we propose a novel and simple Dynamic Alternative Path Selection Scheme (DAlPaS) attempting to face congestion by increasing capacity while attempts to maintain performance requirements. DAlPaS can efficiently and adaptively choose an alternative routing path in order to avoid congested nodes, by taking into consideration a number of critical parameters that affect the performance of a WSN while maintaining overhead in minimal levels. Simulation results show that DAlPaS algorithm can perform significant performance achievements over comparable schemes.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 18th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTS.2011.5898912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

As Wireless Sensor Networks are evolving to applications where high load demands dominate and performance becomes a crucial factor, congestion remains a serious problem that has to be effectively and efficiently tackled. Congestion in WSNs is mitigated either by reducing the data load or by increasing capacity (employing sleep nodes). In either case due to the energy constraints and low processing capabilities of sensor nodes, congestion control and avoidance algorithms has to be kept as simple and efficient as possible while overhead must be limited. In this paper we propose a novel and simple Dynamic Alternative Path Selection Scheme (DAlPaS) attempting to face congestion by increasing capacity while attempts to maintain performance requirements. DAlPaS can efficiently and adaptively choose an alternative routing path in order to avoid congested nodes, by taking into consideration a number of critical parameters that affect the performance of a WSN while maintaining overhead in minimal levels. Simulation results show that DAlPaS algorithm can perform significant performance achievements over comparable schemes.
一种性能感知的无线传感器网络拥塞控制算法
随着无线传感器网络向高负载需求主导和性能成为关键因素的应用领域发展,拥塞仍然是一个必须有效解决的严重问题。通过减少数据负载或增加容量(使用睡眠节点)来缓解wsn中的拥塞。在这两种情况下,由于能量限制和传感器节点的低处理能力,拥塞控制和避免算法必须保持尽可能简单和高效,同时必须限制开销。在本文中,我们提出了一种新颖而简单的动态替代路径选择方案(DAlPaS),试图通过增加容量来面对拥塞,同时试图保持性能要求。通过考虑影响WSN性能的一些关键参数,同时将开销保持在最低水平,dalpa可以有效地、自适应地选择替代路由路径,以避免拥塞节点。仿真结果表明,与同类方案相比,DAlPaS算法可以取得显著的性能成就。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信