List of Articles Target Tracking

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Introducing a new optimal energy method for targets tracking in wireless sensor network using a hunting search algorithm
  Shayesteh Tabatabaei Hassan Nosrati Nahook
  In this paper, in order to increase the accuracy of target tracking, it tries to reduce the energy consumption of sensors with a new algorithm for tracking distributed targets called hunting search algorithm. The proposed method is compared with the DCRRP protocol and t More

  In this paper, in order to increase the accuracy of target tracking, it tries to reduce the energy consumption of sensors with a new algorithm for tracking distributed targets called hunting search algorithm. The proposed method is compared with the DCRRP protocol and the NODIC protocol, which uses the OPNET simulator version 11.5 to test the performance of these algorithms. The simulation results show that the proposed algorithm performs better than the other two protocols in terms of energy consumption, healthy delivery rate and throughput rate. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - An Adaptive Multi-Objective Clustering Algorithm based on Auction_Prediction for Mobile Target Tracking in Wireless Sensor Network
  Roghieh Alinezhad Sepideh Adabi arash Sharifi
  One of the applications of sensor networks is to track moving target. In designing the algorithm for target tracking two issues are of importance: reduction of energy consumption and improvement of the tracking quality. One of the solutions for reduction of energy consu More

  One of the applications of sensor networks is to track moving target. In designing the algorithm for target tracking two issues are of importance: reduction of energy consumption and improvement of the tracking quality. One of the solutions for reduction of energy consumption is to form a tracking cluster. Two major challenges in formation of the tracking cluster are when and how it should be formed. To decrease the number of messages which are exchanged to form the tracking cluster an auction mechanism is adopted. The sensor’s bid in an auction is dynamically and independently determined with the aim of establishing an appropriate tradeoff between network lifetime and the accuracy of tracking. Furthermore, since the tracking cluster should be formed and activated before the target arrives to the concerned region (especially in high speed of target), avoidance from delay in formation of the tracking cluster is another challenge. Not addressing the mentioned challenge results in increased target missing rate and consequently energy loss. To overcome this challenge, it is proposed to predict the target’s position in the next two steps by using neural network and then, simultaneously form the tracking clusters in the next one and two steps. The results obtained from simulation indicate that the proposed algorithm outperforms AASA (Auction-based Adaptive Sensor Activation). Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - A New Power Allocation Optimization for One Target Tracking in Widely Separated MIMO Radar
  Mohammad Akhondi Darzikolaei Mohammad Reza Karami-Mollaei Maryam Najimi
  10.61186/jist.39531.11.44.294
  In this paper, a new power allocation scheme for one target tracking in MIMO radar with widely dispersed antennas is designed. This kind of radar applies multiple antennas which are deployed widely dispersed from each other. Therefore, a target is observed simultaneousl More

  In this paper, a new power allocation scheme for one target tracking in MIMO radar with widely dispersed antennas is designed. This kind of radar applies multiple antennas which are deployed widely dispersed from each other. Therefore, a target is observed simultaneously from different uncorrelated angles and it offers spatial diversity. In this radar, a target’s radar cross section (RCS) is different in each transmit-receive path. So, a random complex Gaussian RCS is supposed for one target. Power allocation is used to allocate the optimum power to each transmit antenna and avoid illuminating the extra power in the environment and hiding it from interception. This manuscript aims to minimize the target tracking error with constraints on total transmit power and the power of each transmit antenna. For calculation of target tracking error, the joint Cramer Rao bound for a target velocity and position is computed and this is assumed as an objective function of the problem. It should be noted that a target RCS is also considered as unknown parameter and it is estimated along with target parameters. This makes a problem more similar to real conditions. After the investigation of the problem convexity, the problem is solved by particle swarm optimization (PSO) and sequential quadratic programming (SQP) algorithms. Then, various scenarios are simulated to evaluate the proposed scheme. The simulation results validate the accuracy and the effectiveness of the power allocation structure for target tracking in MIMO radar with widely separated antennas. Manuscript profile