Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks
Publications associées (44)
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 present a protocol that enables to create pairwise keys between nodes in a wireless network, so that the keys are secure from an adversary, Eve, with unbounded computational and memory capabilities, but with limited network presence. Our proposed protoc ...
Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...
Adapting the transmission rate of video telephony Internet applications in order to guarantee the maximal communication quality is still an open and extremely challenging problem. The congestion control algorithm, which is the algorithm responsible for adj ...
Agreement problems and their solutions are essential to fault-tolerant distributed computing. Over the years, different assumptions on failures have been considered, but most of these assumptions were focusing on either processes or links. In contrast, we ...
This work studies how to build wireless network protocols that achieve better reliability, lower delay and higher throughput than existing alternatives by using network coding and by exploiting the broadcast nature of the wireless channel. In the first par ...
Adapting the transmission rate of video telephony Internet applications in order to guarantee the maximal communication quality is still an open and extremely challenging problem. The congestion control algorithm, which is the algorithm responsible for adj ...
When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This ...
This thesis addresses the security of two fundamental elements of wireless networking: neighbor discovery and ranging. Neighbor discovery consists in discovering devices available for direct communication or in physical proximity. Ranging, or distance boun ...
This paper considers a single source transmitting data to one or more receivers/users over a shared wireless channel. Due to random fading, the wireless channel conditions vary with time and from user to user. Each user has a buffer to store received packe ...
Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...