Modified Hilbert Space-Filling Curve for Ellipsoidal Coverage in Wireless Ad Hoc Sensor Networks

M. Kamat, A. Ismail, S. Olariu
{"title":"Modified Hilbert Space-Filling Curve for Ellipsoidal Coverage in Wireless Ad Hoc Sensor Networks","authors":"M. Kamat, A. Ismail, S. Olariu","doi":"10.1109/ICSPC.2007.4728592","DOIUrl":null,"url":null,"abstract":"Sensor nodes are deployed to sense an environment for observing the physical world. The sensing field (an area of interest) can be represented as an ellipse. This paper proposes an algorithm for covering an elliptical shaped area of interest within wireless sensor network fields by modifying the Hilbert-space filling curve. Conventionally, an area is partitioned into 2n times 2n square grid (Hilbert cells). Hilbert space-filling curve is modified to map only specific area of interest. To cover the entire area of interest, the algorithm requires a mobility pattern for a sink node in order to collect data for a specific mission. This is done by traversing the area from an entry point and finishing at an exit point from the square grids. Simulation results show that modified Hilbert space-filling curve achieves its best Hilbert-covering for an ellipse that is almost circular as opposed to a narrow ellipse.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Signal Processing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSPC.2007.4728592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Sensor nodes are deployed to sense an environment for observing the physical world. The sensing field (an area of interest) can be represented as an ellipse. This paper proposes an algorithm for covering an elliptical shaped area of interest within wireless sensor network fields by modifying the Hilbert-space filling curve. Conventionally, an area is partitioned into 2n times 2n square grid (Hilbert cells). Hilbert space-filling curve is modified to map only specific area of interest. To cover the entire area of interest, the algorithm requires a mobility pattern for a sink node in order to collect data for a specific mission. This is done by traversing the area from an entry point and finishing at an exit point from the square grids. Simulation results show that modified Hilbert space-filling curve achieves its best Hilbert-covering for an ellipse that is almost circular as opposed to a narrow ellipse.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无线自组织传感器网络椭球覆盖的改进Hilbert空间填充曲线
传感器节点用于感知环境以观察物理世界。感测场(感兴趣的区域)可以用椭圆表示。本文提出了一种通过修改希尔伯特空间填充曲线来覆盖无线传感器网络场中感兴趣的椭圆区域的算法。通常,一个区域被划分为2n乘以2n个正方形网格(希尔伯特单元)。希尔伯特空间填充曲线被修改为只映射感兴趣的特定区域。为了覆盖整个感兴趣的区域,该算法需要一个汇聚节点的移动模式,以便为特定任务收集数据。这是通过从入口点遍历该区域并在从方形网格的出口点完成的。仿真结果表明,与窄椭圆相比,改进的Hilbert空间填充曲线对近似圆形的椭圆具有最佳的Hilbert覆盖效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Security of Mobile Communications An Improved ICI Reduction Method in OFDM Communication System in Presence of Phase Noise A Real-Time H.264 BP Decoder based on a DM642 DSP Modified Hilbert Space-Filling Curve for Ellipsoidal Coverage in Wireless Ad Hoc Sensor Networks Wavelength Selective WDM Network Design: How Bad is Shortest Path Routing?
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1