Sciweavers

410 search results - page 64 / 82
» Upgrading Shortest Paths in Networks
Sort
View
INFOCOM
2012
IEEE
13 years 3 months ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
INFOCOM
2007
IEEE
15 years 7 months 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...
EUC
2005
Springer
15 years 7 months ago
Asymmetry-Aware Link Quality Services in Wireless Sensor Networks
Recent studies in wireless sensor networks (WSN) have observed that the irregular link quality is a common phenomenon, rather than an anomaly. The irregular link quality, especiall...
Junzhao Du, Weisong Shi, Kewei Sha
INFOCOM
2006
IEEE
15 years 7 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
ENVSOFT
2006
76views more  ENVSOFT 2006»
15 years 1 months ago
LQGraph: A software package for optimizing connectivity in conservation planning
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...
Trevon Fuller, Sahotra Sarkar