Search

This paper focuses on the QoS-aware secure routing design based on the physical layer security technology for a multi-hop wireless network consisting of legitimate nodes, malicious eavesdroppers, and selfish jammers. We first provide theoretical modeling for a given route to reveal how its end-to-end security/QoS performance is related to the transmitting power of legitimate nodes along the route and the jamming power of jammers in the network. We then design an incentive mechanism that stimulates jammers to generate artificial jamming for security enhancement, and also develop a non-cooperative game framework to resolve the jamming power setting issue here. Based on the security/QoS performance modeling of the route and jamming power setting, we further propose a theoretical framework to determine the optimal transmitting power of nodes along the route such that its optimal transmission security can be achieved under a QoS constraint. Finally, with the help of the power setting results of the given route, we formulate a shortest weighted path-finding problem to identify the optimal route for data delivery in the network, which can be solved by employing the Bellman-Ford or Dijkstra’s algorithm. It is demonstrated that the proposed routing scheme is individually rational, stable, distributed and computationally efficient. [ABSTRACT FROM AUTHOR]

Video streaming over vehicular networks has considerable benefits for both road safety and entertainment. In this paper, the scalable video coding over cooperative vehicular networks is investigated to improve the performance of video streaming services. We formulate a joint optimization problem to answer questions about the number of video layers that should be transmitted for each vehicle, the selection of relay vehicles to assist destination vehicles, and the assignment of radio resources to direct and cooperative communications. We decouple the problem into two subproblems, i.e., the quality of service (QoS)-driven resource allocation (QoSRA) subproblem and the layer selection (LS) subproblem. We solve the QoSRA subproblem by converting it into a generalized maximum concurrent flow problem, and propose a tabu search-based metaheuristic algorithm for the LS subproblem. The simulation results verify the efficiency of the proposed scheme and provide some insight into the tradeoff between system performance and computation complexity. [ABSTRACT FROM AUTHOR]

Characterizing a virtual network function performance is one of the most challenging issues in softwarized network function deployment due to different configurations leading to a different performance. Since there has been no clear solution on how to configure a software router that provides the minimum average packet latency, we address this problem by proposing a configuration framework for a software router. First, we advance the performance characterization of a software router by conducting a packet latency prediction model based on the Erlang- $k$ distribution. Motivated by the analysis of the packet latency distribution, the Erlang- $k$ distribution is chosen as a basis of the packet latency prediction model. Our prediction model requires the measurement of only two different configurations, i.e., one and two receiving queues of a network interface card, to predict the average packet latency of all configurations. We cross-verify the accuracy of our prediction model with the measured data. Second, we adopt our prediction model in the configuration selection (CS) algorithm for searching which configuration yields the minimum of average packet latency. The validity of the prediction-based CS algorithm is confirmed by comparing to the measurement-based one. Finally, we present the CS-based measurement system interworking with network function virtualization-management and orchestration for advances in network management. [ABSTRACT FROM AUTHOR]

This paper investigates the secure communication issue for both static and dynamic cognitive radio networks (CRNs), where multiple nonaltruistic primary users (PUs), secondary users (SUs), and eavesdroppers exist. The design objective is to provide secure communications for PUs and, meanwhile, to ease the starvation of transmission opportunities for SUs. To achieve this goal, we propose a barter-like trading model to incentivize the cooperation among nonaltruistic users. Specifically, PUs leverage the assistance of SUs in the form of cooperative relaying or friendly jamming and, in return, yield certain licensed spectrum accessing time to the aided SUs. We propose a truthful nonmonetary double auction framework (FONDA) toward secure communications for static CRN where PUs and SUs interact in a single round. Then, we extend our framework to d-FONDA for dynamic CRN, where SUs who have patience (tolerant of traffic delay) arrive and leave the network dynamically. We prove that both FONDA and d-FONDA preserve nice economic properties, including truthfulness, individual rationality, and budget balance. Simulation results reveal that the proposed frameworks provide substantial performance gains compared with the baseline scheme and suffer acceptable performance degradation over ideal schemes. [ABSTRACT FROM PUBLISHER]

This paper investigates the secure communication issue for cognitive radio networks with nonaltruistic users. The design objective is to improve the secrecy rate of the primary user (PU) and, at the same time, create transmission opportunities for the secondary users (SUs) to satisfy their diversified quality-of-service (QoS) demands. To achieve this goal, we propose a novel nonmonetary trading model, where the users are incentivized to participate in the market by a barter-like resource-to-resource exchange. Specifically, the PU leverages the assistance of the SU in the form of cooperative forwarding or friendly jamming and yields part of the spectrum accessing time to the aided SU. The proposed spectrum auction framework jointly formulates the optimal cooperator selection and the corresponding resource allocation problems by taking into consideration the QoS demands of individual users. The proposed framework ensures that bidding truthfully is the dominant strategy for all bidders and, thus, is invulnerable to market manipulation and eliminates the overhead of strategizing over other bidders. Simulation results reveal that the proposed framework could provide substantial gains for both the PU and the aided SU. [ABSTRACT FROM AUTHOR]

This paper studies how to efficiently apply device-to-device (D2D) communications underlaying a cellular system to support vehicle-to-vehicle (V2V) connection (termed D2D-V). By considering the geographic features of the D2D-V system, we propose a D2D-V grouping, reuse channel selection (RS), and power control (PC) framework to achieve the optimal performance of the D2D-V system, in terms of either maximized sum rate or maximized minimally achievable rate. First, in a full channel state information (CSI) scenario, we apply difference of two convex functions (D.C.) programming to obtain the optimal PC. However, because the CSI between some terminals is hard to obtain and some interference can be appropriately inhibited by taking advantage of the vehicles' geographic features, we make a series of simplifications to the PC problem to reduce the requirement of full CSI, the dependence of centralized control, and the computational complexity. The suitable conditions of each simplification are elaborated. Each step of our simplifications are shown as a certain tradeoff between performance and complexity. Furthermore, we provide an investigation into the service quality that one vehicle can achieve when it passes through the covered segment of the highway and propose the location–service curve to portray this. We use numerical simulations to verify the accuracy and feasibility of each step of our suboptimal PC and specific features embedded in the location–service curve. [ABSTRACT FROM PUBLISHER]

With a formulated game of non-cooperative internet service providers (ISPs), this paper proposes a new framework for apportioning ISP's responsibility in an end-to-end quality of service (QoS) request. The strategy is based on Path-Classification scheme under Nash equilibrium (PC-Nash), which is obtained by classifying paths according to the quantized QoS level. Optimal QoS-level selection of individual ISP is then captured by the Nash equilibrium. To facilitate the game solution searching, a loss network model is derived for the call acceptance probabilities and the expected utility values. Solutions provided by PC-Nash are compared with three conventional policies, i.e. most-effort (ME), least-effort (LE) and equal-distribution (ED). The reported results show the conformity of call acceptance probabilities between mathematical analysis and discrete-event simulations. Furthermore, with the utility functions of practical service models, ME and LE are found to provide comparable utilities to PC-Nash with respect to peer and retail/wholesale service models, respectively, for a network with the same path quality. However, for networks with different path qualities, PC-Nash outperforms all the conventional policies significantly. From this evidence, PC-Nash is thus expected to be useful in QoS provisioning of practical inter-domain networks. [ABSTRACT FROM AUTHOR]

The vehicular Internet of Things (IoT) comprises enabling technologies for a large number of important applications including collaborative autonomous driving and advanced transportation systems. Due to the mobility of vehicles, strict application requirements, and limited communication resources, the conventional centralized control fails to provide sufficient quality of service for connected vehicles, so a decentralized approach is required in the vicinity to satisfy the requirements of delay-sensitive and mission-critical applications. A decentralized system is also more resistant to the single point of failure problem and malicious attacks. Blockchain technology has been attracting great interest due to its capability of achieving a decentralized, transparent, and tamper-resistant system. There are many studies focusing on the use of blockchain in managing data and transactions in vehicular environments. However, the application of blockchain in vehicular environments also faces some technical challenges. In this paper, we first explain the fundamentals of blockchain and vehicular IoT. Then, we conduct a literature review on the existing research efforts of the blockchain for vehicular IoT by discussing the research problems and technical issues. After that, we point out some future research issues considering the characteristics of both blockchain and vehicular IoT. [ABSTRACT FROM AUTHOR]

Abstract: By making the best use of limited bandwidth, quality of service (QoS) provisioning over internet is essential for satisfying various types of internet-application requirements. The traffic classification and scheduling are the key functions to provide various kinds of class of service (CoS) under an overload condition. This paper investigates QoS performance in a network equipment testbed when implementing these main functions. We examine the major CoS functions provided by the Juniper T320 router, and measure their performance. In addition to fundamental analysis of the QoS behavior, we show the impact of QoS operations on a parallel system distributed in multi-domain networks as a practical case study of grid environments. [Copyright &y& Elsevier]