Sciweavers

972 search results - page 51 / 195
» Performance of data networks with random links
Sort
View
CISS
2007
IEEE
15 years 6 months ago
Robust Routing in Wireless Multi-Hop Networks
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
Yuchen Wu, Alejandro Ribeiro, Georgios B. Giannaki...
DSN
2007
IEEE
16 years 12 days ago
R-Sentry: Providing Continuous Sensor Services against Random Node Failures
The success of sensor-driven applications is reliant on whether a steady stream of data can be provided by the underlying system. This need, however, poses great challenges to sen...
Shengchao Yu, Yanyong Zhang
INFOCOM
2009
IEEE
16 years 22 days ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
139
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Our Brothers' Keepers: Secure Routing with High Performance
The Trinity [1] spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of proc...
Alex Brodsky, Scott Lindenberg
SIGCOMM
1995
ACM
15 years 9 months ago
Performance Analysis of MD5
MD5 is an authentication algorithm proposed as the required implementation of the authentication option in IPv6. This paper presents an analysis of the speed at which MD5 can be i...
Joseph D. Touch