In this paper, a joint reducing energy consumption and improving quality of service scheme for the migration of virtual network resources is proposed. This migration algorithm reflects the state of the virtual network...
详细信息
Dense heterogeneous networks are deployed for future wireless communication to meet the explosively increasing traffic demand. However, the network densification leads to a great amount of energy consumption especiall...
详细信息
The performance of large-scale cognitive radio (CR) networks with secondary users self-sustained by opportunistically harvesting radio-frequency (RF) energy from nearby primary transmissions is investigated. Using an ...
详细信息
One important feature of Content-centric networking (CCN) is to utilize built-in network caches to improve the transmission efficiency of content dissemination. In CCN, all nodes have the function of caching contents....
In this paper, the measurements of 2 × 2 MIMO channel were performed at 2.6 GHz with 20 MHz bandwidth along the Harbin-Dalian passenger dedicated railway line. To improve the accuracy of multipath searching, we p...
详细信息
The main characteristic of the wireless medium is its broadcast nature, i.e., a unicast packet (destined for one specific node) is actually a one-hop broadcast packet to neighbors. However, the traditional routing tra...
详细信息
Content-centric networking (CCN) is a new Internet architecture, relies on in-network caching to achieve an efficient and reliable content distribution. However, the existing forwarding strategy cannot fully sense the...
详细信息
Compute-and-Forward (C&F) has been proved to be an efficient approach for multiuser, multihop wireless networks. It allows intermediate relays to infer and forward linear combinations of the transmitted messages, ...
详细信息
ISBN:
(纸本)9781509016990
Compute-and-Forward (C&F) has been proved to be an efficient approach for multiuser, multihop wireless networks. It allows intermediate relays to infer and forward linear combinations of the transmitted messages, in order to achieve high computation rate. The coefficient selection for each relay is a shortest vector problem (SVP). The most common solutions for such a problem are exhaustive search and the Lenstra-LenstraLovsz (LLL) lattice reduction. The former has a high complexity and the latter proves to be suboptimal for large numbers of users. In this paper, we propose two novel algorithms, of which one can be regarded as a simplified version of the exhaustive search, while the other one selects the coefficients iteratively. Numerical results reveal that both methods achieve the same computation rate as the exhaustive search with much lower complexity. Both outperform the LLL algorithm (especially with a large number of users), and the complexities are lower than the LLL except in the very high SNR region.
While the real-time processing applications are ubiquitous, which lead to the sprout of many distributed real-time stream processing systems. In this paper, we design a high-performance streamed-oriented big data proc...
详细信息
ISBN:
(纸本)9781509007691
While the real-time processing applications are ubiquitous, which lead to the sprout of many distributed real-time stream processing systems. In this paper, we design a high-performance streamed-oriented big data processing system, including a messaging queue on Kafka and a Spark Streaming-based processing engine, and we evaluate the effectiveness of our system through a real-time traffic statistics application. Then we focus on the relationship between the parameters of Kafka and Spark Streaming and the performance of our system. In the last, we discuss the scalability of the optimized system of Kafka and Spark Streaming.
Hypertext transfer protocol (HTTP) video streaming is a growing and increasingly important data traffic type in wireless and mobile networks. Experiments have shown that the quality of experience (QoE) of this service...
详细信息
暂无评论