On a tandem queue with batch service and its applications in wireless sensor networks

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
75 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)81
Number of pages93
JournalQueueing systems
Volume87
Issue number1-2
DOIs
Publication statusPublished - 2 Jun 2017

Keywords

  • Tandem network of queues with Batch Service
  • Wireless Sensor Network
  • Broadcasting
  • Scheduling

Fingerprint Dive into the research topics of 'On a tandem queue with batch service and its applications in wireless sensor networks'. Together they form a unique fingerprint.

  • Cite this