A survey of sensor selection schemes in wireless sensor networks

被引:34
作者
Rowaihy, Hosam [1 ]
Eswaran, Sharanya [1 ]
Johnson, Matthew [2 ]
Verma, Dinesh [3 ]
Bar-Noy, Amotz [2 ]
Brown, Theodore [2 ]
La Porta, Thomas [1 ]
机构
[1] Penn State Univ, University Pk, PA 16802 USA
[2] CUNY, New York, NY 10021 USA
[3] IBM TJ Watson Res Ctr, Yorktown Hts, NY USA
来源
UNATTENDED GROUND, SEA, AND AIR SENSOR TECHNOLOGIES AND APPLICATIONS IX | 2007年 / 6562卷
关键词
D O I
10.1117/12.723514
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
One of the main goals of sensor networks is to provide accurate information about a sensing field for an extended period of time. This requires collecting measurements from as many sensors as possible to have a better view of the sensor surroundings. However, due to energy limitations and to prolong the network lifetime, the number of active sensors should be kept to a minimum. To resolve this conflict of interest, sensor selection schemes are used. In this paper, we survey different schemes that are used to select sensors. Based on the purpose of selection, we classify the schemes into (1) coverage schemes, (2) target tracking and localization schemes, (3) single mission assignment schemes and (4) multiple missions assignment schemes. We also look at solutions to relevant problems from other areas and consider their applicability to sensor networks. Finally, we take a look at the open research problems in this field.
引用
收藏
页数:13
相关论文
共 31 条
  • [1] Ahuja R.K., 1993, NETWORK FLOWS THEORY
  • [2] Ai Jing, 2006, J COMBINATORIAL OPTI
  • [3] [Anonymous], P IEEE C WIR COMM NE
  • [4] Aurenhammer F., 1991, ACM COMPUTING SURVEY
  • [5] BERNARDO JM, 1996, BAYESIAN THEORY
  • [6] Bian F, 2006, P IEEE C INF PROC SE
  • [7] BISDIKIAN C, 2007, 3 IEEE WORKSH SENS N
  • [8] BYERS J, 2000, P IEEE WORKSH MOB AD
  • [9] CARDEI M, 2005, ACM WIRELESS NETWORK
  • [10] ERTIN E, 2003, P 2 INT WORKSH INF P