Research Area:  Wireless Sensor Networks
Most of the current generation sensor nodes of mobile wireless sensor network (MWSN) are designed to have heterogeneous mobility to adapt itself in the applied environment. Energy optimization in MWSN with heterogeneous mobility is very challenging task. In this paper, a heterogeneous game theoretical clustering algorithm called mobile clustering game theory–1 (MCGT-1) is proposed for energy optimization in a heterogeneous mobile sensor environment. Energy optimization is achieved through energy-efficient cluster head election and multipath routing in the network. A heterogeneous clustering game is modelled with varying attributes and located an asymmetric equilibrium condition for a symmetric game with mixed strategies. The real-time parameters, namely, predicted remaining energy, distance between a base station and nodes, distance between nodes, and mobility speed, were used to calculate the probability to elect the cluster head (CH). The efficient multipath routing is achieved through prior energy prediction strategy. It has mitigated the generation of hot spots, reducing its delay and improving the overall residual energy of the network. Simulation results showed that the average lifetime of MCGT-1 has increased by 6.33 %, 13.1% and 14.2% and the PDR has improved by 4.8%,11.8%, and 17.2% than MCGT, LEACH-ME and LEACH-M respectively. The hot spot delay is reduced to 0.063025 seconds, improving the efficiency of the network.
Author(s) Name:  Preethiya Thandapani, Muthukumar Arunachalam, Durairaj Sundarraj
Journal name:  INTERNATIONAL JOURNAL OF COMMUNICATION SYSYTEMS
Publisher name:  Wiley
Volume Information:  Volume33, Issue7 10 May 2020
Paper Link:   https://onlinelibrary.wiley.com/doi/abs/10.1002/dac.4336