Sciweavers

2571 search results - page 396 / 515
» Approximation schemes for wireless networks
Sort
View
TRIDENTCOM
2010
IEEE
15 years 4 months ago
Experimental Evaluation of OpenVZ from a Testbed Deployment Perspective
A scalable approach to building large scale experimentation testbeds involves multiplexing the system resources for better utilization. Virtualization provides a convenient means o...
Gautam D. Bhanage, Ivan Seskar, Yanyong Zhang, Dip...
QUESTA
2006
101views more  QUESTA 2006»
15 years 6 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
IWCMC
2006
ACM
16 years 12 days ago
Effective channel assignment in multi-hop W-CDMA cellular networks
Multi-hop relaying is an important concept in tackling the inherent problems of limited capacity and coverage in cellular networks. It helps to solve the dead-spots problem and to...
Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl
MOBIQUITOUS
2008
IEEE
16 years 25 days ago
Exploiting Schelling behavior for improving data accessibility in mobile peer-to-peer networks
In 1969, Thomas Schelling proposed one of the most cited models in economics to explain how similar people (e.g. people with the same race, education, community) group together in...
Long Vu, Klara Nahrstedt, Matthias Hollick
INFOCOM
2007
IEEE
16 years 22 days ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...