An efficient heuristic for selecting active nodes in wireless sensor networks

  • Authors:

  • Flávia Delicato;Fábio Protti;Luci Pirmez;José Ferreira de Rezende

  • Affiliations:

  • Núcleo de Compuação Eletrônica, Univ. Fed. do Rio de Janeiro and Grupo de Teleinformática e Automação, Univ. Fed. do Rio de Janeiro and Prog. de Engenharia El ...;Núcleo de Compuação Eletrôniea, Universidade Federal do Rio de Janeiro, RJ, Brazil and Instituto de Matemátiea, Universidade Federal do Rio de Janeiro, RJ, Brazil;Núcleo de Compuação Eletrôniea, Universidade Federal do Rio de Janeiro, RJ, Brazil;Grupo de Teleinformática e Automação, Universidade Federal do Rio de Janeiro, RJ, Brazil and Programa de Engenharia Elétriea - COPPE, Universidade Federal do Rio de Janeiro, RJ ...

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Energy saving is a paramount concern in wireless sensor networks (WSNs). A strategy for energy saving is to cleverly manage the duty cycle of sensors, by dynamically activating different sets of sensors while non-active nodes are kept in a power save mode. We propose a simple and efficient approach for selecting active nodes in WSNs. Our primary goal is to maximize residual energy and application relevance of selected nodes to extend the network lifetime while meeting application-specific QoS requirements. We formalize the problem of node selection as a knapsack problem and adopt a greedy heuristic for solving it. An environmental monitoring application is chosen to derive some specific requirements. Analyses and simulations were performed and the impact of various parameters on the process of node selection was investigated. Results show that our approach outperforms a naïve scheme for node selection, achieving large energy savings while preserving QoS requirements.