Coalition formation for bearings-only localization in sensor networks: a cooperative game approach

Authors:
Omid Namvar Gharehshiran;Vikram Krishnamurthy
Affiliations:
Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, Canada;Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, Canada
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 10
Cited 1

Estimation with Applications to Tracking and Navigation

Estimation with Applications to Tracking and Navigation
Medium access control with coordinated adaptive sleeping for wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Topology control in wireless ad hoc and sensor networks

ACM Computing Surveys (CSUR)
Energy-efficient, collision-free medium access control for wireless sensor networks

Wireless Networks
Exploiting mobility for energy efficient data collection in wireless sensor networks

Mobile Networks and Applications
Energy conservation in wireless sensor networks: A survey

Ad Hoc Networks
FloodNet: coupling adaptive sampling with energy aware routing in a flood warning system

Journal of Computer Science and Technology
Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network

IEEE Transactions on Signal Processing
Decentralized Activation in Dense Sensor Networks via Global Games

IEEE Transactions on Signal Processing - Part I
Mobility-based communication in wireless sensor networks

IEEE Communications Magazine

Multi-variate quickest detection of significant change process

GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security

Quantified Score

Hi-index	35.68

Visualization

Abstract

In this paper, formation of optimal coalitions of nodes is investigated for data acquisition in bearings-only target localization such that the average sleep time allocated to the nodes is maximized. Targets are required to be localized with a prespecified accuracy where the localization accuracy metric is defined to be the determinant of the Bayesian Fisher information matrix (B-FIM). We utilize cooperative game theory as a tool to devise a distributed dynamic coalition formation algorithm in which nodes autonomously decide which coalition to join while maximizing their feasible sleep times. Nodes in the sleep mode do not record any measurements, hence, save energy in both sensing and transmitting the sensed data. It is proved that if each node operates according to this algorithm, the average sleep time for the entire network converges to its maximum feasible value. In numerical examples, we illustrate the tradeoff between localization accuracy and the average sleep time allocated to the nodes and demonstrate the superior performance of the proposed scheme via Monte Carlo simulations.