Securing position and distance verification in wireless networks
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.
Formation building and keeping among vehicles has been studied for many years, since 1987 with Reynolds' rules [1]. This paper presents a control algorithm, based on recent work in graph theory, able to reconfigure static formations of non-holonomic vehicl ...
NOVELTY - At least some of wireless terminals can communicate over wireless links (2) in one or several hops with at least some of the other wireless terminals. The distances (dij) to one-hop neighbors may be measured in a number of the wireless terminals ...
In this paper we consider the problem of node positioning in ad-hoc networks. We propose a distributed, infrastructure-free positioning algorithm that does not rely on Global Positioning System (GPS). The algorithm uses the distances between the nodes to b ...
The determination of instantaneous positions with high accuracy using differential GPS techniques is of great importance for several applications, like airborne topographic mapping, airborne gravimetry and altimetry. In some of these applications long base ...
Infrastructure-based mobile-positioning is receiving increasing attention in the field of wireless communications. This is is due to an order issued by the Federal Communications Commission (FCC) that mandates all wireless service providers to locate an em ...
