A Route Planning Method Using Cost Map for Mobile Sensor Nodes

M. Nakamiya, Y. Kishino, T. Terada, S. Nishio
{"title":"A Route Planning Method Using Cost Map for Mobile Sensor Nodes","authors":"M. Nakamiya, Y. Kishino, T. Terada, S. Nishio","doi":"10.1109/ISWPC.2007.342595","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a route planning method for mobile sensor nodes using cost map. The proposed method achieves novel route planning that can solve several practical problems from previous works: the limitations of sensing ranges, obstacles on the node's routes, and restriction of their movements. This method can determine the route that has the lowest power consumption. We also propose a sensing area defining method for dealing with many kinds of sensors. Furthermore, we compared the proposed method to A*algorithm, a well-known route planning algorithm. We implemented a prototype of the sensor node to verify our algorithm in a real environment.","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"402 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Symposium on Wireless Pervasive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWPC.2007.342595","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper, we propose a route planning method for mobile sensor nodes using cost map. The proposed method achieves novel route planning that can solve several practical problems from previous works: the limitations of sensing ranges, obstacles on the node's routes, and restriction of their movements. This method can determine the route that has the lowest power consumption. We also propose a sensing area defining method for dealing with many kinds of sensors. Furthermore, we compared the proposed method to A*algorithm, a well-known route planning algorithm. We implemented a prototype of the sensor node to verify our algorithm in a real environment.
基于成本图的移动传感器节点路由规划方法
本文提出了一种基于成本图的移动传感器节点路由规划方法。该方法实现了一种新颖的路径规划,可以解决以往工作中遇到的几个实际问题:感知范围的限制、节点路径上的障碍物以及节点运动的限制。这种方法可以确定功耗最低的路由。我们还提出了一种处理多种传感器的传感区域定义方法。并将该方法与A*算法进行了比较。我们实现了传感器节点的原型,在真实环境中验证了我们的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信