Next Article in Journal
Capture of Escherichia coli O157:H7 Using Immunomagnetic Beads of Different Size and Antibody Conjugating Chemistry
Next Article in Special Issue
A New Method for Node Fault Detection in Wireless Sensor Networks
Previous Article in Journal
Applications of Nanomaterials in Electrogenerated Chemiluminescence Biosensors
Previous Article in Special Issue
Wireless Monitoring of Automobile Tires for Intelligent Tires
Sensors 2009, 9(2), 696-716; doi:10.3390/s90100696
Article

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

1,* , 1
 and 2
Received: 14 November 2008; in revised form: 16 January 2009 / Accepted: 16 January 2009 / Published: 23 January 2009
(This article belongs to the Special Issue Wireless Sensor Technologies and Applications)
View Full-Text   |   Download PDF [341 KB, uploaded 21 June 2014]   |   Browse Figures
Abstract: 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.
Keywords: Sensor Scheduling; Dynamic Programming; Markov Model; Target Tracking Sensor Scheduling; Dynamic Programming; Markov Model; Target Tracking
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.

Export to BibTeX |
EndNote


MDPI and ACS Style

Maheswararajah, S.; Halgamuge, S.; Premaratne, M. Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application. Sensors 2009, 9, 696-716.

AMA Style

Maheswararajah S, Halgamuge S, Premaratne M. Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application. Sensors. 2009; 9(2):696-716.

Chicago/Turabian Style

Maheswararajah, Suhinthan; Halgamuge, Saman; Premaratne, Malin. 2009. "Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application." Sensors 9, no. 2: 696-716.


Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert