Search

This paper proposes on-driving experience sharing algorithms at junctions in infrastructure-assisted vehicles-to-everything networks. For the purpose, a millimeter-wave (mmWave) technology is used because it provides multi-Gbps data rates which is helpful for handling users’ short stay times at junctions and spatial reuse due to high beam directionality which is helpful for interference-avoidance among densely deployed vehicles at junctions. To realize on-driving experience sharing, the proposed algorithms focus on joint resource allocation and scheduling for 3GPP-compliant multiple unicast vehicle-to-vehicle (V2V) communications where the vehicles are group leaders (GLs) in 3GPP Mode 4(d). The resource allocation stands for the roadside unit (RSU) allocation to scheduled V2V GL links where RSU is essentially required for overcoming blockage by establishing two-hop relaying. Because vehicles stay for short times at junctions, this paper designs two algorithms without or with delay considerations. Without delay considerations, the joint optimization of RSU allocation and scheduling was originally formulated as mixed 0-1 non-convex optimization. However our proposed algorithm reformulates the problem into mixed 0-1 convex optimization, which is computationally easier to solve. With delay considerations, our proposed algorithm dynamically controls video contents frame rates for time-average on-driving video sharing quality maximization subject to delay constraints, inspired by Lyapunov optimization. Extensive simulation results demonstrate that our algorithms can significantly outperform in a variety of scenarios. Furthermore, we conduct the cost analysis for the proposed algorithms in terms of capital expenditure (CAPEX) and operating expenditure (OPEX). [ABSTRACT FROM AUTHOR]

This paper examines the problem of predictive gear scheduling for fuel consumption minimization in connected/automated heavy trucks. The literature highlights the fuel economy benefits of such predictive scheduling, but there is a need to optimize such scheduling online, in real time. To address this need, we begin by using dynamic programming (DP) to schedule gear shifting offline, in a manner that achieves a globally optimal Pareto tradeoff between the conflicting objectives of minimizing fuel consumption and shift frequency. The computational cost of DP is unfavorable for online implementation, but we present two algorithms addressing this challenge. Both algorithms rely on the fact that in the Pareto limit where fuel consumption minimization is the sole objective, DP furnishes a simple static shift map. Our first algorithm trains a recurrent neural network to prune the shift schedule generated by this map. The second algorithm performs this pruning in a direct manner tailored to reduce the schedule's rain flow count. We simulate these algorithms for different drive cycles. Both algorithms achieve a reasonable tradeoff between fuel consumption and gear shift frequency. However, the rain flow count algorithm is both more effective in approaching the DP-based Pareto front and more computationally efficient. [ABSTRACT FROM AUTHOR]

In this paper, a means of generating residuals based on a fault isolation observer (FIO) and evaluating them using a support vector machine (SVM) is proposed. The proposed FIO generates the isolated residual signals and they shows robust performance regardless of unknown road surface conditions. This FIO is designed using a linear time-invariant quarter-car model. While quarter-car models have the form of a bilinear system, in this study the authors convert this bilinear model to a linear model with model uncertainty based on the assumption that the control input is limited. Therefore, the proposed FIO can be used regardless of the type of damper or controller. Furthermore, the SVM based residual evaluator without empirically set thresholds is used to evaluate the generated residuals. The proposed fault diagnosis algorithm is expected to reduce the effort required in the design procedure and it can also detect a small amount of sensor fault that cannot be detected by traditional limit-checking method. The proposed fault diagnosis algorithm is verified using low cost production accelerometers and a quarter-car test rig. Consequently, the fault diagnosis algorithm proposed in this paper can detect the faults of a sprung mass accelerometer and an unsprung mass accelerometer independently, and this algorithm can reduce the effort required in designing the diagnosis algorithm greatly. [ABSTRACT FROM AUTHOR]

Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower complexity because of its sparsity. In this paper, based on deterministic message passing algorithm (DMPA), algorithmic simplifications such as domain changing and probability approximation are applied for SCMA decoding. Early termination, adaptive decoding, and initial noise reduction are also employed for faster convergence and better performance. Numerical results show that the proposed optimizations benefit both decoding complexity and speed. Furthermore, efficient hardware architectures based on folding and retiming are proposed. VLSI implementation is also given in this paper. Comparison with the state-of-the-art have shown the proposed decoder's advantages in both latency and throughput (multi-Gbps). [ABSTRACT FROM AUTHOR]

The Internet of vehicles (IoV) is a large information interaction network that collects information on vehicles, roads and pedestrians. One of the important uses of vehicle networks is to meet the entertainment needs of driving users through communication between vehicles and roadside units (RSUs). Due to the limited storage space of RSUs, determining the content cached in each RSU is a key challenge. With the development of 5G and video editing technology, short video systems have become increasingly popular. Current widely used cache update methods, such as partial file precaching and content popularity- and user interest-based determination, are inefficient for such systems. To solve this problem, this paper proposes a QoE-driven edge caching method for the IoV based on deep reinforcement learning. First, a class-based user interest model is established. Compared with the traditional file popularity- and user interest distribution-based cache update methods, the proposed method is more suitable for systems with a large number of small files. Second, a quality of experience (QoE)-driven RSU cache model is established based on the proposed class-based user interest model. Third, a deep reinforcement learning method is designed to address the QoE-driven RSU cache update issue effectively. The experimental results verify the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Range-based positioning using wireless signal has gained remarkable attention in past decades. Accurately extracting the distance information, i.e., estimating parameters of individual multipath, is of interest. It has been shown that diffuse multipath component (DMC) in wireless propagation channel has significant influence on channel estimation and, thus, the ranging performance. In addition to specular component (SC), DMC should be considered in order to improve the estimated accuracy of channel paths’ parameters and, thus, the ranging performance. In this paper, we extend the quasi-maximum likelihood space-alternating generalized expectation-maximization (SAGE) algorithm by incorporating an autoregressive moving average (ARMA) filter to estimate the channel parameters under the presence of DMC. The parameters of both DMC and SC are estimated in an iterative approach, where the DMC is assumed as colored noise and the ARMA-filter is used to estimate the contributions from DMC. The validation of the algorithm based on measured data shows that both SC and DMC can be accurately estimated by the proposed approach. A comparison with standard SAGE and AR-SAGE is conducted, where the results reveal that the proposed method outperforms other two approaches in terms of ranging accuracy. [ABSTRACT FROM AUTHOR]

In this paper, we propose an adaptive vehicle clustering algorithm based on fuzzy C-means algorithm, which aims at minimizing power consumption of the vehicles. Specifically, the proposed algorithm firstly dynamically allocates the computing resources of each virtual machine in the vehicle, according to the popularity of different virtualized network functions. The optimal clustering number to minimize the total energy consumption of vehicles is determined using the fuzzy C-means algorithm and the clustering head is selected based on vehicles moving direction, weighted mobility, and entropy. Simulation results are provided to confirm that the proposed algorithm can decrease the power consumption of vehicles while satisfying the vehicle delay requirement. [ABSTRACT FROM AUTHOR]

Torque safety is one of the key elements of functional safety for future automobile development. For drive-by-wire systems that are commonly used in modern vehicles, pedal signals are critical for the vehicle supervisory controller to generate appropriate torque request to the powertrain, in order to keep the vehicle speed as desired. Problems with pedals or pedal sensors will result in incorrect torque request sent to the drivetrain, possibly resulting in torque safety problems, such as sudden unintended acceleration. This paper proposes a fault detection and isolation strategy based on structural analysis as well as fault mitigation methods for torque safety of drive-by-wire systems, with focus on pedal mechanical stiction fault and pedal sensor faults. Before the diagnostic strategy is designed, fault modeling for these two types of faults are introduced to assist the design of diagnostic tests. In addition, for pedal mechanical stiction fault, this paper introduces an effective approach to calibrate the thresholds in the fault diagnostic system in order to achieve the desired tradeoff between false alarm rate and detection delay. The detection and mitigation strategies are calibrated and validated through model-in-the-loop and hardware-in-the-loop simulations using realistic pedal profiles from the testing results of the EcoCAR2 prototype vehicle developed at the authors’ institution. [ABSTRACT FROM AUTHOR]

Feature template matching (FTM) was proposed by Zhang and Qiu in 2011 for spectrum sensing in cognitive radio. Theoretical analysis for FTM is, however, missing in the literature. This paper will address this issue. Another new direction suggested by this paper is a nonlinear version of FTM, which is called kernel FTM (KFTM). The proposed nonlinear algorithm is performed on data mapped to a kernel space usually with higher dimension by a general nonlinear mapping. The high-dimensional data are cheaply operated with the so-called kernel trick. Furthermore, higher order statistics is considered in the proposed algorithm. Simulations using the real-world measurements of digital television (DTV) signal show that a gain of more than 4 dB can be achieved for KFTM over its linear counterpart FTM. Theoretical analysis is conducted for KFTM (that can be directly applied to FTM). For the first time, a theoretical justification is also performed for FTM. The concentration inequalities of KFTM, which are valid for arbitrary dimensions, are established as a result of concentration of measure phenomenon. The closed-form expressions of the probability distributions (under null hypothesis) are derived for both FTM and KFTM under different kernel functions. The obtained closed-form results agree with simulations. The closed-form expressions of the decision thresholds for a target false-alarm probability are obtained as well. The thresholds are noise power independent; thus, the proposed algorithm overcomes the difficulty of noise uncertainty. [ABSTRACT FROM PUBLISHER]

Opportunistic routing has been extensively studied and utilized in delay/disruption-tolerant networks. The extensive use of nodes' local information, e.g., the distance to the destination or the contact frequency with the destination, in such routing schemes can cause severe security and privacy problems. Existing solutions of anonymous routing can introduce undesired overhead and fail to provide the confidentiality of the routing metric. In this paper, we propose an advanced framework for opportunistic routing schemes, providing the following properties: confidentiality of the nodes' routing metric, anonymous authentication, and efficient key agreement for pairwise communication. A comprehensive evaluation, including security analysis, efficiency analysis, and simulation evaluation, is presented to show the security and feasibility of the proposed framework. [ABSTRACT FROM PUBLISHER]

The aim of this paper consists of developing a hybrid active control system to reduce the impact of vertical forces on roads and, therefore, to avoid the rollover of heavy vehicles (HVs). The controller is based on a super twisting algorithm. Two states are then fixed, which correspond to the controller being on or off. They are based on the lower limit and the upper limit of lateral acceleration. These states have been computed from the fixed lower limit and upper limit of the load transfer ratio (LTR). The system switches between these two states to control the vehicle. An estimator based on the sliding-mode observer is also developed to estimate the vehicle dynamics, such as yaw rate, roll angle, and lateral acceleration. The lateral positions and speeds are then controlled to limit the lateral acceleration of the vehicle, reduce the effect of impact forces, and prevent the risk of vehicle rollover. To show the quality of this assistance system, simulation and experimental results are given in this paper. Ramp and chicane tests are then presented. [ABSTRACT FROM PUBLISHER]

This paper examines the problem of optimizing hybrid electric vehicle (HEV) power management for fuel economy. This paper begins by presenting a pseudospectral algorithm to solve this optimization problem. Compared with traditional dynamic programming (DP)-based optimal power management approaches, this algorithm has two key advantages: It is numerically more efficient, and it furnishes both the optimal state and costate trajectories. Building on the second advantage, this paper proposes a two-level strategy for optimal power management in vehicles commuting along fixed routes. The upper level of the proposed strategy is a costate adaptation algorithm employing pseudospectral optimization, whereas the lower level is an instantaneous optimization controller employing Pontryagin's minimum principle (PMP). This paper shows its pseudospectral optimization algorithm and two-level strategy using numerical simulation for a series hybrid school bus. Parameters of the bus powertrain model are obtained from experimental component tests performed at the National Engineering Laboratory for Electric Vehicles, Beijing Institute of Technology. Simulation results show that the pseudospectral method reaches a solution close to DP with higher computational efficiency. Furthermore, the proposed two-level strategy is capable of adapting vehicle power management based on road-grade predictions, i.e., an attractive feature compared with more traditional online hybrid power management approaches such as the use of proportional integral derivative (PID) control for adaptive equivalent fuel consumption minimization [PID equivalent consumption minimization strategy (PID-ECMS)]. [ABSTRACT FROM PUBLISHER]

Dq impedance measurement is of great importance as a part of the impedance-based analysis. At present, impedance of objects in single-phase vehicle-grid system are mainly obtained by injecting the voltage or current disturbance of one single frequency into the system circularly. However, as the number of measurement frequency points increases, there will produce much time-consuming of measurement. In this paper, a quick dq impedance measurement algorithm for single-phase vehicle-grid system based on multi-frequency sweep is proposed. First, pseudo-random binary sequences (PRBS) and ternary sequences are modified as the driving signals rather than directly injecting into the control link. Then three types of disturbance with specific frequency characteristics are introduced into the system and their parameters setting principle are given for the first time. According to the different characteristics of measurement objects, the proposed algorithms are also different to ensure the maximum specificity and sensitivity. Finally, for different objects in vehicle-grid system like traction network, single-phase converter and dual-interleaved converter, simulation and experimental results based on the hardware in the loop real-time simulation platform both show the correctness of the proposed algorithm, and the possible causes of errors are also analyzed in detail. Moreover, the proposed algorithm makes it possible to quickly measure the dq impedance of the single-phase vehicle-grid system, and the correctness of the theoretical and measured value can be judged and used for the stability analysis of electrical systems. [ABSTRACT FROM AUTHOR]

This paper aims to explore the performance potential of a novel dual-mode power-split hybrid powertrain. First, the steady-state power split characteristics for the proposed hybrid powertrain in different modes are analyzed. The mode switching strategy is developed to maximize powertrain efficiency, which is verified by using dynamic programming based on direct transmit points (DTPs). Moreover, a novel multi-objective evolutionary algorithm based on the decomposition (MOEA/D) method used in a nested way with dynamic programming is proposed to solve the multi-objective optimization of the PS-HEVs for the first time, and the computational efficiency and superiority of the proposed algorithm is compared with the commonly used NSGA-II algorithm. The results show that the MOEA/D based multi-objective optimization framework has similar performance in the search for the Pareto frontier but significantly higher computational efficiency than that of the NSGA-II algorithm. The obtained Pareto frontier provides optimal design candidates for hybrid powertrain systems. [ABSTRACT FROM AUTHOR]

This paper proposes a novel bit loading algorithm to multicarrier non-orthogonal multiple access (NOMA) systems to maximize the system total throughput while satisfying the users’ individual quality of service (QoS) constraints. Although bit loading is generally a non-deterministic polynomial-time (NP)-hard problem, even for orthogonal multiple access (OMA), the mutual interference between the users, and the dependence of power coefficients and modulation orders are additional challenges that add substantial complexity to the optimization problem. Therefore, in this paper, we propose an efficient bit loading algorithm for multicarrier NOMA systems and compare the complexity and throughput with a corresponding OMA system. The obtained results show that for the case of NOMA, bit loading provides an additional degree of freedom that allows non-uniform spectrum sharing among the users. In particular scenarios, the system may experience hybrid modes of operation, where the system switches between NOMA and OMA. The obtained numerical results show that NOMA can outperform OMA by 100% in terms of spectral efficiency, for a two-user scenario. The complexity of the loading process for NOMA is noticeably higher than OMA, which is due to the high complexity associated with the bit error rate (BER) computation in the case of NOMA. [ABSTRACT FROM AUTHOR]

At present, Underwater Wireless Sensor Networks (UWSNs) have been widely used in enormous applications, and simultaneously face many security threats. The trust management mechanism plays an important role in protecting network security. Many theories, e.g., subjective logic, Bayesian, cloud model, entropy theory, evidence theory, etc., have been adopted to evaluate the node trust of wireless sensor networks. However, due to the unique characteristics of the underwater dynamic environment, the existing trust mechanisms used in traditional networks (such as P2P networks, Ad-hoc networks, etc.) cannot be directly used in UWSNs. Therefore, this paper proposes a new trust evaluation and update mechanism for underwater wireless sensor networks based on the C4.5 decision tree algorithm (TEUC). In the TEUC, trust evidences are first collected including data-based, link-based and node-based trust evidences. Then, the collected trust evidences are used to train the C4.5 decision tree. In addition, the reward and penalty factors are defined to update trust based on the sliding time window. Finally, simulation results demonstrate that the proposed algorithm outperforms the traditional ones in a dynamic network environment in terms of malicious node detection and energy consumption. [ABSTRACT FROM AUTHOR]

Autonomous vehicles will generate data from the variety of sensors they employ to track the surrounding environment. This data is inherently valuable, as it gives algorithm designers the potential to leverage prior experience in order to improve driving performance over time. This paper uses the lens of autonomous racing to provide an example of how data from previous iterations of driving can be used to improve quantitative metrics of performance. Two complementary algorithms are demonstrated in this paper. The first algorithm uses iterative learning control (ILC) to simultaneously improve lateral and longitudinal tracking of the desired racing trajectory over multiple laps, while the second algorithm is focused on altering the trajectory itself using a search method. When driven experimentally at the limits of handling, the result is a reduction in lap time of nearly 1.4 seconds, a major improvement. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are wireless self-organizing networks, whose communication is conducted through open wireless channels, thus making it vulnerable to various attacks. It is therefore necessary to employ encryption technology to ensure secure communication. In view of the foregoing, key agreement techniques are introduced to VANET communications. The group key agreement (GKA) protocol allows a group of participants to establish a public session key for a secure communication channel over an insecure network. The traditional GKA protocol is inefficient, however, and consumes considerable amounts of resources. With the aim of resolving problems related to information security and privacy preservation in VANETs, this paper proposes a full session key agreement scheme based on chaos mapping. In this paper, the first phase describes the key agreement between the fog server and group administrator; the second phase describes the group key agreement for vehicle nodes in the group where the vehicle can only communicate with vehicles having the same group key without the aid of a trusted key center or centralized key distributor. The proposed scheme is based on Chebyshev chaotic mapping algorithm, in which a chaotic map is utilized to provide a one-way hash; Chebyshev polynomial is also employed to establish a public multi-party key; it avoids the modular multiplication index or scalar multiplication on the elliptic curve. The proposed scheme does not only satisfy the security requirements in VANETs but also performs detailed analysis. [ABSTRACT FROM AUTHOR]

The Ultra-short baseline (USBL) positioning system has important application in the positioning of underwater vehicles. The installation error angle of the USBL positioning system has an important influence on the positioning accuracy of USBL system. The traditional calibration methods have limited estimation accuracy for installation error angles and have high route requirements. To solve the above problems, a calibration method of installation error angle based on attitude determination is proposed in this paper. When strapdown inertial navigation system (SINS) and USBL are fixed together in the application process, the installation error angle of USBL is fixed and unchanged. Then the calibration of installation error angle can be accomplished with the idea of attitude determination. The vector observation model based on the installation error angle matrix is established first. Observation vectors are obtained by the relative position of transponders in the USBL coordinate frame. The reference vector is calculated by position of transponder, position and attitude of SINS and lever arm between SINS and USBL. By constructing the observation vectors and the reference vectors, the proposed method can calibrate the installation error angle of SINS and USBL in real time. The advantages of the proposed method are that it has no specific requirements for the calibration route and can calibrate the installation error angle in real time with high accuracy. In order to verify the performance of the proposed algorithm, simulation experiment and field experiment are carried out in this paper. The results of simulation experiment and field experiment show that the proposed method can give the estimated installation error angle of USBL in real time, and the estimated result is the best among several methods. The proposed method can not only achieve the calibration of the installation error angle in circular trajectory, but also in straight trajectory. [ABSTRACT FROM AUTHOR]

To improve the maneuverability and stability of a vehicle and fully leverage the advantages of torque vectoring technology in vehicle dynamics control, a finite-time yaw rate and sideslip angle tracking controller is proposed by combining a second-order sliding mode (SOSM) controller with the backstepping method in this paper. However, existing research indicates that first-order sliding mode (FOSM) control suffers from the chattering problem, while the traditional SOSM controller requires knowing the bound of the uncertain term in advance to obtain the switching gain, which is difficult in practice. To address these problems, this paper proposes an adaptive second-order sliding mode (ASOSM) controller based on the backstepping method by adding the high-frequency switching term to the first derivative of the sliding mode variable, which implies that the actual control can be acquired after an integration process. The switching gain in the ASOSM controller is obtained by an adaptive algorithm without knowing any information of the uncertainty. The proposed algorithm is compared with FOSM and SOSM in different scenarios to demonstrate its applicability and robustness. Simulation results show that the bandwidth of the vehicle transient response can be improved by 21%. In addition, ASOSM and SOSM controllers are insensitive to vehicle mass and tire type, implying their robustness to such disturbances. Furthermore, ASOSM requires less control action because of the adaptive law when it performs similarly with SOSM and FOSM. [ABSTRACT FROM AUTHOR]

In this paper we propose a quality of experience (QoE) based joint subcarrier and power allocation (JSPA) technique for orthogonal frequency division multiple access (OFDMA) based downlink video transmission over doubly selective channels (DSCs), where the power allocation is made adaptive to the user velocity. Due to the doubly selective nature of wireless channels, OFDMA based wireless systems are vulnerable to inter-carrier interference (ICI). The proposed speed adaptive power allocation can combat ICI to a great extent compared to the non-adaptive power allocation schemes. Moreover, the proposed JSPA ensures a critical issue of fairness in QoE among users. By making use of space-alternating generalized expectation-maximization maximum a posteriori probability (SAGE-MAP) algorithm, this paper also studies the bit rate performance of the proposed resource allocation algorithm in the presence of perfect and imperfect channel state information (CSI). [ABSTRACT FROM AUTHOR]

The time synchronization in vehicular ad hoc networks (VANETs) has gained significant attention in recent times. In this paper, we focus on the time synchronization in large-scale VANETs and propose an adaptive beacon time synchronization (ABTS) algorithm to enhance timing message synchronization. ABTS algorithm selects the best time synchronization pairs to decrease the number of timing messages transmitted. To guarantee the reliability of synchronization, the clock offset of the connected vehicles periodically readjust to provide a better degree of synchronization accuracy with minimum energy consumption. Based on two-way timing message synchronization, we derive maximum likelihood (ML) estimation and its equivalent Cramer-Rao lower bound (CRLB) for clock offset design in the generalized sender-to-receiver system by assuming a Gaussian noise model. We propose node pair selection algorithms to improve pairwise beacon message timing synchronization. The simulation results validate that our proposed ABTS algorithm performs better than other protocols in terms of synchronization accuracy, the rate of convergence and energy efficiency. [ABSTRACT FROM AUTHOR]

The small cells in millimeter wave (mmWave) have been utilized extensively for the fifth generation (5 G) mobile networks. And full-duplex (FD) communications become possible with the development of self-interference (SI) cancellation technology. In this paper, we focus on the optimal allocation of the sub-channels in the small cells deployed densely underlying the mmWave networks. In order to improve the resource utilization and network capacity, device-to-device (D2D) communications are adopted in networks. For maximizing the system throughput, we propose a cooperative sub-channel allocation approach based on coalition formation game, and theoretically prove the convergence of the proposed allocation algorithm. The utility of the coalition formation game is closely related to the sum system throughput in this paper, and each link makes an individual decision to leave or join any coalition based on the principle of maximizing the utility. Besides, a threshold of the minimum transmission rate is given to improve the system fairness. Through extensive simulations, we demonstrate that our proposed scheme has a near-optimal performance on sum throughput. In addition, we verify the low complexity of the proposed scheme by simulating the number of switch operations. [ABSTRACT FROM AUTHOR]

We consider the energy-efficient mobility-aware content caching problem with clustered small cells (SCs) in ultra-dense networks (UDNs). The UDN is regarded as one of the key solutions to overcome the explosive growth of mobile data traffic and consequential energy consumption. In addition, caching the popular contents at the edge of UDNs can further mitigate the challenges of traffic and energy. In this paper, we group the SCs into disjoint clusters and model the mobility of users between clusters as a Markov chain. We formulate the caching problem aimed at minimizing the overall energy consumption for content delivery to the moving users. Then we decompose the complicated task of energy consumption optimization in cache-enabled UDNs into two sub-problems. In the first sub-problem, we formulate the inter-cluster caching problem as minimizing the energy consumption for serving a user request by the macro base station. We show that the first sub-problem is NP-hard, and develop a polynomial-heuristic algorithm. Further, we define the mobility-oblivious version of the sub-problem, and provide a ${\textstyle {1 \over {2k }}}$ -approximation solution for the mobility-aware based on this mobility-oblivious version. In the second sub-problem, we consider the heterogeneity of small cells and define the intra-cluster caching problem. The aim of this sub-problem is the placement of content in different SCs within the cluster so that the energy consumption for the content delivery in that cluster is minimized. In particular, the second sub-problem fits the general framework of the generalized assignment problem, which allows us to exploit its rich literature, to determine the optimal solution for our problem. Through extensive simulations based on real wireless data and human mobility patterns, we demonstrate the benefits of our approach that is even up to 56% better compared to the conventional caching schemes. [ABSTRACT FROM AUTHOR]

Dynamic spectrum leasing (DSL) is a promising method to improve the spectrum efficiency. A lot of work has been done about spectrum sharing issues with static models. In this paper, we want to study the behavior of the primary users (PUs) under uncertainty. For this objective, we propose a model with time-varying parameters. The model captures both technical and economic features. We study the long-term behavior of the PUs in the model with stochastic Cournot game theory and variational inequality theory. We show that the PUs can maximize their long-term utilities with a static supply of spectrum. In addition, we also propose two algorithms based on stochastic approximation theory. The convergence and performance of the algorithms are demonstrated theoretically and numerically. The proposed model and analytical framework can be used to study and predict the behaviors of PUs given a DSL system and provide design insights for the DSL system. [ABSTRACT FROM AUTHOR]

This paper focuses on precoding design for sum-rate maximization while considering the effects of residual self-interference for multiuser multiple-input–multiple-output (MU-MIMO) full-duplex (FD) systems. The problem formulation leads to a nonconvex matrix-variable optimization problem, where we develop two efficient sum-rate maximization algorithms using sequential convex programming (SCP), namely, the difference of convex functions (DC)-based and the sequential convex approximations for matrix-variable programming (SCAMP) algorithms. In addition, we derive the achievable sum rate under the effect of residual self-interference. Simulation results show that, even in cases of high self-interference and high estimation error, the SCAMP algorithm provides approximately 20%–30% sum-rate improvements over both conventional optimized half-duplex (HD) transmission and the existing state-of-the-art FD algorithm in a wide range of scenarios. Finally, the convergence results indicate that the DC-based algorithm tends to initially give the best performance; however, at convergence, the SCAMP algorithm tends to significantly outperform the other algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a new approach to accurately and efficiently identifying a large number of wireless devices blindly installed to known three-dimensional installation/fitting points, based on received signal strengths (RSSs) between the devices. The approach is non-trivial because of the factorial, mapping nature of the considered problem, the multiplicative ranging errors of the RSS measurements (with standard deviation of 5–7 dB), and the requirement of high mapping accuracy in many internet-of-things (IoT) applications, e.g., industrial IoT and aircraft. The consideration of a structured environment where the set of candidate node positions is known beforehand shifts the problem of interest from a pure position estimation problem to a position assignment problem. The key idea of the proposed approach is that we interpret the position mapping problem with a probabilistic graphical model, where the factorial nature of mapping (more specifically, the mutual exclusiveness of devices at every installation point) is fully captured. A max-product belief propagation is designed against the probabilistic graph, to estimate the max-marginal position distribution of each device. The Kuhn-Munkres algorithm is applied to preserve the mutual exclusiveness of devices throughout the belief propagation and to decide device locations based on the estimated position distributions. Large-scale simulations and field tests are carried out, showing that the new approach achieves close-to-100% accuracy in simulations with hundreds of blindfolded devices under RSS measurement errors with standard deviation of 5–7 dB. Our approach also achieves 100% accuracy in all field trials with 76 devices inside the cabin of a Fokker 100 airplane, dramatically outperforming baseline techniques. [ABSTRACT FROM AUTHOR]

Power control is becoming increasingly essential for the fifth-generation (5G) and beyond systems. An example use-case, among others, is the unmanned-aerial-vehicle (UAV) communications where the nearly line-of-sight (LoS) radio channels may result in very low signal-to-interference-plus-noise ratios (SINRs). The authors in (Chiang et al., 2007) proposed to efficiently and reliably solve this kind of non-convex problem via a series of geometrical programmings (GPs) using condensation approximation. However, it is only applicable for a small-scale network with several communication pairs and practically infeasible with more (e.g., tens of) nodes to be jointly optimized. We therefore in this paper aim to provide new insights into this problem. By properly introducing auxiliary variables, the problem is transformed to an equivalent form which is simpler and more intuitive for condensation. A novel condensation method with linear complexity is also proposed based on the form. The enhancements make the GP-based power control feasible for both small- and especially large-scale networks that are common in 5G and beyond. The algorithm is verified via simulations. A preliminary case study of uplink UAV communications also shows the potential of the algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a scheme for constructing an Internet Protocol (IP) version 6 over low-power wireless personal area networks (6LoWPAN) wireless sensor network based on a cluster tree. In the cluster generation algorithm, a cluster tree is always an isolated node with the maximum number of neighbor isolated nodes that launches the cluster generation process; therefore, the total number of cluster heads is minimized. In the cluster-tree construction algorithm, the cluster-tree architecture is proposed, and the cluster-tree construction algorithm minimizes the total number of nodes included in a cluster tree; therefore, the routing cost is reduced. In the cluster-tree repair algorithm, when a cluster head or a cluster associate node fails or moves, a new cluster head or cluster associate node is elected to maintain the cluster-tree topology. This paper compares the performance parameters of Least Cluster Change algorithm with Lowest-ID, Root-based Lowest-ID cluster constructing mechanism, and the proposed scheme, including the cluster-tree topology stability, the routing memory cost, and the routing update cost. The analytical data show that the performance of the proposed scheme is better. [ABSTRACT FROM PUBLISHER]

To meet the execution requirements of delay-sensitive services in vehicular edge computing (VEC) networks, vehicular services need to be offloaded to edge computing nodes. For complex, large-scale services, the services need to be migrated if the services are not completed before the vehicles leave the coverage of edge computing nodes. Trust and resource matching between areas thus become major problems. This paper studies the decision model of vehicular service offloading and migration. First, software-defined network (SDN) technology is introduced into the traditional network architecture, and a two-layer distributed SDN-controlled VEC network architecture is designed, which is divided into a domain control layer and an area control layer. In this framework, we use the consortium blockchain as a carrier to share network topology information between SDN controllers to prevent information leakage. We then established a service offloading and migration optimization problem model to minimize service execution delay, reduce energy consumption and maximize the throughput of the blockchain system. We describe the problem model as a Markov Decision Process (MDP), introduce a deep reinforcement learning (DRL) algorithm named asynchronous advantage actor-critic (A3C) and design a dynamic service offloading and migration algorithm (DSOMA) based on A3C to solve the problem. Simulation results show that DSOMA can increase the throughput of the blockchain system, and DSOMA is superior to the deep Q-learning (DQN) algorithm and greedy offloading algorithm in reducing service execution delay and system energy consumption. [ABSTRACT FROM AUTHOR]

This paper considers optimal joint time, frequency, and power allocation for energy-efficient device-to-device (D2D) communications in an overlay cellular network, where multiple D2D transmitters communicate with their corresponding D2D receivers while utilizing the energy harvested from a cellular base station (BS). Due to channel estimation error and feedback delays, the channel state information (CSI) available at the transmitters is usually imperfect, which can significantly deteriorate the energy efficiency (EE) of the considered system. To mitigate the impact of imperfect CSI, we formulate a non-convex robust optimization problem for the maximization of the EE (in bits/Joule) of the system while ensuring quality of service (QoS) requirements on the minimum data rata and the minimum amount of harvested energy for cellular and D2D users, respectively. We reveal that the optimal energy-efficient D2D transmission should exhaust all the harvested energy of each D2D transmitter. Exploiting this fact, we propose an efficient iterative algorithm for obtaining the optimal solution. To strike a balance between performance and computational complexity, we further propose a low-complexity suboptimal algorithm. Simulation results show that compared with several baseline schemes, both the proposed optimal and suboptimal algorithms can significantly improve the EE of wireless-powered D2D communications under imperfect CSI. Moreover, the proposed suboptimal algorithm is close-to-optimal when the number of cellular users are small or the channel estimation error is large. [ABSTRACT FROM AUTHOR]

During the running of electric locomotives, a large amount of operating data will be stored through the Analog-Digital Converter (ADC) and the recording oscillograph of the on-board Traction Control Unit (TCU). Analysis based on mass data to detect slipping is of great significance for saving energy, improving the performance and safety of the traction control system of electric locomotives. Therefore, after analyzing and summarizing the advantages of Empirical Wavelet Transform (EWT) and Fuzzy Entropy (FE) algorithm in data processing and the classification theory of Support Vector Machine (SVM), this paper proposed a SVM slipping detection method based on EWT and FE algorithm. Firstly, feature extraction is carried out on the locomotive wheelset velocity data collected by the on-board velocity sensor, that is, the feature vector of data is extracted by calculating fuzzy entropy value after EWT, and the velocity data is converted into feature matrix for slipping-detection of SVM. Then considering the defects of traditional optimization algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) in the parameter optimization of SVM, Genetic Particle Swarm Optimization Algorithm (GAPSO) is proposed to optimize the parameters of SVM classification model, and the slipping detection model of SVM is established through training samples, which realizes high-precision slipping detection. Finally, combined with a large number of locomotive data, the comparative analysis test is carried out, the results show that the feature extraction method based on EWT and FE algorithm has excellent ability of mode decomposition and feature extraction, GAPSO has efficient optimization ability, and the proposed slipping detection method can accurately detect slipping. [ABSTRACT FROM AUTHOR]

The combination of non-orthogonal multiple access (NOMA) and intelligent reflecting surface (IRS) is an efficient solution to significantly enhance the energy efficiency of the wireless communication system. In this paper, a downlink multi-cluster NOMA network is considered, where each cluster is supported by one IRS. This paper aims to minimize the transmit power by jointly optimizing the beamforming, the power allocation and the phase shift of each IRS. The formulated problem is non-convex and challenging to be solved due to the coupled variables, i.e., the beamforming vector, the power allocation coefficient and the phase shift matrix. To address this non-convex problem, an alternating optimization based algorithm is proposed. Specifically, the primal problem is divided into two subproblems for beamforming optimization and phase shifting feasiblity, where the two subproblems are solved iteratively. Moreover, to guarantee the feasibility of the beamforming optimization problem, an iterative algorithm is proposed to search the feasible initial points. To reduce the complexity, a simplified algorithm based on partial exhaustive search for this system model is also proposed. Simulation results demonstrate that the proposed alternating algorithm can yield a better performance gain than the partial exhaustive search algorithm, NOMA with random IRS phase shift scheme and OMA-IRS scheme. [ABSTRACT FROM AUTHOR]

This paper studies a novel design of user pairing and resource allocation in a simultaneous wireless information and power transfer (SWIPT)-enabled cooperative non-orthogonal multiple access (NOMA) system with coexisting power-splitting (PS) and time-switching (TS) users. In this system, near NOMA users (NUs) that are close to a source can assist the communications between the source and far NOMA users (FUs) using the energy harvested by either PS or TS strategy. The design aims to maximize the sum-rate of the system by optimizing user pairing and power allocation between NUs and FUs as well as performing PS and TS control at NUs, while guaranteeing the target data rates and the minimum harvested energy requirements of users. Since the joint design is formulated as a non-convex mixed-integer non-linear programming (MINLP) problem that is challenging to tackle, we propose a two-step user pairing and resource allocation algorithm. Specifically, we decouple the original problem into an inner resource allocation problem and an outer user pairing problem. For the inner problem, we propose successive convex approximation (SCA) and block coordinate descent (BCD)-based algorithms to perform power allocation as well as PS and TS control iteratively, with the algorithms’ convergence being theoretically proved. By exploiting the characteristics of the outer problem of user pairing, this problem is well tackled by the Hungarian algorithm. Simulation results demonstrate the proposed joint design yields better performance gains than the existing schemes. [ABSTRACT FROM AUTHOR]

In this paper, we study the beam synthesis and management methods for the phased antenna array-based wireless communications systems, e.g., 5 G mmWave communications. First, we propose a novel on-off beam synthesis method that can synthesize any given on-off beam pattern. The proposed method maximizes the beam power towards a given set of on-directions while suppressing the power towards all off-directions. Second, by using a set of beams synthesized by the proposed on-off beam synthesis method, we design a non-interactive hierarchical beam management algorithm that can greatly reduce the radio resource usage, feedback overhead, and the latency of the beam discovery, compared to the exhaustive beam search algorithms. Since the proposed beam management algorithm is non-interactive, it can be applied to the initial access as well as the beam tracking, and is especially useful for supporting a massive number of devices. Finally, we show the validness of the proposed beam synthesis and management methods by conducting experiments on a phased antenna array experimental testbed. [ABSTRACT FROM AUTHOR]

In delay-tolerant networks (DTNs), stable end-to-end connections do not always exist. Messages are forwarded, assisted by the mobility of nodes, in a store–carry–forward paradigm. The mobility of nodes in most DTNs has a certain statistical regularity; thus, using historical information in DTNs to compute the delivery quality of nodes can help to select good forwarding nodes. This paper aims to establish a routing scheme based on multihop delivery quality, which is designed to reduce the energy consumption of message forwarding while maintaining a high delivery rate. We characterized the multihop delivery quality of each node with an expected delay and an expected probability, parameterized by the remaining hop count. Based on these two quality metrics, we developed two algorithms, namely, the delay-inferred forwarding (DIF) algorithm and the probability-inferred forwarding (PIF) algorithm. The basic idea of DIF and PIF is to find the optimal forwarding path by minimizing the expected delay and by maximizing the expected probability, respectively, in the hop graph that is defined in this paper. We performed extensive trace-driven simulations to compare our algorithm to other representative routing algorithms using several real traces. We observed the following: 1) Compared with the delegation algorithm, which uses one-hop delivery quality, both DIF and PIF significantly improve the message delivery rate, and they yield more improvements as the mobility of nodes becomes more regular; and 2) compared with the state-of-the-art optimal opportunistic forwarding (OOF) algorithm, which also uses a multihop delivery quality, DIF and PIF have significantly smaller forwarding overhead (with the maximum reduction in the number of forwarding being over 40%), whereas they are quite close to OOF in terms of both delivery rate and average delay. [ABSTRACT FROM PUBLISHER]

In the current architecture of dynamic spectrum access, secondary users (SUs) only opportunistically access the spectrum of primary users (PUs). The resurgence of PUs disrupts secondary communications, which can result in poor performance for SUs. In this paper, we propose a novel architecture for dynamic spectrum access, termed dynamic spectrum co-access (DSCA), to enable the PU and the SU to simultaneously access the licensed spectrum. With DSCA, SUs transparently incentivize PUs through increasing the PU performance so that SUs can access the spectrum simultaneously with PUs; hence, there is no disruption to secondary communications due to the resurgence of PUs. We derive a mathematical model to formulate the minimum incentives for the spectrum co-access between the PU and the SU and to compute the region of co-access to determine the SUs that can co-access with a given PU. An algorithm is also developed to select the co-access primary and secondary links to maximize network performance. Numerical results indicate that DSCA significantly improves performance compared with the current architecture of dynamic spectrum access. [ABSTRACT FROM PUBLISHER]

In this paper, we study the downlink resource assignment problem of maximizing the total data rate subject to minimum satisfaction guarantees in multiservice scenarios assuming the use of multiuser (MU) multiple-input–multiple-output (MIMO) techniques. With the use of MU MIMO techniques, the same frequency resource can be shared by different terminals at the same time by assigning different spatial channels to each terminal. Different from single-user (SU) access per frequency resource where the resource assignment problem consists of searching for the best association between frequency resources and terminals, with MU access per resource, we aim at finding which space-division multiple-access (SDMA) group should be associated with each frequency resource. The first contribution of this paper is the formal presentation of this generalized problem as an optimization problem. Then, after some mathematical manipulations, we managed to convert this problem from a nonlinear integer to an integer linear problem (ILP) that can be optimally solved by standard techniques instead of resorting to brute-force methods. Motivated by the high computational complexity of the optimal solution, we propose a low-complexity algorithm. By analyzing outage rate and total data rate performance metrics, we show that the proposed solution presents a good performance–complexity tradeoff compared with the method for obtaining the optimal solution. [ABSTRACT FROM PUBLISHER]

Multicarrier low-density-spreading multiple access (MC-LDSMA) is a promising multiple access technique that enables near-optimal multiuser detection. In MC-LDSMA, each user's symbol is spread over a small set of subcarriers, and each subcarrier is shared by multiple users. The unique structure of MC-LDSMA makes the radio resource allocation more challenging compared with some well-known multiple access techniques. In this paper, we study the radio resource allocation for a single-cell MC-LDSMA system. First, we consider the single-user case and derive the optimal power allocation and subcarriers partitioning schemes. Then, by capitalizing on the optimal power allocation of the Gaussian multiple-access channel, we provide an optimal solution for MC-LDSMA that maximizes the users' weighted sum rate under relaxed constraints. Due to the prohibitive complexity of the optimal solution, suboptimal algorithms are proposed based on the guidelines inferred by the optimal solution. The performance of the proposed algorithms and the effect of subcarrier loading and spreading are evaluated through Monte Carlo simulations. Numerical results show that the proposed algorithms significantly outperform conventional static resource allocation, and MC-LDSMA can improve the system performance in terms of spectral efficiency and fairness in comparison with orthogonal frequency-division multiple access. [ABSTRACT FROM PUBLISHER]

Sparse signatures have been proposed for the code-division multiple-access (CDMA) uplink to reduce multiuser detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this paper, we propose multicarrier CDMA (MC-CDMA) downlink communication whereby regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station (BS), subject to minimum symbol error probability (SEP) requirements at the mobile stations (MSs). In the algorithm, signature sparsity is shown to be crucial for reducing precoding complexity. Numerical results confirm system-load-dependent power reduction gain from the proposed precoding over the zero-forcing (ZF) precoding and the regularized ZF (RZF) precoding with optimized regularization parameter under the same SEP targets. For a fixed system load, it is also demonstrated that sparse MC-CDMA with a proper choice of sparsity level attains almost the same power efficiency and link throughput as that of dense MC-CDMA yet with reduced precoding complexity due to the sparse signatures. [ABSTRACT FROM PUBLISHER]

Multiple-input–multiple-output (MIMO) technology can efficiently use the spectrum to increase the communication throughput. Designing low-complexity detection algorithms with high performance for the MIMO system has been an important issue. In this paper, we propose efficient detection algorithms for MIMO systems based on differential metrics. We first define differential metrics and give their recursive calculation of different orders. Based on differential metrics, we give the principle of gradient search. We then propose a gradient search algorithm (GSA) that can provide a tradeoff between performance and complexity. The GSA applies the indicative functions such that we can determine in advance some maximum-likelihood (ML) bits of the initial sequence and reduce the searching range. The GSA also uses a stop condition with which we can stop the search if the proper condition is satisfied. The GSA does not need QR decomposition (QRD) or matrix inversion. The multiplicative operations are only necessary before the searching process, during which only the additive operations are needed. For large-scaled MIMO systems, we also give a simple searching algorithm based on differential metrics. Finally, we propose a fixed-complexity gradient algorithm (FCGA), which has a fixed number of operations during the searching process and is appropriate for pipelined hardware implementation. The simulation results validate the efficiency of the proposed algorithms. [ABSTRACT FROM PUBLISHER]

To efficiently trade off system sum rate and link fairness, power allocation in wireless spectrum-sharing networks often concentrates upon proportional fairness. The corresponding problem has been proved to be convex for a single tone but NP-hard for more than two tones. However, in the two-tone case, the complexity of the problem for achieving proportional fairness has not been addressed yet. In this paper, we prove that the issue of proportional-fairness optimization for the two-tone situation is NP-hard by reducing the problem of finding the maximum independent set in an undirected graph to it. Moreover, a computationally efficient algorithm is proposed to provide an efficient suboptimal solution. Simulation results are presented to illustrate the effectiveness of our proposal. [ABSTRACT FROM PUBLISHER]

In this paper, we study the distributed precoding problem for simultaneous wireless information and power transfer (SWIPT) in decode-and-forward (DF)-based multiple-input–multiple-output (MIMO) relay networks. The system model considered here consists of a source, a relay, an information decoding (ID) receiver, and an energy harvesting (EH) receiver, all mounted with multiple antennas. Since full channel state information (CSI) is usually unavailable, a practical scenario, where only local CSI is required, is considered in this paper. Such a practical scenario naturally constitutes a noncooperative game, where the source and the relay can be regarded as two rational game players. With properly designed utilities, it can be further shown that the existence and uniqueness of the pure-strategy Nash equilibrium (NE) of the proposed game can both be guaranteed under some mild conditions. Therefore, a distributed iterative precoding algorithm can be developed based on the best-response dynamic to obtain the unique NE solution for the proposed game. Moreover, a proximal-point-based regularization approach is also pursued to ensure the convergence of the proposed algorithm without requiring special restrictions on the channel ranks. Numerical simulations are also provided to demonstrate the proposed algorithm. Results show that our algorithm can converge quickly to a satisfactory solution with guaranteed convergence. [ABSTRACT FROM PUBLISHER]

In this paper, the downlink of a clustered coordinated multicell multiuser multiple-input multiple-output (MIMO) system is considered, and various low-complexity user scheduling algorithms to maximize the sum rate are proposed. The users' data signals are transmitted cooperatively via the base stations (BSs) of a cluster within the sectorized multicell heterogeneous cellular network. Exhaustive search as the optimal scheduling method is extremely complex, particularly for large numbers of users requesting service. We therefore propose suboptimal scheduling algorithms based on the lower complexity metaheuristic stochastic optimization techniques of simulated annealing (SA) and particle swarm (PS). Moreover, a hybrid algorithm combining the traits of PS and a greedy scheduler is also proposed. The performance and complexity of these algorithms are evaluated for a heterogeneous system model employing different precoding methods. Assessing the algorithms' performance via computer simulations, the effectiveness of the proposed schemes in terms of sum rate is demonstrated, yielding performance very close to that of the exhaustive search at much lower complexity. For each precoding method used in the employed system model, the best corresponding approach to scheduling from our proposed algorithms is determined. [ABSTRACT FROM AUTHOR]

Geocast, which consists of delivering messages to a specific location, has become an important technique with the accelerated development of the location-based services in mobile networks. Geocast in the automotive domain is of particular interest, enabling many promising applications, such as geographic advertising, location-based traffic alerts, etc. Different from the conventional geocast algorithms focusing on the distance-based approaches, in this paper, we propose a node mobility-aware and node contact-aware geocast algorithm (GeoMobCon) for urban vehicular ad hoc networks from the delay-tolerant network perspective to better deal with the high mobility and transient connectivity issues. Different levels and aspects of vehicle mobility information and self-maintained contact information are employed, making GeoMobCon simple, scalable, and communication and computation effective. Practical issues are well considered by introducing real-world trace analysis, trace-driven simulation, and efficient buffer management. Extensive performance comparisons with other protocols have been conducted to show the advantages of GeoMobCon. [ABSTRACT FROM AUTHOR]

This paper proposes an algorithm to control the suspension dynamics with an energy regeneration capability and high conversion efficiency. Central to the concept is the development of a switched-mode rectifier (SMR) that is capable of providing either an equivalent positive or negative damping and alternating between regenerative and motoring modes. Simulation results are presented to demonstrate power flow in regeneration and motoring modes and verify the equivalent damping characteristic and vibration energy harvesting. The studies are conducted on a small-scale proof-of-concept electromagnetic suspension system excited by emulated International Standard Organization (ISO) 8608 road profiles. An autonomous start/stop algorithm is proposed such that autonomously turns on or off the converter. This mechanism mitigates quiescent power consumption of auxiliary integrated circuits (ICs) such as gate drivers and current transducers, therefore increasing the conversion efficiency of the power electronics throughout an ISO standardized variable-speed driving cycle. The autonomous start/stop algorithm is implemented experimentally to demonstrate its feasibility under typical standardized driving cycles. [ABSTRACT FROM PUBLISHER]

Grant-free non-orthogonal multiple access (NOMA) scheme is considered as a promising candidate for the enabling of massive connectivity and reduced signalling overhead for Internet of Things (IoT) applications in massive machine-type communication (mMTC) networks. Exploiting the inherent nature of sporadic transmissions in the grant-free NOMA systems, compressed sensing based multiuser detection (CS-MUD) has been deemed as a powerful solution to user activity detection (UAD) and data detection (DD). In this paper, block coordinate descend (BCD) method is employed in CS-MUD to reduce the computational complexity. We propose two modified BCD based algorithms, called enhanced BCD (EBCD) and complexity reduction enhanced BCD (CR-EBCD), respectively. To be specific, by incorporating a novel candidate set pruning mechanism into the original BCD framework, our proposed EBCD algorithm achieves remarkable CS-MUD performance improvement. In addition, the proposed CR-EBCD algorithm further ameliorates the proposed EBCD by eliminating the redundant matrix multiplications during the iteration process. As a consequence, compared with the proposed EBCD algorithm, our proposed CR-EBCD algorithm enjoys two orders of magnitude complexity saving without any CS-MUD performance degradation, rendering it a viable solution for future mMTC scenarios. Extensive simulation results demonstrate the bound-approaching performance as well as ultra-low computational complexity. [ABSTRACT FROM AUTHOR]

The multimode power-split architecture for hybrid electric vehicle (HEV) powertrains is generally known for the complexity of its operation. This paper first addresses the challenge of developing an automated on-line near-optimal control strategy for these systems. Particularly, a machine learning logic based on supervised learning is developed for on-line selection of the HEV operating mode, thus the particular set of clutches to be engaged. An efficiency-based approach is then adopted to determine the optimal power-split between powertrain components. Later, the developed strategy finds integration in an optimal design methodology for multimode power-split HEVs considering the effectiveness and ease of on-line controllability. The obtained results are compared with the ones by the traditional HEV design methodology that only considers off-line energy management. The illustrated design methodology with on-line control reveals efficient at identifying the multimode HEV design that demonstrates optimal predicted fuel economy values and ease of on-line controllability simultaneously. Results suggest that the HEV design optimization procedure may produce different outcomes and demonstrate more effective when the evaluation of the on-line controlled operation is integrated. [ABSTRACT FROM AUTHOR]

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications. The proposed CRA scheme is scalable. As a result, if the number of devices increases, more RBs can be added to support them. Thanks to multiple RBs, we can employ fast retrial between RBs for re-transmissions of collided packets, which can result in short access delay. For stable CRA with fast retrial, we derive conditions (with a rate control scheme), and analyze the steady-state performance to find the throughput and delay. Through analysis and simulation results, we can see that the proposed scheme can perform better than conventional multichannel ALOHA and enjoy a tradeoff between the performance and complexity in terms of the number of RBs. [ABSTRACT FROM AUTHOR]

As Vehicular Ad hoc Network (VANET) features random topology and accommodates freely connected nodes, it is important that the cooperation among the nodes exists. This paper proposes a trust model called Implicit Web of Trust in VANET (IWOT-V) to reason out the trustworthiness of vehicles. Such that untrusted nodes can be identified and avoided when we make a decision regarding whom to follow or cooperate with. Furthermore, the performance of Cooperative Intelligent Transport System (C-ITS) applications improves. The idea of IWOT-V is mainly inspired by web page ranking algorithms such as PageRank. Although there does not exist explicit link structure in VANET because of random topology and dynamic connections, social trust relationship among vehicles exists and an implicit web of trust can be derived. To accomplish the derivation, two algorithms are presented, i.e., BayesTrust and VehicleRank. They are responsible for deriving the local and global trust relationships, respectively. The simulation results show that IWOT-V can accurately identify trusted and untrusted nodes if enough local trust information is collected. The performance of IWOT-V affected by five threat models is demonstrated, and the related discussions are also given. [ABSTRACT FROM AUTHOR]