An eigenvector centrality-based mobile target tracking algorithm for wireless sensor networks
by Natarajan Meghanathan
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 6, No. 4, 2016

Abstract: We propose an eigenvector centrality (EVC)-based tracking algorithm to trace the trajectory of a mobile radioactive dispersal device (RDD) in a wireless sensor network. We propose that the sensor nodes simply sum up the strengths of the signals sensed in the neighbourhood over a sampling time period and forward the sum of the signals to a control centre (called sink). For every sampling time period, the sink constructs an adjacency matrix in which the entry for edge (i, j) is the sum of the signal strengths reported by sensor nodes i and j. The sink uses this adjacency matrix as the basis to determine the eigenvector centralities and uses the arithmetic mean (calculated by the sink) of the X and Y coordinates of the suspect sensor nodes (those having larger EVC) to predict the location of the RDD at a time instant corresponding to the middle of the sampling time period.

Online publication date: Thu, 19-Jan-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com