activity
20062015
most citedDynamic Routing for Flying Ad Hoc Networks

259 citations · 369 across the 10 of their papers we have counts for

collaborators

10 papers

cs.AI2015★ 9 cited

UAVs using Bayesian Optimization to Locate WiFi Devices

Mattia Carpin, Stefano Rosati, Mohammad Emtiyaz Khan +1

We address the problem of localizing non-collaborative WiFi devices in a large region. Our main motive is to localize humans by localizing their WiFi devices, e.g. during search-an…

cs.NI2014★ 259 cited

Dynamic Routing for Flying Ad Hoc Networks

S. Rosati, K. Kruzelecki, G. Heitz +2

This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehic…

cs.NI2013★ 17 cited

Speed-Aware Routing for UAV Ad-Hoc Networks

Stefano Rosati, Karol Kruzelecki, Louis Traynard +1

In this paper we examine mobile ad-hoc networks (MANET) composed by unmanned aerial vehicles (UAVs). Due to the high-mobility of the nodes, these networks are very dynamic and the…

cs.IT2012★ 6 cited

LLR Compression for BICM Systems Using Large Constellations

Stefano Rosati, Stefano Tomasin, Matteo Butussi +1

Digital video broadcasting (DVB-C2) and other modern communication standards increase diversity by means of a symbol-level interleaver that spans over several codewords. De-interle…

cs.IT2010

Competition of Wireless Providers for Atomic Users

Vojislav Gajić, Jianwei Huang, Bixio Rimoldi

We study a problem where wireless service providers compete for heterogenous wireless users. The users differ in their utility functions as well as in the perceived quality of serv…

cs.IT2010★ 5 cited

A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme

Marius Kleiner, Bixio Rimoldi

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared erro…

cs.IT2009★ 8 cited

Asymptotically Optimal Joint Source-Channel Coding with Minimal Delay

Marius Kleiner, Bixio Rimoldi

We present and analyze a joint source-channel coding strategy for the transmission of a Gaussian source across a Gaussian channel in n channel uses per source symbol. Among all suc…

cs.IT2009★ 5 cited

On Competing Wireless Service Providers

Vojislav Gajic, Jianwei Huang, Bixio Rimoldi

We consider a situation where wireless service providers compete for heterogenous wireless users. The users differ in their willingness to pay as well as in their individual channe…

cs.IT2008★ 2 cited

On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels

Ninoslav Marina, Bixio Rimoldi

The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a…

cs.IT2006★ 58 cited

A Simple Converse of Burnashev's Reliability

Peter Berlin, Baris Nakiboglu, Bixio Rimoldi +1

In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels with feedback. Subsequently,…