Cooperation of Nodes. In: L. Buttyan and J.-P. Hubaux (eds.), Report on a Working Session on Security in Wireless Ad Hoc Networks
Publications associées (53)
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 propose a probabilistic routing algorithm for wireless ad-hoc networks. The focus is on applications that can tolerate end-to-end delays and those for which the final destination for the packets is a small region. The nodes are assumed stationary and es ...
In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packet forwarding in order to save its own resources. Some researchers have propose ...
In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packet forwarding in order to save its own resources. Some researchers have propose ...
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux ...
Misbehavior in mobile ad-hoc networks occurs for several reasons. Selfish nodes misbehave to save power or to improve their access to service relative to others. Malicious intentions result in misbehavior as exemplified by denial of service attacks. Faulty ...
Multi-hop hybrid networks can help providing both high bandwidth and broad coverage for wireless data networks. We focus on CSMA/CA-based networks and take IEEE 802.11 as a concrete example. We show that the three fundamental operations of synchronization, ...
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 ...
In this paper, we propose resource allocation strategies for a class of wireless networks with a clustering protocol. The nodes are assumed stationary and establish connections with the master node according to a priority scheme that relates to their dista ...
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux ...