A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

M. Brandl, A. Kos, K. Kellner, C. Mayerhofer, T. Posnicek, Christian Fabian
{"title":"A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks","authors":"M. Brandl, A. Kos, K. Kellner, C. Mayerhofer, T. Posnicek, Christian Fabian","doi":"10.4018/ijwnbt.2011070104","DOIUrl":null,"url":null,"abstract":"Wireless Sensor Networks WSNs are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric Pa gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm DSR. The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node's attractiveness metric.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Wirel. Networks Broadband Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijwnbt.2011070104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

Wireless Sensor Networks WSNs are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric Pa gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm DSR. The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node's attractiveness metric.
一种基于源的无线传感器网络按需数据转发方案
无线传感器网络在医疗和环境领域的应用越来越重要。作者提出了一种按需路由协议,使用传感器吸引力-度量Pa梯度在网络内进行数据转发决策。基于吸引力的路由为无线传感器网络中以数据为中心的路由提供了一个有效的概念。该协议按需工作,是源启动的,具有扁平的层次结构,并且起源于基于信息素的路由思想。该算法支持节点到接收器的数据流量,因此是wsn中广义多跳路由算法的一种轻量级方法。利用基于多智能体的仿真环境NetLogo对所提出的协议进行了广泛的仿真,从而对协议的性能进行了评估。在仿真中比较了基于吸引力的路由算法与动态源路由算法DSR的效率。结果表明,该算法实现简单,且节点吸引力指标的权重可调,可适应不同场景,适合于易于建立的无线传感器网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信