Searcharxiv⌕ Search

arXiv subjects

Theofanis P. Raptis

Publications and source records attributed to Theofanis P. Raptis.

25 records · Page 2Linked to original sources

Balanced Wireless Crowd Charging with Mobility Prediction and Social Awareness

The advancements in peer-to-peer wireless power transfer (P2P-WPT) have empowered the portable and mobile devices to wirelessly replenish their battery by directly interacting with other nearby devices. The existing works unrealistically assume the users to exchange energy with any of the users and at every such opportunity. However, due to the users' mobility, the inter-node meetings in such opportunistic mobile networks vary, and P2P energy exchange in such scenarios remains uncertain. Additionally, the social interests and interactions of the users influence their mobility as well as the energy exchange between them. The existing P2P-WPT methods did not consider the joint problem for energy exchange due to user's inevitable mobility, and the influence of sociality on the latter. As a result of computing with imprecise information, the energy balance achieved by these works at a slower rate as well as impaired by energy loss for the crowd. Motivated by this problem scenario, in this work, we present a wireless crowd charging method, namely MoSaBa, which leverages mobility prediction and social information for improved energy balancing. MoSaBa incorporates two dimensions of social information, namely social context and social relationships, as additional features for predicting contact opportunities. In this method, we explore the different pairs of peers such that the energy balancing is achieved at a faster rate as well as the energy balance quality improves in terms of maintaining low energy loss for the crowd. We justify the peer selection method in MoSaBa by detailed performance evaluation. Compared to the existing state-of-the-art, the proposed method achieves better performance trade-offs between energy-efficiency, energy balance quality and convergence time.

cs.NI↗

Wireless charging for weighted energy balance in populations of mobile peers

Wireless energy transfer is an emerging technology that is used in networks of battery-powered devices in order to deliver energy and keep the network functional. Existing state-of-the-art studies have mainly focused on applying this technology on networks of relatively strong computational and communicational capabilities (wireless sensor networks, ad-hoc networks); also they assume energy transfer from special chargers to regular network nodes. Different from these works, we study how to efficiently transfer energy wirelessly in populations of battery-limited devices, towards prolonging their lifetime. In contrast to the state-of-the-art, we assume a much weaker population of distributed devices which are exchanging energy in a "peer to peer" manner with each other, without any special charger nodes. We address a quite general case of diverse energy levels and priorities in the network and study the problem of how the system can efficiently reach a weighted energy balance state distributively, under both loss-less and lossy power transfer assumptions. Three protocols are designed, analyzed and evaluated, achieving different performance trade-offs between energy balance quality, convergence time and energy efficiency.

cs.NI↗

Radiation-constrained algorithms for Wireless Energy Transfer in Ad hoc Networks

We study the problem of efficiently charging a set of rechargeable nodes using a set of wireless chargers, under safety constraints on the electromagnetic radiation incurred. In particular, we define a new charging model that greatly differs from existing models in that it takes into account real technology restrictions of the chargers and nodes of the network, mainly regarding energy limitations. Our model also introduces non-linear constraints (in the time domain), that radically change the nature of the computational problems we consider. In this charging model, we present and study the Low Radiation Efficient Charging Problem (LREC), in which we wish to optimize the amount of "useful" energy transferred from chargers to nodes (under constraints on the maximum level of imposed radiation). We present several fundamental properties of this problem and provide indications of its hardness. Finally, we propose an iterative local improvement heuristic for LREC, which runs in polynomial time and we evaluate its performance via simulation. Our algorithm decouples the computation of the objective function from the computation of the maximum radiation and also does not depend on the exact formula used for the computation of the electromagnetic radiation in each point of the network, achieving good trade-offs between charging efficiency and radiation control; it also exhibits good energy balance properties. We provide extensive simulation results supporting our claims and theoretical results.

cs.NI↗

An algorithmic study in the vector model for Wireless Power Transfer maximization

Rapid technological advances in the domain of Wireless Power Transfer (WPT) pave the way for novel methods for power management in systems of wireless devices and recent research works have already started considering algorithmic solutions for tackling emerging problems. However, many of those works are limited by the system modelling, and more specifically the one-dimensional abstraction suggested by Friis formula for the power received by one antenna under idealized conditions given another antenna some distance away. Different to those works, we use a model which arises naturally from fundamental properties of the superposition of energy fields. This model has been shown to be more realistic than other one-dimensional models that have been used in the past and can capture superadditive and cancellation effects. Under this model, we define two new interesting problems for configuring the wireless power transmitters so as to maximize the total power in the system and we prove that the first problem can be solved in polynomial time. We present a distributed solution that runs in pseudo-polynomial time and uses various knowledge levels and we provide theoretical performance guarantees. Finally, we design three heuristics for the second problem and evaluate them via simulations.

cs.NI↗

Keeping data at the edge of smart irrigation networks: A case study in strawberry greenhouses

Strawberries are widely appreciated for their aroma, bright red color, juicy texture, and sweetness. They are, however, among the most sensitive fruits when it comes to the quality of the end product. The recent commercial trends show a rising number of farmers who directly sell their products and are interested in using smart solutions for a continuous quality control of the product. Cloud-based approaches for smart irrigation have been widely used in the recent years. However, the network traffic, security and regulatory challenges, which come hand in hand with sharing the crop data with third parties outside the edge of the network, lead strawberry farmers and data owners to rely on global clouds and potentially lose control over their data, which are usually transferred to third party data centers. In this paper, we follow a three-step methodological approach in order to design, implement and validate a solution for smart strawberry irrigation in greenhouses, while keeping the corresponding data at the edge of the network: (i) We develop a small-scale smart irrigation prototype solution with off-the-shelf hardware and software equipment, which we test and evaluate on different kinds of plants in order to gain useful insights for larger scale deployments, (ii) we introduce a reference network architecture, specifically targeting smart irrigation and edge data distribution for strawberry greenhouses, and (iii) adopting the proposed reference architecture, we implement a full-scale system in an actual strawberry greenhouse environment in Greece, and we compare its performance against that of conventional strawberries irrigation. We show that our design significantly outperforms the conventional approach, both in terms of soil moisture variation and in terms of water consumption, and conclude by critically appraising the costs and benefits of our approach in the agricultural industry.

cs.NI↗

Data Management in Industry 4.0: State of the Art and Open Challenges

Information and communication technologies are permeating all aspects of industrial and manufacturing systems, expediting the generation of large volumes of industrial data. This article surveys the recent literature on data management as it applies to networked industrial environments and identifies several open research challenges for the future. As a first step, we extract important data properties (volume, variety, traffic, criticality) and identify the corresponding data enabling technologies of diverse fundamental industrial use cases, based on practical applications. Secondly, we provide a detailed outline of recent industrial architectural designs with respect to their data management philosophy (data presence, data coordination, data computation) and the extent of their distributiveness. Then, we conduct a holistic survey of the recent literature from which we derive a taxonomy of the latest advances on industrial data enabling technologies and data centric services, spanning all the way from the field level deep in the physical deployments, up to the cloud and applications level. Finally, motivated by the rich conclusions of this critical analysis, we identify interesting open challenges for future research. The concepts presented in this article thematically cover the largest part of the industrial automation pyramid layers. Our approach is multidisciplinary, as the selected publications were drawn from two fields; the communications, networking and computation field as well as the industrial, manufacturing and automation field. The article can help the readers to deeply understand how data management is currently applied in networked industrial environments, and select interesting open research opportunities to pursue.

cs.NI↗

Distributed Path Reconfiguration and Data Forwarding in Industrial IoT Networks

In today's typical industrial environments, the computation of the data distribution schedules is highly centralised. Typically, a central entity configures the data forwarding paths so as to guarantee low delivery delays between data producers and consumers. However, these requirements might become impossible to meet later on, due to link or node failures, or excessive degradation of their performance. In this paper, we focus on maintaining the network functionality required by the applications after such events. We avoid continuously recomputing the configuration centrally, by designing an energy efficient local and distributed path reconfiguration method. Specifically, given the operational parameters required by the applications, we provide several algorithmic functions which locally reconfigure the data distribution paths, when a communication link or a network node fails. We compare our method through simulations to other state of the art methods and we demonstrate performance gains in terms of energy consumption and data delivery success rate as well as some emerging key insights which can lead to further performance gains.

cs.NI↗