Next Article in Journal
Mapping Sensory Spots for Moderate Temperatures on the Back of Hand
Next Article in Special Issue
Link Connectivity and Coverage of Underwater Cognitive Acoustic Networks under Spectrum Constraint
Previous Article in Journal
A Robust Indoor/Outdoor Navigation Filter Fusing Data from Vision and Magneto-Inertial Measurement Unit
Previous Article in Special Issue
Optimal Quantization Scheme for Data-Efficient Target Tracking via UWSNs Using Quantized Measurements
Article Menu
Issue 12 (December) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(12), 2807; doi:10.3390/s17122807

Node Depth Adjustment Based Target Tracking in UWSNs Using Improved Harmony Search

1
State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China
2
College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
3
School of Marine Science and Technology, Northwestern Polytechnical University, Xi’an 710072, China
*
Author to whom correspondence should be addressed.
Received: 4 November 2017 / Revised: 28 November 2017 / Accepted: 29 November 2017 / Published: 4 December 2017
(This article belongs to the Special Issue Advances and Challenges in Underwater Sensor Networks)
View Full-Text   |   Download PDF [429 KB, uploaded 5 December 2017]   |  

Abstract

Underwater wireless sensor networks (UWSNs) can provide a promising solution to underwater target tracking. Due to the limited computation and bandwidth resources, only a small part of nodes are selected to track the target at each interval. How to improve tracking accuracy with a small number of nodes is a key problem. In recent years, a node depth adjustment system has been developed and applied to issues of network deployment and routing protocol. As far as we know, all existing tracking schemes keep underwater nodes static or moving with water flow, and node depth adjustment has not been utilized for underwater target tracking yet. This paper studies node depth adjustment method for target tracking in UWSNs. Firstly, since a Fisher Information Matrix (FIM) can quantify the estimation accuracy, its relation to node depth is derived as a metric. Secondly, we formulate the node depth adjustment as an optimization problem to determine moving depth of activated node, under the constraint of moving range, the value of FIM is used as objective function, which is aimed to be minimized over moving distance of nodes. Thirdly, to efficiently solve the optimization problem, an improved Harmony Search (HS) algorithm is proposed, in which the generating probability is modified to improve searching speed and accuracy. Finally, simulation results are presented to verify performance of our scheme. View Full-Text
Keywords: target tracking; node depth adjustment; improved harmony search; underwater wireless sensor networks target tracking; node depth adjustment; improved harmony search; underwater wireless sensor networks
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Liu, M.; Zhang, D.; Zhang, S.; Zhang, Q. Node Depth Adjustment Based Target Tracking in UWSNs Using Improved Harmony Search. Sensors 2017, 17, 2807.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top