Performance evaluation of selective and adaptive heads clustering algorithms over wireless sensor networks

被引:63
作者
Darabkh, Khalid A. [1 ]
Ismail, Shereen S. [2 ]
Al-Shurman, Mohammad [3 ]
Jafar, Iyad F. [1 ]
Alkhader, Eman [4 ]
Al-Mistarihi, Mamoun F. [5 ]
机构
[1] Univ Jordan, Dept Comp Engn, Amman 11942, Jordan
[2] Al Zaytoonah Univ Jordan, Dept Elect Engn, Amman 11733, Jordan
[3] Jordan Univ Sci & Technol, Dept Network Engn & Secur, Irbid 22110, Jordan
[4] Isra Univ, Dept Elect Engn, Amman 11622, Jordan
[5] Jordan Univ Sci & Technol, Dept Elect Engn, Irbid 22110, Jordan
关键词
Wireless sensor networks; New clustering algorithms; Object tracking; Energy consumption; Tracking error; Target speed; Sensor density; OBJECT TRACKING; ENERGY-EFFICIENT;
D O I
10.1016/j.jnca.2012.08.008
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Target tracking in wireless sensor networks can be considered as a milestone of a wide range of applications to permanently report, through network sensors, the positions of a mobile target to the base station during its move across a certain path. While tracking a mobile target, a lot of open challenges arise and need to be investigated and maintained which mainly include energy efficiency and tracking accuracy. In this paper, we propose three algorithms for tracking a mobile target in wireless sensor network utilizing cluster-based architecture, namely adaptive head, static head, and selective static head. Our goal is to achieve a promising tracking accuracy and energy efficiency by choosing the candidate sensor nodes nearby the target to participate in the tracking process while preserving the others in sleep state. Through Matlab simulation, we investigate the performance of the proposed algorithms in terms of energy consumption, tracking error, sensor density, as well as target speed. The results show that the adaptive head is the most efficient algorithm in terms of energy consumption while static and selective static heads algorithms are preferred as far as the tracking error is concerned especially when the target moves rapidly. Furthermore, the effectiveness of our proposed algorithms is verified through comparing their results with those obtained from previous algorithms. (c) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2068 / 2080
页数:13
相关论文
共 45 条
[1]   A survey on clustering algorithms for wireless sensor networks [J].
Abbasi, Ameer Ahmed ;
Younis, Mohamed .
COMPUTER COMMUNICATIONS, 2007, 30 (14-15) :2826-2841
[2]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[3]  
[Anonymous], 2 WORKSH INF PROC SE
[4]  
[Anonymous], P 26 IEEE C COMP COM
[5]  
[Anonymous], P 1 IEEE INT C EM TR
[6]  
[Anonymous], 2008, P 2008 EUROPEAN SIGN
[7]  
[Anonymous], 2011, WIRELESS SENSOR NETW
[8]  
[Anonymous], P IEEE INT C COMP TE
[9]  
[Anonymous], J AD HOC NETWORKS AC
[10]  
[Anonymous], P 4 IEEE INT C SENS