Sciweavers

552 search results - page 44 / 111
» Lower bounds for dynamic connectivity
Sort
View
ICPADS
1998
IEEE
14 years 1 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
STACS
2005
Springer
14 years 3 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
MONET
2008
135views more  MONET 2008»
13 years 9 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
SIROCCO
2004
13 years 11 months ago
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
Deshi Ye, Hu Zhang
ICDCN
2011
Springer
13 years 1 months ago
Reliable Networks with Unreliable Sensors
Abstract. Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network conn...
Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, J...