z-logo
open-access-imgOpen Access
Energy-Efficient Routing in Wireless Sensor Networks
Author(s) -
Dániel Pásztor,
Péter Ekler,
János Levendovszky
Publication year - 2021
Publication title -
acta cybernetica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.143
H-Index - 18
eISSN - 2676-993X
pISSN - 0324-721X
DOI - 10.14232/actacyb.288351
Subject(s) - computer science , computer network , network packet , wireless sensor network , reliability (semiconductor) , routing protocol , energy consumption , data transmission , routing (electronic design automation) , transmission (telecommunications) , efficient energy use , throughput , distributed computing , wireless , power (physics) , telecommunications , engineering , physics , quantum mechanics , electrical engineering
Efficient data collection is the core concept of implementing Industry4.0 on IoT platforms. This requires energy aware communication protocols for Wireless Sensor Networks (WSNs) where different functions, like sensing and processing on the IoT nodes must be supported by local battery power. Thus, energy aware network protocols, such as routing, became one of fundamental challenges in IoT data collection schemes.In our research, we have developed novel routing algorithms which guarantee minimum energy consumption data transfer which is achieved subject to pre-defined reliability constraints. We assume that data is transmitted in the form of packets and the routing algorithm identifies the paths over which the packets can reach the Base Station (BS) with minimum transmission energy, while the probability of successful packet transmission still exceeds a pre-defined reliability parameter. In this way, the longevity and the information throughput of the network is maximized and the low energy transmissions will considerably extend the lifetime of the IoT nodes. In this paper we propose a solution that maximizes the lifetime of the nodes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here