Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of game-theoretic approaches in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks
IEEE Transactions on Mobile Computing
Cooperative Incentive Mechanism Based on Game Theory in MANET
ICNDS '09 Proceedings of the 2009 International Conference on Networking and Digital Society - Volume 02
A Game Theory Approach to Detect Malicious Nodes in Wireless Sensor Networks
SENSORCOMM '09 Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications
Relay node placement in large scale wireless sensor networks
Computer Communications
Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree
Journal of Parallel and Distributed Computing
Lightweight object localization with a single camera in wireless multimedia sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Game-theoretic approach for improving cooperation in wireless multihop networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Optimized relay placement to federate segments in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Simple movement control algorithm for bi-connectivity in robotic sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
A Localized Algorithm for Restoring Internode Connectivity in Networks of Moveable Sensors
IEEE Transactions on Computers
Mobility-based self route recovery from multiple node failures in mobile sensor networks
LCN '10 Proceedings of the 2010 IEEE 35th Conference on Local Computer Networks
IEEE Transactions on Computers
Game theory-based resource allocation strategy for clustering based wireless sensor network
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
A Game Theory Approach to Target Tracking in Sensor Networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Optimized relay placement for WSNs federation
Wireless Communications & Mobile Computing
Connectivity restoration in delay-tolerant sensor networks using game theory
International Journal of Ad Hoc and Ubiquitous Computing
On using game theory to balance energy consumption in heterogeneous wireless sensor networks
LCN '12 Proceedings of the 2012 IEEE 37th Conference on Local Computer Networks (LCN 2012)
| Hi-index | 0.00 |
Several factors such as initial deployment, battery depletion or hardware failures can cause partition wireless sensor networks (WSNs). This results in most of the sensors losing connectivity with the sink node and thus creating disruption of the delivery of the data. To restore connectivity, one possible solution is populating relay nodes to connect the partitions. However, this solution requires information regarding the availability of the damaged area, number of partitions in the network and the location of the remaining nodes which may not be obtained for all applications. Thus, a distributed self-deployment strategy may better fit the application requirements. In this paper, we propose two distributed relay node positioning approaches to guarantee network recovery for partitioned WSNs by minimizing the movement cost of the relay nodes. The first approach is based on virtual force-based movements of relays while the second exploits Game Theory among the leaders of the partitions. Force-based approach stretches the network gradually with the deployment of additional relays. In the game-theoretic approach, the partition to be connected with is determined by the leader relay nodes based on the probability distribution function (pdf) of the partitions. Partitions with a higher pdf have priority over other partitions for recovery. Once the partition is connected with the relay nodes, it becomes the part of the connected network. Recovery proceeds with the partition having the next highest priority until network is completely recovered by reaching the system-wide unique Nash equilibrium. Both approaches are analyzed and evaluated extensively through simulation. Game-theoretic approach has been shown to outperform force-based approach as well as a centralized approach under most of the conditions.