Joint Sink Mobility and Routing to Maximize the Lifetime of Wireless Sensor Networks: The Case of Constrained Mobility

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Federated Learning (FL) enables end-user devices to collaboratively train ML models without sharing raw data, thereby preserving data privacy. In FL, a central parameter server coordinates the learning process by iteratively aggregating the trained models ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Given two elliptic curves and the degree of an isogeny between them, finding the isogeny is believed to be a difficult problem—upon which rests the security of nearly any isogeny-based scheme. If, however, to the data above we add information about the beh ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

Static and mobile sensor nodes can be employed in gas monitoring tasks to detect gas leaks in an early stage and localize gas sources. Due to the intermittent nature of gas plumes and the slow dynamics of commonly used gas sensors, measuring gas concentrat ...

Operators from various industries have been pushing the adoption of wireless sensing nodes for industrial monitoring, and such efforts have produced sizeable condition monitoring datasets that can be used to build diagnosis algorithms capable of warning ma ...

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

We present a numerical model for the approximation of multiphase flows with free surfaces and strong interfacial effects. The model relies on the multiphase incompressible Navier-Stokes equations, and includes surface tension effects on the interfaces betw ...

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

The wireless sensor nodes used for monitoring the condition of grid equipment always be powered by disposable batteries. However, it introduces disadvantages, such as inconvenient replacement, short lifespan, and envi-ronmental pollution, significantly imp ...

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

Incidents where water networks are contaminated with microorganisms or pollutants can result in a large number of infected or ill persons, and it is therefore important to quickly detect, localize and estimate the spread and source of the contamination. In ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

. High-resolution simulations of particle-based kinetic plasma models typically require a high number of particles and thus often become computationally intractable. This is exacerbated in multi-query simulations, where the problem depends on a set of para ...

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

Linear-Quadratic-Gaussian (LQG) control is a fundamental control paradigm that is studied in various fields such as engineering, computer science, economics, and neuroscience. It involves controlling a system with linear dynamics and imperfect observations ...

Joint Sink Mobility and Routing to Maximize the Lifetime of Wireless Sensor Networks: The Case of Constrained Mobility

Chat with Graph Search

Practical Federated Learning without a Server

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

The Two Times Problem: Where Is the Problem?

Learning to Remove Cuts in Integer Linear Programming

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Isogeny Problems with Level Structure

A ride time-oriented scheduling algorithm for dial-a-ride problems

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Design and Evaluation of Modular Gas and Wind Sensing Nodes for Static and Mobile Deployments

Federated learning with uncertainty-based client clustering for fleet-wide fault diagnosis

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

A cut-cell method for the numerical simulation of 3D multiphase flows with strong interfacial effects

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Self-powered transformer intelligent wireless temperature monitoring system based on an ultra-low acceleration piezoelectric vibration energy harvester

Better Trees for Santa Claus

Estimating pollution spread in water networks as a Schrödinger bridge problem with partial information

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Adaptive Symplectic Model Order Reduction Of Parametric Particle-Based Vlasov-Poisson Equation

Fairness and Explainability in Clustering Problems

Distributionally Robust Linear Quadratic Control