DCTC

Dynamic convoy tree-based collaboration for target tracking in sensor networks

Wensheng Zhang, Guohong Cao

Research output: Contribution to journalArticle

383 Citations (Scopus)

Abstract

Most existing work on sensor networks concentrates on finding efficient ways to forward data from the information source to the data centers, and not much work has been done on collecting local data and generating the data report. This paper studies this issue by proposing techniques to detect and track a mobile target. We introduce the concept of dynamic convoy tree-based collaboration, and formalize it as a multiple objective optimization problem which needs to find a convoy tree sequence with high tree coverage and low energy consumption. We propose an optimal solution which achieves 100% coverage and minimizes the energy consumption under certain ideal situations. Considering the real constraints of a sensor network, we propose several practical implementations: the conservative scheme and the prediction-based scheme for tree expansion and pruning; the sequential and the localized reconfiguration schemes for tree reconfiguration. Extensive experiments are conducted to compare the practical implementations and the optimal solution. The results show that the prediction-based scheme outperforms the conservative scheme and it can achieve similar coverage and energy consumption to the optimal solution. The experiments also show that the localized reconfiguration scheme outperforms the sequential reconfiguration scheme when the node density is high, and the trend is reversed when the node density is low.

Original languageEnglish (US)
Pages (from-to)1689-1701
Number of pages13
JournalIEEE Transactions on Wireless Communications
Volume3
Issue number5
DOIs
StatePublished - Sep 1 2004

Fingerprint

Target Tracking
Target tracking
Sensor networks
Sensor Networks
Energy utilization
Reconfiguration
Energy Consumption
Coverage
Optimal Solution
Experiments
Multiple Objective Optimization
Prediction
Data Center
Vertex of a graph
Collaboration
Pruning
Experiment
Optimization Problem
Minimise
Target

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{d0e0d73eee794ed88921a2785d816fbb,
title = "DCTC: Dynamic convoy tree-based collaboration for target tracking in sensor networks",
abstract = "Most existing work on sensor networks concentrates on finding efficient ways to forward data from the information source to the data centers, and not much work has been done on collecting local data and generating the data report. This paper studies this issue by proposing techniques to detect and track a mobile target. We introduce the concept of dynamic convoy tree-based collaboration, and formalize it as a multiple objective optimization problem which needs to find a convoy tree sequence with high tree coverage and low energy consumption. We propose an optimal solution which achieves 100{\%} coverage and minimizes the energy consumption under certain ideal situations. Considering the real constraints of a sensor network, we propose several practical implementations: the conservative scheme and the prediction-based scheme for tree expansion and pruning; the sequential and the localized reconfiguration schemes for tree reconfiguration. Extensive experiments are conducted to compare the practical implementations and the optimal solution. The results show that the prediction-based scheme outperforms the conservative scheme and it can achieve similar coverage and energy consumption to the optimal solution. The experiments also show that the localized reconfiguration scheme outperforms the sequential reconfiguration scheme when the node density is high, and the trend is reversed when the node density is low.",
author = "Wensheng Zhang and Guohong Cao",
year = "2004",
month = "9",
day = "1",
doi = "10.1109/TWC.2004.833443",
language = "English (US)",
volume = "3",
pages = "1689--1701",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

DCTC : Dynamic convoy tree-based collaboration for target tracking in sensor networks. / Zhang, Wensheng; Cao, Guohong.

In: IEEE Transactions on Wireless Communications, Vol. 3, No. 5, 01.09.2004, p. 1689-1701.

Research output: Contribution to journalArticle

TY - JOUR

T1 - DCTC

T2 - Dynamic convoy tree-based collaboration for target tracking in sensor networks

AU - Zhang, Wensheng

AU - Cao, Guohong

PY - 2004/9/1

Y1 - 2004/9/1

N2 - Most existing work on sensor networks concentrates on finding efficient ways to forward data from the information source to the data centers, and not much work has been done on collecting local data and generating the data report. This paper studies this issue by proposing techniques to detect and track a mobile target. We introduce the concept of dynamic convoy tree-based collaboration, and formalize it as a multiple objective optimization problem which needs to find a convoy tree sequence with high tree coverage and low energy consumption. We propose an optimal solution which achieves 100% coverage and minimizes the energy consumption under certain ideal situations. Considering the real constraints of a sensor network, we propose several practical implementations: the conservative scheme and the prediction-based scheme for tree expansion and pruning; the sequential and the localized reconfiguration schemes for tree reconfiguration. Extensive experiments are conducted to compare the practical implementations and the optimal solution. The results show that the prediction-based scheme outperforms the conservative scheme and it can achieve similar coverage and energy consumption to the optimal solution. The experiments also show that the localized reconfiguration scheme outperforms the sequential reconfiguration scheme when the node density is high, and the trend is reversed when the node density is low.

AB - Most existing work on sensor networks concentrates on finding efficient ways to forward data from the information source to the data centers, and not much work has been done on collecting local data and generating the data report. This paper studies this issue by proposing techniques to detect and track a mobile target. We introduce the concept of dynamic convoy tree-based collaboration, and formalize it as a multiple objective optimization problem which needs to find a convoy tree sequence with high tree coverage and low energy consumption. We propose an optimal solution which achieves 100% coverage and minimizes the energy consumption under certain ideal situations. Considering the real constraints of a sensor network, we propose several practical implementations: the conservative scheme and the prediction-based scheme for tree expansion and pruning; the sequential and the localized reconfiguration schemes for tree reconfiguration. Extensive experiments are conducted to compare the practical implementations and the optimal solution. The results show that the prediction-based scheme outperforms the conservative scheme and it can achieve similar coverage and energy consumption to the optimal solution. The experiments also show that the localized reconfiguration scheme outperforms the sequential reconfiguration scheme when the node density is high, and the trend is reversed when the node density is low.

UR - http://www.scopus.com/inward/record.url?scp=7544235797&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=7544235797&partnerID=8YFLogxK

U2 - 10.1109/TWC.2004.833443

DO - 10.1109/TWC.2004.833443

M3 - Article

VL - 3

SP - 1689

EP - 1701

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 5

ER -