Balancing Energy Consumption for the Establishment of Multi-interface Networks

Aloisio, Alessandro; Navarra, Alfredo

doi:10.1007/978-3-662-46078-8_9

Cited by 13 publications

(8 citation statements)

References 12 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%

“…Surprisingly, the basic case for p = 2 comes out to be more difficult, in general, than CMI(∞). In fact, in [2] the following theorem has been proved:…”

Section: Goalmentioning

confidence: 99%

“…In fact, by activating all interfaces for each node, a feasible solution for CMI(∞) is obtained. However, there are special graph classes that turn out to be much more affordable in CMI (2). Concerning trees and complete graphs, for instance, in [2] the CMI(∞) problem has been investigated.…”

Section: Goalmentioning

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 4 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%

“…Surprisingly, the basic case for p = 2 comes out to be more difficult, in general, than CMI(∞). In fact, in [2] the following theorem has been proved:…”

Section: Goalmentioning

confidence: 99%

Section: Goalmentioning

confidence: 99%