Sciweavers

1265 search results - page 178 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
MOBICOM
2006
ACM
14 years 3 months ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...
MOBIHOC
2006
ACM
14 years 8 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
PIMRC
2010
IEEE
13 years 6 months ago
Low-complexity admission control for distributed power-controlled networks with stochastic channels
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
Stepán Kucera, Bing Zhang
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 9 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 3 months ago
Impatient Backoff Algorithm: Fairness in a Distributed Ad-Hoc MAC
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
Rajarshi Gupta, Jean C. Walrand