Sciweavers

79 search results - page 4 / 16
» Throughput of random access without message passing
Sort
View
TWC
2008
112views more  TWC 2008»
13 years 5 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
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 1 days ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
ICC
2007
IEEE
13 years 11 months ago
Energy and Utility Optimization in Wireless Networks with Random Access
— Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks’ nodes work properly without recharging or substituti...
Amir Mahdi Khodaian, Babak Hossein Khalaj
TSP
2008
118views more  TSP 2008»
13 years 5 months ago
Channel-Aware Random Access Control for Distributed Estimation in Sensor Networks
A cross-layered slotted ALOHA protocol is proposed and analyzed for distributed estimation in sensor networks. Suppose that the sensors in the network record local measurements of ...
Y.-W. P. Hong, Keng-U Lei, Chong-Yung Chi
DATE
2008
IEEE
69views Hardware» more  DATE 2008»
13 years 11 months ago
Time Properties of the BuST Protocol under the NPA Budget Allocation Scheme
Token passing is a channel access technique used in several communication networks. Among them, one of the most effective solution for supporting both real-time traffic (synchron...
Gianluca Franchino, Giorgio C. Buttazzo, Tullio Fa...