Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties

For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes. Reliability should come first before cost since no one wants a network that cannot work most of the time. First, reliable route selection...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Jianhua Lyu, Yiran Ren, Zeeshan Abbas, Baili Zhang
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	wireless sensor networks connection failure uncertainty route selection reliable spanning tree filtering Chemical technology TP1-1185
Acceso en línea:	https://doaj.org/article/dc6327f5e466401bb05de7e835539c2a
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:dc6327f5e466401bb05de7e835539c2a
record_format	dspace
spelling	oai:doaj.org-article:dc6327f5e466401bb05de7e835539c2a2021-11-11T19:13:15ZReliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties10.3390/s212172541424-8220https://doaj.org/article/dc6327f5e466401bb05de7e835539c2a2021-10-01T00:00:00Zhttps://www.mdpi.com/1424-8220/21/21/7254https://doaj.org/toc/1424-8220For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes. Reliability should come first before cost since no one wants a network that cannot work most of the time. First, reliable route selection for WSNs with connection failure uncertainties is formulated by considering the top-k most reliable spanning trees (RST) from graphs with structural uncertainties. The reliable spanning trees are defined as a set of spanning trees with top reliabilities and limited tree weights based on the possible world model. Second, two tree-filtering algorithms are proposed: the k minimum spanning tree (KMST) based tree-filtering algorithm and the depth-first search (DFS) based tree-filtering algorithm. Tree-filtering strategy filters the candidate RSTs generated by tree enumeration with explicit weight thresholds and implicit reliability thresholds. Third, an innovative edge-filtering method is presented in which edge combinations that act as upper bounds for RST reliabilities are utilized to filter the RST candidates and to prune search spaces. Optimization strategies are also proposed for improving pruning capabilities further and for enhancing computations. Extensive experiments are conducted to show the effectiveness and efficiency of the proposed algorithms.Jianhua LyuYiran RenZeeshan AbbasBaili ZhangMDPI AGarticlewireless sensor networksconnection failure uncertaintyroute selectionreliable spanning treefilteringChemical technologyTP1-1185ENSensors, Vol 21, Iss 7254, p 7254 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	wireless sensor networks connection failure uncertainty route selection reliable spanning tree filtering Chemical technology TP1-1185
spellingShingle	wireless sensor networks connection failure uncertainty route selection reliable spanning tree filtering Chemical technology TP1-1185 Jianhua Lyu Yiran Ren Zeeshan Abbas Baili Zhang Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
description	For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes. Reliability should come first before cost since no one wants a network that cannot work most of the time. First, reliable route selection for WSNs with connection failure uncertainties is formulated by considering the top-k most reliable spanning trees (RST) from graphs with structural uncertainties. The reliable spanning trees are defined as a set of spanning trees with top reliabilities and limited tree weights based on the possible world model. Second, two tree-filtering algorithms are proposed: the k minimum spanning tree (KMST) based tree-filtering algorithm and the depth-first search (DFS) based tree-filtering algorithm. Tree-filtering strategy filters the candidate RSTs generated by tree enumeration with explicit weight thresholds and implicit reliability thresholds. Third, an innovative edge-filtering method is presented in which edge combinations that act as upper bounds for RST reliabilities are utilized to filter the RST candidates and to prune search spaces. Optimization strategies are also proposed for improving pruning capabilities further and for enhancing computations. Extensive experiments are conducted to show the effectiveness and efficiency of the proposed algorithms.
format	article
author	Jianhua Lyu Yiran Ren Zeeshan Abbas Baili Zhang
author_facet	Jianhua Lyu Yiran Ren Zeeshan Abbas Baili Zhang
author_sort	Jianhua Lyu
title	Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
title_short	Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
title_full	Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
title_fullStr	Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
title_full_unstemmed	Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
title_sort	reliable route selection for wireless sensor networks with connection failure uncertainties
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/dc6327f5e466401bb05de7e835539c2a
work_keys_str_mv	AT jianhualyu reliablerouteselectionforwirelesssensornetworkswithconnectionfailureuncertainties AT yiranren reliablerouteselectionforwirelesssensornetworkswithconnectionfailureuncertainties AT zeeshanabbas reliablerouteselectionforwirelesssensornetworkswithconnectionfailureuncertainties AT bailizhang reliablerouteselectionforwirelesssensornetworkswithconnectionfailureuncertainties
_version_	1718431614305828864

Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties

Ejemplares similares