Please use this identifier to cite or link to this item:
Title: On the Tradeoff Between Network Lifetime and k-Connectivity-Based Reliability in UWSNs
Authors: Çobanlar, Muhammed
Yıldız, Huseyin Uğur
Akram, Vahid Khalilpour
Dağdeviren, Orhan
Tavlı, Bülent
Keywords: Reliability
Wireless sensor networks
Maintenance engineering
Internet of Things
mixed-integer linear programming (MILP)
network lifetime (NLT)
underwater wireless sensor networks (UWSNs)
Detection Algorithm
Issue Date: 2022
Publisher: Ieee-Inst Electrical Electronics Engineers Inc
Abstract: Underwater wireless sensor networks (UWSNs) are utilized for a wide range of monitoring and surveillance applications. Lifetime maximization and maintenance of network reliability are among the most important considerations in the deployment of UWSNs. k-connectivity is a robust approach for reinforcing reliability. However, maintaining k disjoint paths from each sensor node to the BS, inevitably, results in extra energy dissipation, which reduces the network lifetime (NLT). Yet, there is no systematic exploration to determine the extent of lifetime reduction due to the increase in the k value, in the literature, to the best of our knowledge. In this study, we create an optimization framework to be able to explore the tradeoff between NLT and k-connectivity-based reliability in UWSNs. Through the optimal solutions of the proposed optimization model for a large set of salient parameters, we characterize the interplay between lifetime and k-connectivity. Our analysis reveals that the k value to be maintained in a UWSN can affect the NLT significantly.
ISSN: 2327-4662
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

checked on Jun 5, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.