分布式传感器网络设计中的路由器节点布局优化

M. Mozumdar, A. Ganesan, Alireza Ameri Daragheh
{"title":"分布式传感器网络设计中的路由器节点布局优化","authors":"M. Mozumdar, A. Ganesan, Alireza Ameri Daragheh","doi":"10.1109/DCOSS.2014.46","DOIUrl":null,"url":null,"abstract":"Designing a distributed wireless sensor network can be a difficult effort without using simulation tools. These tools should provide a robust and efficient solution for the problem with quick response time. However, available simulation tools for designing wireless sensor networks are very limited. Authors in [1] proposed an interactive design tool based on Dijkstra's algorithm which can assist rapid design of sensor network. However, it has a very high execution time when the network size is relatively large, i.e. n 50. Moreover, it produces a suboptimal solution with large number of router nodes. In this paper, we present efficient and robust synthesis algorithms which exclusively reduce run time for large networks as much as 1000% and also produce a synthesized network with a reduced number of router nodes as much as 150% in comparison to similar previous works.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"340 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimizing router nodes placement for designing distributed sensor networks\",\"authors\":\"M. Mozumdar, A. Ganesan, Alireza Ameri Daragheh\",\"doi\":\"10.1109/DCOSS.2014.46\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Designing a distributed wireless sensor network can be a difficult effort without using simulation tools. These tools should provide a robust and efficient solution for the problem with quick response time. However, available simulation tools for designing wireless sensor networks are very limited. Authors in [1] proposed an interactive design tool based on Dijkstra's algorithm which can assist rapid design of sensor network. However, it has a very high execution time when the network size is relatively large, i.e. n 50. Moreover, it produces a suboptimal solution with large number of router nodes. In this paper, we present efficient and robust synthesis algorithms which exclusively reduce run time for large networks as much as 1000% and also produce a synthesized network with a reduced number of router nodes as much as 150% in comparison to similar previous works.\",\"PeriodicalId\":351707,\"journal\":{\"name\":\"2014 IEEE International Conference on Distributed Computing in Sensor Systems\",\"volume\":\"340 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Distributed Computing in Sensor Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCOSS.2014.46\",\"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 IEEE International Conference on Distributed Computing in Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2014.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

如果不使用仿真工具,设计分布式无线传感器网络可能是一项困难的工作。这些工具应该为具有快速响应时间的问题提供健壮而有效的解决方案。然而,可用于设计无线传感器网络的仿真工具非常有限。[1]作者提出了一种基于Dijkstra算法的交互式设计工具,可以辅助传感器网络的快速设计。但是,当网络规模比较大时,它的执行时间非常高,例如n 50。此外,它产生了一个次优解决方案与大量的路由器节点。在本文中,我们提出了高效且鲁棒的综合算法,该算法专门将大型网络的运行时间减少了1000%,并且与之前的类似工作相比,还产生了一个路由器节点数量减少150%的综合网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimizing router nodes placement for designing distributed sensor networks
Designing a distributed wireless sensor network can be a difficult effort without using simulation tools. These tools should provide a robust and efficient solution for the problem with quick response time. However, available simulation tools for designing wireless sensor networks are very limited. Authors in [1] proposed an interactive design tool based on Dijkstra's algorithm which can assist rapid design of sensor network. However, it has a very high execution time when the network size is relatively large, i.e. n 50. Moreover, it produces a suboptimal solution with large number of router nodes. In this paper, we present efficient and robust synthesis algorithms which exclusively reduce run time for large networks as much as 1000% and also produce a synthesized network with a reduced number of router nodes as much as 150% in comparison to similar previous works.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信