Search

Damage assessment is one of the most crucial issues for bridge engineers during the operational and maintenance phase, especially for existing steel bridges. Among several methodologies, the vibration measurement test is a typical approach, in which the natural frequency variation of the structure is monitored to detect the existence of damage. However, locating and quantifying the damage is still a big challenge for this method, due to the required human resources and logistics involved. In this regard, an artificial intelligence (AI)-based approach seems to be a potential way of overcoming such obstacles. This study deployed a comprehensive campaign to determine all the dynamic parameters of a predamaged steel truss bridge structure. Based on the results for mode shape, natural frequency, and damping ratio, a finite element model (FEM) was created and updated. The artificial intelligence network’s input data from the damage cases were then analysed and evaluated. The trained artificial neural network model was curated and evaluated to confirm the approach’s feasibility. During the actual operational stage of the steel truss bridge, this damage assessment system showed good performance, in terms of monitoring the structural behaviour of the bridge under some unexpected accidents.

Recently, hybrid wired-wireless Network-on-Chip (WiNoC) has been proposed as a suitable communication fabric to provide scalability and satisfy high performance demands of the exascale era of modern multi/many-core System-on-Chip (SoC) design. A well accepted low-latency wireless communication fabric for WiNoCs is millimeter wave (mm-Wave). However, the wireless channel of mm-Wave is lossy due to free space signal radiation with both dielectric propagation loss (DPL) and molecular absorption attenuation (MAA). This is exacerbated for edge situated cores and in macro-chips embodying thousands of cores. To this end, this article proposes efficient relaying techniques to improve the signal strength of the wireless channel in the WiNoCs using on-chip networking approaches under the realistic SoC channel conditions. First, we propose a realistic relay communication channel for the WiNoCs to characterise both MAA and DPL which have drastic effect on the performance. We then derive and show that the channel capacity for a single-relay WiNoC employing Amplify-and-Forward (AF) and Decode-and-Forward (DF) relaying protocols increases by up to 20% and 25%, respectively, compared to the conventional direct transmission. The AF protocol outperforms the DF mode for shorter transmissions between the relay and the destination cores, while the reverse is observed in other conditions. A hybrid protocol is then proposed to exploit the performance advantages of both relaying protocols to address the unbalanced distance between the cores, providing the maximal channel capacity close to the cutset bound. Finally, our approach is further validated in multi-relay WiNoCs where the communications of the remote cores is assisted by multiple intermediate cores along with the details of associated realistic channel model in emerging many-core SoCs.

This paper proposes a dynamic priority system at medium access control (MAC) layer to schedule time sensitive and critical communications in infrastructure-less wireless networks. Two schemes, priority enabled MAC (PE-MAC) and optimized PE-MAC are proposed to ensure real-time and reliable data delivery in emergency and feedback systems. These schemes use a dynamic priority mechanism to offer improved network reliability and timely communication for critical nodes. Both schemes offer a notable improvement in comparison to the IEEE 802.15.4e low-latency deterministic networks. To ensure more predictable communication reliability, two reliability centric schemes, quality-ensured scheme (QES) and priority integrated QES, are also proposed. These schemes maintain a pre-specified successful packet delivery rate, hence improving the overall network reliability and guaranteed channel access.

Device-to-device (D2D) communications as an underlay to cellular networks can not only increase the system capacity and energy efficiency but also enable national security and public safety services. A key requirement for these services is to provide alternative access to cellular networks when they are partially or fully damaged due to a natural disaster event. In this paper, we employ energy harvesting (EH) at the relay with simultaneous wireless information and power transfer to prolong the lifetime of energy constrained network. In particular, we consider a user equipment relay that harvests energy from radio frequency signal via base station and use harvested energy for D2D communications. We integrate clustering technique with D2D communications into cellular networks such that communication services can be maintained when the cellular infrastructure becomes partially dysfunctional. Simulation results show that our proposed EH-based D2D clustering model performs efficiently in terms of coverage, energy efficiency, and cluster formation to extend the communication area. Moreover, a novel concept of power transfer in D2D clustering with user equipment relay and cluster head is proposed to provide a new framework to handle critical and emergency situations. The proposed approach is shown to provide significant energy saving for both mobile users and clustering heads to survive in emergency and disaster situations.

In this paper, we investigate disaster-recovery communications utilizing two-cell cooperative D2D communications. Specifically, one cell is in a healthy area, while the other is in a disaster area. A user equipment (UE) in the healthy area aims to assist a UE in the disaster area to recover wireless information transfer via an energy harvesting relay. In the healthy area, the cellular base station (BS) shares the spectrum with the UE, however, both of them may belong to different service providers. Thus, the UE pays an amount of price as incentive to the BS as part of two processes: energy trading and interference pricing. We formulate these two processes as two Stackelberg games, where their equilibrium is derived as closed-form solutions. The results help providing a sustainable framework for disaster recovery when the involving parties juggle between energy trading, interference compromise, and payment incentives in establishing communications during the recovery process.

Abstract This paper introduces a new differential spatial modulation (DSM) scheme which subsumes both the previously introduced DSM and high-rate spatial modulation (HR-SM) for wireless multiple input multiple output (MIMO) transmission. By combining the codeword design method of the HR-SM scheme with the encoding method of the DSM scheme, we develop a high-rate differential spatial modulation (HR-DSM) scheme equipped with an arbitrary number of transmit antennas that requires channel state information (CSI) neither at the transmitter nor at the receiver. The proposed approach can be applied to any equal energy signal constellations. The bit error rate (BER) performance of the proposed HR-DSM schemes is evaluated by using both theoretical upper bound and computer simulations. It is shown that for the same spectral efficiency and antenna configuration, the proposed HR-DSM outperforms the DSM in terms of bit error rate (BER) performance.

Recently, the Internet of Things (IoT) has emerged as a significant advancement for Internet and mobile networks with various public safety network applications. An important use of IoT-based solutions is its application in post-disaster management, where the traditional telecommunication systems may be either completely or partially damaged. Since enabling technologies have restricted authentication privileges for mobile users, in this paper, a strategy of mobile-sink is introduced for the extension of user authentication over cloud-based environments. A seamless secure authentication and key agreement (S-SAKA) approach using bilinear pairing and elliptic-curve cryptosystems is presented. It is shown that the proposed S-SAKA approach satisfies the security properties, and as well as being resilient to nodecapture attacks, it also resists significant numbers of other well-known potential attacks related with data confidentiality, mutual authentication, session-key agreement, user anonymity, password guessing, and key impersonation. Moreover, the proposed approach can provide a seamless connectivity through authentication over wireless sensor networks to alleviate the computation and communication cost constraints in the system. In addition, using Burrows-Abadi-Needham logic, it is demonstrated that the proposed S-SAKA framework offers proper mutual authentication and session key agreement between the mobile-sink and the base station.

In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal. Specifically, we want to identify vital nodes and edges whose failure (either random or intentional) will break the most number of connected triples (or triangles) in the network. This problem is extremely important, because connected triples form the foundation of strong connections in many real-world systems, such as mutual relationships in social networks, reliable data transmission in communication networks, and stable routing strategies in mobile networks. Disconnected triples, analog to broken mutual connections, can greatly affect the network's structure and disrupt its normal function, which can further lead to the corruption of the entire system. The analysis of such crucial elements will shed light on key factors behind the resilience and robustness of many complex systems in practice. We formulate the analysis under multiple optimization problems and show their intractability. We next propose efficient approximation algorithms, namely, DAK-n and DAK-e, which guarantee an (1 - 1/e)-approximate ratio (compared with the overall optimal solutions) while having the same time complexity as the best triangle counting and listing algorithm on power-law networks. This advantage makes our algorithms scale extremely well even for very large networks. In an application perspective, we perform comprehensive experiments on real social traces with millions of nodes and billions of edges. Empirical results indicate that our approaches achieve comparably better solution quality while are up to 100× faster than the current state-of-the-art methods.

The Influence Maximization (IM) problem, which finds a set of k nodes (called seedset) in a social network to initiate the influence spread so that the number of influenced nodes after propagation process is maximized, is an important problem in information propagation and social network analysis. However, previous studies ignored the constraint of priority that led to inefficient seed collections. In some real situations, companies or organizations often prioritize influencing potential users during their influence diffusion campaigns. With a new approach to these existing works, we propose a new problem called Influence Maximization with Priority (IMP) which finds out a set seed of k nodes in a social network to be able to influence the largest number of nodes subject to the influence spread to a specific set of nodes U (called priority set) at least a given threshold T in this paper. We show that the problem is NP-hard under well-known IC model. To find the solution, we propose two efficient algorithms, called Integrated Greedy (IG) and Integrated Greedy Sampling (IGS) with provable theoretical guarantees. IG provides a 1−(1−1k)t-approximation solution with t is an outcome of algorithm and t≥1. The worst-case approximation ratio is obtained when t=1 and it is equal to 1/k. In addition, IGS is an efficient randomized approximation algorithm based on sampling method that provides a 1−(1−1k)t−ϵ-approximation solution with probability at least 1−δ with ϵ>0,δ∈(0,1) as input parameters of the problem. We conduct extensive experiments on various real networks to compare our IGS algorithm to the state-of-the-art algorithms in IM problem. The results indicate that our algorithm provides better solutions interns of influence on the priority sets when approximately give twice to ten times higher than threshold T while running time, memory usage and the influence spread also give considerable results compared to the others.

Competitive Influence Maximization ( CIM ) problem, which seeks a seed set nodes of a player or a company to propagate their product’s information while at the same time their competitors are conducting similar strategies, has been paid much attention recently due to its application in viral marketing. However, existing works neglect the fact that the limited budget and time constraints can play an important role in competitive influence strategy of each company. In addition, based on the the assumption that one of the competitors dominates in the competitive influence process, the majority of prior studies indicate that the competitive influence function (objective function) is monotone and submodular.This led to the fact that CIM can be approximated within a factor of 1 − 1 / e − ϵ by a Greedy algorithm combined with Monte Carlo simulation method. Unfortunately, in a more realistic scenario where there is fair competition among competitors, the objective function is no longer submodular. In this paper, we study a general case of CIM problem, named Budgeted Competitive Influence Maximization ( BCIM ) problem, which considers CIM with budget and time constraints under condition of fair competition. We found that the objective function is neither submodular nor suppermodular. Therefore, it cannot admit Greedy algorithm with approximation ratio of 1 − 1 / e . We propose Sandwich Approximation based on Polling-Based Approximation ( SPBA ), an approximation algorithm based on Sandwich framework and polling-based method. Our experiments on real social network datasets showed the effectiveness and scalability of our algorithm that outperformed other state-of-the-art methods. Specifically, our algorithm is scalable with million-scale networks in only 1.5 min.

In this paper1, we investigate different practical automatic repeat request (ARQ) retransmission protocols for twowaywireless relay networks based on network coding (NC). Theidea of NC is applied to increase the achievable throughput for the exchange of information between two terminals through one relay. Using NC, throughput efficiency is significantly improved due to the reduction of the number of retransmissions. Particularly, two improved NC-based ARQ schemes are designed based on go-back-N and selective-repeat (SR) protocols. The analysis of throughput efficiency is then carried out to find the best retransmission strategy for different scenarios. It is shown that the combination of improved NC-based SR ARQ scheme in the broadcast phase and the traditional SR ARQ scheme in themultiple access phase achieves the highest throughput efficiency compared to the other combinations of ARQ schemes. Finally, simulation results are provided to verify the theoretical analysis.

The impacts of merging on mixed traffic flow in the highway on-ramp zone are numerically investigated in this paper. An on-ramp mixed traffic flow merging model is proposed. Our model focuses on the on-ramp merging zone and considers a mixed traffic flow comprising of connected and automated vehicles (CAVs) and human-driven vehicles (HDVs). Firstly, we establish the Velocity-Modified Comfortable Driving (V-MCD) model for HDVs, which incorporates a velocity estimation module into the base Modified Comfortable Driving (MCD) model. The Cooperative Adaptive Cruise Control (CACC) model developed by PATH Labs is used for CAVs. A cooperative merging model has been developed to capture the interaction behavior of vehicles in various driving scenarios. Merging rules are established based on vehicle type and merging order. The merging rules for HDV-HDV are based on safety gap. Meanwhile, those for CAV-HDV are based on velocity difference, and for CAV-CAV are based on first-come-first-served. We conduct numerical simulation experiments to derive the fundamental diagram of the mixed flow and analyze the interaction between vehicles on the on-ramp and mainline. The simulation results indicate that the V-MCD model can effectively reflect on the hysteresis effect caused by on-ramp merging vehicles in real traffic scenarios. The increase in CAV penetration improves road traffic efficiency in terms of both traffic velocity and capacity. However, as the penetration of CAVs continues to rise, their positive impact will diminish. The sensitivity analysis of the hysteresis effect at both micro and macro levels can enhance our understanding of the impacts on traffic flow. As the hysteresis effect increases, merging has a greater impact on mainline upstream traffic, leading to reduce headway and more erratic velocity changes. [ABSTRACT FROM AUTHOR]