Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field

Kwang I. Hwang, Jeongsik In, Yeo Hong Yun, Doo-Seop Eom

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

14 Citations (Scopus)

Abstract

In a wide sensor field, it is difficult to track location of moving targets to just fixed sinks, since data aggregation can be slower than the movement of targets. In such applications, some of mobile sink users can be directly injected to the sensor filed. So, in recent, the problem handling multiple mobile sinks in wireless sensor networks is becoming another rising issue. However, it is difficult for the links connected to the sink to be maintained since links are easy to be broken. In this paper, we introduce efficient target tracking scheme through dynamic Sink Oriented Tree (SOT) Algorithm for multiple mobile sinks. The SOT is maintained by partial link Reversal algorithm to adapt the mobile sink environment. The main objective of our proposed algorithm is to efficiently deliver location information of targets to the multiple mobile sinks. Since our protocol can construct and dynamically maintain the SOTs although the sinks moves continuously, data aggregation from target nodes to sink can be efficiently achieved through the SOT and also, in-network processing in the process to be aggregated is naturally achieved. In addition, coverage of tracking of each mobile sinks is wider by dynamically merging the each sink's SOTs. Also, we evaluated our protocol in terms of how robust it is by examining the packet loss rate with respect to the sink speed.

Original languageEnglish
Title of host publicationIEEE Vehicular Technology Conference
Pages4607-4610
Number of pages4
Volume60
Edition7
Publication statusPublished - 2004
Event2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security - Los Angeles, CA, United States
Duration: 2004 Sep 262004 Sep 29

Other

Other2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security
CountryUnited States
CityLos Angeles, CA
Period04/9/2604/9/29

Fingerprint

Target tracking
Sensors
Agglomeration
Network protocols
Packet loss
Merging
Wireless sensor networks
Processing

Keywords

  • Ad hoc routing
  • Link reversal sensor netowrks
  • Target tracking

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Hwang, K. I., In, J., Yun, Y. H., & Eom, D-S. (2004). Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field. In IEEE Vehicular Technology Conference (7 ed., Vol. 60, pp. 4607-4610)

Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field. / Hwang, Kwang I.; In, Jeongsik; Yun, Yeo Hong; Eom, Doo-Seop.

IEEE Vehicular Technology Conference. Vol. 60 7. ed. 2004. p. 4607-4610.

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

Hwang, KI, In, J, Yun, YH & Eom, D-S 2004, Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field. in IEEE Vehicular Technology Conference. 7 edn, vol. 60, pp. 4607-4610, 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security, Los Angeles, CA, United States, 04/9/26.
Hwang KI, In J, Yun YH, Eom D-S. Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field. In IEEE Vehicular Technology Conference. 7 ed. Vol. 60. 2004. p. 4607-4610
Hwang, Kwang I. ; In, Jeongsik ; Yun, Yeo Hong ; Eom, Doo-Seop. / Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field. IEEE Vehicular Technology Conference. Vol. 60 7. ed. 2004. pp. 4607-4610
@inproceedings{b768876061704e2092dbb06d87c4325d,
title = "Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field",
abstract = "In a wide sensor field, it is difficult to track location of moving targets to just fixed sinks, since data aggregation can be slower than the movement of targets. In such applications, some of mobile sink users can be directly injected to the sensor filed. So, in recent, the problem handling multiple mobile sinks in wireless sensor networks is becoming another rising issue. However, it is difficult for the links connected to the sink to be maintained since links are easy to be broken. In this paper, we introduce efficient target tracking scheme through dynamic Sink Oriented Tree (SOT) Algorithm for multiple mobile sinks. The SOT is maintained by partial link Reversal algorithm to adapt the mobile sink environment. The main objective of our proposed algorithm is to efficiently deliver location information of targets to the multiple mobile sinks. Since our protocol can construct and dynamically maintain the SOTs although the sinks moves continuously, data aggregation from target nodes to sink can be efficiently achieved through the SOT and also, in-network processing in the process to be aggregated is naturally achieved. In addition, coverage of tracking of each mobile sinks is wider by dynamically merging the each sink's SOTs. Also, we evaluated our protocol in terms of how robust it is by examining the packet loss rate with respect to the sink speed.",
keywords = "Ad hoc routing, Link reversal sensor netowrks, Target tracking",
author = "Hwang, {Kwang I.} and Jeongsik In and Yun, {Yeo Hong} and Doo-Seop Eom",
year = "2004",
language = "English",
volume = "60",
pages = "4607--4610",
booktitle = "IEEE Vehicular Technology Conference",
edition = "7",

}

TY - GEN

T1 - Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field

AU - Hwang, Kwang I.

AU - In, Jeongsik

AU - Yun, Yeo Hong

AU - Eom, Doo-Seop

PY - 2004

Y1 - 2004

N2 - In a wide sensor field, it is difficult to track location of moving targets to just fixed sinks, since data aggregation can be slower than the movement of targets. In such applications, some of mobile sink users can be directly injected to the sensor filed. So, in recent, the problem handling multiple mobile sinks in wireless sensor networks is becoming another rising issue. However, it is difficult for the links connected to the sink to be maintained since links are easy to be broken. In this paper, we introduce efficient target tracking scheme through dynamic Sink Oriented Tree (SOT) Algorithm for multiple mobile sinks. The SOT is maintained by partial link Reversal algorithm to adapt the mobile sink environment. The main objective of our proposed algorithm is to efficiently deliver location information of targets to the multiple mobile sinks. Since our protocol can construct and dynamically maintain the SOTs although the sinks moves continuously, data aggregation from target nodes to sink can be efficiently achieved through the SOT and also, in-network processing in the process to be aggregated is naturally achieved. In addition, coverage of tracking of each mobile sinks is wider by dynamically merging the each sink's SOTs. Also, we evaluated our protocol in terms of how robust it is by examining the packet loss rate with respect to the sink speed.

AB - In a wide sensor field, it is difficult to track location of moving targets to just fixed sinks, since data aggregation can be slower than the movement of targets. In such applications, some of mobile sink users can be directly injected to the sensor filed. So, in recent, the problem handling multiple mobile sinks in wireless sensor networks is becoming another rising issue. However, it is difficult for the links connected to the sink to be maintained since links are easy to be broken. In this paper, we introduce efficient target tracking scheme through dynamic Sink Oriented Tree (SOT) Algorithm for multiple mobile sinks. The SOT is maintained by partial link Reversal algorithm to adapt the mobile sink environment. The main objective of our proposed algorithm is to efficiently deliver location information of targets to the multiple mobile sinks. Since our protocol can construct and dynamically maintain the SOTs although the sinks moves continuously, data aggregation from target nodes to sink can be efficiently achieved through the SOT and also, in-network processing in the process to be aggregated is naturally achieved. In addition, coverage of tracking of each mobile sinks is wider by dynamically merging the each sink's SOTs. Also, we evaluated our protocol in terms of how robust it is by examining the packet loss rate with respect to the sink speed.

KW - Ad hoc routing

KW - Link reversal sensor netowrks

KW - Target tracking

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

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

M3 - Conference contribution

AN - SCOPUS:17144429337

VL - 60

SP - 4607

EP - 4610

BT - IEEE Vehicular Technology Conference

ER -