Sciweavers

11061 search results - page 2047 / 2213
» Computer Architecture
Sort
View
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
15 years 10 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
SIGMETRICS
2008
ACM
15 years 6 months ago
Traffic capacity of multi-cell WLANS
Performance of WLANs has been extensively studied during the past few years. While the focus has mostly been on isolated cells, the coverage of WLANs is in practice most often rea...
Thomas Bonald, Ali Ibrahim, James Roberts
MOBICOM
2006
ACM
16 years 11 days ago
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...
Andrew Brzezinski, Gil Zussman, Eytan Modiano
IPSN
2004
Springer
15 years 11 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
CCS
2008
ACM
15 years 8 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun
« Prev « First page 2047 / 2213 Last » Next »