基于自动化机器人的无线传感器网络最大似然拓扑图

Ashanie Gunathillake, A. Savkin, A. Jayasumana
{"title":"基于自动化机器人的无线传感器网络最大似然拓扑图","authors":"Ashanie Gunathillake, A. Savkin, A. Jayasumana","doi":"10.1109/LCN.2016.62","DOIUrl":null,"url":null,"abstract":"Topology maps represent the layout arrangement of nodes while maintaining the connectivity. As it is extracted using connectivity information only, it does not accurately represent the physical layout such as physical voids, shape, and relative distances among physical positions of sensor nodes. A novel concept Maximum Likelihood-Topology Maps for Wireless Sensor Networks is presented. As it is based on a packet reception probability function, which is sensitive to the distance, it represents the physical layout more accurately. In this paper, we use a binary matrix recorded by a mobile robot representing the reception of packets from sensor nodes by the mobile robot at different locations along the robots trajectory. Maximum likelihood topology coordinates are then extracted from the binary matrix by using a packet receiving probability function. Also, the robot trajectory is automated to avoid the obstacles and cover the entire network within least possible amount of time. The result shows that our algorithm generates topology maps for various network shapes under different environmental conditions accurately, and that it outperforms the existing algorithms by representing the physical layout of the network more accurately.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"11 1","pages":"339-347"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Maximum Likelihood Topology Maps for Wireless Sensor Networks Using an Automated Robot\",\"authors\":\"Ashanie Gunathillake, A. Savkin, A. Jayasumana\",\"doi\":\"10.1109/LCN.2016.62\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Topology maps represent the layout arrangement of nodes while maintaining the connectivity. As it is extracted using connectivity information only, it does not accurately represent the physical layout such as physical voids, shape, and relative distances among physical positions of sensor nodes. A novel concept Maximum Likelihood-Topology Maps for Wireless Sensor Networks is presented. As it is based on a packet reception probability function, which is sensitive to the distance, it represents the physical layout more accurately. In this paper, we use a binary matrix recorded by a mobile robot representing the reception of packets from sensor nodes by the mobile robot at different locations along the robots trajectory. Maximum likelihood topology coordinates are then extracted from the binary matrix by using a packet receiving probability function. Also, the robot trajectory is automated to avoid the obstacles and cover the entire network within least possible amount of time. The result shows that our algorithm generates topology maps for various network shapes under different environmental conditions accurately, and that it outperforms the existing algorithms by representing the physical layout of the network more accurately.\",\"PeriodicalId\":6864,\"journal\":{\"name\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"volume\":\"11 1\",\"pages\":\"339-347\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2016.62\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

拓扑图在保持连接性的同时表示节点的布局安排。由于它仅使用连接信息提取,因此不能准确地表示物理布局,例如物理空隙、形状和传感器节点物理位置之间的相对距离。提出了一种新的无线传感器网络最大似然拓扑映射概念。由于它基于对距离敏感的数据包接收概率函数,因此可以更准确地表示物理布局。在本文中,我们使用移动机器人记录的二进制矩阵来表示移动机器人沿着机器人轨迹在不同位置接收来自传感器节点的数据包。然后利用包接收概率函数从二值矩阵中提取最大似然拓扑坐标。此外,机器人的轨迹是自动的,可以避开障碍物,并在最短的时间内覆盖整个网络。结果表明,我们的算法能够准确地生成不同环境条件下各种网络形状的拓扑图,并且能够更准确地表示网络的物理布局,优于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Maximum Likelihood Topology Maps for Wireless Sensor Networks Using an Automated Robot
Topology maps represent the layout arrangement of nodes while maintaining the connectivity. As it is extracted using connectivity information only, it does not accurately represent the physical layout such as physical voids, shape, and relative distances among physical positions of sensor nodes. A novel concept Maximum Likelihood-Topology Maps for Wireless Sensor Networks is presented. As it is based on a packet reception probability function, which is sensitive to the distance, it represents the physical layout more accurately. In this paper, we use a binary matrix recorded by a mobile robot representing the reception of packets from sensor nodes by the mobile robot at different locations along the robots trajectory. Maximum likelihood topology coordinates are then extracted from the binary matrix by using a packet receiving probability function. Also, the robot trajectory is automated to avoid the obstacles and cover the entire network within least possible amount of time. The result shows that our algorithm generates topology maps for various network shapes under different environmental conditions accurately, and that it outperforms the existing algorithms by representing the physical layout of the network more accurately.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the General Chair Message from the general chair Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management? TransFetch: A Viewing Behavior Driven Video Distribution Framework in Public Transport
×
引用
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