On a tandem queue with batch service and its applications in wireless sensor networks
M.A. Mitici (TU Delft - Air Transport & Operations)
Jasper Goseling (University of Twente)
Maurits de Graaf (University of Twente, Thales Nederland B.V.)
Richard J. Boucherie (University of Twente)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We present a tandem network of queues 0 , ⋯ , s- 1. Customers arrive at queue 0 according to a Poisson process with rate λ. There are s independent batch service processes at exponential rates μ0, ⋯ , μs - 1. Service process i, i= 0 , ⋯ , s- 1 , at rate μi is such that all customers of all queues 0 , ⋯ , i simultaneously receive service and move to the next queue. We show that this system has a geometric product-form steady-state distribution. Moreover, we determine the service allocation that minimizes the waiting time in the system and state conditions to approximate such optimal allocations. Our model is motivated by applications in wireless sensor networks, where s observations from different sensors are collected for data fusion. We demonstrate that both optimal centralized and decentralized sensor scheduling can be modeled by our queueing model by choosing the values of μi appropriately. We quantify the performance gap between the centralized and decentralized schedules for arbitrarily large sensor networks.
help_outline