Distributing Energy Consumption in Multi-interface Series-Parallel Networks

Aloisio, Alessandro; Navarra, Alfredo; Mostarda, Leonardo

doi:10.1007/978-3-030-15035-8_71

Cited by 8 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Considering the new notation, that problem becomes CMI(∞), i.e., p = ∞. Moreover, following the trend of the previous work [2,3] on the same subject (and similarly to the technique used in [19]), we focus on CMI (2). The contribution of this paper is summarized and compared with previous results in Table 1.…”

Section: Our Resultsmentioning

confidence: 98%

“…Multi-interface wireless network combinatorial problems have been studied in [10] and [1,11] which investigate the Coverage problem. The constrained Coverage problem referred to as p-Coverage has been introduced in [2] and further investigated in [3].…”

Section: Related Workmentioning

confidence: 99%

“…If i is an internal node of T with two children j and k, then we compute f (i, A) solving the following minimization problem, where A has several subsets equal to |(V i , V −i )|, as defined in Equation (3). Moreover, there can be edges between G(j) and G(l).…”

Section: Solving Cmi(2) On Graphs With Bounded Carvingwidthmentioning

confidence: 99%

“…The objective is the minimization of the overall network activation cost. We add to the Coverage problem a further constraint [2][3][4][5] where a device cannot activate more than p interfaces. This constraint is used to keep under control the energy spent by single devices.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Constrained Connectivity in Bounded X-Width Multi-Interface Networks

Aloisio

Navarra

2020

Algorithms

Self Cite

View full text Add to dashboard Cite

As technology advances and the spreading of wireless devices grows, the establishment of interconnection networks is becoming crucial. Main activities that involve most of the people concern retrieving and sharing information from everywhere. In heterogeneous networks, devices can communicate by means of multiple interfaces. The choice of the most suitable interfaces to activate (switch-on) at each device results in the establishment of different connections. A connection is established when at its endpoints the devices activate at least one common interface. Each interface is assumed to consume a specific percentage of energy for its activation. This is referred to as the cost of an interface. Due to energy consumption issues, and the fact that most of the devices are battery powered, special effort must be devoted to suitable solutions that prolong the network lifetime. In this paper, we consider the so-called p-Coverage problem where each device can activate at most p of its available interfaces in order to establish all the desired connections of a given network of devices. As the problem has been shown to be NP -hard even for p = 2 and unitary costs of the interfaces, algorithmic design activities have focused in particular topologies where the problem is optimally solvable. Following this trend, we first show that the problem is polynomially solvable for graphs (modeling the underlying network) of bounded treewidth by means of the Courcelle’s theorem. Then, we provide two optimal polynomial time algorithms to solve the problem in two subclasses of graphs with bounded treewidth that are graphs of bounded pathwidth and graphs of bounded carvingwidth. The two solutions are obtained by means of dynamic programming techniques.

show abstract

Section: Our Resultsmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Section: Solving Cmi(2) On Graphs With Bounded Carvingwidthmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Constrained Connectivity in Bounded X-Width Multi-Interface Networks

Aloisio

Navarra

2020

Algorithms

Self Cite

View full text Add to dashboard Cite

show abstract

“…Albertson and Haas investigated the problem in [1,2] when G is a cubic graph. See also [21], where it is shown that for every cubic graph G ν 2 (G) ≥ 4 5 |V (G)| and ν 3 (G) ≥ 7 6 |V (G)|. Moreover, [6] proves that for any cubic graph G ν 2 (G) + ν 3 (G) ≥ 2|V (G)|, and in [21,22] Mkrtchyan et al showed that for any cubic graph G ν 2 (G) ≤ |V (G)|+2ν 3 (G)…”

Section: Introductionmentioning

confidence: 99%

Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem

Aloisio

Mkrtchyan

2021

Advanced Information Networking and Applications

Self Cite

View full text Add to dashboard Cite

A k-edge-coloring of a graph is an assignment of colors {1, ..., k} to edges of the graph such that adjacent edges receive different colors. In the maximum k-edge-colorable subgraph problem we are given a graph and an integer k, the goal is to find a k-edge-colorable subgraph with maximum number of edges together with its k-edge-coloring. In this paper, we consider the maximum 2-edge-colorable subgraph problem and present some results that deal with the fixed-parameter tractability of this problem.

show abstract

Coverage Subject to a Budget on Multi-Interface Networks with Bounded Carving-Width

Aloisio

2020

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Distributing Energy Consumption in Multi-interface Series-Parallel Networks

Cited by 8 publications

References 21 publications

Constrained Connectivity in Bounded X-Width Multi-Interface Networks

Constrained Connectivity in Bounded X-Width Multi-Interface Networks

Algorithmic Aspects of the Maximum 2-edge-colorable Subgraph Problem

Coverage Subject to a Budget on Multi-Interface Networks with Bounded Carving-Width

Contact Info

Product

Resources

About