Sciweavers

1265 search results - page 81 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
MSWIM
2004
ACM
14 years 1 months ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
LCN
2008
IEEE
14 years 2 months ago
An analysis on error servers for stochastic network calculus
—Network calculus is a recently developed theory dealing with queuing systems found in computer networks with focus on service guarantee analysis. In the current network calculus...
Jing Xie, Yuming Jiang
PEWASUN
2006
ACM
14 years 1 months ago
Revisiting neighbor discovery with interferences consideration
In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic...
Elyes Ben Hamida, Guillaume Chelius, Eric Fleury
GLOBECOM
2010
IEEE
13 years 5 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun