无线传感器和参与网络中最优参与节点的分布式选择方法

V. Ranga, M. Dave, A. Verma
{"title":"无线传感器和参与网络中最优参与节点的分布式选择方法","authors":"V. Ranga, M. Dave, A. Verma","doi":"10.1109/IC3I.2014.7019702","DOIUrl":null,"url":null,"abstract":"In this research paper we study the problem of optimal actor nodes selection based on mutual exclusion in the context of wireless sensor and actor network (WSAN) and propose a novel distributed approach to solve it. The major requirements for any proposed approach in such scenario are: (1) the proposed approach should select the minimum number of actor nodes to act on the given incident event region, (2) the overlaps between acting ranges should be minimum to avoid redundant action by actor nodes i.e. wastage of resources should be minimal, and finally, whole event region must be covered by one or more than one actors as per their availability in the network i.e. full coverage should be achieved. We have proposed one novel approach called Distributed Optimal Actor nodes Selection based on Mutual Exclusion approach (DOASME) in this research paper. The simulation results show the performance in terms of size of actor cover set, overlapped region, non-overlapped region and maximum actor coverage degree. We have also compared our simulated results with previously proposed benchmark algorithms.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A distributed approach for selection of optimal actor nodes in wireless sensor and actor networks\",\"authors\":\"V. Ranga, M. Dave, A. Verma\",\"doi\":\"10.1109/IC3I.2014.7019702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research paper we study the problem of optimal actor nodes selection based on mutual exclusion in the context of wireless sensor and actor network (WSAN) and propose a novel distributed approach to solve it. The major requirements for any proposed approach in such scenario are: (1) the proposed approach should select the minimum number of actor nodes to act on the given incident event region, (2) the overlaps between acting ranges should be minimum to avoid redundant action by actor nodes i.e. wastage of resources should be minimal, and finally, whole event region must be covered by one or more than one actors as per their availability in the network i.e. full coverage should be achieved. We have proposed one novel approach called Distributed Optimal Actor nodes Selection based on Mutual Exclusion approach (DOASME) in this research paper. The simulation results show the performance in terms of size of actor cover set, overlapped region, non-overlapped region and maximum actor coverage degree. We have also compared our simulated results with previously proposed benchmark algorithms.\",\"PeriodicalId\":430848,\"journal\":{\"name\":\"2014 International Conference on Contemporary Computing and Informatics (IC3I)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Contemporary Computing and Informatics (IC3I)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3I.2014.7019702\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3I.2014.7019702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文研究了无线传感器与行动者网络(WSAN)中基于互斥的行动者节点最优选择问题,并提出了一种新的分布式方法来解决该问题。任何建议的方法的主要要求在这样的场景中:(1)该方法应选择演员的最小数量节点按照给定的事件事件的地区,(2)代理之间的重叠范围应该最小,避免多余的动作演员节点即浪费的资源应该是最小的,最后,整个事件区域必须由一个或多个参与者根据他们的可用性在网络即应实现全覆盖。本文提出了一种基于互斥方法的分布式最优参与者节点选择方法(DOASME)。仿真结果表明,该算法在行动者覆盖集的大小、重叠区域、非重叠区域和最大行动者覆盖度方面具有良好的性能。我们还将模拟结果与先前提出的基准算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A distributed approach for selection of optimal actor nodes in wireless sensor and actor networks
In this research paper we study the problem of optimal actor nodes selection based on mutual exclusion in the context of wireless sensor and actor network (WSAN) and propose a novel distributed approach to solve it. The major requirements for any proposed approach in such scenario are: (1) the proposed approach should select the minimum number of actor nodes to act on the given incident event region, (2) the overlaps between acting ranges should be minimum to avoid redundant action by actor nodes i.e. wastage of resources should be minimal, and finally, whole event region must be covered by one or more than one actors as per their availability in the network i.e. full coverage should be achieved. We have proposed one novel approach called Distributed Optimal Actor nodes Selection based on Mutual Exclusion approach (DOASME) in this research paper. The simulation results show the performance in terms of size of actor cover set, overlapped region, non-overlapped region and maximum actor coverage degree. We have also compared our simulated results with previously proposed benchmark algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信