Search

Massive numbers of nodes will be connected in future wireless networks. This brings great difficulty to collect a large amount of data. Instead of collecting the data individually, computation over multi-access channels (CoMAC) provides an intelligent solution by computing a desired function over the air based on the signal-superposition property of wireless channels. To improve the spectrum efficiency in conventional CoMAC, we propose the use of non-orthogonal multiple access (NOMA) for functions in CoMAC. The desired functions are decomposed into several sub-functions, and multiple sub-functions are selected to be superposed over each resource block (RB). The corresponding achievable rate is derived based on sub-function superposition, which prevents a vanishing computation rate for large numbers of nodes. We further study the limiting case when the number of nodes goes to infinity. An exact expression of the rate is derived that provides a lower bound on the computation rate. Compared with existing CoMAC, the NOMA-based CoMAC not only achieves a higher computation rate but also provides an improved non-vanishing rate. Furthermore, the diversity order of the computation rate is derived, which shows that the system performance is dominated by the node with the worst channel gain among these sub-functions in each RB. [ABSTRACT FROM AUTHOR]

An energy cooperation policy for energy harvesting wireless sensor networks (WSNs) with wireless power transfer is proposed in this paper to balance the energy at each sensor node and increase the total energy utilization ratio of the whole WSNs. Considering the unbalanced spatiotemporal properties of the harvested energy across the deployment terrain of the WSNs and the dynamic traffic load at each sensor node, the energy cooperation process among sensor nodes is decomposed into two steps: each sensor node locally calculates its optimal energy storage amount based on its traffic load; within the calculation of the optimal energy storage amount at each sensor node, sensor nodes with excess energy transmit a part of their energy to nodes with energy shortage through energy trading. Inventory theory and game theory are respectively applied to calculating the local optimal energy storage amount at each sensor node and the energy trading problem among multiple sensor nodes. Numerical results show that compared with the static energy cooperation method without energy trading, the Stackelberg Model based Game we design in this paper can significantly improve the trading volume of energy thereby increasing the utilization ratio of the harvested energy which is unevenly distributed in the WSNs. [ABSTRACT FROM AUTHOR]

In this paper, we propose an architecture of software-defined information-centric network virtualization with device-to-device (D2D) communications, which facilitates dynamic virtual resource allocation and content caching via a software-defined networking (SDN) controller with a global view of the system. In our proposed framework, substrate physical resources can be virtualized and shared among multiple mobile virtual network operators (MVNOs). Meanwhile, by means of integrating D2D communications into information-centric wireless networks, content caching is enabled not only in the air but in mobile devices as well. In addition, taking into consideration inaccurate channel estimation and measurement, we formulate the virtual resource allocation and caching optimization as a discrete stochastic optimization problem in which imperfect channel state information is incorporated. Because the formulated virtual resource allocation problem is a large-scale combinational optimization problem, we exploit discrete stochastic approximation approaches to cope with it. Finally, extensive simulations are conducted to demonstrate the effectiveness of the proposed scheme with different system parameters. Simulation results show that MVNOs can benefit from not only the sharing of physical infrastructure but from the caching functionality that exists in both the air and mobile devices as well. [ABSTRACT FROM PUBLISHER]

ABSTRACT In cooperative wireless networks, relay nodes are employed to improve the performance of the network in terms of throughput and reliability. However, the presence of malicious relay nodes in the network may severely degrade the performance of the system. When a relay node behaves maliciously, there exists a possibility that such a node refuses to cooperate when it is selected for cooperation or deliberately drops the received packets. Trust establishment is a mechanism to detect misbehaving nodes in a network. In this paper, we propose a trust establishment method for cooperative wireless networks by using Bayesian framework. In contrast with the previous schemes proposed in wireless networks, this approach takes the channel state information and the relay selection decisions into account to derive a pure trust value for each relay node. The proposed method can be applied to any cooperative system with a general relay selection policy whose decisions in each cooperative transmission are independent of the previous ones. Moreover, it does not impose additional communication overhead on the system as it uses the available information in relay selection procedure. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Cooperative relaying technology is considered as a promising solution for the high data-rate coverage required in future wireless communication systems, where provision of reliable multimedia or data services for transmission control protocol (TCP) applications is of extreme importance. However, while the performance of cooperative relaying protocols has been extensively studied over physical layer, little attention has been paid to the impact of selection relaying on TCP performance. The authors investigate the TCP throughput in cooperative relaying networks and take a cross-layer design approach when selecting a relay to optimise the TCP throughput. The authors use first-order finite-state Markov channel to model the wireless time-varying channels, and formulate the cross-layer TCP throughput optimisation problem as a restless bandit system, which is a powerful stochastic control modelling framework and can be solved using linear programming algorithm. Simulation results were presented to illustrate the effectiveness of the proposed scheme. It was shown that the TCP throughput is determined by physical layer channel state and link-layer frame size and retransmission time. [ABSTRACT FROM AUTHOR]

The special section presents a collection of high quality research papers on the state-of-the-art in the emerging technologies for connected vehicles, the latest development in standardizations and regulations, as well as the potential services and applications for connected vehicle (CV) and autonomous vehicle (AV) systems. [ABSTRACT FROM AUTHOR]