A scalable model for energy load balancing in large-scale sensor networks

Seung Jun Baek, Gustavo De Veciana

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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

Original languageEnglish
Title of host publication2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006
DOIs
Publication statusPublished - 2006 Dec 1
Event2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006 - Boston, MA, United States
Duration: 2006 Feb 262006 Mar 2

Other

Other2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006
CountryUnited States
CityBoston, MA
Period06/2/2606/3/2

Fingerprint

Dynamic loads
Load Balancing
Sensor networks
Resource allocation
Sensor Networks
Agglomeration
Aggregation
Energy
Traffic
Vertex of a graph
Inhomogeneity
Model
Data fusion
Stochastic models
Path
Geometric Model
Data Fusion
Balancing
Relay
Stochastic Model

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modelling and Simulation

Cite this

Baek, S. J., & De Veciana, G. (2006). A scalable model for energy load balancing in large-scale sensor networks. In 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006 [1666518] https://doi.org/10.1109/WIOPT.2006.1666518

A scalable model for energy load balancing in large-scale sensor networks. / Baek, Seung Jun; De Veciana, Gustavo.

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006. 2006. 1666518.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baek, SJ & De Veciana, G 2006, A scalable model for energy load balancing in large-scale sensor networks. in 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006., 1666518, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006, Boston, MA, United States, 06/2/26. https://doi.org/10.1109/WIOPT.2006.1666518
Baek SJ, De Veciana G. A scalable model for energy load balancing in large-scale sensor networks. In 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006. 2006. 1666518 https://doi.org/10.1109/WIOPT.2006.1666518
Baek, Seung Jun ; De Veciana, Gustavo. / A scalable model for energy load balancing in large-scale sensor networks. 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006. 2006.
@inproceedings{12bc23c5f6344bb1b9a31c9e30e19876,
title = "A scalable model for energy load balancing in large-scale sensor networks",
abstract = "In this paper we propose a stochastic geometric model to study energy burdens seen in a large scale hirarchical sensor network. network makes a natural use of aggregation nodes, for compression, filtering or data fusion of local sensed data. Aggregation nodes (AGN) then relay traffic to mobile sinks. While aggregation may substantially reduce overall traffic on network it may have a deleterious effect of concentrating loads on paths between AGNs and sinks - such inhomogeneities in energy burdens may in turn lead to nodes with depleted energy reserves. To remedy this problem we consider how one might achieve more balanced energy burdens across network by spreading traffic, i.e., using a multiplicity of paths between AGNs and sinks. proposed model reveals, how various aspects of task at hand impact characteristics of energy burdens on network and in turn likely lifetime for system. We show that scale of aggregation and degree of spreading might need and can be optimized. Additionally if sensing activity involves large amounts of data flowing to sinks, then inhomogeneities in energy burdens seen by nodes around sinks will be hard to overcome, and indeed network appears to scale poorly. By contrast if sensed data is bursty in space and time, then one can reap substantial benefits from aggregation and balancing.",
author = "Baek, {Seung Jun} and {De Veciana}, Gustavo",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/WIOPT.2006.1666518",
language = "English",
isbn = "0780395492",
booktitle = "2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006",

}

TY - GEN

T1 - A scalable model for energy load balancing in large-scale sensor networks

AU - Baek, Seung Jun

AU - De Veciana, Gustavo

PY - 2006/12/1

Y1 - 2006/12/1

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

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

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

U2 - 10.1109/WIOPT.2006.1666518

DO - 10.1109/WIOPT.2006.1666518

M3 - Conference contribution

AN - SCOPUS:84886461708

SN - 0780395492

SN - 9780780395497

BT - 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2006

ER -