Optimal relay nodes placement with game theory optimization for Wireless Sensor Networks

Wireless Sensor Networks (WSN) play a major role in the wide variety of applications like underground pipeline and leaks monitoring, temperature distribution monitoring in industrial cyber systems, military, forest life monitoring, and environmental and geographical monitoring. Sensors are widely us...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of high speed networks 2024-01, Vol.30 (1), p.29-51
Hauptverfasser: Radha, Subramanyam, Bala, G. Josemin, Rajkumar, Nalluri Prophess, Indumathi, G., Nagabushanam, Perattur
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Wireless Sensor Networks (WSN) play a major role in the wide variety of applications like underground pipeline and leaks monitoring, temperature distribution monitoring in industrial cyber systems, military, forest life monitoring, and environmental and geographical monitoring. Sensors are widely used in these different applications. The number of sensors and the application concerned mainly decides the energy consumption, network lifetime. In this process relay nodes may help the sensors as backbone to connect with sink node or base stations. In this paper, we introduce a new approach for relay node selection in WSN to minimize the energy consumption of the network. It uses channel aware relay selection technique using game theory optimization and act as a virtual backbone in connecting to the base station. However, the relay nodes are varied to check the optimal number of relays required for the small, medium and large number of nodes deployed in the network. Simulations are carried out using Network Simulator NS-2.35 and network is analyzed in wide variety of scenarios. Results show that the proposed relay node selection algorithm reduces energy consumption, improves lifetime, throughput of the network.
ISSN:0926-6801
1875-8940
DOI:10.3233/JHS-222038