Sciweavers

1265 search results - page 75 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
MOBICOM
2009
ACM
14 years 2 months ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 9 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
EPEW
2005
Springer
14 years 1 months ago
Performance Tuning of Failure Detectors in Wireless Ad-hoc Networks: Modelling and Experiments
Abstract. We consider wireless ad-hoc networks and implement failure detections mechanisms. These failure detectors provide elementary information for high level distributed algori...
Corine Marchand, Jean-Marc Vincent
GLOBECOM
2006
IEEE
14 years 1 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
MOBIHOC
2010
ACM
13 years 5 months ago
Security-capacity trade-off in large wireless networks using keyless secrecy
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...
Sudarshan Vasudevan, Dennis Goeckel, Donald F. Tow...