{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T09:11:04Z","timestamp":1685351464566},"reference-count":0,"publisher":"National Library of Serbia","issue":"4","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2011]]},"abstract":"<jats:p>In large-scale wireless sensor networks (WSNs), when the consumption of\n   hardware is limited, how to maximize the performance has become the research\n   focus for improving transmission quality of service (QoS) of WSNs in recent\n   years. This paper presents a new evaluation method for packet buffer capacity\n   of nodes using queueing network model, whose packet buffer capacity is\n   analyzed for each type node, when it is in the best working condition. In\n   order to evaluate congestion situation in the queueing network, and to get\n   real effective arrival rates and transmission rates in the model, holding\n   nodes were added in the queueing network model, and equivalent queueing\n   network model is expanded. We establish an M\/M\/1\/N type queueing network\n   model with holding nodes for WSNs and design approximate iterative\n   algorithms. Experimental results show that the model is consistent with the\n   real data.<\/jats:p>","DOI":"10.2298\/csis110227057q","type":"journal-article","created":{"date-parts":[[2011,10,13]],"date-time":"2011-10-13T06:59:22Z","timestamp":1318489162000},"page":"1028-1049","source":"Crossref","is-referenced-by-count":22,"title":["A packet buffer evaluation method exploiting queueing theory for wireless sensor networks"],"prefix":"10.2298","volume":"8","author":[{"given":"Tie","family":"Qiu","sequence":"first","affiliation":[{"name":"School of Software, Dalian University of Technology, Dalian, China + School of Innovation Experiment, Dalian University of Technology, Dalian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Innovation Experiment, Dalian University of Technology, Dalian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Xia","sequence":"additional","affiliation":[{"name":"School of Software, Dalian University of Technology, Dalian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guowei","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Software, Dalian University of Technology, Dalian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Software, Dalian University of Technology, Dalian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:28Z","timestamp":1685349028000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141100057Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011]]}},"URL":"https:\/\/doi.org\/10.2298\/csis110227057q","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}