English
Related papers

Related papers: Optimally Approximating the Coverage Lifetime of W…

200 papers

We develop a graph neural network (GNN) to compute, within a time budget of 1 to 2 milliseconds required by practical systems, the optimal linear precoder (OLP) maximizing the minimal downlink user data rate for a Cell-Free Massive MIMO…

Signal Processing · Electrical Eng. & Systems 2024-06-10 Benjamin Parlier , Lou Salaün , Hong Yang

This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem.…

Robotics · Computer Science 2023-07-11 Mingyu Kim , Harun Yetkin , Daniel J. Stilwell , Jorge Jimenez , Saurav Shrestha , Nina Stark

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost…

Networking and Internet Architecture · Computer Science 2014-01-14 Abhijit Bhattacharya , Akhila Rao , K. P. Naveen , P. P. Nishanth , S. V. R. Anand , Anurag Kumar

We study the maximum $k$-set coverage problem in the following distributed setting. A collection of sets $S_1,\ldots,S_m$ over a universe $[n]$ is partitioned across $p$ machines and the goal is to find $k$ sets whose union covers the most…

Data Structures and Algorithms · Computer Science 2018-08-24 Sepehr Assadi , Sanjeev Khanna

The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the…

Optimization and Control · Mathematics 2018-08-02 Mariam M. N. Aboelwafa , Mohamed A. Abd-Elmagid , Alessandro Biason , Karim G. Seddik , Tamer ElBatt , Michele Zorzi

We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\mathsf{NP}$-hard, but as for many $\mathsf{NP}$-hard problems…

Computational Geometry · Computer Science 2018-05-17 Jérémy Barbay , Pablo Pérez-Lantero , Javiel Rojas-Ledesma

Camera pose estimation is a fundamental problem in robotics. This paper focuses on two issues of interest: First, point and line features have complementary advantages, and it is of great value to design a uniform algorithm that can fuse…

Robotics · Computer Science 2024-07-24 Guangyang Zeng , Biqiang Mu , Qingcheng Zeng , Yuchen Song , Chulin Dai , Guodong Shi , Junfeng Wu

We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise…

Networking and Internet Architecture · Computer Science 2012-05-08 Thomas Kesselheim

Packing problems constitute an important class of optimization problems, both because of their high practical relevance and theoretical appeal. However, despite the large number of variants that have been studied in the literature, most…

Data Structures and Algorithms · Computer Science 2020-12-09 Guido Schäfer , Bernard G. Zweers

In modern wireless networks, devices are able to set the power for each transmission carried out. Experimental but also theoretical results indicate that such power control can improve the network capacity significantly. We study this…

Networking and Internet Architecture · Computer Science 2010-08-27 Thomas Kesselheim

Deep neural networks (DNNs) have been introduced for designing wireless policies by approximating the mappings from environmental parameters to solutions of optimization problems. Considering that labeled training samples are hard to…

Information Theory · Computer Science 2020-08-12 Chengjian Sun , Changyang She , Chenyang Yang

In this paper, we combat the problem of performance optimization in wireless sensor networks. Specifically, a novel framework is proposed to handle two major research issues. Firstly, we optimize the utilization of resources available to…

Networking and Internet Architecture · Computer Science 2017-12-13 Muzammil Behzad , Manal Abdullah , Muhammad Talal Hassan , Yao Ge , Mahmood Ashraf Khan

In this paper, we consider an intrusion detection application for Wireless Sensor Networks (WSNs). We study the problem of scheduling the sleep times of the individual sensors to maximize the network lifetime while keeping the tracking…

Systems and Control · Computer Science 2014-03-25 Prashanth L. A. , Abhranil Chatterjee , Shalabh Bhatnagar

Deterministic linear network coding (DLNC) is an important family of network coding techniques for wireless packet broadcast. In this paper, we show that DLNC is strongly related to and can be effectively studied using matroid theory…

Information Theory · Computer Science 2015-06-04 Mingchao Yu , Parastoo Sadeghi , Neda Aboutorab

We consider the problem of finding patrol schedules for $k$ robots to visit a given set of $n$ sites in a metric space. Each robot has the same maximum speed and the goal is to minimize the weighted maximum latency of any site, where the…

Data Structures and Algorithms · Computer Science 2020-07-15 Peyman Afshani , Mark De Berg , Kevin Buchin , Jie Gao , Maarten Loffler , Amir Nayyeri , Benjamin Raichel , Rik Sarkar , Haotian Wang , Hao-Tsung Yang

We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this…

Data Structures and Algorithms · Computer Science 2019-07-01 Vincenzo Bonifaci , Peter Korteweg , Alberto Marchetti-Spaccamela , Leen Stougie

In this paper, we study a wireless packet broadcast system that uses linear network coding (LNC) to help receivers recover data packets that are missing due to packet erasures. We study two intertwined performance metrics, namely throughput…

Information Theory · Computer Science 2017-01-18 Mingchao Yu , Parastoo Sadeghi

Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks due to full control on energy transfer, far field region, small and low-cost circuitry. In this paper,…

Signal Processing · Electrical Eng. & Systems 2020-06-23 Muhammad Shahid Iqbal , Yalcin Sadi , Sinem Coleri

Finding complete subgraphs in a graph, that is, cliques, is a key problem and has many real-world applications, e.g., finding communities in social networks, clustering gene expression data, modeling ecological niches in food webs, and…

Optimization and Control · Mathematics 2017-05-01 Melisew Tefera Belachew , Nicolas Gillis

In Cognitive Radio Networks (CRNs), unlicensed users are allowed to access the licensed spectrum when it is not currently being used by primary users (PUs). In this paper, we study the throughput maximization problem for a multi-channel CRN…

Networking and Internet Architecture · Computer Science 2012-11-16 Shuang Li , Zizhan Zheng , Eylem Ekici , Ness B. Shroff