Abstract
A communication network's survivability and routability are primarily based on the degree of interconnection between the existing nodes of the network. Enhancement of these characteristics can be obtained by adding direct communication links between nodes of the network. This process is generally subject to a budget constraint. We show that the link enhancement problem, for a given investment, is NP-complete. Explanation of the proposed heuristic, for near-optimal solution, is presented with several examples. Improvements on previous work using constrained range and reduced candidate set searches are introduced and clarified. A review of pertinent previous work, problem formulation, algorithm presentation, and discussion of computational issues are also provided.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
