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

Clicks: 212
ID: 24184
2009
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #1,270 of 1,694 articles by views in sensors

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,694 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
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.
Reference Key
premaratne2009energysensors Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Premaratne, Malin;Halgamuge, Saman;Maheswararajah, Suhinthan;
Journal sensors
Year 2009
DOI
DOI not found
URL
http://www.mdpi.com/1424-8220/9/2/696/
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.