Sciweavers

11371 search results - page 288 / 2275
» The network inhibition problem
Sort
View
GLOBECOM
2008
IEEE
16 years 1 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—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...
LCN
2008
IEEE
16 years 1 months ago
Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding
—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...
Long Long, Ahmed E. Kamal
CNSR
2004
IEEE
218views Communications» more  CNSR 2004»
15 years 10 months ago
CSN: A Network Protocol for Serving Dynamic Queries in Large-Scale Wireless Sensor Networks
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...
Muneeb Ali, Zartash Afzal Uzmi
TWC
2010
15 years 1 months ago
Toward network coding-based protocols for data broadcasting in wireless Ad Hoc networks
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&...
INFOCOM
2009
IEEE
16 years 1 months ago
Passive Loss Inference in Wireless Sensor Networks Based on Network Coding
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...
Yunfeng Lin, Ben Liang, Baochun Li