Sciweavers

4679 search results - page 229 / 936
» Modeling When Connections Are the Problem
Sort
View
MOBIHOC
2008
ACM
16 years 6 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
CN
2008
163views more  CN 2008»
15 years 6 months ago
Loss-resilient window-based congestion control
This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window...
Christophe De Vleeschouwer, Pascal Frossard
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
ICOIN
2005
Springer
16 years 23 hour ago
S-RO: Simple Route Optimization Scheme with NEMO Transparency
Network mobility (NEMO) basic support protocol maintains the connectivity when mobile router (MR) changes its point of attachment to the Internet by establishing a bidirectional tu...
Hanlim Kim, Geunhyung Kim, Cheeha Kim
AUTONOMICS
2007
ACM
15 years 8 months ago
Multi-hop broadcast from theory to reality: practical design for ad hoc networks
We propose a complete design for a scope limited, multihop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networ...
Alaeddine El Fawal, Jean-Yves Le Boudec, Kav&eacut...