Decentralized vs. centralized scheduling in wireless sensor networks for data fusion

Research output: Book/ReportReportProfessional

72 Downloads (Pure)

Abstract

We consider the problem of data estimation in a sensor wireless network where sensors transmit their observations according to decentralized and centralized transmission schedules. A data collector is interested in achieving a data estimation using several sensor observations such that the variance of the estimation is below a targeted threshold. We analyze the waiting time for a collector to receive sufficient sensor observations. We show that, for sufficiently large sensor sets, the decentralized schedule results in a waiting time that is a constant factor approximation of the waiting time under the optimal centralized scheme.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages4
Publication statusPublished - Dec 2013

Publication series

NameMemorandum
PublisherUniversity of Twente, Department of Applied Mathematics
No.2019
ISSN (Print)1874-4850
ISSN (Electronic)1874-4850

Keywords

  • METIS-300190
  • IR-88065
  • EWI-24039
  • Waiting time
  • Data Fusion
  • Scheduling
  • Wireless Sensor Network

Cite this

Mitici, M., Goseling, J., de Graaf, M., & Boucherie, R. J. (2013). Decentralized vs. centralized scheduling in wireless sensor networks for data fusion. (Memorandum; No. 2019). Enschede: University of Twente, Department of Applied Mathematics.