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

Research output: Book/ReportReportProfessional

54 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.
Mitici, Mihaela ; Goseling, Jasper ; de Graaf, Maurits ; Boucherie, Richardus J. / Decentralized vs. centralized scheduling in wireless sensor networks for data fusion. Enschede : University of Twente, Department of Applied Mathematics, 2013. 4 p. (Memorandum; 2019).
@book{22c7ee50288c460b971e6d725aca748d,
title = "Decentralized vs. centralized scheduling in wireless sensor networks for data fusion",
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.",
keywords = "METIS-300190, IR-88065, EWI-24039, Waiting time, Data Fusion, Scheduling, Wireless Sensor Network",
author = "Mihaela Mitici and Jasper Goseling and {de Graaf}, Maurits and Boucherie, {Richardus J.}",
year = "2013",
month = "12",
language = "Undefined",
series = "Memorandum",
publisher = "University of Twente, Department of Applied Mathematics",
number = "2019",

}

Mitici, M, Goseling, J, de Graaf, M & Boucherie, RJ 2013, Decentralized vs. centralized scheduling in wireless sensor networks for data fusion. Memorandum, no. 2019, University of Twente, Department of Applied Mathematics, Enschede.

Decentralized vs. centralized scheduling in wireless sensor networks for data fusion. / Mitici, Mihaela; Goseling, Jasper; de Graaf, Maurits; Boucherie, Richardus J.

Enschede : University of Twente, Department of Applied Mathematics, 2013. 4 p. (Memorandum; No. 2019).

Research output: Book/ReportReportProfessional

TY - BOOK

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

AU - Mitici, Mihaela

AU - Goseling, Jasper

AU - de Graaf, Maurits

AU - Boucherie, Richardus J.

PY - 2013/12

Y1 - 2013/12

N2 - 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.

AB - 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.

KW - METIS-300190

KW - IR-88065

KW - EWI-24039

KW - Waiting time

KW - Data Fusion

KW - Scheduling

KW - Wireless Sensor Network

M3 - Report

T3 - Memorandum

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

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -

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