A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability

Author(s):  
Sebastián Laborde ◽  
Franco Robledo ◽  
Pablo Romero ◽  
Omar Viera
2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Marcello Carioni ◽  
Alessandra Pluda

Abstract Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of the Steiner problem in several variants. Our goal is to compare the different notions of calibrations for the Steiner problem and for planar minimal partitions that are already present in the literature. The paper is then complemented with remarks on the convexification of the problem, on nonexistence of calibrations and on calibrations in families.


2014 ◽  
Vol 352 (5) ◽  
pp. 451-454 ◽  
Author(s):  
Antoine Lemenant ◽  
Filippo Santambrogio
Keyword(s):  

Networks ◽  
2016 ◽  
Vol 69 (1) ◽  
pp. 33-51 ◽  
Author(s):  
Andreas Bley ◽  
Ivana Ljubić ◽  
Olaf Maurer
Keyword(s):  

2009 ◽  
Vol 5 (4) ◽  
pp. 128
Author(s):  
Nuraj Pradhan ◽  
Tarek Saadawi

In order to be strongly connected in the network, a node may increase its power indiscriminately causing interference. Since interference is one of the major problems in wireless network, the proposed algorithm will co-operatively reduce inter-node interference in the network. Further, uni-directional links are a major source of interference as most of the routing protocol only utilizes bi-directional links. The algorithm will attempt to prevent such links or if required convert them into bi-directional links. We will show that the proposed algorithm provides strongly connected and more reliable network over dynamic physical channel modeled by log-distance path loss model, log-normal shadowing model and rayleigh fading model. It stabilizes node connectivity over the dynamic network and environment and even, to a certain extent, prevent node from being completely disconnected from the network. For the selected simulation environment, we will show that the proposed algorithm provides a shorter packet delay, improves the network throughput by as much as 37%, decreases the routing overhead and reduces interference.


2013 ◽  
Vol 6 (2) ◽  
pp. 251-260
Author(s):  
Denise Halverson ◽  
Andrew Logan
Keyword(s):  

2016 ◽  
Vol 73 (7) ◽  
pp. 2966-2986 ◽  
Author(s):  
Min-Kuan Chang ◽  
Yu-Wei Chan ◽  
Hsiao-Ping Tsai ◽  
Ting-Chen Chen ◽  
Min-Han Chuang

Sign in / Sign up

Export Citation Format

Share Document