z-logo
open-access-imgOpen Access
A Game-Based Secure Localization Algorithm for Mobile Wireless Sensor Networks
Author(s) -
Tianyue Bao,
Jiangwen Wan,
Kefu Yi,
Qiang Zhang
Publication year - 2015
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2015/642107
Subject(s) - computer science , wireless sensor network , node (physics) , stochastic game , key distribution in wireless sensor networks , mobile wireless , algorithm , wireless , game theory , wireless network , computer network , distributed computing , telecommunications , mathematics , structural engineering , mathematical economics , engineering , economics , microeconomics
The issue of node localization is a fundamental problem in wireless sensor networks. Recently, the localization problem for mobile sensor networks in hostile environment has received significant attention. Due to the mobility of the sensor nodes, it is more challenging to achieve node localization in attacked sensor networks than in static ones. To address these challenges, the paper presents a novel game-based secure localization algorithm. The nodes' strategy level can be indicated through the results of trust evaluation and then by means of constructing reasonable strategy space and payoff function using game theory; all kinds of nodes within the network can achieve the optimal payoffs. The performance of our algorithm is evaluated by extensive simulation experiments. The simulation results show that the localization error of our proposed algorithm is lower than those of the existing ones in attacked environment.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom