MCTA: Target tracking algorithm based on minimal contour in wireless sensor networks

Jaehoon Jeong, Taehyun Hwang, Tian He, David Du

Research output: Chapter in Book/Report/Conference proceedingConference contribution

58 Citations (Scopus)

Abstract

This paper proposes a minimal contour tracking algorithm (MCTA) that reduces energy consumption for tracking mobile targets in wireless sensor networks in terms of sensing and communication energy consumption. MCTA conserves energy by letting only a minimum number of sensor nodes participate in communication and perform sensing for target tracking. MCTA uses the minimal tracking area based on the vehicular kinematics. The modeling of target's kinematics allows for pruning out part of the tracking area that cannot be mechanically visited by the mobile target within scheduled time. So, MCTA sends the tracking area information to only the sensor nodes within minimal tracking area and wakes them up. Compared to the legacy scheme which uses circle-based tracking area, our proposed scheme uses less number of sensors for tracking in both communication and sensing without target missing. Through simulation, we show that MCTA outperforms the circle-based scheme with about 60% energy saving under certain ideal situations.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages2371-2375
Number of pages5
DOIs
StatePublished - 2007
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: May 6 2007May 12 2007

Other

OtherIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
CountryUnited States
CityAnchorage, AK
Period5/6/075/12/07

Fingerprint

Target tracking
Wireless sensor networks
Sensor nodes
Communication
Kinematics
Energy utilization
Energy conservation
Sensors

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Jeong, J., Hwang, T., He, T., & Du, D. (2007). MCTA: Target tracking algorithm based on minimal contour in wireless sensor networks. In Proceedings - IEEE INFOCOM (pp. 2371-2375). [4215865] https://doi.org/10.1109/INFCOM.2007.283

MCTA : Target tracking algorithm based on minimal contour in wireless sensor networks. / Jeong, Jaehoon; Hwang, Taehyun; He, Tian; Du, David.

Proceedings - IEEE INFOCOM. 2007. p. 2371-2375 4215865.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jeong, J, Hwang, T, He, T & Du, D 2007, MCTA: Target tracking algorithm based on minimal contour in wireless sensor networks. in Proceedings - IEEE INFOCOM., 4215865, pp. 2371-2375, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, United States, 5/6/07. https://doi.org/10.1109/INFCOM.2007.283
Jeong, Jaehoon ; Hwang, Taehyun ; He, Tian ; Du, David. / MCTA : Target tracking algorithm based on minimal contour in wireless sensor networks. Proceedings - IEEE INFOCOM. 2007. pp. 2371-2375
@inproceedings{17d3f816a3f44842883a880912ecfea3,
title = "MCTA: Target tracking algorithm based on minimal contour in wireless sensor networks",
abstract = "This paper proposes a minimal contour tracking algorithm (MCTA) that reduces energy consumption for tracking mobile targets in wireless sensor networks in terms of sensing and communication energy consumption. MCTA conserves energy by letting only a minimum number of sensor nodes participate in communication and perform sensing for target tracking. MCTA uses the minimal tracking area based on the vehicular kinematics. The modeling of target's kinematics allows for pruning out part of the tracking area that cannot be mechanically visited by the mobile target within scheduled time. So, MCTA sends the tracking area information to only the sensor nodes within minimal tracking area and wakes them up. Compared to the legacy scheme which uses circle-based tracking area, our proposed scheme uses less number of sensors for tracking in both communication and sensing without target missing. Through simulation, we show that MCTA outperforms the circle-based scheme with about 60{\%} energy saving under certain ideal situations.",
author = "Jaehoon Jeong and Taehyun Hwang and Tian He and David Du",
year = "2007",
doi = "10.1109/INFCOM.2007.283",
language = "English (US)",
isbn = "1424410479",
pages = "2371--2375",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - MCTA

T2 - Target tracking algorithm based on minimal contour in wireless sensor networks

AU - Jeong, Jaehoon

AU - Hwang, Taehyun

AU - He, Tian

AU - Du, David

PY - 2007

Y1 - 2007

N2 - This paper proposes a minimal contour tracking algorithm (MCTA) that reduces energy consumption for tracking mobile targets in wireless sensor networks in terms of sensing and communication energy consumption. MCTA conserves energy by letting only a minimum number of sensor nodes participate in communication and perform sensing for target tracking. MCTA uses the minimal tracking area based on the vehicular kinematics. The modeling of target's kinematics allows for pruning out part of the tracking area that cannot be mechanically visited by the mobile target within scheduled time. So, MCTA sends the tracking area information to only the sensor nodes within minimal tracking area and wakes them up. Compared to the legacy scheme which uses circle-based tracking area, our proposed scheme uses less number of sensors for tracking in both communication and sensing without target missing. Through simulation, we show that MCTA outperforms the circle-based scheme with about 60% energy saving under certain ideal situations.

AB - This paper proposes a minimal contour tracking algorithm (MCTA) that reduces energy consumption for tracking mobile targets in wireless sensor networks in terms of sensing and communication energy consumption. MCTA conserves energy by letting only a minimum number of sensor nodes participate in communication and perform sensing for target tracking. MCTA uses the minimal tracking area based on the vehicular kinematics. The modeling of target's kinematics allows for pruning out part of the tracking area that cannot be mechanically visited by the mobile target within scheduled time. So, MCTA sends the tracking area information to only the sensor nodes within minimal tracking area and wakes them up. Compared to the legacy scheme which uses circle-based tracking area, our proposed scheme uses less number of sensors for tracking in both communication and sensing without target missing. Through simulation, we show that MCTA outperforms the circle-based scheme with about 60% energy saving under certain ideal situations.

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

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

U2 - 10.1109/INFCOM.2007.283

DO - 10.1109/INFCOM.2007.283

M3 - Conference contribution

AN - SCOPUS:34548299940

SN - 1424410479

SN - 9781424410477

SP - 2371

EP - 2375

BT - Proceedings - IEEE INFOCOM

ER -