Enhancing the Kademlia P2P Network

Distributed Hash Tables (DHT´s) are sophisticated Peer-to-Peer (P2P) overlay networks. Such overlays have the ability to retrieve stored data in a limited time, usually in a logarithmic number of steps. However in contrast to the well-known Gnutella and FastTrack networks, these can only locate data quickly, if the key associated with the data requested is accurately specified. In this article we analyze the reliability of the Kademlia network, and describe our model, which can be used to determine its system-wide configuration parameters. We also present a novel algorithm that implements broadcast messages in Kademlia. The developed algorithm ensures reliable delivery of broadcast messages in an error prone environment. Broadcast messaging is an elementary service in an overlay network. Using broadcast messages, queries of any key type or part of key, can be realized

Context-based Broadcast Acknowledgement for Enhanced Reliability of Cooperative V2X Messages

Most V2X applications/services are supported by the continuous exchange of broadcast messages. One of the main challenges is to increase the reliability of broadcast transmissions that lack of mechanisms to assure the correct delivery of the messages. To address this issue, one option is the use of acknowledgments. However, this option has scalability issues when applied to broadcast transmissions because multiple vehicles can transmit acknowledgments simultaneously. To control scalability while addressing reliability of broadcast messages, this paper proposes and evaluates a context-based broadcast acknowledgement mechanism where the transmitting vehicles selectively request the acknowledgment of specific/critical broadcast messages, and performs retransmissions if they are not correctly received. In addition, the V2X applications/services identify the situations/conditions that trigger the execution of the broadcast acknowledgment mechanism, and the receiver(s) that should acknowledge the broadcast messages. The paper evaluates the performance of the context-based broadcast acknowledgment mechanism for a Collective Perception Service. The obtained results show the proposed mechanism can contribute to improve the awareness of crossing pedestrians at intersections by increasing the reliability in the exchange of CPM messages between vehicles approaching the intersection. This solution is being discussed under IEEE 802.11bd, and thus can be relevant for the standardization process.10.13039/501100000780-European Commission;10.13039/501100007170-Ministry of Econom

An efficient self-healing key distribution scheme

Self-healing key distribution schemes enable a group user to recover session keys from two broadcast messages he received before and after those sessions, even if the broadcast messages for the middle sessions are lost due to network failure. These schemes are quite suitable in supporting secure communication over unreliable networks such as sensor networks and ad hoc networks. An efficient self-healing key distribution scheme is proposed in this paper. The scheme bases on the concept of access polynomial and self-healing key distribution model constructed by Hong et al. The new scheme reduces communication and computation overheads greatly yet still keeps the constant storageoverhead

0E2FA: Zero Effort Two-Factor Authentication

Smart devices (mobile devices, laptops, tablets, etc.) can receive signals from different radio frequency devices that are within range. As these devices move between networks (e.g., Wi-Fi hotspots, cellphone towers, etc.), they receive broadcast messages from access points, some of which can be used to collect useful information. This information can be utilized in a variety of ways, such as to establish a connection, to share information, to locate devices, and to identify users, which is central to this dissertation. The principal benefit of a broadcast message is that smart devices can read and process the embedded information without first being connected to the corresponding network. Moreover, broadcast messages can be received only within the range of the wireless access point that sends the broadcast, thus inherently limiting access to only those devices in close physical proximity, which may facilitate many applications that are dependent on proximity. In our research, we utilize data contained in these broadcast messages to implement a two-factor authentication (2FA) system that, unlike existing methods, does not require any extra effort on the part of the users of the system. By determining if two devices are in the same physical location and sufficiently close to each other, we can ensure that they belong to the same user. This system depends on something that a user knows, something that a user owns, and—a significant contribution of this work—something that is in the user’s environment

GENETIC SIMULATED ANNEALING BASED GROUP MANAGEMENT SOLUTION FOR MULTIPLE VENDORS IN LOW-POWER AND LOSSY NETWORKS

Techniques are described herein to transform logical group traffic into a combination of broadcast and unicast messages rather than flood of broadcast messages. These techniques limit redundant traffic to manage logical group traffic over Wireless Mesh Networks (WMNs)

Self-Synchronization in Duty-cycled Internet of Things (IoT) Applications

In recent years, the networks of low-power devices have gained popularity. Typically these devices are wireless and interact to form large networks such as the Machine to Machine (M2M) networks, Internet of Things (IoT), Wearable Computing, and Wireless Sensor Networks. The collaboration among these devices is a key to achieving the full potential of these networks. A major problem in this field is to guarantee robust communication between elements while keeping the whole network energy efficient. In this paper, we introduce an extended and improved emergent broadcast slot (EBS) scheme, which facilitates collaboration for robust communication and is energy efficient. In the EBS, nodes communication unit remains in sleeping mode and are awake just to communicate. The EBS scheme is fully decentralized, that is, nodes coordinate their wake-up window in partially overlapped manner within each duty-cycle to avoid message collisions. We show the theoretical convergence behavior of the scheme, which is confirmed through real test-bed experimentation.Comment: 12 Pages, 11 Figures, Journa