A graph-center-based scheme for energy-efficient data collection in wireless sensor networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

2 Citations (Scopus)

Abstract

We consider the problem of sensor data collection in a wireless sensor network (WSN). The geographic deployment of sensors is random, with an irregular network topology. We propose a data collection scheme for the WSN, based on the concept of the center of the graph in graph theory. The purpose of the scheme is to use less power in the process of data collection. Because it is mostly true that the sensors of WSN are powered by batteries, power saving is an especially important issue in WSN. In this paper, we will propose the energy-saving scheme, and provide the experimental results. It is shown that under the energy consumption model used in the paper, the proposed scheme saves about 20% of the power collecting data from sensors.

Original languageEnglish
Title of host publicationMobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings
Pages579-587
Number of pages9
DOIs
StatePublished - 1 Dec 2006
Event2nd International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2006 - Hong Kong, China
Duration: 13 Dec 200615 Dec 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4325 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2006
CountryChina
CityHong Kong
Period13/12/0615/12/06

Fingerprint

Energy Efficient
Wireless Sensor Networks
Wireless sensor networks
Sensor
Sensors
Graph in graph theory
Power Saving
Graph theory
Energy Saving
Network Topology
Battery
Energy Consumption
Irregular
Energy conservation
Energy utilization
Topology
Experimental Results
Model

Keywords

  • Energy efficiency
  • Graph center
  • Hierarchical structures
  • Wireless networks
  • Wireless sensor networks

Cite this

Wang, D. (2006). A graph-center-based scheme for energy-efficient data collection in wireless sensor networks. In Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings (pp. 579-587). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4325 LNCS). https://doi.org/10.1007/11943952_49
Wang, Dajin. / A graph-center-based scheme for energy-efficient data collection in wireless sensor networks. Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings. 2006. pp. 579-587 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{906f24d412e14d399e9c5fdc18f70aa8,
title = "A graph-center-based scheme for energy-efficient data collection in wireless sensor networks",
abstract = "We consider the problem of sensor data collection in a wireless sensor network (WSN). The geographic deployment of sensors is random, with an irregular network topology. We propose a data collection scheme for the WSN, based on the concept of the center of the graph in graph theory. The purpose of the scheme is to use less power in the process of data collection. Because it is mostly true that the sensors of WSN are powered by batteries, power saving is an especially important issue in WSN. In this paper, we will propose the energy-saving scheme, and provide the experimental results. It is shown that under the energy consumption model used in the paper, the proposed scheme saves about 20{\%} of the power collecting data from sensors.",
keywords = "Energy efficiency, Graph center, Hierarchical structures, Wireless networks, Wireless sensor networks",
author = "Dajin Wang",
year = "2006",
month = "12",
day = "1",
doi = "10.1007/11943952_49",
language = "English",
isbn = "3540499326",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "579--587",
booktitle = "Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings",

}

Wang, D 2006, A graph-center-based scheme for energy-efficient data collection in wireless sensor networks. in Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4325 LNCS, pp. 579-587, 2nd International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2006, Hong Kong, China, 13/12/06. https://doi.org/10.1007/11943952_49

A graph-center-based scheme for energy-efficient data collection in wireless sensor networks. / Wang, Dajin.

Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings. 2006. p. 579-587 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4325 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - A graph-center-based scheme for energy-efficient data collection in wireless sensor networks

AU - Wang, Dajin

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We consider the problem of sensor data collection in a wireless sensor network (WSN). The geographic deployment of sensors is random, with an irregular network topology. We propose a data collection scheme for the WSN, based on the concept of the center of the graph in graph theory. The purpose of the scheme is to use less power in the process of data collection. Because it is mostly true that the sensors of WSN are powered by batteries, power saving is an especially important issue in WSN. In this paper, we will propose the energy-saving scheme, and provide the experimental results. It is shown that under the energy consumption model used in the paper, the proposed scheme saves about 20% of the power collecting data from sensors.

AB - We consider the problem of sensor data collection in a wireless sensor network (WSN). The geographic deployment of sensors is random, with an irregular network topology. We propose a data collection scheme for the WSN, based on the concept of the center of the graph in graph theory. The purpose of the scheme is to use less power in the process of data collection. Because it is mostly true that the sensors of WSN are powered by batteries, power saving is an especially important issue in WSN. In this paper, we will propose the energy-saving scheme, and provide the experimental results. It is shown that under the energy consumption model used in the paper, the proposed scheme saves about 20% of the power collecting data from sensors.

KW - Energy efficiency

KW - Graph center

KW - Hierarchical structures

KW - Wireless networks

KW - Wireless sensor networks

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

U2 - 10.1007/11943952_49

DO - 10.1007/11943952_49

M3 - Conference contribution

SN - 3540499326

SN - 9783540499329

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 579

EP - 587

BT - Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings

ER -

Wang D. A graph-center-based scheme for energy-efficient data collection in wireless sensor networks. In Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings. 2006. p. 579-587. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11943952_49