Sciweavers

184 search results - page 1 / 37
» Communication in Networks with Random Dependent Faults
Sort
View
MFCS
2007
Springer
13 years 11 months ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
ADHOCNOW
2008
Springer
13 years 6 months ago
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
ECRTS
2004
IEEE
13 years 9 months ago
Comparing Real-Time Communication Under Electromagnetic Interference
The contribution of this paper is threefold. First, an improvement to a previously published paper on the timing analysis of Controller Area Network (CAN) in the presence of trans...
Ian Broster, Alan Burns, Guillermo Rodrígue...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 5 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
TC
1998
13 years 4 months ago
A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks
—Many applications require communication services with guaranteed timeliness and fault tolerance at an acceptable level of overhead. We present a scheme for restoring real-time c...
Seungjae Han, Kang G. Shin