Sciweavers

1265 search results - page 10 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
INFOCOM
2003
IEEE
14 years 26 days ago
Capacity, Delay and Mobility in Wireless Ad-Hoc Networks
Abstract— Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been show...
Nikhil Bansal, Zhen Liu
CISS
2008
IEEE
14 years 2 months ago
Distributed estimation in wireless sensor networks via variational message passing
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
Yanbing Zhang, Huaiyu Dai
DCOSS
2006
Springer
13 years 11 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
TWC
2008
112views more  TWC 2008»
13 years 7 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...