DMCA
Data Gathering Algorithms in Sensor Networks Using Energy Metrics (2002)
Cached
Download Links
| Venue: | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS |
| Citations: | 226 - 2 self |
BibTeX
@ARTICLE{Lindsey02datagathering,
author = {Stephanie Lindsey and Cauligi Raghavendra and Krishna M. Sivalingam},
title = {Data Gathering Algorithms in Sensor Networks Using Energy Metrics},
journal = {IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS},
year = {2002},
volume = {13},
number = {9},
pages = {924--935}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operating the sensor network for a long period of time. In [12], a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. There is some fixed amount of energy cost in the electronics when transmitting or receiving a packet and a variable cost when transmitting a packet which depends on the distance of transmission. If each node transmits its sensed data directly to the base station, then it will deplete its power quickly. The LEACH protocol presented in [12] is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster-heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvement compared to direct transmissions, as measured in terms of when nodes die. An improved version of LEACH, called LEACH-C, is presented in [14], where the central base station performs the clustering to improve energy efficiency. In this paper, we present an improved scheme, called PEGASIS (Power-Efficient GAthering in Sensor Information Systems), which is a near-optimal chain-based protocol that minimizes energy. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 200 percent when 1 percent, 25 percent, 50 percent, and 100 percent of nodes die for different network sizes and topologies. For many applications, in addition to minimizing energy, it is also important to consider the delay incurred in gathering sensed data. We capture this with the energy delay metric and
Keyphrases
base station sensor network using energy metric data gathering algorithm improved version sensor network many application wireless communication useful information leach protocol power-efficient gathering close neighbor central base station limited battery power long period variable cost different network size energy cost energy delay sensor information system sensor node fixed amount sensed data data collection problem distant base station energy efficiency energy efficient manner simulation result near-optimal chain-based protocol improved scheme sensed information elegant solution
