69 search results - page 5 / 14 » On the Connected Nodes Position Distribution in Ad Hoc Wirel... |
FSTTCS
2004
Springer
14 years 13 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
MOBISYS
2003
ACM
14 years 6 months ago
2003
ACM
Due to node mobility and limitations on bandwidth availability in wireless channels, there exist unique challenges towards achieving efficient and effective information access in ...
PEWASUN
2004
ACM
14 years 14 days ago
2004
ACM
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, ...
MSWIM
2004
ACM
14 years 14 days 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...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...