Ayan Mondal

Game-Theoretic Topology Controlfor Opportunistic Localizationin Sparse Underwater Sensor Networks

In this paper, we propose a localization scheme named Opportunistic Localization by Topology Control (OLTC), specifically for sparse Underwater Sensor Networks (UWSNs). In a UWSN, an unlocalized sensor node finds its location by utilizing the spatio-temporal relation with the reference nodes. Generally, UWSNs are sparsely deployed because of the high implementation cost, and unfortunately, the network topology experiences partitioning due to the effect of passive node mobility. Consequently, most of the underwater sensor nodes lack the required number of reference nodes for localization in underwater environments. The existing literature is deficient in addressing the problem of node localization in the above mentioned scenario. Antagonistically, however, we promote that even in such sparse UWSN context, it is possible to localize the nodes by exploiting their available opportunities. We formulate a game-theoretic model based on the Single-Leader-Multi-Follower Stackelberg game for topology control of the unlocalized and localized nodes. We also prove that both the players choose strategies to reach a socially optimal Stackelberg-Nash-Cournot Equilibrium. NS-3 based simulation results indicate that the localization coverage of the network increases upto 1.5 times compared to the existing state-of-the-art. The energy-efficiency of OLTC has also been established.

Optimal gateway selection in sensor-cloud framework for health monitoring

Sensor-cloud computing is envisioned to be one of the key enabling technologies for remote health monitoring. Integration of sensed data into cloud applications in sensor-cloud will help in real-time monitoring of patients over geographically distributed locations. In this study, the authors study the optimal gateway selection problem in sensor-cloud framework for real-time patient monitoring system by using a zero-sum game model. In the proposed model, a gateway acts as the first player, and chooses the strategy based on the available bandwidth, whereas a user request acts as the second player, and follows the strategy chosen by the first player. The authors evaluate the execution time for selecting the optimal gateway through which the sensed data will be fetched to the cloud platform. In addition, the authors show how user requests are serviced by the gateways to access data from cloud platform optimally. The authors also show that by using the proposed approach, the execution time decreases, thereby helping in forming a reliable, efficient and real-time architecture for health monitoring.

Residential Energy Management in Smart Grid: A Markov Decision Process-Based Approach

The deployment of advanced information and communication technologies has helped in the transformation of the traditional power grids into smart grids by introducing demand side management in residential area. The use of demand side management in the residential area can successfully reduce customers energy consumption, and can also provide a well balanced energy demand throughout the day. Based on real-time pricing information, a customer can shift his/her energy demand to reduce the energy consumption cost. In this paper, we present a Markov Decision Process (MDP)-based scheduling mechanism for residential energy management (REM) in smart grid. The aim of the proposed work is to reduce the energy expenses of a customer. In this mechanism, the Home Energy Management Unit (HEMU) acts as one of the players, the Central Energy Management Unit (CEMU) acts as another player. The HEMU interacts with the CEMU to fulfill its energy request within its desired budget. The CEMU follows its own dynamic pricing mechanism to decide the price per unit energy for on-peak and off-peak hours. The proposed mechanism is able to reduce the energy expenses of the residential customers.

Dynamic coalition formation in a smart grid: A game theoretic approach

In this paper, the problem of optimal energy distribution by dynamically changing the size of coalition, which consists of one micro-grid and several customers, is studied using the theory of Markov Decision Process (MDP) - a discrete optimization method. In this paper, the micro-grid, which acts as one of the players, needs to decide the size of the coalition for utilizing the generated energy optimally. On the other hand, the customer, which acts as another player, needs to decide its strategies, so as to optimize a trade-off between the associated cost, i.e., communication cost and energy distribution cost, and effective power supply. Using MDP, it is shown how dynamically coalition can be formed and the customer can be assured of an efficient power distribution.

Distributed Home Energy Management System With Storage in Smart Grid Using Game Theory

In this paper, the problem of distributed home energy management system with storage (<bold><italic>HoMeS</italic></bold>) in a coalition, which consists of multiple microgrids and multiple customers, is studied using the <bold><italic>multiple-leader–multiple-follower Stackelberg game</italic></bold> theoretic model—a multistage and multilevel game. The microgrids, which act as the leaders, need to decide on the minimum amount of energy to be generated with the help of a central energy management unit and the optimum price per unit energy to maximize their profit. On the other hand, the customers, which act as the followers, need to decide on the optimum amount of energy to be consumed, including the energy to be requested for storage. Using the proposed distributed scheme, i.e., <bold><italic>HoMeS</italic></bold>, the earned profit of the grid improves up to 55%, and the customers consume almost 30.79% higher amount of energy, which, in turn, increases the utilization of the generated energy by the microgrids.

Distributed topology management for wireless multimedia sensor networks: exploiting connectivity and cooperation

In this paper, we propose a distributed topology management algorithm, named T-Must, which orchestrates coalition formation game between camera and scalar sensor SS nodes, for use in wireless multimedia sensor networks. In the proposed solution, connectivity among the peer camera sensor CS nodes is maintained, and coverage is ensured between them. Only the scalar data are not sufficient to describe an event in a particular monitored area. In many cases, multimedia data specifically, video data are required to provide more precise information about the event. As the CS nodes, which sense and transmit multimedia data, are costlier than the SS nodes, the former are deployed in the monitored area in lesser numbers compared to the latter ones. In case of CS nodes, power consumption due to sensing is also significant, similar to power consumption for the transmission and reception of packets. Therefore, in this work, in order to increase the network lifetime, topology is controlled by forming coalition between the CS and SS nodes. Upon occurrence of an event, the SS nodes send scalar data to their associated CS nodes. If the scalar data received from SS nodes cross a preconfigured threshold, the associated CS node in the coalition starts sensing the event, captures the video data, and forwards the video data toward other coalitions or sink. Copyright

Connectivity Re-establishment in the Presence of Dumb Nodes in Sensor-Cloud Infrastructure: A Game Theoretic Approach

In this work, we consider the presence of dumb nodes in the underlying physical networks of Sensor-Cloud infrastructure. The dumb nodes get isolated from the network and degrade the network performance. Consequently, a Cloud Service Provider (CSP) is unable to use Wireless Sensor Networks (WSNs) in an efficient manner, as the dumb sensor nodes cannot use as a virtual sensor. Thus, in this work, we propose a scheme, Connectivity Re-establishment in the Presence of Dumb Nodes in Sensor-Cloud Infrastructure (CoRDS), that facilitates the reestablishment of the connectivity between dumb nodes and the sink. Using the proposed scheme, CoRDS, the CSP is able to provide the services efficiently as per end-users requirements. In order to re-establish connectivity between the dumb nodes and the sink, we use a single leader multiple follower Stackelberg game. Additionally, theoretical characterization of CoRDS has been shown.

Topology control in the presence of jammers for wireless sensor networks

Summary In this paper, the problem of ensuring packet delivery ratio and high network lifetime in wireless sensor networks in the presence of single or multiple jammers is studied using single-leader-multiple-followers Stackelberg game theory. A topology control scheme is proposed, in which the sink node, which acts as the leader, identifies the set of jamming affected nodes. On the other hand, the sensor nodes, which act as followers, need to decide an optimum transmission power level, while ensuring an optimal set of neighbor nodes covered. A scheme, named TC-JAM, for ensuring packet delivery ratio, while avoiding jammers and increasing network lifetime in wireless sensor networks, is proposed. In existing literatures, the sensor nodes are envisioned to be equipped with multiple interfaces, while having access for multiple channels. However, in TC-JAM, the sensor nodes have simple hardware with single interface for communication, ie, the sensor nodes have single channel for communication. Additionally, in the proposed scheme, TC-JAM, each sensor node has a provision to vary its transmission power according to the chosen strategies. Using TC-JAM, the energy consumption of the overall network reduces by up to 62%, and the network lifetime increases by 56% to 73%.

DEMANDS: Distributed Energy Management Using Noncooperative Scheduling in Smart Grid

In this paper, the problem of energy scheduling and energy exchange between microgrids and customers is studied as a multi-leader multi-follower noncooperative Stackelberg game. The customers act as leaders, and decide the amount of required energy to be taken in each time slot. On the other hand, the microgrids act as the followers, which need to decide the price per unit energy based on the total requested energy by the connected customers. Using variational inequality, it is shown that the proposed distributed energy management using scheduling (DEMANDS) scheme has a Nash equilibrium solution, which is also socially optimal. In the proposed scheme, DEMANDS, each customer gets energy from any of the available microgrids within a coalition neither by paying higher price per unit energy, nor by waiting for the next time slot for service. The proposed scheme, DEMANDS, which enables the microgrids and the customers to reach the equilibrium state, is evaluated theoretically as well as through simulations.

Topology Control for Self-Adaptation in Wireless Sensor Networks with Temporary Connection Impairment

In this work, the problem of topology control for self-adaptation in stationary Wireless Sensor Networks (WSNs) is revisited, specifically for the case of networks with a subset of nodes having temporary connection impairment between them. This study focuses on misbehaviors arising due to the presence of\enskip “dumb” nodes [Misra et al. 2014; Roy et al. 2014a, 2014b, 2014c; Kar and Misra 2015], which can sense its surroundings but cannot communicate with its neighbors due to shrinkage in its communication range by the environmental effects attributed to change in temperature, rainfall, and fog. However, a dumb node is expected to behave normally on the onset of favorable environmental conditions. Therefore, the presence of such dumb nodes in the network gives rise to impaired connectivity between a subset of nodes and, consequently, results in change in topology. Such phenomena are dynamic in nature and are thus distinct from the phenomena attributed to traditional isolation problems considered in stationary WSNs. Activation of all the sensor nodes simultaneously is not necessarily energy efficient and cost-effective. In order to maintain self-adaptivity of the network, two algorithms, named Connectivity Re-establishment in the presence of Dumb nodes (CoRD) and Connectivity Re-establishment in the presence of Dumb nodes Without Applying Constraints (CoRDWAC), are designed. The performance of these algorithms is evaluated through simulation-based experiments. Further, it is also observed that the performance of CoRD is better than the existing topology control protocols—LETC and A1—with respect to the number of nodes activated, overhead, and energy consumption.