{"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}
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.