Sciweavers

625 search results - page 17 / 125
» Semi-preemptive routing on trees
Sort
View
COMCOM
2006
120views more  COMCOM 2006»
13 years 7 months ago
Energy efficient routing and scheduling for real-time data aggregation in WSNs
In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario wher...
Hongwei Du, Xiaodong Hu, Xiaohua Jia
IPPS
2007
IEEE
14 years 1 months ago
Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
1 Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as Grids and PlanetLab. This paper proposes a scalable Grid monitoring architect...
Min Cai, Kai Hwang
CN
2007
154views more  CN 2007»
13 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
INFOCOM
2009
IEEE
14 years 2 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
SENSYS
2006
ACM
14 years 1 months ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...