Flow Problems in Multi-Interface Networks

D’Angelo, Gianlorenzo; Stefano, Gabriele Di; Navarra, Alfredo

doi:10.1109/tc.2012.214

Cited by 11 publications

(2 citation statements)

References 28 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In D’Angelo et al [ 28 ] and in Audrito et al [ 29 ], the authors study the bandwidth constraint problem. This concerns flow on multi-interface networks.…”

Section: Related Workmentioning

confidence: 99%

Fast File Transfers from IoT Devices by Using Multiple Interfaces

Mostarda

Navarra

Nobili

2020

Sensors

Self Cite

View full text Add to dashboard Cite

The Internet-of-Things (IoT) is a modern technological revolution that enables communication amongst a plethora of different devices. To date, about 30 billion devices have been connected to the internet and more than 75 billion devices are probably to be connected worldwide by 2025. These can range from small sensors and actuators to larger devices such as smartphones, drones or even buildings and interconnected cars. Devices are often mobile and battery powered thus their communication requires fast and energy efficient solutions. To this end, this paper studies the use of multi-interface communication for fast and energy efficient communication. In particular, we consider the basic operation of data transfer between smartphones in the form of files. This task can be performed for backup purposes, and hence it represents a useful and frequent operation that users perform. Our aim is to provide a new and easy means that optimises file transfers with respect to time and energy consumption. In particular, as smartphones are endowed with various connecting interfaces like Bluetooth, WiFi and 4G, we conduct experimental studies by varying different parameters in order to understand the best setting, including which interface is more appropriate to accomplish file transfer. To this respect, we also implemented an innovative and light app that allows the use of two or more interfaces concurrently. The experimental results show how the coupling of some interfaces might be effective in terms of time, while consuming a negligible amount of energy. Actually, such results become more and more interesting as the size of the file to be transferred grows. The best combination experienced is by making use of WiFi at 5 GHz concurrently with 4G, whereas WiFi at 2.4 GHz caused interference complications.

show abstract

“…In D’Angelo et al [ 28 ] and in Audrito et al [ 29 ], the authors study the bandwidth constraint problem. This concerns flow on multi-interface networks.…”

Section: Related Workmentioning

confidence: 99%

Fast File Transfers from IoT Devices by Using Multiple Interfaces

Mostarda

Navarra

Nobili

2020

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…The authors [15,16] face bandwidth constraints by investigating flow problems in multi-interface networks. Each interface is associated with one additional parameter that defines the bandwidth the interface can deal with.…”

Section: Related Workmentioning

confidence: 99%

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