A Charging and Rewarding Scheme for Packet Forwarding
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This thesis is primarily concerned with two security mechanisms for wireless networks: location verification and key management. These mechanisms are potential building blocks in the security architectures of a range of applications. Under location verific ...
We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where f ...
We propose a micro-payment scheme for multi-hop cellular networks that encourages collaboration in packet forwarding by letting users benefit from relaying others` packets. At the same time as proposing mechanisms for detecting and rewarding collaboration, ...
In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...
With the convergence of internet and wireless communications, a plethora of new services will originate. A natural application for cellular radio networks is that of radiolocation, in which the mobile unit can be positioned based on the signals received at ...
Naouel Ben Salem, Levente Buttyan, Jean-Pierre Hubaux and Markus Jakobsson abstract: In multi-hop cellular networks, the existence of a communication link between the mobile station and the base station is not required: a mobile station that has no direct ...
We propose a straightforward technique to provide peer-to-peer security in mobile networks. We show that far from being a hurdle, mobility can be exploited to set up security associations among users. We leverage on the temporary vicinity of users, during ...
Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is ...
NOVELTY - Secret data is generated in one terminal or user equipment. Secret or hash value of secret is displayed on display terminal (11) or user equipment and is entered on input element of other terminal or user equipment. Shared secret data is used to ...
We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where f ...
