TU Darmstadt / ULB / TUbiblio

Energy-Efficient Decentralized Broadcasting in Wireless Multi-Hop Networks

Sterz, Artur ; Klose, Robin ; Sommer, Markus ; Höchst, Jonas ; Link, Jakob ; Simon, Bernd ; Klein, Anja ; Hollick, Matthias ; Freisleben, Bernd (2023)
Energy-Efficient Decentralized Broadcasting in Wireless Multi-Hop Networks.
In: Sensors, 23 (17)
doi: 10.3390/s23177419
Artikel, Bibliographie

Dies ist die neueste Version dieses Eintrags.

Kurzbeschreibung (Abstract)

Several areas of wireless networking, such as wireless sensor networks or the Internet of Things, require application data to be distributed to multiple receivers in an area beyond the transmission range of a single node. This can be achieved by using the wireless medium’s broadcast property when retransmitting data. Due to the energy constraints of typical wireless devices, a broadcasting scheme that consumes as little energy as possible is highly desirable. In this article, we present a novel multi-hop data dissemination protocol called BTP. It uses a game-theoretical model to construct a spanning tree in a decentralized manner to minimize the total energy consumption of a network by minimizing the transmission power of each node. Although BTP is based on a game-theoretical model, it neither requires information exchange between distant nodes nor time synchronization during its operation, and it inhibits graph cycles effectively. The protocol is evaluated in Matlab and NS-3 simulations and through real-world implementation on a testbed of 75 Raspberry Pis. The evaluation conducted shows that our proposed protocol can achieve a total energy reduction of up to 90% compared to a simple broadcast protocol in real-world experiments.

Typ des Eintrags: Artikel
Erschienen: 2023
Autor(en): Sterz, Artur ; Klose, Robin ; Sommer, Markus ; Höchst, Jonas ; Link, Jakob ; Simon, Bernd ; Klein, Anja ; Hollick, Matthias ; Freisleben, Bernd
Art des Eintrags: Bibliographie
Titel: Energy-Efficient Decentralized Broadcasting in Wireless Multi-Hop Networks
Sprache: Englisch
Publikationsjahr: 2023
Ort: Darmstadt
Verlag: MDPI
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Sensors
Jahrgang/Volume einer Zeitschrift: 23
(Heft-)Nummer: 17
Kollation: 25 Seiten
DOI: 10.3390/s23177419
Zugehörige Links:
Kurzbeschreibung (Abstract):

Several areas of wireless networking, such as wireless sensor networks or the Internet of Things, require application data to be distributed to multiple receivers in an area beyond the transmission range of a single node. This can be achieved by using the wireless medium’s broadcast property when retransmitting data. Due to the energy constraints of typical wireless devices, a broadcasting scheme that consumes as little energy as possible is highly desirable. In this article, we present a novel multi-hop data dissemination protocol called BTP. It uses a game-theoretical model to construct a spanning tree in a decentralized manner to minimize the total energy consumption of a network by minimizing the transmission power of each node. Although BTP is based on a game-theoretical model, it neither requires information exchange between distant nodes nor time synchronization during its operation, and it inhibits graph cycles effectively. The protocol is evaluated in Matlab and NS-3 simulations and through real-world implementation on a testbed of 75 Raspberry Pis. The evaluation conducted shows that our proposed protocol can achieve a total energy reduction of up to 90% compared to a simple broadcast protocol in real-world experiments.

Freie Schlagworte: wireless networks, data dissemination, broadcast tree
Zusätzliche Informationen:

This paper is an extended version of our paper published in the 48th IEEE Conference on Local Computer Networks, Daytona Beach, FL, USA, 1–5 October 2023 (accepted for publication).

This article belongs to the Special Issue Energy-Efficient Communication Networks and Systems

Sachgruppe der Dewey Dezimalklassifikatin (DDC): 000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik
600 Technik, Medizin, angewandte Wissenschaften > 621.3 Elektrotechnik, Elektronik
Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Kommunikationstechnik
20 Fachbereich Informatik
20 Fachbereich Informatik > Sichere Mobile Netze
DFG-Sonderforschungsbereiche (inkl. Transregio)
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > A: Konstruktionsmethodik
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > A: Konstruktionsmethodik > Teilprojekt A3: Migration
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > B: Adaptionsmechanismen
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > B: Adaptionsmechanismen > Teilprojekt B3: Adaptionsökonomie
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > C: Kommunikationsmechanismen
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1053: MAKI – Multi-Mechanismen-Adaption für das künftige Internet > C: Kommunikationsmechanismen > Teilprojekt C5: Kontextzentrische Sicht
Hinterlegungsdatum: 02 Aug 2024 12:55
Letzte Änderung: 02 Aug 2024 12:55
PPN:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen