Biblio

In this paper we consider connected and autonomous vehicles (CAV) in a traffic network as moving waves defined by their frequency and phase. This outlook allows us to develop a multi-layer decentralized control strategy that achieves the following desirable behaviors: (1) safe spacing between vehicles traveling down the same road, (2) coordinated safe crossing at intersections of conflicting flows, (3) smooth velocity profiles when traversing adjacent intersections. The approach consist of using the Kuramoto equation to synchronize the phase and frequency of agents in the network. The output of this layer serves as the reference trajectory for a back-stepping controller that interfaces the first-order dynamics of the phase-domain layer and the second order dynamics of the vehicle. We show the performance of the strategy for a single intersection and a small urban grid network. The literature has focused on solving the intersection coordination problem in both a centralized and decentralized manner. Some authors have even used the Kuramoto equation to achieve synchronization of traffic lights. Our proposed strategy falls in the rubric of a decentralized approach, but unlike previous work, it defines the vehicles as the oscillating agents, and leverages their inter-connectivity to achieve network-wide synchronization. In this way, it combines the benefits of coordinating the crossing of vehicles at individual intersections and synchronizing flow from adjacent junctions.

With the proliferation of WiFi-enabled devices, people expect to be able to use them everywhere, be it at work, while commuting, or when visiting friends. In the latter case, home owners are confronted with the burden of controlling the access to their WiFi router, and usually resort to simply sharing the password. Although convenient, this solution breaches basic security principles, and puts the burden on the friends who have to enter the password in each and every of their devices. The use of social networks, specifying the trust relations between people and devices, provides for a more secure and more friendly authentication mechanism. In this paper, we progress the state-of-the-art by abandoning the centralized solution to embed social networks in WiFi authentication; we introduce EAP-SocTLS, a decentralized approach for authentication and authorization of WiFi access points and other devices, exploiting the embedded trust relations. In particular, we address the (quadratic) search complexity when indirect trust relations, like the smartphone of a friend's kid, are involved. We show that the simple heuristic of limiting the search to friends and devices in physical proximity makes for a scalable solution. Our prototype implementation, which is based on WebID and EAP-TLS, uses WiFi probe requests to determine the pool of neighboring devices and was shown to reduce the search time from 1 minute for the naive policy down to 11 seconds in the case of granting access over an indirect friend.