Cargando…

Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application

Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transm...

Descripción completa

Detalles Bibliográficos
Autores principales: Maheswararajah, Suhinthan, Halgamuge, Saman, Premaratne, Malin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Molecular Diversity Preservation International (MDPI) 2009
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3280826/
https://www.ncbi.nlm.nih.gov/pubmed/22399934
http://dx.doi.org/10.3390/s90100696
_version_ 1782223866381205504
author Maheswararajah, Suhinthan
Halgamuge, Saman
Premaratne, Malin
author_facet Maheswararajah, Suhinthan
Halgamuge, Saman
Premaratne, Malin
author_sort Maheswararajah, Suhinthan
collection PubMed
description Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance
format Online
Article
Text
id pubmed-3280826
institution National Center for Biotechnology Information
language English
publishDate 2009
publisher Molecular Diversity Preservation International (MDPI)
record_format MEDLINE/PubMed
spelling pubmed-32808262012-03-07 Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application Maheswararajah, Suhinthan Halgamuge, Saman Premaratne, Malin Sensors (Basel) Article Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance Molecular Diversity Preservation International (MDPI) 2009-01-23 /pmc/articles/PMC3280826/ /pubmed/22399934 http://dx.doi.org/10.3390/s90100696 Text en © 2009 by the authors; licensee Molecular Diversity Preservation International, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).
spellingShingle Article
Maheswararajah, Suhinthan
Halgamuge, Saman
Premaratne, Malin
Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application
title Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application
title_full Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application
title_fullStr Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application
title_full_unstemmed Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application
title_short Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application
title_sort energy efficient sensor scheduling with a mobile sink node for the target tracking application
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3280826/
https://www.ncbi.nlm.nih.gov/pubmed/22399934
http://dx.doi.org/10.3390/s90100696
work_keys_str_mv AT maheswararajahsuhinthan energyefficientsensorschedulingwithamobilesinknodeforthetargettrackingapplication
AT halgamugesaman energyefficientsensorschedulingwithamobilesinknodeforthetargettrackingapplication
AT premaratnemalin energyefficientsensorschedulingwithamobilesinknodeforthetargettrackingapplication