{"title":"An eigenvector centrality-based mobile target tracking algorithm for wireless sensor networks","authors":"N. Meghanathan","doi":"10.1504/IJMNDI.2016.081661","DOIUrl":null,"url":null,"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.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"127 1","pages":"202-211"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mobile Network Design and Innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJMNDI.2016.081661","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
引用次数: 1
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.
期刊介绍:
The IJMNDI addresses the state-of-the-art in computerisation for the deployment and operation of current and future wireless networks. Following the trend in many other engineering disciplines, intelligent and automatic computer software has become the critical factor for obtaining high performance network solutions that meet the objectives of both the network subscriber and operator. Characteristically, high performance and innovative techniques are required to address computationally intensive radio engineering planning problems while providing optimised solutions and knowledge which will enhance the deployment and operation of expensive wireless resources.