介绍了一种基于蚁群算法的无线传感器网络野火检测方法

R. Chandrasekar, S. Misra
{"title":"介绍了一种基于蚁群算法的无线传感器网络野火检测方法","authors":"R. Chandrasekar, S. Misra","doi":"10.1109/ISAHUC.2006.4290657","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce an ant colony optimization (ACO)-based paradigm for detecting wildfires using wireless sensor networks. By considering a data-centric approach and trying to monitor and report events from specific locations according to the requests of the sinks, energy is saved in terms of precious battery-power and additional communication overhead is reduced. The ant colony heuristic provides a robust mechanism to choose the most stable routing paths. Based on the probability of occurrence of the data sites according to the user queries, the movements of the ants are biased towards those sites. Zones of reachability are assigned in the network to better estimate a fire and also to reduce the overhead involved. Sensing of multiple phenomena is carried out by an odor-analysis approach. Local interactions are made use of here to globally optimize the tree generated. Ant-aggregation, of particular use here, reduces the data to be forwarded while sending various kinds of reports back to the sinks. Simulation is carried out in NS-2 and the results obtained are promising when a suitable zone radius is chosen.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Introducing an ACO Based Paradigm for Detecting Wildfires using Wireless Sensor Networks\",\"authors\":\"R. Chandrasekar, S. Misra\",\"doi\":\"10.1109/ISAHUC.2006.4290657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce an ant colony optimization (ACO)-based paradigm for detecting wildfires using wireless sensor networks. By considering a data-centric approach and trying to monitor and report events from specific locations according to the requests of the sinks, energy is saved in terms of precious battery-power and additional communication overhead is reduced. The ant colony heuristic provides a robust mechanism to choose the most stable routing paths. Based on the probability of occurrence of the data sites according to the user queries, the movements of the ants are biased towards those sites. Zones of reachability are assigned in the network to better estimate a fire and also to reduce the overhead involved. Sensing of multiple phenomena is carried out by an odor-analysis approach. Local interactions are made use of here to globally optimize the tree generated. Ant-aggregation, of particular use here, reduces the data to be forwarded while sending various kinds of reports back to the sinks. Simulation is carried out in NS-2 and the results obtained are promising when a suitable zone radius is chosen.\",\"PeriodicalId\":165524,\"journal\":{\"name\":\"2006 International Symposium on Ad Hoc and Ubiquitous Computing\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Symposium on Ad Hoc and Ubiquitous Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISAHUC.2006.4290657\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAHUC.2006.4290657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文介绍了一种基于蚁群优化(ACO)的无线传感器网络野火检测范式。通过考虑以数据为中心的方法,并尝试根据接收器的请求从特定位置监视和报告事件,可以节省宝贵的电池电量,并减少额外的通信开销。蚁群启发式算法提供了一种鲁棒的机制来选择最稳定的路由路径。根据用户查询的数据站点出现的概率,蚂蚁的运动偏向这些站点。在网络中分配可达区域,以便更好地估计火灾,并减少所涉及的开销。通过气味分析方法对多种现象进行感知。这里使用局部交互来全局优化生成的树。这里特别使用的反聚合减少了将各种报告发送回接收器时要转发的数据。在NS-2中进行了仿真,在选择合适的区域半径时,得到了令人满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Introducing an ACO Based Paradigm for Detecting Wildfires using Wireless Sensor Networks
In this paper, we introduce an ant colony optimization (ACO)-based paradigm for detecting wildfires using wireless sensor networks. By considering a data-centric approach and trying to monitor and report events from specific locations according to the requests of the sinks, energy is saved in terms of precious battery-power and additional communication overhead is reduced. The ant colony heuristic provides a robust mechanism to choose the most stable routing paths. Based on the probability of occurrence of the data sites according to the user queries, the movements of the ants are biased towards those sites. Zones of reachability are assigned in the network to better estimate a fire and also to reduce the overhead involved. Sensing of multiple phenomena is carried out by an odor-analysis approach. Local interactions are made use of here to globally optimize the tree generated. Ant-aggregation, of particular use here, reduces the data to be forwarded while sending various kinds of reports back to the sinks. Simulation is carried out in NS-2 and the results obtained are promising when a suitable zone radius is chosen.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信