Connectivity restoration in delay–tolerant sensor networks using game theory. (14th November 2012)

• Record Type: Journal Article
• Authors: Senturk, Izzet; Yilmaz, Sabri; Akkaya, Kemal
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 11:Number 2/3(2012)
• Page Start: 109
• Page End: 124
• Publication Date: 2012-11-14
• Subjects: delay–tolerant WSNs -- distributed recovery -- connectivity restoration -- mobility -- game theory -- partitioning -- wireless sensor networks -- network connectivity -- self–healing -- uncertainty -- failure locations -- node movement -- node selection -- movement distance -- network coverage; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

Abstract

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.