{"title":"无线传感器网络随机路由中的分布式时延最小化","authors":"U. Wijetunge, S. Perreau, A. Pollok","doi":"10.1109/AusCTW.2012.6164915","DOIUrl":null,"url":null,"abstract":"Improving the packet transmission delay is one of the major challenges of stochastic routing in wireless sensor networks: the use of random paths from source to destination nodes results in longer routes on average, which is not desirable in delay-sensitive applications. In this paper, we propose a novel distributed and decentralized stochastic routing algorithm to minimize the average packet transmission delay of the network. We also provide an analytical expression for the average packet transmission delay for a circular network using a discrete time Markov chain model and we discuss the performance improvement with respect to random walking methods. Simulation results demonstrate that our proposed routing method significantly improves the average packet transmission delay when compared to existing methods and provides a near optimal solution.","PeriodicalId":320391,"journal":{"name":"2012 Australian Communications Theory Workshop (AusCTW)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed delay minimization in stochastic routing for wireless sensor networks\",\"authors\":\"U. Wijetunge, S. Perreau, A. Pollok\",\"doi\":\"10.1109/AusCTW.2012.6164915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Improving the packet transmission delay is one of the major challenges of stochastic routing in wireless sensor networks: the use of random paths from source to destination nodes results in longer routes on average, which is not desirable in delay-sensitive applications. In this paper, we propose a novel distributed and decentralized stochastic routing algorithm to minimize the average packet transmission delay of the network. We also provide an analytical expression for the average packet transmission delay for a circular network using a discrete time Markov chain model and we discuss the performance improvement with respect to random walking methods. Simulation results demonstrate that our proposed routing method significantly improves the average packet transmission delay when compared to existing methods and provides a near optimal solution.\",\"PeriodicalId\":320391,\"journal\":{\"name\":\"2012 Australian Communications Theory Workshop (AusCTW)\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Australian Communications Theory Workshop (AusCTW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AusCTW.2012.6164915\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Australian Communications Theory Workshop (AusCTW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AusCTW.2012.6164915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed delay minimization in stochastic routing for wireless sensor networks
Improving the packet transmission delay is one of the major challenges of stochastic routing in wireless sensor networks: the use of random paths from source to destination nodes results in longer routes on average, which is not desirable in delay-sensitive applications. In this paper, we propose a novel distributed and decentralized stochastic routing algorithm to minimize the average packet transmission delay of the network. We also provide an analytical expression for the average packet transmission delay for a circular network using a discrete time Markov chain model and we discuss the performance improvement with respect to random walking methods. Simulation results demonstrate that our proposed routing method significantly improves the average packet transmission delay when compared to existing methods and provides a near optimal solution.