DeepAI AI Chat
Log In Sign Up

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

by   Roman Plotnikov, et al.

We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consumption spent for the data transmission is minimized and the maximum number of hops between two nodes is bounded by some predefined constant. We focus on the planar Euclidian case of this problem where the nodes are placed at the random uniformly spread points on a square and the power cost necessary for the communication between two network elements is proportional to the squared distance between them. Since this is an NP-hard problem, we propose different polynomial heuristic algorithms for the approximation solution to this problem. We perform a posteriori comparative analysis of the proposed algorithms and present the obtained results in this paper.


page 1

page 2

page 3

page 4


Parameterized Complexity of Min-Power Asymmetric Connectivity

We investigate parameterized algorithms for the NP-hard problem Min-Powe...

The 2-connected bottleneck Steiner network problem is NP-hard in any ℓ_p plane

Bottleneck Steiner networks model energy consumption in wireless ad-hoc ...

Learning Data Dependency with Communication Cost

In this paper, we consider the problem of recovering a graph that repres...

Maximum Lifetime Convergecast Tree in Wireless Sensor Networks

We study the problem of building a maximum lifetime data collection tree...

An Energy-Efficient Controller for Wirelessly-Powered Communication Networks

In a wirelessly-powered communication network (WPCN), an energy access p...

A Robust Advantaged Node Placement Strategy for Sparse Network Graphs

Establishing robust connectivity in heterogeneous networks (HetNets) is ...