TY - JOUR
T1 - On a tandem queue with batch service and its applications in wireless sensor networks
AU - Mitici, Mihaela
AU - Goseling, Jasper
AU - van Ommeren, Jan Kees
AU - de Graaf, Maurits
AU - Boucherie, Richard J.
PY - 2017/10/1
Y1 - 2017/10/1
N2 - 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.
AB - 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.
KW - Broadcasting
KW - Scheduling
KW - Tandem network of queues with Batch Service
KW - Wireless Sensor Networks
UR - http://resolver.tudelft.nl/uuid:8a4abf17-314b-481a-bb34-a1e9b64ae74e
UR - http://www.scopus.com/inward/record.url?scp=85020120066&partnerID=8YFLogxK
U2 - 10.1007/s11134-017-9534-1
DO - 10.1007/s11134-017-9534-1
M3 - Article
AN - SCOPUS:85020120066
SN - 0257-0130
VL - 87
SP - 81
EP - 93
JO - Queueing Systems: theory and applications
JF - Queueing Systems: theory and applications
IS - 1-2
ER -