{"title":"基于集群的无线传感器网络交通流分析模型","authors":"Shensheng Tang","doi":"10.1109/ISWPC.2006.1613563","DOIUrl":null,"url":null,"abstract":"An analytical traffic flow model is developed for cluster-based wireless sensor networks. The source-to-sink path is modeled by a number of single-server finite queues linked in tandem. During the process of modeling, both the blocking effect of tandem queuing networks and the impact of connection failure due to limited node power are taken into account. The tandem queuing network is analyzed by decomposing it into individual nodes with modified arrival and service processes and modified queue capacities. The steady-state queue-length distributions of individual nodes are determined iteratively by using the matrix-geometric procedure. A computational algorithm with a global loop from the last node to the first node and local loops in individual nodes is developed to determine the performance metrics, such as source-to-sink throughput (SST) and source-to-sink delay (SSD), of the tandem network.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"An analytical traffic flow model for cluster-based wireless sensor networks\",\"authors\":\"Shensheng Tang\",\"doi\":\"10.1109/ISWPC.2006.1613563\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An analytical traffic flow model is developed for cluster-based wireless sensor networks. The source-to-sink path is modeled by a number of single-server finite queues linked in tandem. During the process of modeling, both the blocking effect of tandem queuing networks and the impact of connection failure due to limited node power are taken into account. The tandem queuing network is analyzed by decomposing it into individual nodes with modified arrival and service processes and modified queue capacities. The steady-state queue-length distributions of individual nodes are determined iteratively by using the matrix-geometric procedure. A computational algorithm with a global loop from the last node to the first node and local loops in individual nodes is developed to determine the performance metrics, such as source-to-sink throughput (SST) and source-to-sink delay (SSD), of the tandem network.\",\"PeriodicalId\":145728,\"journal\":{\"name\":\"2006 1st International Symposium on Wireless Pervasive Computing\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 1st International Symposium on Wireless Pervasive Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWPC.2006.1613563\",\"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 1st International Symposium on Wireless Pervasive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWPC.2006.1613563","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An analytical traffic flow model for cluster-based wireless sensor networks
An analytical traffic flow model is developed for cluster-based wireless sensor networks. The source-to-sink path is modeled by a number of single-server finite queues linked in tandem. During the process of modeling, both the blocking effect of tandem queuing networks and the impact of connection failure due to limited node power are taken into account. The tandem queuing network is analyzed by decomposing it into individual nodes with modified arrival and service processes and modified queue capacities. The steady-state queue-length distributions of individual nodes are determined iteratively by using the matrix-geometric procedure. A computational algorithm with a global loop from the last node to the first node and local loops in individual nodes is developed to determine the performance metrics, such as source-to-sink throughput (SST) and source-to-sink delay (SSD), of the tandem network.