#### Filter Results:

- Full text PDF available (100)

#### Publication Year

1998

2017

- This year (9)
- Last 5 years (42)
- Last 10 years (94)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bruno Sinopoli, Luca Schenato, Massimo Franceschetti, Kameshwar Poolla, Michael I. Jordan, S. Shankar Sastry
- IEEE Trans. Automat. Contr.
- 2004

Motivated by navigation and tracking applications within sensor networks, we consider the problem of performing Kalman filtering with intermittent observations. When data travel along unreliable communication channels in a large, wireless, multi-hop sensor network, the effect of communication delays and loss of information in the control loop cannot be… (More)

- Massimo Franceschetti, Olivier Dousse, David Tse, Patrick Thiran
- IEEE Transactions on Information Theory
- 2007

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same 1/radicn transmission rate of arbitrarily located nodes. This contrasts with previous results… (More)

- Martin Haenggi, Jeffrey G. Andrews, François Baccelli, Olivier Dousse, Massimo Franceschetti
- IEEE Journal on Selected Areas in Communications
- 2009

Wireless networks are fundamentally limited by the intensity of the received signals and by their interference. Since both of these quantities depend on the spatial location of the nodes, mathematical techniques have been developed in the last decade to provide communication-theoretic results accounting for the network’s geometrical configuration. Often,… (More)

- Luca Schenato, Bruno Sinopoli, Massimo Franceschetti, Kameshwar Poolla, S. Shankar Sastry
- Proceedings of the IEEE
- 2007

| This paper considers control and estimation problems where the sensor signals and the actuator signals are transmitted to various subsystems over a network. In contrast to traditional control and estimation problems, here the observation and control packets may be lost or delayed. The unreliability of the underlying communication network is modeled… (More)

- Massimo Franceschetti, Olivier Dousse, David Tse, Patrick Tiran
- 2004

We consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users grows. Following the physical model of Gupta and Kumar, we show that randomly scattered nodes can achieve the optimal 1/ √ n per-node transmission rate of arbitrarily located nodes. This contrasts with previous achievable results… (More)

- Ehsan Ardestanizadeh, Paolo Minero, Massimo Franceschetti
- IEEE Transactions on Information Theory
- 2010

A code for communication over the k-receiver complex additive white Gaussian noise broadcast channel (BC) with feedback is presented and analyzed using tools from the theory of linear quadratic Gaussian optimal control. It is shown that the performance of this code depends on the noise correlation at the receivers and it is related to the solution of a… (More)

- Massimo Franceschetti, Marco Donald Migliore, Paolo Minero
- IEEE Transactions on Information Theory
- 2009

It is shown that the capacity scaling of wireless networks is subject to a fundamental limitation which is independent of power attenuation and fading models. It is a degrees of freedom limitation which is due to the laws of physics. By distributing uniformly an order of <i>n</i> users wishing to establish pairwise independent communications at fixed… (More)

Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range of each other have been extensively studied. This paper considers a variation in which a connection between two points depends not only on their Euclidean distance, but also on the positions of all other points of the… (More)

- Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger
- IEEE Transactions on Information Theory
- 2011

The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function <i>f</i> of the messages. The objective is to maximize the average number of times <i>f</i> can be computed per network usage, i.e., the “computing capacity”. The… (More)

- Paolo Minero, Massimo Franceschetti, Subhrakanti Dey, Girish N. Nair
- IEEE Trans. Automat. Contr.
- 2009

A data rate theorem for stabilization of a linear, discrete-time, dynamical system with arbitrarily large disturbances, over a rate-limited, time-varying communication channel is presented. Necessary and sufficient conditions for stabilization are derived, their implications and relationships with related results in the literature are discussed. The proof… (More)