Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
ASCENT: Adaptive Self-Configuring sEnsor Network Topologies
ACM SIGCOMM Computer Communication Review
Utility-based decision-making in wireless sensor networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cooperative Packet Forwarding in Multi-Domain Sensor Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Sensor network localisation based on sorted RSSI quantisation
International Journal of Ad Hoc and Ubiquitous Computing
A self-organising algorithm for sensor placement in wireless mobile microsensor networks
International Journal of Wireless and Mobile Computing
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
IEEE Transactions on Computers
International Journal of Ad Hoc and Ubiquitous Computing
Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree
Journal of Parallel and Distributed Computing
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
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
RAGOBOT: a new platform for wireless mobile sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Why does it pay to be selfish in a MANET?
IEEE Wireless Communications
Optimized relay placement for WSNs federation
Wireless Communications & Mobile Computing
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Handling large-scale node failures in mobile sensor/robot networks
Journal of Network and Computer Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Due to limited resources and harsh environments, partitioning can be inevitable in wireless sensor networks (WSNs). To re-establish network connectivity, healthy mobile sensor nodes can be repositioned in an on-demand basis. However, the nodes are equipped with limited batteries and their movement requires excessive energy consumption. In this paper, we address the problem of minimising the movement cost when re-establishing network connectivity in delay tolerant WSNs by presenting a distributed heuristic approach based on Game Theory. Compared to centralised heuristics which assume complete knowledge of the network and failures, this approach is self-healing that can work with uncertain network/failure information. Under limited knowledge on partitions and failure locations, Game Theory is used to facilitate decision making on the selection of the nodes to be moved and their movement directions. Extensive simulations have revealed the efficiency of the proposed approach in terms of movement distance and network coverage.