Reliable navigation of mobile sensors in wireless sensor networks without localization service

Qingjun Xiao, Bin Xiao, Jiaqing Luo, Guobin Liu
{"title":"Reliable navigation of mobile sensors in wireless sensor networks without localization service","authors":"Qingjun Xiao, Bin Xiao, Jiaqing Luo, Guobin Liu","doi":"10.1109/IWQoS.2009.5201398","DOIUrl":null,"url":null,"abstract":"This paper deals with the problem of guiding mobile sensors (or robots) to a phenomenon across a region covered by static sensors. We present a distributed, reliable and energy-efficient algorithm to construct a smoothed moving trajectory for a mobile robot. The reliable trajectory is realized by first constructing among static sensors a distributed hop count based artificial potential field (DH-APF) with only one local minimum near the phenomenon, and then navigating the robot to that minimum by an attractive force following the reversed gradient of the constructed field. Besides the attractive force towards the phenomenon, our algorithm adopts an additional repulsive force to push the robot away from obstacles, exploiting the fast sensing devices carried by the robot. Compared with previous navigation algorithms that guide the robot along a planned path, our algorithm can (1) tolerate the potential deviation from a planned path, since the DH-APF covers the entire deployment region; (2) mitigate the trajectory oscillation problem; (3) avoid the potential collision with obstacles; (4) save the precious energy of static sensors by configuring a large moving step size, which is not possible for algorithms neglecting the issue of navigation reliability. Our theoretical analysis of the above features considers practical sensor network issues including radio irregularity, packet loss and radio conflict. We implement the proposed algorithm over TinyOS and test its performance on the simulation platform with a high fidelity provided by TOSSIM and Tython. Simulation results verify the reliability and energy efficiency of the proposed mobile sensor navigation algorithm.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 17th International Workshop on Quality of Service","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS.2009.5201398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

This paper deals with the problem of guiding mobile sensors (or robots) to a phenomenon across a region covered by static sensors. We present a distributed, reliable and energy-efficient algorithm to construct a smoothed moving trajectory for a mobile robot. The reliable trajectory is realized by first constructing among static sensors a distributed hop count based artificial potential field (DH-APF) with only one local minimum near the phenomenon, and then navigating the robot to that minimum by an attractive force following the reversed gradient of the constructed field. Besides the attractive force towards the phenomenon, our algorithm adopts an additional repulsive force to push the robot away from obstacles, exploiting the fast sensing devices carried by the robot. Compared with previous navigation algorithms that guide the robot along a planned path, our algorithm can (1) tolerate the potential deviation from a planned path, since the DH-APF covers the entire deployment region; (2) mitigate the trajectory oscillation problem; (3) avoid the potential collision with obstacles; (4) save the precious energy of static sensors by configuring a large moving step size, which is not possible for algorithms neglecting the issue of navigation reliability. Our theoretical analysis of the above features considers practical sensor network issues including radio irregularity, packet loss and radio conflict. We implement the proposed algorithm over TinyOS and test its performance on the simulation platform with a high fidelity provided by TOSSIM and Tython. Simulation results verify the reliability and energy efficiency of the proposed mobile sensor navigation algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无定位服务无线传感器网络中移动传感器的可靠导航
本文讨论的问题是如何引导移动传感器(或机器人)跨越静态传感器覆盖的区域到达一种现象。提出了一种分布式、可靠、节能的移动机器人平滑运动轨迹构造算法。该方法首先在静态传感器之间构建一个基于分布式跳数的人工势场(DH-APF),该势场在现象附近只有一个局部最小值,然后利用引力沿着所构建的场的反向梯度将机器人导航到该最小值。除了对该现象的吸引力外,我们的算法还利用机器人携带的快速传感装置,采用额外的排斥力将机器人推离障碍物。与以往引导机器人沿着规划路径的导航算法相比,我们的算法可以(1)容忍偏离规划路径的潜在偏差,因为DH-APF覆盖了整个部署区域;(2)缓解弹道振荡问题;(3)避免与障碍物的潜在碰撞;(4)通过配置大的移动步长来节省静态传感器的宝贵能量,这对于忽略导航可靠性问题的算法来说是不可能的。我们对上述特征的理论分析考虑了实际的传感器网络问题,包括无线电不规则,数据包丢失和无线电冲突。我们在TinyOS上实现了所提出的算法,并在TOSSIM和python提供的高保真度仿真平台上测试了其性能。仿真结果验证了所提出的移动传感器导航算法的可靠性和高能效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reliable navigation of mobile sensors in wireless sensor networks without localization service Fast rerouting for IP multicast in managed IPTV networks Admission control for roadside unit access in Intelligent Transportation Systems Rate and delay controlled core networks: An experimental demonstration Succinct priority indexing structures for the management of large priority queues
×
引用
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