Energy Harvesting Aware Relay Node Addition for Power-Efficient Coverage in Wireless Sensor Networks
Loading...
Date
2015-01-11
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
CERIST
Abstract
This paper deals with power-efficient coverage in wireless sensor networks (WSN) by taking advantage of energyharvesting capabilities. A general scenario is considered for
deployed networks with two types of sensor nodes, harvesting enabled nodes (HNs), and none-harvesting nodes (NHNs). The aim is to use only the HNs for relaying packets, while NHNs use will be limited to sensing and transmitting their own readings.
The problem is modeled using graph theory and reduced to
finding the minimum weighted connected dominating set in a
vertex weighted graph. A limited number of relay nodes is added
at the positions close to the NHNs in the resulted set. The weight
function ensures minimizing the number of NHNs in the set, and
thus reducing the relay nodes to be added. Our contribution is
to consider relay node placement (addition) in energy harvesting
WSN, where only HNs are used to forward packets. This is to
preserve the limited energy of NHNs. Extensive simulation results
show that the proposed relay node addition strategy prolongs the network lifetime, from the double, to factors of several tens of times. This is at a reasonable cost in terms of the number of relay nodes added, which is compared to a lower-bound derived
in the paper.
This paper deals with power-efficient coverage in wireless sensor networks (WSN) by taking advantage of energy-harvesting capabilities. A general scenario is considered for deployed networks with two types of sensor nodes, harvesting enabled nodes (HNs), and none-harvesting nodes (NHNs). The aim is to use only the HNs for relaying packets, while NHNs use will be limited to sensing and transmitting their own readings. The problem is modeled using graph theory and reduced to finding the minimum weighted connected dominating set in a vertex weighted graph. A limited number of relay nodes is added at the positions close to the NHNs in the resulted set. The weight function ensures minimizing the number of NHNs in the set, and thus reducing the relay nodes to be added. Our contribution is to consider relay node placement (addition) in energy harvesting WSN, where only HNs are used to forward packets. This is to preserve the limited energy of NHNs. Extensive simulation results show that the proposed relay node addition strategy prolongs the network lifetime, from the double, to factors of several tens of times. This is at a reasonable cost in terms of the number of relay nodes added, which is compared to a lower-bound derived in the paper.
This paper deals with power-efficient coverage in wireless sensor networks (WSN) by taking advantage of energy-harvesting capabilities. A general scenario is considered for deployed networks with two types of sensor nodes, harvesting enabled nodes (HNs), and none-harvesting nodes (NHNs). The aim is to use only the HNs for relaying packets, while NHNs use will be limited to sensing and transmitting their own readings. The problem is modeled using graph theory and reduced to finding the minimum weighted connected dominating set in a vertex weighted graph. A limited number of relay nodes is added at the positions close to the NHNs in the resulted set. The weight function ensures minimizing the number of NHNs in the set, and thus reducing the relay nodes to be added. Our contribution is to consider relay node placement (addition) in energy harvesting WSN, where only HNs are used to forward packets. This is to preserve the limited energy of NHNs. Extensive simulation results show that the proposed relay node addition strategy prolongs the network lifetime, from the double, to factors of several tens of times. This is at a reasonable cost in terms of the number of relay nodes added, which is compared to a lower-bound derived in the paper.
Description
Keywords
Energy Harvesting, wireless sensor network, Relay node placement