Point d'accès sans fil | EPFL Graph Search

vignette|Photographie d'un point d'accès sans fil. Dans les réseaux informatiques, un point d'accès sans fil (WAP ou simplement AP de l'anglais [wireless] access point) est un dispositif qui permet aux périphériques sans fil de se connecter à un réseau câblé ou au réseau Internet à l'aide d'une connexion radio. Le point d'accès en tant que dispositif autonome est habituellement relié à un routeur (par l'intermédiaire d'un réseau câblé), mais il peut aussi faire partie intégrante du routeur lui-même. Les points d'accès sans fil, les plus répandus, sont de type Wi-Fi (box ou borne Wi-Fi). Les points d'accès publics ou privés des FAI sont généralement compatibles avec les normes Wi-Fi IEEE 802.11n ou IEEE 802.11ac et offrent des débits supérieurs à . Notes et références Articles connexes

Point d'accès
Borne Wi-Fi
Réseaux sans fil communautaires
Point d'accès public à Internet
Wi-Fi

Catégorie:Connectique Catégorie:Réseau sans fil

Over-the-Air Computation via Reconfigurable Intelligent Surface

Wei Chen, Yuning Jiang

Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bottlenecked by the worst channel condition among all links between the IoT devices and the access point. In this paper, a reconfigurable intelligent surface (RIS) assisted AirComp system is proposed to boost the received signal power and thus mitigate the performance bottleneck by reconfiguring the propagation channels. With an objective to minimize the AirComp distortion, we propose a joint design of AirComp transceivers and RIS phase-shifts, which however turns out to be a highly intractable non-convex programming problem. To this end, we develop a novel alternating minimization framework in conjunction with the successive convex approximation technique, which is proved to converge monotonically. To reduce the computational complexity, we transform the subproblem in each alternation as a smooth convex-concave saddle point problem, which is then tackled by proposing a Mirror-Prox method that only involves a sequence of closed-form updates. Simulations show that the computation time of the proposed algorithm can be two orders of magnitude smaller than that of the state-of-the-art algorithms, while achieving a similar distortion performance.

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Modeling and predicting mobility in wireless ad hoc networks

Jérôme Härri

Wireless Ad Hoc Networks are a particular paradigm where wireless devices communicate in a decentralized fashion, without any centralized infrastructure or decision. In order to avoid a situation where nodes chaotically try to communicate, distributed and localized structures (graphs, trees, etc.) need to be built. Mobility brings challenging issues to the maintenance and to the optimality of such structures. In conventional approaches, structures are adapted to the current topology by each node periodically sending beacon messages, which is a significant waste of network resources. If each node can obtain some a priori knowledge of future topology configurations, it could decide to send maintenance messages only when a change in the topology effectively requires updating the structure. In this Doctoral Thesis, we investigate this approach and define the Kinetic Graphs, a novel paradigm regrouping mobility predictions for a kinetic mobility management, and localized and distributed graph protocols to insure a high scalability. The Kinetic Graph framework is able to naturally capture the dynamics of mobile structures, and is composed of four steps: (i) a representation of the trajectories, (ii) a common message format for the posting of those trajectories, (iii) a time varying weight for building the kinetic structures, (iv) an aperiodic neighborhood maintenance. By following this framework, we show that any structure-based ad-hoc protocol may benefit from the kinetic approach. A significant challenge of Kinetic Graphs comes from prediction errors. In order to analyze them, we illustrate the relationship between the prediction model and the mobility model. We decompose the prediction errors into three metrics: the adequacy between the prediction and the mobility models, the predicability of the mobility model, and the mobility model's realism. Following the framework, we define a kinetic model for the modeling of the trajectories and then analyze the extents of the effects of each error metric and develop solutions in order to reduce them. We finally adapt the Multipoint Relaying (MPR) protocol, used by the Optimized Link State Routing protocol (OLSR), and show the significant improvements that may be obtained by using the Kinetic Graph Framework, even on the very challenging vehicular networks.

EPFL2007

How Others Compromise Your Location Privacy: The Case of Shared Public IPs at Hotspots

Vincent Bindschaedler, Jean-Pierre Hubaux, Kévin Clément Huguenin, Nevena Vratonjic

Location privacy has been extensively studied over the last few years, especially in the context of location-based services where users purposely disclose their location to benefit from convenient context-aware services. To date, however, little attention has been devoted to the case of users' location being unintentionally compromised by others. In this paper, we study a concrete and widespread example of such situations, specifically the location-privacy threat created by access points (e.g., public hotspots) using network address translation (NAT). Indeed, because users connected to the same hotspot share a unique public IP, a single user making a location-based request is enough to enable a service provider to map the IP of the hotspot to its geographic coordinates, thus compromising the location privacy of all the other connected users. When successful, the service provider can locate users within a few hundreds of meters, thus improving over existing IP-location databases. Even in the case where IPs change periodically (e.g., by using DHCP), the service provider is still able to update a previous (IP, Location) mapping by inferring IP changes from authenticated communications (e.g., cookies). The contribution of this paper is three-fold: (i) We identify a novel threat to users' location privacy caused by the use of shared public IPs. (ii) We formalize and analyze theoretically the threat. The resulting framework can be applied to any access-point to quantify the privacy threat. (iii) We experimentally assess the state in practice by using real traces of users accessing Google services, collected from deployed hotspots. Also, we discuss how existing countermeasures can thwart the threat.

2013

Modeling and predicting mobility in wireless ad hoc networks

Jérôme Härri

EPFL2007