Dynamic Programming Optimization in Line of Sight Networks

06/05/2018
by   Pavan Sangha, et al.
0

Line of Sight (LoS) networks were designed to model wireless communication in settings which may contain obstacles restricting node visibility. For fixed positive integer d, and positive integer ω, a graph G=(V,E) is a (d-dimensional) LoS network with range parameter ω if it can be embedded in a cube of side size n of the d-dimensional integer grid so that each pair of vertices in V are adjacent if and only if their embedding coordinates differ only in one position and such difference is less than ω. In this paper we investigate a dynamic programming (DP) approach which can be used to obtain efficient algorithmic solutions for various combinatorial problems in LoS networks. In particular DP solves the Maximum Independent Set (MIS) problem in LoS networks optimally for any ω on narrow LoS networks (i.e. networks which can be embedded in a n × k × k ...× k region, for some fixed k independent of n). In the unrestricted case it has been shown that the MIS problem is NP-hard when ω > 2 (the hardness proof goes through for any ω=O(n^1-δ), for fixed 0<δ<1). We describe how DP can be used as a building block in the design of good approximation algorithms. In particular we present a 2-approximation algorithm and a fast polynomial time approximation scheme for the MIS problem in arbitrary d-dimensional LoS networks. Finally we comment on how the approach can be adapted to solve a number of important optimization problems in LoS networks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2022

Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization

For combinatorial optimization problems, model-based approaches such as ...
research
03/20/2019

A Novel Dynamic Programming Approach to the Train Marshalling Problem

Train marshalling is the process of reordering the railcars of a train i...
research
12/23/2020

Approximation Limitations of Pure Dynamic Programming

We prove the first, even super-polynomial, lower bounds on the size of t...
research
12/08/2021

A PTAS for the Min-Max Euclidean Multiple TSP

We present a polynomial-time approximation scheme (PTAS) for the min-max...
research
10/29/2014

Extended Dynamic Programming and Fast Multidimensional Search Algorithm for Energy Minization in Stereo and Motion

This paper presents a novel extended dynamic programming approach for en...
research
05/15/2020

Minimizing the Installation Cost of Ground Stations in Satellite Networks: Complexity, Dynamic Programming and Approximation Algorithm

In this letter, we study the optimum selection of ground stations (GSs) ...
research
07/05/2021

Polymorphic dynamic programming by algebraic shortcut fusion

Dynamic programming (DP) is a broadly applicable algorithmic design para...

Please sign up or login with your details

Forgot password? Click here to reset