Game Theory and Coverage Optimization Based Multihop Routing Protocol for Network Lifetime in Wireless Sensor Networks
Yindi Yao, Xiong Li, Yanpeng Cui, Lang Deng, Chen Wang

TL;DR
This paper introduces a game theory-based multi-hop routing protocol for wireless sensor networks that optimizes coverage and energy use, significantly extending network lifetime compared to existing protocols.
Contribution
It proposes a novel multi-hop routing protocol combining game theory and coverage optimization, with innovative clustering and path selection strategies for energy efficiency.
Findings
Extended network lifetime by up to 159.22%
Reduced energy consumption effectively
Improved cluster head distribution and election
Abstract
Wireless sensor networks (WSNs) are self-organizing monitoring networks with a large number of randomly deployed microsensor nodes to collect various physical information to realize tasks such as intelligent perception, efficient control, and decision-making. However, WSN nodes are powered by batteries, so they will run out of energy after a certain time. This energy limitation will greatly constrain the network performance like network lifetime and energy efficiency. In this study, to prolong the network lifetime, we proposed a multi-hop routing protocol based on game theory and coverage optimization (MRP-GTCO). Briefly, in the stage of setup, two innovational strategies including a clustering game with penalty function and cluster head coverage set were designed to realize the uniformity of cluster head distribution and improve the rationality of cluster head election. In the data…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
