无线传感器网络中移动性的优化希尔伯特

M. Kamat, A. Ismail, S. Olariu
{"title":"无线传感器网络中移动性的优化希尔伯特","authors":"M. Kamat, A. Ismail, S. Olariu","doi":"10.1109/ICCSA.2007.85","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks (WSNs), mobilizing sink node for data collection can minimize communication and maximize network lifetime. Several mobility algorithms have been proposed to control sink node's movement. However, they do not consider mobility for coverage area problem. Hilbert space-filling curves technique is modified to navigate mobile sink in traversing specfiic area of the sensor field. The algorithm is called optimized-Hilbert, which provides mobility pattern of a sink node in covering an ellipsoidal monitoring area during data collection for a specific mission by traversing the entire area from an entry point and finish at an exit point of square grids. The optimized-Hilbert requires less number of steps as compared to conventional Hilbert. Additionally, it is also compared with circular mobility, and result indicates the efficiency of optimized Hilbert.","PeriodicalId":386960,"journal":{"name":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Optimized-Hilbert for Mobility in Wireless Sensor Networks\",\"authors\":\"M. Kamat, A. Ismail, S. Olariu\",\"doi\":\"10.1109/ICCSA.2007.85\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In wireless sensor networks (WSNs), mobilizing sink node for data collection can minimize communication and maximize network lifetime. Several mobility algorithms have been proposed to control sink node's movement. However, they do not consider mobility for coverage area problem. Hilbert space-filling curves technique is modified to navigate mobile sink in traversing specfiic area of the sensor field. The algorithm is called optimized-Hilbert, which provides mobility pattern of a sink node in covering an ellipsoidal monitoring area during data collection for a specific mission by traversing the entire area from an entry point and finish at an exit point of square grids. The optimized-Hilbert requires less number of steps as compared to conventional Hilbert. Additionally, it is also compared with circular mobility, and result indicates the efficiency of optimized Hilbert.\",\"PeriodicalId\":386960,\"journal\":{\"name\":\"2007 International Conference on Computational Science and its Applications (ICCSA 2007)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Science and its Applications (ICCSA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSA.2007.85\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Science and its Applications (ICCSA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSA.2007.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

在无线传感器网络中,调动汇聚节点进行数据采集可以减少通信,提高网络寿命。为了控制汇聚节点的移动,提出了几种移动算法。然而,他们没有考虑到覆盖区域的移动性问题。对希尔伯特空间填充曲线技术进行了改进,使其能够在传感器场的特定区域内对移动sink进行导航。该算法被称为优化希尔伯特算法,该算法通过从方形网格的入口点遍历整个区域,在特定任务的数据收集过程中覆盖椭球形监测区域,并在出口点完成,从而提供了汇聚节点的移动模式。与传统的希尔伯特算法相比,优化后的希尔伯特算法所需的步骤更少。此外,还将其与圆迁移率进行了比较,结果表明优化后的希尔伯特算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimized-Hilbert for Mobility in Wireless Sensor Networks
In wireless sensor networks (WSNs), mobilizing sink node for data collection can minimize communication and maximize network lifetime. Several mobility algorithms have been proposed to control sink node's movement. However, they do not consider mobility for coverage area problem. Hilbert space-filling curves technique is modified to navigate mobile sink in traversing specfiic area of the sensor field. The algorithm is called optimized-Hilbert, which provides mobility pattern of a sink node in covering an ellipsoidal monitoring area during data collection for a specific mission by traversing the entire area from an entry point and finish at an exit point of square grids. The optimized-Hilbert requires less number of steps as compared to conventional Hilbert. Additionally, it is also compared with circular mobility, and result indicates the efficiency of optimized Hilbert.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信