Castor: Scalable Secure Routing for Ad Hoc Networks
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We show that network coding allows to realize significant energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus ...
This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions of a packet have been received, a packet combining procedure attempts to recove ...
We address the problem of securing the route discovery for Quality-of- Service (QoS)-aware routing in ad hoc networks. We provide a specification of secure route discovery for QoS-aware routing. We propose a reactive secure routing protocol, SRP-QoS, to de ...
Position-based routing has proven to be a scalable and efficient way for packet routing in mobile ad-hoc networks. To enable position-based routing, a node must be able to discover the location of the node it wants to communicate with. This task is typical ...
Mobility in ad hoc networks causes frequent link failures, which in turn causes packet losses. TCP attributes these packet losses to congestion. This incorrect inference results in frequent TCP re-transmission time-outs and therefore a degradation in TCP p ...
We address the problem of securing the route discovery in mobile ad hoc networks, proposing a light-weight yet robust routing protocol, the Distance- Vector Secure Routing Protocol (DV-SRP). DV-SRP discovers on-demand multiple routes, which are established ...
When striving for reliability, multicast protocols are most commonly designed as deterministic solutions. Such an approach seems to make the reasoning about reliability guarantees (traditionally binary "all-or-nothing"- like) in the face of packet losses a ...
In this paper we present Scalable Position-Based Multicast (SPBM), a multicast routing protocol for ad-hoc networks. SPBM uses the geographic position of nodes to provide a highly scalable group membership scheme and to forward data packets with a very low ...
We present a novel error-correction scheme for sensor networks called Multi-hop Hybrid ARQ (MHARQ). Rather than immediately discard a received corrupt packet, a node buffers it. When two corrupt versions of a packet have been received, a procedure attempts ...
Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc networks have sufficiently redundant paths and counter-DoS mechanisms to make Do ...