Sciweavers

210 search results - page 11 / 42
» Excludability and Bounded Computational Capacity
Sort
View
GLOBECOM
2008
IEEE
14 years 4 months ago
A Dynamic Programming Approach for Routing in Wireless Mesh Networks
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
Jorge Crichigno, Joud Khoury, Min-You Wu, Wei Shu
SSD
2005
Springer
188views Database» more  SSD 2005»
14 years 3 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
IWCMC
2006
ACM
14 years 3 months ago
Bounds on the fading number of multiple-input single-output fading channels with memory
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
Stefan M. Moser
MOBIHOC
2007
ACM
14 years 9 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
IPSN
2004
Springer
14 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...