Sciweavers

79 search results - page 8 / 16
» Throughput of random access without message passing
Sort
View
VTC
2007
IEEE
158views Communications» more  VTC 2007»
14 years 2 months ago
Efficient Spatial Reuse in Multi-Radio, Multi-Hop Wireless Mesh Networks
— In the paper, we propose a novel scheduling mechanism without modifying the existing IEEE 802.11 MAC, called wireless Radio-Matching Protocol (RMP). It takes account of interfe...
Da-Ren Guo, Kuochen Wang, Lung-Sheng Lee
ICDCN
2011
Springer
13 years 2 hour ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
MM
1993
ACM
105views Multimedia» more  MM 1993»
14 years 19 days ago
Synchronous Bandwidth Allocation in FDDI Networks
It is well-known that an FDDI token ring network provides a guaranteed throughput for synchronous messages and a bounded medium access delay for each node/station. However, this f...
Qin Zheng, Kang G. Shin
DCOSS
2006
Springer
14 years 7 days ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
GLOBECOM
2007
IEEE
13 years 8 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor