Game Theory and Coverage Optimization Based Multihop Routing Protocol for Network Lifetime in Wireless Sensor Networks Article Swipe
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.1109/jsen.2022.3178441
· OA: W4285280184
Wireless sensor networks (WSNs) are self-organizing monitoring networks with\na large number of randomly deployed microsensor nodes to collect various\nphysical information to realize tasks such as intelligent perception, efficient\ncontrol, and decision-making. However, WSN nodes are powered by batteries, so\nthey will run out of energy after a certain time. This energy limitation will\ngreatly constrain the network performance like network lifetime and energy\nefficiency. In this study, to prolong the network lifetime, we proposed a\nmulti-hop routing protocol based on game theory and coverage optimization\n(MRP-GTCO). Briefly, in the stage of setup, two innovational strategies\nincluding a clustering game with penalty function and cluster head coverage set\nwere designed to realize the uniformity of cluster head distribution and\nimprove the rationality of cluster head election. In the data transmission\nstage, we first derived the applicable conditions theorem of inter-cluster\nmulti-hop routing. Based on this, a novel multi-hop path selection algorithm\nrelated to residual energy and node degree was proposed to provide an\nenergy-efficient data transmission path. The simulation results showed that the\nMRP-GTCO protocol can effectively reduce the network energy consumption and\nextend the network lifetime by 159.22%, 50.76%, and 16.46% compared with LGCA,\nRLEACH, and ECAGT protocols.\n
