An efficient heuristic for selecting active nodes in wireless sensor networks

被引:29
作者
Delicato, Flavia
Protti, Fabio
Pirmez, Luci
de Rezende, Jose Ferreira
机构
[1] Univ Fed Rio de Janeiro, Nucleo Comp Eletron, BR-20001970 Rio De Janeiro, Brazil
[2] Univ Fed Rio de Janeiro, Grp Teleinformat & Automacao, BR-20001970 Rio De Janeiro, Brazil
[3] Univ Fed Rio de Janeiro, Inst Matemat, BR-20001970 Rio De Janeiro, Brazil
[4] Univ Fed Rio de Janeiro, COPPE, Programa Engn Eletr, BR-20001970 Rio De Janeiro, Brazil
关键词
management of wireless sensor networks; Knapsack problem;
D O I
10.1016/j.comnet.2006.04.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 naive scheme for node selection, achieving large energy savings while preserving QoS requirements. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:3701 / 3720
页数:20
相关论文
共 26 条
[1]  
ABOWD GD, 2000, IEEE PERS COMMUN, V1, P36
[2]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[3]  
[Anonymous], 2000, 527 USC INF SCI I
[4]  
[Anonymous], 2003, Elsevier AdHoc Networks Journal
[5]  
[Anonymous], P 1 ACM INT WORKSH W
[6]  
BAUER P, 2000, P IEEE INT C INF TEC
[7]  
BOULIS A, 2003, P 1 IEEE WORKSH SENS
[8]  
CERPA A, 2002, P 21 ANN JOINT C IEE
[9]   Grid coverage for surveillance and target location in distributed sensor networks [J].
Chakrabarty, K ;
Iyengar, SS ;
Qi, HR ;
Cho, EC .
IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (12) :1448-1453
[10]  
CHEN B, 2001, P ACM SIGMOBILE ANN