Sciweavers

1265 search results - page 171 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
Yunfeng Lin, Ben Liang, Baochun Li
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Multipath Routing
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
Yuxin Chen, Jeffrey Andrews
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
14 years 3 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
GLOBECOM
2008
IEEE
14 years 3 months ago
Cooperative and Non-Cooperative Aloha Games with Channel Capture
—Game theory has been a useful tool for the analysis of random-access based wireless networks due to their decentralized operations. This paper studies one of the most widely use...
Younggeun Cho, Fouad A. Tobagi
BROADNETS
2006
IEEE
14 years 23 days ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...