MAXIMIZING LIFETIME OF HETEROGENEOUS WIRELESS TURNABLE CAMERA SENSOR NETWORKS ENSURING STRONG BARRIER COVERAGE

Nguyen Thi My Binh, H. T. Thanh Binh, N. Ngoc, Mai Dang Quan Anh, N. Phuong
{"title":"MAXIMIZING LIFETIME OF HETEROGENEOUS WIRELESS TURNABLE CAMERA SENSOR NETWORKS ENSURING STRONG BARRIER COVERAGE","authors":"Nguyen Thi My Binh, H. T. Thanh Binh, N. Ngoc, Mai Dang Quan Anh, N. Phuong","doi":"10.15625/1813-9663/37/1/15858","DOIUrl":null,"url":null,"abstract":"Barrier coverage in wireless camera sensor networks (WCSNs) has drawn the attention of research community since it promises an extremely large potential in applications involve movement detection and surveillance. As the battery resources are limited, improving the efficiency of energy is one of the key drivers for prolonging the lifetime of barrier coverage. However, most prior studies on this problem only worked on the networks with homogeneous sensors as well as omni-directional sensing coverage. This paper thus investigates the problem of maximizing the network lifetime to ensure strong barrier coverage for heterogeneous case (MLBC-HWCSN), that has not been taken into account in WCSNs research. We formulate the problem, and then propose a Modified Maximum Flow Algorithm (MMFA) consisting of three stages: constructing the flow-network, finding the maximum flow and refining the solution to solve this problem. Experimental results on extensive instances show that the proposed methodology is suitable for the studied problem and more efficient than existing algorithms.","PeriodicalId":15444,"journal":{"name":"Journal of Computer Science and Cybernetics","volume":"6 1","pages":"57-70"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Science and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15625/1813-9663/37/1/15858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Barrier coverage in wireless camera sensor networks (WCSNs) has drawn the attention of research community since it promises an extremely large potential in applications involve movement detection and surveillance. As the battery resources are limited, improving the efficiency of energy is one of the key drivers for prolonging the lifetime of barrier coverage. However, most prior studies on this problem only worked on the networks with homogeneous sensors as well as omni-directional sensing coverage. This paper thus investigates the problem of maximizing the network lifetime to ensure strong barrier coverage for heterogeneous case (MLBC-HWCSN), that has not been taken into account in WCSNs research. We formulate the problem, and then propose a Modified Maximum Flow Algorithm (MMFA) consisting of three stages: constructing the flow-network, finding the maximum flow and refining the solution to solve this problem. Experimental results on extensive instances show that the proposed methodology is suitable for the studied problem and more efficient than existing algorithms.
最大限度地延长异构无线可旋转相机传感器网络的寿命,确保强大的屏障覆盖
无线摄像传感器网络(WCSNs)中的屏障覆盖技术在运动检测和监视方面具有巨大的应用潜力,因此受到了研究界的广泛关注。由于电池资源有限,提高能量效率是延长屏障覆盖寿命的关键驱动因素之一。然而,以往对该问题的研究大多只针对具有均匀传感器和全向传感覆盖的网络。因此,本文研究了在异构情况下(MLBC-HWCSN)最大化网络生存期以保证强屏障覆盖的问题,这是wcsn研究中没有考虑到的问题。在此基础上,提出了一种改进的最大流量算法(MMFA),该算法分为构建流网络、寻找最大流量和细化解三个阶段来求解该问题。大量实例的实验结果表明,该方法适用于所研究的问题,并且比现有算法效率更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信