Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks

Authors:
R. Kannan;S. S. Iyengar
Affiliations:
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 13

Sensor-centric energy-constrained reliable query routing for wireless sensor networks

Journal of Parallel and Distributed Computing
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
A price-based reliable routing game in wireless networks

GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Sleep and Wakeup Strategies in Solar-Powered Wireless Sensor/Mesh Networks: Performance Analysis and Optimization

IEEE Transactions on Mobile Computing
Dependable data aggregation on cluster-based wireless sensor networks

ICCOM'07 Proceedings of the 11th Conference on 11th WSEAS International Conference on Communications - Volume 11
A survey of game-theoretic approaches in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A secure network management protocol for SmartGrid BPL networks: Design, implementation and experimental results

Computer Communications
Cognitive MIMO radio: an emerging paradigm for enhancing wireless access capability

International Journal of Communication Networks and Distributed Systems
A novel approach for trade-off between computation and communication cost in wireless sensor networks

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Multi-channel assignment in wireless sensor networks: a game theoretic approach

INFOCOM'10 Proceedings of the 29th conference on Information communications
Cooperative game-based routing approach for wireless sensor network

International Journal of Computer Applications in Technology
A novel trade-off between communication and computation costs for data aggregation in wireless sensor networks

International Journal of Ad Hoc and Ubiquitous Computing
The evolution game analysis of clustering for asymmetrical multi-factors in WSNs

Computers and Electrical Engineering

Quantified Score

Hi-index	0.07

Visualization

Abstract

Path length, path reliability, and sensor energy-consumption are three major constraints affecting routing in resource constrained, unreliable wireless sensor networks. By considering the implicit collaborative imperative for sensors to achieve overall network objectives subject to individual resource consumption, we develop a game-theoretic model of reliable, length and energy-constrained, sensor-centric information routing in sensor networks. We define two distinct payoff (benefit) functions and show that computing optimally reliable energy-constrained paths is NP-Hard under both models for arbitrary sensor networks. We then show that optimal length-constrained paths can be computed in polynomial time in a distributed manner (using O(E) messages) for popular sensor network implementations using geographic routing. We also develop sensor-centric metrics called path weakness to measure the qualitative performance of different routing schemes and provide theoretical limits on the inapproximability of computing paths with bounded weakness. Heuristics for computing optimal paths in arbitrary sensor networks are described along with simulation results comparing performance with other routing algorithms.