Topology Control for Wireless Sensor Networks with Irregular and Dynamic Radio Coverage

N. Ababneh, S. Selvadurai, J. Hassan, N. Boukhatem
{"title":"Topology Control for Wireless Sensor Networks with Irregular and Dynamic Radio Coverage","authors":"N. Ababneh, S. Selvadurai, J. Hassan, N. Boukhatem","doi":"10.1109/CNSR.2010.39","DOIUrl":null,"url":null,"abstract":"A critical issue in wireless sensor networks isrepresented by the limited availability of energy withinsensor nodes. An effective approach for energy conservationis scheduling sleep intervals for extraneous nodes, while theremaining nodes stay active to provide continuous service.Most previous solutions assumed a perfect radio conditionwith a static, circular coverage. However, in real situations,radio signals are very dynamic and irregular in theircoverage. This is especially true for wireless sensornetworks, which usually employ low quality radio modulesto reduce the cost. Assuming no location information isavailable, we approach the problem in this paper from twoaspects: space and time. We present a topology controlalgorithm, termed OTC, for sensor networks withconsideration of radio irregularity and dynamic radiocoverage. It uses two-hop neighborhood information to selecta subset of nodes to be active among all nodes in theneighborhood. Each node in the network selects its own setof active neighbors from among its one-hop neighbors. Thisset is determined such that it covers all two-hop nodes. OTCis evaluated against a well-known algorithm from theliterature, namely Span through realistic simulations usingTOSSIM. The results show that under dense deploymentand irregular and dynamic radio coverage, our algorithmoutperforms Span.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 8th Annual Communication Networks and Services Research Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2010.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A critical issue in wireless sensor networks isrepresented by the limited availability of energy withinsensor nodes. An effective approach for energy conservationis scheduling sleep intervals for extraneous nodes, while theremaining nodes stay active to provide continuous service.Most previous solutions assumed a perfect radio conditionwith a static, circular coverage. However, in real situations,radio signals are very dynamic and irregular in theircoverage. This is especially true for wireless sensornetworks, which usually employ low quality radio modulesto reduce the cost. Assuming no location information isavailable, we approach the problem in this paper from twoaspects: space and time. We present a topology controlalgorithm, termed OTC, for sensor networks withconsideration of radio irregularity and dynamic radiocoverage. It uses two-hop neighborhood information to selecta subset of nodes to be active among all nodes in theneighborhood. Each node in the network selects its own setof active neighbors from among its one-hop neighbors. Thisset is determined such that it covers all two-hop nodes. OTCis evaluated against a well-known algorithm from theliterature, namely Span through realistic simulations usingTOSSIM. The results show that under dense deploymentand irregular and dynamic radio coverage, our algorithmoutperforms Span.
不规则和动态无线电覆盖无线传感器网络的拓扑控制
无线传感器网络中的一个关键问题是传感器节点内能量的有限可用性。一种有效的节能方法是为多余节点安排睡眠间隔,而剩余节点保持活动状态以提供连续服务。以前的大多数解决方案都假设有一个完美的无线电条件,具有静态的圆形覆盖。然而,在实际情况下,无线电信号的覆盖范围是非常动态和不规则的。对于无线传感器网络来说尤其如此,它通常采用低质量的无线电模块来降低成本。假设没有可用的位置信息,我们从空间和时间两个方面来解决这个问题。我们提出了一种拓扑控制算法,称为OTC,用于考虑无线电不规则性和动态无线电覆盖的传感器网络。它使用两跳邻居信息在邻居的所有节点中选择一个活跃的节点子集。网络中的每个节点从其单跳邻居中选择自己的活动邻居集。这个集合被确定为覆盖所有两跳节点。otci通过使用tossim进行现实模拟,根据文献中的知名算法进行评估,即Span。结果表明,在密集部署和不规则动态无线电覆盖下,我们的算法优于Span。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信