A game theory based energy efficient clustering routing protocol for WSNs

Lin, Deyu; Wang, Quan

doi:10.1007/s11276-016-1206-2

Cited by 81 publications

(73 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm prevents the previous CH node from participating in CH election that reduces energy consumption. Game theory–based energy efficient clustering (GEEC) used evolutionary game theory for optimal CH election. GEEC reduces energy consumed in routing control messages in CH election.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An energy‐efficient clustering and multipath routing for mobile wireless sensor network using game theory

Thandapani

Arunachalam

Durairaj

2020

Int J Communication

View full text Add to dashboard Cite

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. K E Y W O R D Sclustering, mobility, predicted remaining energy, hot spot problem it is essential to use the battery power in an optimal way. Secondly, the battery energy gets depleted rapidly during active communication if it is not properly monitored and controlled. Therefore, a better energy optimization in a sensor network is inevitable, and hence, a clustering architecture is proposed.Many protocols for mobile sensing environment works with constant mobile speed or with homogeneous mobility. 4 In the existing protocols, the node speed and energy dissipation remain constant irrespective of the distance moved. These phenomena lead to waste of the attained bandwidth and timeslot and affect the overall network performance, lifetime, and quality of service (QoS). In practice, it is not possible to attain the constant mobility speed throughout thedeployment and in real-time, the nodes may move with different speeds either arbitrarily or naturally called-heterogeneous mobility. 4 According to Osborne, 5 a game is defined as a method of competitive play by-law. Game theory (GT) is a mathematical branch that deals with competitive situations while analyzing the strategies of every player and produce an outcome based on actions of other participants. In recent years, GT is applied in clustering of sensor network. Since then, all the algorithms are proposed for a static environment where the nodes are fixed without frequent clustering. The game of these algorithms is not defined from the view of sensors and its topology. Further, these algorithms do not provide a solution for hot spot problem i...

show abstract

Section: Related Workmentioning

confidence: 99%

“…The proposed algorithm uses first‐order radio model for handling energy dissipation in the network . Energy spent on transmitting and receiving “ l ” bits of data to and from distance “ d ” is given in Equations , , and , respectively.…”

Section: System Modelmentioning

confidence: 99%

An energy‐efficient clustering and multipath routing for mobile wireless sensor network using game theory

Thandapani

Arunachalam

Durairaj

2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…HE WIRELESS SENSOR NETWORKS (WSNS) is a kind of networks which consist of a large number of tiny sensor nodes [1] [2] . Owing to the low deploying cost, WSNs have gained extensive applications, such as the target tracking, enemy detecting, air pollution monitoring, medical caring, and so on [3][4] [5] .…”

Section: Introductionmentioning

confidence: 99%

An Energy-Efficient Compressive Sensing-Based Clustering Routing Protocol for WSNs

et al. 2019

Self Cite

View full text Add to dashboard Cite

A novel algorithm which combined the merits of the Clustering strategy and the Compressive Sensing-based (CS-based) scheme was proposed in this paper. The lemmas for the relationship between any two adjacent layers, the optimal size of clusters, the optimal distribution of the Cluster Head (CH) and the corresponding proofs were presented firstly. In addition, to alleviate the "Hot Spot Problem" and reduce the energy consumption resulted from the rotation of the role of CHs, a third role of Backup Cluster Head (BCH) as well as the corresponding mechanism to rotate the roles between the CH and BCH were proposed. Subsequently, the Energy-Efficient Compressive Sensing-based clustering Routing (EECSR) protocol was presented in detail. Finally, extensive simulation experiments were conducted to evaluate its energy performance. Comparisons with the existing clustering algorithms and the CS-based algorithm verified the effect of EECSR on improving the energy efficiency and extending the lifespan of WSNs.

show abstract

“…Because our target is to review the latest protocols, we do not review these. Even though [41] and [42] are reviewed in [47], we have included them in our survey because they are two of the major papers published in recent years that cover the implementation of the cluster-based WSNs using evolutionary game theory (EGT).…”

Section: Introductionmentioning

confidence: 99%

Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

Habib

Moh

2019

Applied Sciences

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have become an important and promising technology owing to their wide range of applications in disaster response, battle field surveillance, wildfire monitoring, radioactivity monitoring, etc. In WSNs, routing plays a significant role in delivery latency, energy consumption, and packet delivery ratio. Furthermore, as these applications are used in critical operations with limited irreplaceable batteries, routing protocols are required to be flawless as well as energy efficient. The dynamic environment also requires intelligent and adaptive routing. Game theory is widely used for designing routing protocols in WSNs to achieve not only reduced energy consumption but also increased packet delivery ratio. The core features of efficiently designed game theory-based routing protocols include optimal cluster head selection in hierarchical routing, energy-efficient and delay-aware route discovery, fault-tolerant data delivery, and coalition forming and grouping among nodes for stringent data transfer. In this paper, different routing protocols based on various types of games are extensively reviewed, which have been reported so far for improving energy consumption, delay, route establishment time, packet delivery ratio, and network lifetime. The different game theory-based routing protocols are qualitatively compared with each other in terms of major features, advantages, limitations, and key characteristics. For each protocol, possible applications and future improvements are summarized. Certain important open concerns and challenges are also discussed, along with future research directions.

show abstract

A game theory based energy efficient clustering routing protocol for WSNs

Cited by 81 publications

References 46 publications

An energy‐efficient clustering and multipath routing for mobile wireless sensor network using game theory

An energy‐efficient clustering and multipath routing for mobile wireless sensor network using game theory

An Energy-Efficient Compressive Sensing-Based Clustering Routing Protocol for WSNs

Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

Contact Info

Product

Resources

About