—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
—In this paper we address the problem of traffic grooming in WDM rings with all-to-all and its generalization to many-to-many service by using network coding. We consider minimi...
A fundamental problem that confronts future applications of sensor networks is how to efficiently locate the sensor node that stores a particular data item. It is known that distr...
In this paper we consider practical dissemination algorithms exploiting network coding for data broadcasting in ad hoc wireless networks. For an efcient design, we analyze issues r...
Alfred Asterjadhi, Elena Fasolo, Michele Rossi, J&...
Abstract—The highly stochastic nature of wireless environments makes it desirable to monitor link loss rates in wireless sensor networks. In this paper, we study the loss inferen...