Finding Degree Constrained k-Cardinality Minimum Spanning Trees for Wireless Sensor Networks

2018 ◽  
pp. 51-62
Author(s):  
Pablo Adasme ◽  
Ismael Soto ◽  
Fabian Seguel
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spanning Trees ◽  
Wireless Sensor ◽  
Minimum Spanning Trees

Power Assignment for Symmetric Communication in Wireless Sensor Networks

2009 ◽  
Vol 5 (2) ◽  
pp. 185-200
Author(s):  
Joongseok Park ◽  
Sartaj Sahni
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Cost Reduction ◽  
Spanning Trees ◽  
Minimum Cost ◽  
Approximation Ratio ◽  
Wireless Sensor ◽  
Power Assignment ◽  
Power Cost

We show that two incremental power heuristics for power assignment in a wireless sensor network have an approximation ratio 2. Enhancements to these heuristics are proposed. It is shown that these enhancements do not reduce the approximation ratio of the considered incremental power heuristics. However, experiments conducted by us indicate that the proposed enhancements reduce the power cost of the assignment on average. Further, the two-edge switch enhancements reduce the power-cost reduction (relative to using minimum cost spanning trees) that is, on average, twice as much as obtainable from any of the heuristics proposed earlier.

scholarly journals An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks

Sensors ◽  
2015 ◽  
Vol 15 (1) ◽  
pp. 1518-1536 ◽  
Author(s):  
Rosana Lachowski ◽  
Marcelo Pellenz ◽  
Manoel Penna ◽  
Edgard Jamhour ◽  
Richard Souza
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Distributed Algorithm ◽  
Spanning Trees ◽  
Wireless Sensor

scholarly journals Bounded-degree minimum-radius spanning trees in wireless sensor networks

2013 ◽  
Vol 498 ◽  
pp. 46-57 ◽  
Author(s):  
Min Kyung An ◽  
Nhat X. Lam ◽  
Dung T. Huynh ◽  
Trac N. Nguyen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spanning Trees ◽  
Wireless Sensor ◽  
Bounded Degree ◽  
Minimum Radius

scholarly journals Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties

Sensors ◽  
2021 ◽  
Vol 21 (21) ◽  
pp. 7254
Author(s):  
Jianhua Lyu ◽  
Yiran Ren ◽  
Zeeshan Abbas ◽  
Baili Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spanning Trees ◽  
Minimum Spanning Tree ◽  
Wireless Sensor ◽  
Route Selection ◽  
Possible World ◽  
Filtering Algorithm ◽  
Search Spaces ◽  
Selection For

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.

Sign in / Sign up

Export Citation Format

Share Document