Spatial model for energy burden balancing and data fusion in sensor networks detecting bursty events

Seung Jun Baek, Gustavo de Veciana

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

In this paper, we propose a stochastic geometric model to study the energy burdens seen in a large scale hierarchical sensor network. The network makes use of aggregation nodes, for compression, filtering, and/ or data fusion of locally sensed data. Aggregation nodes (AGNs) then relay the traffic to mobile sinks. While aggregation may substantially reduce the overall traffic on the network, it may have the deleterious effect of concentrating loads on paths between AGNs and the sinks-such inhomogeneities in the energy burden may in turn lead to nodes with depleted energy reserves. To remedy this problem, we consider how one might achieve a more balanced energy burden across the network by spreading traffic, i.e., using a multiplicity of paths between AGNs and sinks. The proposed model reveals, how various aspects of the task at hand impact the characteristics of energy burdens on the network and in turn the lifetime for the system. We show that the scale of aggregation and degree of spreading can be optimized. Additionally, if the sensing activity involves large amounts of data flowing to sinks, then inhomogeneities in the energy burdens seen by nodes around the sinks will be hard to overcome, and indeed the network appears to scale poorly. By contrast, if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing.

Original languageEnglish
Pages (from-to)3615-3628
Number of pages14
JournalIEEE Transactions on Information Theory
Volume53
Issue number10
DOIs
Publication statusPublished - 2007 Oct 1
Externally publishedYes

Fingerprint

Data fusion
aggregation
Sensor networks
Agglomeration
energy
event
traffic
Stochastic models
remedies

Keywords

  • Boolean model
  • Data fusion
  • Sensor networks
  • Stochastic geometry

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Spatial model for energy burden balancing and data fusion in sensor networks detecting bursty events. / Baek, Seung Jun; de Veciana, Gustavo.

In: IEEE Transactions on Information Theory, Vol. 53, No. 10, 01.10.2007, p. 3615-3628.

Research output: Contribution to journalArticle

@article{9bf7fb5e190348ea9275cf53d55446c0,
title = "Spatial model for energy burden balancing and data fusion in sensor networks detecting bursty events",
abstract = "In this paper, we propose a stochastic geometric model to study the energy burdens seen in a large scale hierarchical sensor network. The network makes use of aggregation nodes, for compression, filtering, and/ or data fusion of locally sensed data. Aggregation nodes (AGNs) then relay the traffic to mobile sinks. While aggregation may substantially reduce the overall traffic on the network, it may have the deleterious effect of concentrating loads on paths between AGNs and the sinks-such inhomogeneities in the energy burden may in turn lead to nodes with depleted energy reserves. To remedy this problem, we consider how one might achieve a more balanced energy burden across the network by spreading traffic, i.e., using a multiplicity of paths between AGNs and sinks. The proposed model reveals, how various aspects of the task at hand impact the characteristics of energy burdens on the network and in turn the lifetime for the system. We show that the scale of aggregation and degree of spreading can be optimized. Additionally, if the sensing activity involves large amounts of data flowing to sinks, then inhomogeneities in the energy burdens seen by nodes around the sinks will be hard to overcome, and indeed the network appears to scale poorly. By contrast, if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing.",
keywords = "Boolean model, Data fusion, Sensor networks, Stochastic geometry",
author = "Baek, {Seung Jun} and {de Veciana}, Gustavo",
year = "2007",
month = "10",
day = "1",
doi = "10.1109/TIT.2007.904970",
language = "English",
volume = "53",
pages = "3615--3628",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Spatial model for energy burden balancing and data fusion in sensor networks detecting bursty events

AU - Baek, Seung Jun

AU - de Veciana, Gustavo

PY - 2007/10/1

Y1 - 2007/10/1

N2 - In this paper, we propose a stochastic geometric model to study the energy burdens seen in a large scale hierarchical sensor network. The network makes use of aggregation nodes, for compression, filtering, and/ or data fusion of locally sensed data. Aggregation nodes (AGNs) then relay the traffic to mobile sinks. While aggregation may substantially reduce the overall traffic on the network, it may have the deleterious effect of concentrating loads on paths between AGNs and the sinks-such inhomogeneities in the energy burden may in turn lead to nodes with depleted energy reserves. To remedy this problem, we consider how one might achieve a more balanced energy burden across the network by spreading traffic, i.e., using a multiplicity of paths between AGNs and sinks. The proposed model reveals, how various aspects of the task at hand impact the characteristics of energy burdens on the network and in turn the lifetime for the system. We show that the scale of aggregation and degree of spreading can be optimized. Additionally, if the sensing activity involves large amounts of data flowing to sinks, then inhomogeneities in the energy burdens seen by nodes around the sinks will be hard to overcome, and indeed the network appears to scale poorly. By contrast, if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing.

AB - In this paper, we propose a stochastic geometric model to study the energy burdens seen in a large scale hierarchical sensor network. The network makes use of aggregation nodes, for compression, filtering, and/ or data fusion of locally sensed data. Aggregation nodes (AGNs) then relay the traffic to mobile sinks. While aggregation may substantially reduce the overall traffic on the network, it may have the deleterious effect of concentrating loads on paths between AGNs and the sinks-such inhomogeneities in the energy burden may in turn lead to nodes with depleted energy reserves. To remedy this problem, we consider how one might achieve a more balanced energy burden across the network by spreading traffic, i.e., using a multiplicity of paths between AGNs and sinks. The proposed model reveals, how various aspects of the task at hand impact the characteristics of energy burdens on the network and in turn the lifetime for the system. We show that the scale of aggregation and degree of spreading can be optimized. Additionally, if the sensing activity involves large amounts of data flowing to sinks, then inhomogeneities in the energy burdens seen by nodes around the sinks will be hard to overcome, and indeed the network appears to scale poorly. By contrast, if the sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing.

KW - Boolean model

KW - Data fusion

KW - Sensor networks

KW - Stochastic geometry

UR - http://www.scopus.com/inward/record.url?scp=35148876417&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35148876417&partnerID=8YFLogxK

U2 - 10.1109/TIT.2007.904970

DO - 10.1109/TIT.2007.904970

M3 - Article

VL - 53

SP - 3615

EP - 3628

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

ER -