A Redundant Data Transmission Protocol for a Wireless Sensor Network

A. Aikebaier, T. Enokido, M. Takizawa
{"title":"A Redundant Data Transmission Protocol for a Wireless Sensor Network","authors":"A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/ICPP-W.2008.12","DOIUrl":null,"url":null,"abstract":"In a wireless sensor-actuator network (WSAN), sensor nodes deliver messages with sensed values to only nearby nodes due to weak radio. Messages are forwarded by sensor nodes to an actuator node by a routing protocol like a flooding protocol. In the redundant data transmission (RT) protocol, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. Each message carries so many number of sensed values that the message loss ratio is not increased. Even if a message with a sensed value v is lost, an actuator node can receive the value v from a message sent by another sensor node. Thus, each sensed value is redundantly carried in multiple messages. The redundancy of a sensed value is in nature increased by broadcasting the value. In order to reduce the redundancy, we take a strategy that the farther sensor nodes from an actuator node forward the fewer number of sensed values. We evaluate the RT protocol in terms of loss ratio, redundancy, and delay time of sensed values. We show that about 80% of sensed values can be delivered to an actuator node even if 95% of messages are lost due to noise and collision.","PeriodicalId":231042,"journal":{"name":"2008 International Conference on Parallel Processing - Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Parallel Processing - Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP-W.2008.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In a wireless sensor-actuator network (WSAN), sensor nodes deliver messages with sensed values to only nearby nodes due to weak radio. Messages are forwarded by sensor nodes to an actuator node by a routing protocol like a flooding protocol. In the redundant data transmission (RT) protocol, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. Each message carries so many number of sensed values that the message loss ratio is not increased. Even if a message with a sensed value v is lost, an actuator node can receive the value v from a message sent by another sensor node. Thus, each sensed value is redundantly carried in multiple messages. The redundancy of a sensed value is in nature increased by broadcasting the value. In order to reduce the redundancy, we take a strategy that the farther sensor nodes from an actuator node forward the fewer number of sensed values. We evaluate the RT protocol in terms of loss ratio, redundancy, and delay time of sensed values. We show that about 80% of sensed values can be delivered to an actuator node even if 95% of messages are lost due to noise and collision.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种无线传感器网络冗余数据传输协议
在无线传感器-执行器网络(WSAN)中,由于无线电信号较弱,传感器节点只能向附近的节点发送带有感知值的消息。消息由传感器节点通过类似泛洪协议的路由协议转发到执行器节点。在冗余数据传输(RT)协议中,传感器节点发送的消息不仅包含其感知值,还包含从其他传感器节点接收到的感知值。每条消息携带如此多的感测值,以至于消息损失率不会增加。即使具有感测值v的消息丢失,执行器节点也可以从另一个传感器节点发送的消息中接收值v。因此,每个感测值被冗余地携带在多个消息中。感知值的冗余性本质上是通过传播该值而增加的。为了减少冗余,我们采用了距离执行器节点越远的传感器节点向前发送的传感值越少的策略。我们评估RT协议的损失率,冗余和延迟时间的感知值。我们表明,即使95%的消息由于噪声和碰撞而丢失,大约80%的感测值也可以传递到执行器节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Utilizing Multi-Networks Task Scheduler for Streaming Applications An Analysis of QoS Provisioning for Sockets Direct Protocol vs. IPoIB over Modern InfiniBand Networks Automatic Performance Model Transformation from UML to C++ Iceberg: An Image Streamer for Space and Time Efficient Provisioning of Virtual Machines Scheduling Task Graphs on Heterogeneous Multiprocessors with Reconfigurable Hardware
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1