Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

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.

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

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 ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

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 ...

This thesis demonstrates that it is feasible for systems code to expose a latency interface that describes its latency and related side effects for all inputs, just like the code's semantic interface describes its functionality and related side effects. S ...

2.5D Systems-on-Package (SoPs) are composed by several chiplets placed on an interposer. They are becoming increasingly popular as they enable easy integration of electronic components in the same package and high fabrication yields. Nevertheless, they int ...

Maximal subgraph mining is increasingly important in various domains, including bioinformatics, genomics, and chemistry, as it helps identify common characteristics among a set of graphs and enables their classification into different categories. Existing ...

Dataflow programming is a methodology that enables the development of high-level, parametric programs that are independent of the underlying platform. This approach is particularly useful for heterogeneous platforms, as it eliminates the need to rewrite ap ...

Simulation is a powerful approach that plays a significant role in science and technology. Computational models that simulate learner interactions and data hold great promise for educational technology as well. Amongst others, simulated learners can be use ...

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

The purpose of this research has a background in the market for Internet of Things (IoT)devices and wireless sensor networks. The Market Forecast predicts the connection of a trillion"things" by 2025. The global smart sensor market size trend grows from US ...

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

Chat with Graph Search

Succinct ordering and aggregation constraints in algebraic array theories

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

Approximation Algorithms for Allocation and Network Design

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Results on Sparse Integer Programming and Geometric Independent Sets

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

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

Better Trees for Santa Claus

Latency Interfaces for Systems Code

REMOTE: Re-thinking Task Mapping on Wireless 2.5D Systems-on-Package for Hotspot Removal

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Design Space Exploration for Partitioning Dataflow Program on CPU-GPU Heterogeneous System

Simulated Learners in Educational Technology: A Systematic Literature Review and a Turing-like Test

Discrete Optimal Transport with Independent Marginals is #P-Hard

The double exponential runtime is tight for 2-stage stochastic ILPs

Minimum Cost Intervention Design for Causal Effect Identification

Formula Normalizations in Verification

Streaming and Matching Problems with Submodular Functions

Strategies, Techniques and Systems for powering low-maintenance and battery-free devices through Energy Harvesting and Wireless Power Transfer