International Transaction Journal of Engineering,
Management, & Applied Sciences & Technologies

FEATURE PEER-REVIEWED ARTICLES

• A GAME THEORETIC APPROACH FOR ENERGY OPTIMIZATION IN CLUSTERED WIRELESS AD HOC SENSOR NETWORKS

  Asad Saleem* (Key Laboratory of Specialty Fiber Optics and Optical Access Networks, Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication, Shanghai Institute for Advanced Communication and Data Science, Shanghai University, 200444, Shanghai, CHINA, and Shenzhen Key Laboratory of Antennas and Propagation, College of Electronics and Information Engineering, Shenzhen University, 518060, Shenzhen, CHINA, and School of Electronics, Quaid-i-Azam University, Islamabad, 45320, PAKISTAN ),
  Malik Asfandyar (School of Automation and Electrical Engineering Beihang University of Aerospace and Aeronautics (BUAA), 100083, Beijing, CHINA ),
  Hasan Mahmood (Department of Electronics, Quaid-i-Azam University, Islamabad, 45320, PAKISTAN )
  

  (Backup file)

  doi: 10.14456/ITJEMAST.2019.172

  Keywords: Ad hoc networks; Clustering Schemes; Game Theory; WANET; Network Lifetime; D-CROSS; ZPR; LEACH.

  Abstract
  In this paper, our objective is to use the game-theoretic approach for clustered wireless ad-hoc networks to optimize system lifetime. Game theory (GT) has been exploited in the domain of biology and economics, but lately it is applied in routing and packet forwarding in Wireless Ad hoc Networks (WANETs). However, the clustering topic, concerned with self-directedness of sensor nodes into big groups, has not been examined under this model. Distance-based Clustered Routing For Selfish Sensors (D-CROSS) protocol assists in accomplishing energy conservation where every single sensor node is nominated as cluster head (CH) with zero probability rule (ZPR). Our analysis follows the non-cooperative game theoretic approach where each sensor node selfishly plays and tries to preserve its own energy and maximize its lifetime. We demonstrate here the Nash Equilibrium for mixed and pure strategies and anticipated payoffs. The comparison of the D-CROSS protocol with the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol through simulations demonstrates that D-CROSS achieves improved performance in terms of network lifetime.
  
  Paper ID: 10A13H











Other issues:
Vol.9(2018)
Vol.10(1)(2019)
Vol.10(2)(2019)
Vol.10(3)(2019)
Vol.10(4)(2019)
Vol.10(5)(2019)
Vol.10(6)(2019)
Vol.10(7)(2019)
Vol.10(8)(2019)
Vol.10(9)(2019)
Vol.10(10)(2019)
Vol.10(11)(2019)
Vol.10(12)(2019)
Archives