Search

Message dissemination protocols for vehicular networks often build upon information maintained in neighbor tables. Due to high mobility and scarce channel capacity available in such networks, algorithms for maintaining neighbor tables must carefully select which information is transmitted at which time. Recent approaches rely on probabilistic data structures (e.g., Bloom filter) for transmitting such neighbor information in order to reduce channel load, yet they still suffer from scarce channel capacities. In this paper, we propose to use multiple communication technologies (heterogeneous networking) for maintaining neighbor tables by building upon recent 2-hop neighbor management strategies. Promising results show an increase of up to 19 % of covered neighbors in comparison to a Baseline approach that only uses one communication technology.

In this paper, we investigate the performance of inverters and ring oscillators composed of gate-all-around (GAA) silicon nanowire and nanosheet (NSH) field-effect transistors (FETs), compared with FinFETs, for sub-10nm logic technology applications. Our TCAD transient simulations reveal that ring oscillators with 3 stacked channels with NSH width, three times wider than the fin width, exhibit improvements of up to 22% in the oscillation frequencies. compared to a ring oscillator with FinFETs. Thus, our study provides an insight for device down-selection in the development of GAA FET technology.

In many homeland security and counterterrorism applications, there is a need to secure and protect large Critical Key Infrastructures and Resources (CKIR), such as transportation, aviation, highways, and maritime systems. These usually span hundreds of thousands to millions of miles of roadways, maritime, and/or airways. To achieve the monitoring of such large CKIR systems there is a need to develop cooperative intelligent geographically and computationally distributed multi-agent-based monitoring systems. In such dynamic large environments, where agents could be moving randomly or less randomly to reach their respective goals, agent path planning for autonomous agents becomes challenging. It is desired to have the agents not only be equipped with intelligence to move autonomously and avoid obstacles and each other, but also to be able to learn autonomously how to reach the shortest path to their goal(s) in a minimum amount of time and exploratory trials. In this paper we address issues related to multi-agent reinforcement learning in a distributed-computing-memory environment where the agents have limited and not complete knowledge of their environment(s). We present an architecture for the distributed dynamic agent communication based on the Message Passing Interface (MPI). In particular, the focus and contribution of this paper are two-fold: the analysis of the effects, on the multi-agent system learning and total execution time, of (a) the agent environment size, (b) the agents shared-over-a-network learned information with/from other agents with one same goal versus agents not sharing information among themselves and (c) the agents sharing information when having one same agent goal versus the agents sharing information when having different agent goals. The desired aim is the analysis of the factors and conditions that increase the overall distributed multi-agent system computational performance and learning speed.