Sciweavers

4781 search results - page 561 / 957
» Online algorithms for network design
Sort
View
JPDC
2006
187views more  JPDC 2006»
15 years 6 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
ICASSP
2010
IEEE
15 years 7 months ago
Consensus in correlated random topologies: Weights for finite time horizon
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
Dusan Jakovetic, João Xavier, José M...
SRDS
2006
IEEE
16 years 24 days ago
Generalised Repair for Overlay Networks
We present and evaluate a generic approach to the repair of overlay networks which identifies general principles of overlay repair and embodies these as a reusable service. At th...
Barry Porter, François Taïani, Geoff C...
IPPS
2005
IEEE
16 years 11 days ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
MSWIM
2005
ACM
16 years 11 days ago
YAES: a modular simulator for mobile networks
Developing network protocols for mobile wireless systems is a complex task, and most of the existing simulator frameworks are not well suited for experimental development. The YAE...
Ladislau Bölöni, Damla Turgut