1265 search results - page 81 / 253 » Randomized Algorithms and Probabilistic Analysis in Wireless... |
131
click to vote
MSWIM
2004
ACM
15 years 8 months ago
2004
ACM
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...
116
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
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...
124
Voted
LCN
2008
IEEE
15 years 9 months ago
2008
IEEE
—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...
125
Voted
PEWASUN
2006
ACM
15 years 8 months ago
2006
ACM
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...
137
click to vote
GLOBECOM
2010
IEEE
15 years 17 days ago
2010
IEEE
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...