Power aware routing for sensor databases

Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri

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

92 Citations (Scopus)

Abstract

Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), and high communication costs, design of energy efficient communication algorithms is of great importance. The data flow in a sensor database is very different from data flow in an ordinary network and poses novel challenges in designing efficient routing algorithms. In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. We give a constant factor approximation algorithm for one class of query, and for other queries give heuristic algorithms. We evaluate the efficiency of the proposed algorithms by simulation and demonstrate their near optimal performance for various network sizes.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
EditorsK. Makki, E. Knightly
Pages1747-1757
Number of pages11
Volume3
DOIs
Publication statusPublished - 10 Oct 2005
Externally publishedYes
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: 13 Mar 200517 Mar 2005

Other

OtherIEEE INFOCOM 2005
CountryUnited States
CityMiami, FL
Period13/3/0517/3/05

Fingerprint

Sensors
Communication
Approximation algorithms
Routing algorithms
Heuristic algorithms
Sensor networks
Wireless sensor networks
Computational complexity
Costs

Keywords

  • Graph theory
  • Mathematical programming/optimization
  • Sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Buragohain, C., Agrawal, D., & Suri, S. (2005). Power aware routing for sensor databases. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM (Vol. 3, pp. 1747-1757) https://doi.org/10.1109/INFCOM.2005.1498455

Power aware routing for sensor databases. / Buragohain, Chiranjeeb; Agrawal, Divyakant; Suri, Subhash.

Proceedings - IEEE INFOCOM. ed. / K. Makki; E. Knightly. Vol. 3 2005. p. 1747-1757.

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

Buragohain, C, Agrawal, D & Suri, S 2005, Power aware routing for sensor databases. in K Makki & E Knightly (eds), Proceedings - IEEE INFOCOM. vol. 3, pp. 1747-1757, IEEE INFOCOM 2005, Miami, FL, United States, 13/3/05. https://doi.org/10.1109/INFCOM.2005.1498455
Buragohain C, Agrawal D, Suri S. Power aware routing for sensor databases. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM. Vol. 3. 2005. p. 1747-1757 https://doi.org/10.1109/INFCOM.2005.1498455
Buragohain, Chiranjeeb ; Agrawal, Divyakant ; Suri, Subhash. / Power aware routing for sensor databases. Proceedings - IEEE INFOCOM. editor / K. Makki ; E. Knightly. Vol. 3 2005. pp. 1747-1757
@inproceedings{531f35ab25554764826d6f66d2c2c919,
title = "Power aware routing for sensor databases",
abstract = "Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), and high communication costs, design of energy efficient communication algorithms is of great importance. The data flow in a sensor database is very different from data flow in an ordinary network and poses novel challenges in designing efficient routing algorithms. In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. We give a constant factor approximation algorithm for one class of query, and for other queries give heuristic algorithms. We evaluate the efficiency of the proposed algorithms by simulation and demonstrate their near optimal performance for various network sizes.",
keywords = "Graph theory, Mathematical programming/optimization, Sensor networks",
author = "Chiranjeeb Buragohain and Divyakant Agrawal and Subhash Suri",
year = "2005",
month = "10",
day = "10",
doi = "10.1109/INFCOM.2005.1498455",
language = "English",
isbn = "0780389689",
volume = "3",
pages = "1747--1757",
editor = "K. Makki and E. Knightly",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Power aware routing for sensor databases

AU - Buragohain, Chiranjeeb

AU - Agrawal, Divyakant

AU - Suri, Subhash

PY - 2005/10/10

Y1 - 2005/10/10

N2 - Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), and high communication costs, design of energy efficient communication algorithms is of great importance. The data flow in a sensor database is very different from data flow in an ordinary network and poses novel challenges in designing efficient routing algorithms. In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. We give a constant factor approximation algorithm for one class of query, and for other queries give heuristic algorithms. We evaluate the efficiency of the proposed algorithms by simulation and demonstrate their near optimal performance for various network sizes.

AB - Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures to extract and manage data in such networks. Since sensors have significant power constraints (battery life), and high communication costs, design of energy efficient communication algorithms is of great importance. The data flow in a sensor database is very different from data flow in an ordinary network and poses novel challenges in designing efficient routing algorithms. In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. We give a constant factor approximation algorithm for one class of query, and for other queries give heuristic algorithms. We evaluate the efficiency of the proposed algorithms by simulation and demonstrate their near optimal performance for various network sizes.

KW - Graph theory

KW - Mathematical programming/optimization

KW - Sensor networks

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

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

U2 - 10.1109/INFCOM.2005.1498455

DO - 10.1109/INFCOM.2005.1498455

M3 - Conference contribution

SN - 0780389689

VL - 3

SP - 1747

EP - 1757

BT - Proceedings - IEEE INFOCOM

A2 - Makki, K.

A2 - Knightly, E.

ER -