Search

The problem of security and privacy in vehicular networks is a vital issue, and it attracts increasing attention to address the security vulnerability of vehicular networks. Authentication solutions are introduced for vehicular networks to ensure that network access is only given to authorized users. Among authentication solutions for vehicular networks, group signature not only offers authentication services, but also provides conditional privacy preservation. However, the current group signature approach for authentication in vehicular networks exhibits time-consuming signature verification and poor scalability. To overcome these shortcomings, we propose a flexible and efficient delay-aware authentication scheme (FEDAS) by utilizing edge computing paradigm. In the proposed architecture, we design the authentication group maintaining mechanism and develop the collaborative CRL management method. Moreover, we propose transition zone to solve the reliable authentication problem in border area of the group. To implement the proposed architecture, we propose a model for calculating the length of local CRL, which establishes the relationship between the size of a sub-area and the length of local CRL. And we also design a method for area division based on the length of local CRL, which provides division principle for our authentication scheme. We conduct extensive simulations to verify the effectiveness of our proposed scheme.

State-of-the-art mechanisms against eavesdropping first encrypt all packet payloads in the application layer and then split the packets into multiple network paths. However, versatile eavesdroppers could simultaneously intercept several paths to intercept all the packets, classify the packets into streams using transport fields, and analyze the streams by brute-force. In this article, we propose a programming protocol-independent packet processors (P4)-based network immune scheme (P4NIS) against the intractable eavesdropping. Specifically, P4NIS is equipped with three lines of defenses to provide a softwarized network immunity. Packets are successively processed by the third, second, and first line of defenses. The third line basically encrypts all packet payloads in the application layer using cryptographic mechanisms. Additionally, the second line re-encrypts all packet headers in the transport layer to distribute the packets from one stream into different streams, and disturbs eavesdroppers to classify the packets correctly. Besides, the second line adopts a programmable design for dynamically changing encryption algorithms. Complementally, the first line uses programmable forwarding policies which could split all the double-encrypted packets into different network paths disorderly. Using a paradigm of programmable data planes—P4, we implement P4NIS and evaluate its performances. Experimental results show that P4NIS can increase difficulties of eavesdropping and transmission throughput effectively compared with state-of-the-art mechanisms. Moreover, if P4NIS and state-of-the-art mechanisms have the same level of defending eavesdropping, P4NIS can decrease the encryption cost by 69.85%–81.24%.

Despite the emerging network technologies such as 5G, edge computing, and cloud computing growing vigorously, it is difficult for terrestrial networks to provide quality services for IoV and other daily communications at the same time. With the advancement of satellite communication technology, more and more people are paying attention to the integration of satellite networks and ground networks. In this article, we propose a space-ground integrated information network based Internet of Vehicles (SGIIN-IoV) architecture supporting multilink access, which provides a good example for the application of the SGIIN in the IoV. In SGIIN-IoV, high delay-tolerant data will be transmitted through satellite links, avoiding using ultra low-latency links. Afterward, we propose a multilayer resource awareness (MLRA) mechanism to achieve full-dimensional monitoring in SGIIN-IoV, which consists of an intravehicle service layer, a link detection layer, and a global monitor layer. Further, we design an adaptive multilink data transmission (AMDT) mechanism to improve utilization of heterogeneous links in SGIIN-IoV. Finally, we verify the two mechanisms, MLRA and AMDT, and the results show that the proposed design can provide higher reliability for data transmission in time.

Long identifier brings low packet forwarding efficiency in Internet of Things (IoT), whereas short identifier may suffer from the exhaustion of identifier space. Compared with fixed-length identifiers ( e.g. , IPv4 and IPv6), flexible identifiers are expected for balancing the packet processing efficiency with the various IoT scales. However, it is challenging to make IoT support the flexible identifier-based forwarding. In this letter, we firstly proposed a novel variable-length identifier (VLI) solution for interconnecting IoT networks. In particular, a VLI datagram header is designed to effectively support a flexible identifier field. Following a basic VLI header, one (multiple) extension header(s) can be added if require. Each extension header includes a fixed-size identifier field. According to the combination of multiple identifier fields, the variable-length identifier can be easily achieved, resolved and supported by the IoT nodes in a flexible way. Experimental results show that VLI can decrease the processing delay effectively.

Static assignment of IP addresses or identifiers can be exploited by an adversary to attack a network. However, existing dynamic IP address assignment approaches suffer from two limitations, namely: participation of terminals in the assignment and inadequate network server management. Thus, in this paper, we propose an Overall-transparent Dynamic Identifier-mapping Mechanism (ODIM) to manage the identifier of network nodes to defend against scanning and worm propagation in the Smart Identifier NETwork (SINET). We establish the selection and allocation constraints, and present selection and allocation algorithms to determine the constraints. The non-repetition probability and cover cycle allow us to evaluate the defense efficiency against scanning. We propose the probability for routing identifiers and derive the defense efficiency of ODIM against worm propagation. Simulation results and theoretical analysis show that the proposed method effectively reduces the detection probability of Routing IDentifiers (RIDs) and thus improves defense capabilities against worm propagation.

The existing satellite-terrestrial integrated networks (STINs) suffer from security and privacy concerns due to the limited resources, poor attack resistance and high privacy requirements of satellite networks. Network Intrusion Detection System (NIDS) is intended to provide a high level of protection for modern network environments, but how to implement distributed NIDS on STINs has not been widely discussed. At the same time, satellite networks have always lacked real and effective security data sets as references. To solve these problems, we propose a distributed NIDS using Federal Learning (FL) in STIN to properly allocate resources in each domain to analyze and block malicious traffic, especially distributed denial-of-service (DDoS) attacks. Specifically, we first design a typical STIN topology, on the basis of which we collect and design security data sets adapted to satellite and terrestrial networks in STIN, respectively. To address the problem of poor attack resistance of satellite networks, we propose a satellite network topology optimization algorithm to reduce the difficulty in tracing malicious packets due to frequent link switching. In order to solve the problem of limited resources and high privacy requirements of satellite networks, we propose an algorithm for FL adaptation to STIN, and build a distributed NIDS using FL in STIN. Finally, we deploy the designed distributed NIDS in a prototype system and evaluate our proposed distributed NIDS with a large number of simulations of randomly generated malicious traffic. Related results demonstrate that the performance of our approach is better than traditional deep learning and intrusion detection methods in terms of malicious traffic recognition rate, packet loss rate, and CPU utilization.

As the demand for real-time and high-quality social network services in mobile communications continues to grow, the performance defects of single-path transmission networks have become more and more prominent. At the same time, multipath transmission provides people with the possibility of stable and smooth communication in mobile wireless social networks. However, since it is usually difficult to obtain frequently varying delays along each path, packets always appear out of order during the communication of heterogeneous social networks, which will cause additional waiting delays in the receiving process. Therefore, it is still a very challenging task to construct a high-bandwidth and low-latency multipath transmission mechanism for social networks in mobile communications. According to the behavioral features of packets of social networks in mobile scenarios, a social network model BAH that reveals wireless social networks bottlenecks is established. Subsequently, this paper proposes a bottleneck-aware algorithm BFDE, which utilizes the one-way delay of periodically probing to derive the features of the wireless social networks bottleneck, so as to achieve an accurate estimation of the delay of each path. In the analysis and simulation, we compared it with the baseline EDPF and proved that the BFDE algorithm can achieve effective scheduling in complex and changeable mobile wireless social networks, thereby effectively increasing the multipath aggregation bandwidth, and has a strong robustness.

© 2019 Elsevier Ltd Stateful forwarding plane is fully considered as a novel forwarding paradigm, which is proven to be beneficial to delivery efficiency and resilient to certain types of attacks. However, this fresh attempt also introduces “varietal” Denial-of-Service attack due to complicated forwarding state operations, which may cause long-term memory exhaustion of forwarding nodes, especially for resource-limited IoT nodes. This new distributed exhaustion attack is extremely hidden and there is currently no effective defense against it. In this paper, we first establish a game model to analyze the attack benefit between attacker and defender. To further make the defender obtain more utility, it is significative to make the defender manage expired state-entries during stateful forwarding. To this end, we propose an enhanced distributed low-rate attack mitigating (eDLAM) mechanism. Particularly, eDLAM maintains a lightweight malicious request table (MRT), which is very small, to offload burden of practical forwarding state table. When a packet request is matched in MRT, it will be marked and dropped directly without any impact on forwarding state table. Based on this, eDLAM adopts an optimal threshold update method for MRT to achieve a maximum defender utility. We evaluate the eDLAM performance in terms of false negatives rate (FNR) and false positives rate (FPR). Extensive experimental results show that eDLAM can reduce FNR by 10.5% and FPR by 44% on average compared with state-of-the-art mechanisms.

As the demand of mobile services for high bandwidth grows, aggregation of various wireless network resources in hybrid communication system becomes a trend. Network coding has been widely studied to solve the packet reordering, low aggregation efficiency problems which are brought by network heterogeneity. Even if the determination of coding scale is the core issue of network coding, current research can not adapt to heterogeneous wireless channels, resulting in low bandwidth aggregation and decoding efficiency. Therefore, we propose a cross-layer network coding scheme called Delay Determined Group Size (DDGS) scheme, which adaptively adjusts the coding scale to solve the problem of overall performance degradation caused by heterogeneous characteristics of wireless channels. It can get the utmost out of the performance improvement brought by network coding, to better avoid packet reordering as well as reduce the receiving delay at the receiving end. The simulation results show that DDGS is significantly superior to network coding schemes in existing state-of-the-art solutions. This work was supported in part by the Fundamental Research Funds for the Central Universities under Grant 2020YJS019, in part by the National Natural Science Foundation of China (NSFC) under Grant 61872029, and in part by the Beijing Municipal Natural Science Foundation under Grant 4182048.

Due to improving computational capacity of supercomputers, transmitting encrypted packets via one single network path is vulnerable to brute-force attacks. The versatile attackers secretly eavesdrop all the packets, classify packets into different streams, performs an exhaustive search for the decryption key, and extract sensitive personal information from the streams. However, new Internet Protocol (IP) brings great opportunities and challenges for preventing eavesdropping attacks. In this paper, we propose a Programming Protocol-independent Packet Processors (P4) based Network Immune Scheme (P4NIS) against the eavesdropping attacks. Specifically, P4NIS is equipped with three lines of defense to improve the network immunity. The first line is promiscuous forwarding by splitting all the traffic packets in different network paths disorderly. Complementally, the second line encrypts transmission port fields of the packets using diverse encryption algorithms. The encryption could distribute traffic packets from one stream into different streams, and disturb eavesdroppers to classify them correctly. Besides, P4NIS inherits the advantages from the existing encryption-based countermeasures which is the third line of defense. Using a paradigm of programmable data planes—P4, we implement P4NIS and evaluate its performances. Experimental results show that P4NIS can increase difficulties of eavesdropping significantly, and increase transmission throughput by 31.7% compared with state-of-the-art mechanisms.

Vehicle-to-cloud is a network access model that aims to share computing resources for vehicles. In vehicle-to-cloud communication, reliable links are critical. Through multipath transmission, comprehensive utilization of heterogeneous wireless networks between the vehicle and the cloud server can effectively improve the reliability and efficiency of transmission. A large number of studies have pointed out that a receive butter can greatly improve the performance of multipath transmission in vehicle-to-cloud communication. However, most of these studies, which use receive buffers to improve multipath transmission performance, do not explicitly specify the design details of the receive butter. A classic design idea is to use a fixed length receive butter. However, this idea makes it difficult to determine the appropriate butter length in a complex vehicle-to-cloud communication scenario. This paper proposes a Dynamic Time-Threshold (DTT) receive buffer. The DTT receive buffer takes into account the instability of vehicular wireless networks, and dynamically adjusts the time-threshold so that the packets in the receive butter do not affect the overall communication performance due to premature departure or excessive waiting. We verified the performance of the DTT receive butter through a large number of simulations and real tests. By comparison, the performance of DTT receive butter is significantly better than the fixed length receive butter. This work was supported in part by NSFC under grant No. 61872029, the Beijing Municipal Natural Science Foundation 4182048, and the Fundamental Research Funds for the Central Universities (Grant no. 2018YJS010).

Information centric network (ICN) is becoming a prevailing design for future Internet to provide data objects to end customers. One crucial problem in ICN is to design routing and forwarding strategy so that traffic can be transmitted efficiently even with the dynamics of network link. In this paper, we consider content centric network (CCN), which is one of the promising candidate architecture design for ICN. Particularly, we consider the scalable CCN with name mapping system, which improves scalability by using router Identifier as name prefix to forward interests. We address the issue of improving link failure resiliency for CCN by designing a dynamic interest transmission approach. We propose the link failure resilient interest transmission algorithm (LFRIT) to enhance link failure resiliency by considering both network traffic and link status information. Additionally, we propose the advanced design of LFRIT (A-LFRIT), which calculates and updates the forwarding table centrally for link updates to further improve network robustness. Numerous simulations are conducted to evaluate the proposed approach under realistic network topologies with respect to packet loss, latency, and network link utilization. Simulation results demonstrate that the packet loss probability and data retrieval delay of A-LFRIT can reduce to 50% of the basic CCN and multi-repository single path approaches.

The current Internet architecture was designed on the basis of a triple bindings model, which could meet the needs of the early Internet. However, with the tremendous growth of the Internet and the continuous innovations of applications, the triple bindings (namely, control/data binding, resource/ location binding and user/network binding) have given rise to many problems for the Internet, such as scalability, mobility, and security. In order to solve these problems, many network techniques have been developed. Besides, novel future Internet architectures including Information-Centric Networks and Software-Defined Networks have emerged. However, these architectures only partially decouple the triple bindings. To completely separate the triple bindings, Smart Collaborative Identifier Networks (SINET) is proposed. There have been many research efforts on SINET, which built the foundation of SINET being a promising future Internet. In this paper, we comprehensively introduce SINET and these related research works. We start by introducing the motivation for SINET, explain its fundamental concepts and how it can make a difference. Next, we present in details the design principles of every layer in SINET, explaining how it can decouple the triple bindings and solve the problems of the current Internet. Finally, we discuss the state-of-the-art challenges in SINET. We investigate the ongoing research works and commercial products in SINET, with aspects such as scalability, mobility, security and reliability.

The prosperity of Internet of Things (IoT) and the success of rich Cloud services have expedited the emergence of a new computing paradigm called Fog computing, which promotes the processing of data at the proximity of their sources. Complementary to the Cloud, Fog promises to offer many appealing features, such as low latency, low cost, high multitenancy, high scalability, and to consolidate the IoT ecosystem. Although the Fog concept has been widely adopted in many areas, a comprehensive realization has yet been adequately researched. To address all these issues, in this paper, object virtualization is investigated to overcome obstacles resulting from resource constraints on sensory-level nodes while service virtualization is explored to easily create tailored applications for end users. Moreover, network function virtualization is studied to perform the flexibility of network service provisioning. Grounded on object virtualization, network function virtualization and service virtualization, a layered framework that encompasses smart objects, Fog and Cloud is presented to illustrate the realization of virtual Fog along IoT continuum. This proposed virtual Fog framework is applied to a smart living case for verification, then quantitative analysis is conducted to demonstrate the low latency, low operating expense, high multitenancy and scalability, followed by an experimental evaluation to further confirm that delay and jitter can be decreased through virtualization.

Information-centric networking (ICN), as a novel network paradigm, is expected to natively support mobility, multicast, and multihoming in vehicular ad hoc networks (VANETs). In this paper, the adoption of ICN principles for multimedia streaming in multihomed VANETs is investigated, with a major emphasis on the tradeoff between the quality of experience and energy efficiency (EnE). To formalize this problem, a cost optimization model is first proposed, based on queueing theory arguments. Then, a novel green information-centric multimedia streaming (GrIMS) framework is designed to drive the system toward optimal working points in practical settings. GrIMS consists of three enhanced mechanisms for on-demand cloud-based processing, adaptive multipath transmission, and cooperative in-network caching. Finally, a massive simulation campaign has been carried out, demonstrating that, thanks to its core components, the GrIMS enables flexible multimedia service provisioning and achieves an improved performance in terms of start-up delay, playbacks continuity, and EnE with respect to state-of-the-art solutions.

Network selection is of critical importance for heterogeneous vehicular networks. However, it still faces network congestion and reliability challenges in high-speed vehicular networks, which are caused by users’ selfishness and link failures, respectively. To address these challenges, we propose a scheme called enhanced congestion game with link failures (E-CGF) to achieve optimal network selection. In E-CGF, a hidden Markov model is utilized to formulate the link failure probability. Considering link failures, users can use more than one radio network simultaneously to improve throughput performance by redundant transmission, which leads to an increase of transit cost. Accordingly, the goal of E-CGF is to make a compromise between achieved throughput and transit cost. We first prove the existence of Nash equilibrium in E-CGF and construct an efficient algorithm to find the optimal strategy. We then evaluate the effect of different parameters on the utility based on numerical analysis. Finally, we carry out extensive experiments based on real-world traces of link states from high-speed rails and compare with three typical algorithms. The results demonstrate that E-CGF outperforms others by alleviating network congestion and improving transmission reliability with a moderate trade-off between achieved throughput and transit cost.

Vehicle-assisted data offloading is envisioned to significantly alleviate the problem of explosive growth of mobile data traffic. However, due to the high mobility of vehicles and the frequent disruption of communication links, it is very challenging to efficiently optimize collaborative offloading from a group of vehicles. In this paper, we leverage the concept of Software-Defined Networking (SDN) and propose a software-defined collaborative offloading (SDCO) solution for heterogeneous vehicular networks. In particular, SDCO can efficiently manage the offloading nodes and paths based on a centralized offloading controller. The offloading controller is equipped with two specific functions: the hybrid awareness path collaboration (HPC) and the graph-based source collaboration (GSC). HPC is in charge of selecting the suitable paths based on the round-trip time, packet loss rate, and path bandwidth, while GSC optimizes the offloading nodes according to the minimum vertex cover for effective offloading. Simulation results are provided to demonstrate that SDCO can achieve better offloading efficiency compared to the state-of-the-art solutions.

5G is increasingly becoming a prominent technology promoting the development of mobile networks. Meanwhile, the ever increasing demands for vehicular networks are driven by a variety of vehicular services and application scenarios. Therefore, a new architectural design, which can harness the benefits of 5G for vehicular networks, can take a solid step toward increasing bandwidth and improving reliability for vehicular communications. In this article, we focus on the innovations of a novel and practical 5G-enabled smart collaborative vehicular network (SCVN) architecture, based on our long-Term research and practice in this field. SCVN not only considers the various technical features of a 5G network, but also includes different mobile scenarios of vehicular networks. We have performed extensive experiments in various scenarios, including high-density vehicles moving at low or high speed across dense cells, to evaluate the performance of the proposed architecture. The real-world experimental results demonstrate that SCVN achieves better performance in throughput, reliability, and handover latency compared to its counterparts.

As satellite networks have played an indispensable role in many fields, how to integrate them with terrestrial networks (e.g., the Internet) has attracted significant attention in academia. However, it is challenging to efficiently build such an integrated network, since terrestrial networks are facing a number of serious problems, and since they do not provide good support for heterogeneous network convergence. In this article, we propose a flexible network architecture, HetNet, for efficient integration of heterogeneous satellite-terrestrial networks. Specifically, the HetNet synthesizes Locator/ID split and Information-Centric Networking to establish a general network architecture. In this way, it is able to achieve heterogeneous network convergence, routing scalability alleviation, mobility support, traffic engineering, and efficient content delivery. Moreover, the HetNet can further improve its network elasticity by using the techniques of Software-Defined Networking and Network Functions Virtualization. In addition, to evaluate the HetNet performance, we build a proof-of-concept prototype system and conduct extensive experiments. The results confirm the feasibility of the HetNet and its advantages.

Recently, Information-centric networking (ICN) has flourished research interest. One common and important feature of ICN is that has built-in caching capability, which means that every node can cache content along the content delivery path. To improve the transmission efficiency of content dissemination, we propose an efficient caching scheme for ICN, which is named as NCPP-based caching scheme. In our proposed caching scheme, we use the definition of node-content pass probability (NCPP), which taking both node utilization ratio and popularity of content into consideration, to decide whether the node needs to cache the content. In addition, the reasonable resource allocation can also improve the performance of ICN. Therefore, we propose a NUR-based resource allocation scheme, which uses the definition of node utilization radio (NUR). We compare the server hit ratio of random caching scheme and the proposed caching scheme by simulation. Our results show that our proposed scheme has smaller server hit ratio than random caching scheme. Furthermore, our proposed caching scheme depends on the number of requests.

As an important component of the intelligent transportation system, internet-of-vehicles technology has attracted considerable attention. The dissemination of event-driven emergency messages with high reliability and low delay is vital to ensure traffic safety and improve traffic efficiency in urban environment. In this study, the authors propose a reliable emergency message dissemination protocol taking into account the urban road characteristics and scalability requirements, which consists of a layout-aware ready-to-broadcast-emergency-message and clear-to-broadcast-emergency-message handshake mechanism and a redundant relay node adaptation mechanism. Finally, the simulation results confirm the feasibility and effectiveness of the proposed scheme.

The emerging future network designs such as Smart Identifier Network (SINET) and Information-Centric Networking (ICN) can provide efficient content delivery via its in-path caching. However, it is not an optimal way to cache contents at all intermediate routers for that current technology is not yet ready to support an Internet scale deployment. Most of the existing works select cache location based on the important of single node rather than that of entire cache group, which may result in inefficient problem caused by reduplicative impertinences. In this work, we study the intelligent cache location selection algorithm with an objective to maximize cache delivery performance while minimize the number of caching nodes. We first investigate the recent work in term of content location selection schemes, and formulate this problem as finding the prominent group with the highest Group Betweenness Centrality (GBC). We then propose a GBC-based in-path caching function group selection algorithm to select the caching nodes in SINET. We evaluate the performance of proposed algorithm through simulations and compare it with others. The final results show that GBC-based algorithm can provide better performance in term of average hop of content delivery. Using our finding, the network operators could deploy cache easily.

With the increasing number of vehicles connected to the Internet-of-Things (IoT), Internet-of-Vehicles (IoV) is becoming a hot research topic. It can improve traffic safety and efficiency and promote the development of the intelligent transportation that is a very important element in Smart Cities. As an important part of the safety application in IoV, the emergency message transmission is designed to inform all the vehicles in the relevant area timely of the accident information through the multi-hop broadcast communication. In this paper, we propose a hybrid emergency message transmission (HEMT), which introduces the SDN technology into the vehicular network environment and utilizes the flexibility of inter-vehicle communication. By deploying SDN-enabled central controller and RSU switches, we can obtain reliable and fast emergency message dissemination. Moreover, considering the space between the coverages of RSUs caused by the sparse deployment, we also use inter-vehicle multi-hop broadcast co...

Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking since it is able to reduce the network traffic, alleviate the server bottleneck and decrease the user access latency. However, the CCN default caching scheme results in a high caching redundancy, causing an urgent need for an efficient caching scheme. To address this issue, we propose a novel implicit cooperative caching scheme to efficiently reduce the caching redundancy and improve the cache resources utilization. The simulation results show that our design achieves a higher hit ratio and a shorter cache hit distance in comparison with the other typical caching schemes.

End-to-end transmission is an essential pattern in current Internet. It had brought obvious conveniences and potential hazard simultaneously. New network technology provides plenty of opportunities to avoid the harmful influences. After reviewing the identifier-based network, a candidate solution of future network, we proposed a smart collaborative connection management scheme for improving the dependability. Comparing with the conventional approaches, our scheme can protect the hosts via intermediate network equipments. During transmission process, the current usage pattern will not be influenced. Traditional unicast can be easily and smoothly enabled. The details of the scheme design are presented via four perspectives of connection identifier, i.e., communication mode, generation, distribution, and deployment. Then the supporting approaches of multipath transport, service migration, network mobility, P2P distribution, and application layer multicast are carefully investigated. The results of implementation and validation illustrate that the performances of new scheme are acceptable. We expect that this paper could provide a compatible and effective solution for both current and future Internet.

The Internet has achieved unprecedented success in human history. However, its original design has encountered many challenges in the past decades due to the significant changes of context and requirements. As a result, the design of future networks has received great attention from both academia and industry, and numerous novel architectures have sprung up in recent years. Among them, the locator/identifier (Loc/ID) split networking is widely discussed for its decoupling of the overloaded IP address semantics, which satisfies several urgent needs of the current Internet such as mobility, multi-homing, routing scalability, security, and heterogeneous network convergence. Hence, in this paper, we focus on Loc/ID split network architectures, and provide a related comprehensive survey on their principles, mechanisms, and characteristics. First, we illustrate the major serious problems of the Internet caused by the overloading of IP address semantics. Second, we classify the existing Loc/ID split network architectures based on their properties, abstract the general principle and framework for each classification, and demonstrate related representative architectures in detail. Finally, we summarize the fundamental features of the Loc/ID split networking, compare corresponding investigated architectures, and discuss several open issues and opportunities.

The in-network caching strategy in named data networking can not only reduce the unnecessary fetching of content from the original content server deep in the core network and improve the user response time, but also ease the traffic in the core network. However, challenges exist in in-network caching, such as the distributed locations of storage and relatively small cache space which limit the hit rate, and the cache management introduces further overhead. In this paper, we propose a two-layer hierarchical cluster-based caching solution to improve in-network caching efficiency. A network is grouped into several clusters, then, a cluster-head is nominated for each cluster to make caching decision. The clustering approach offers scalability and permits multiple aspects of inputs to be used for decision making. Our solution jointly considers the location and content popularity for caching. We implement our strategy in ndnSIM and test it on GEANT-based network and AS3967 network. Our simulation results show significant improvement over its peers.

Recently, the Internet of Things (IoT) is attracting significant attention from both academia and industry. To connect the huge amount of IoT devices effectively, software-defined networking (SDN) is considered as a promising way because of its centralized network management and programmable routing logic. However, due to the limited resources in both the data plane and the control plane, SDN is vulnerable to the new-flow attack, which can disable the SDN-based IoT by exhausting the switches or the controller. Therefore, in this paper, we propose a smart security mechanism (SSM) to defend against the new-flow attack. The SSM uses the standard southbound and northbound interfaces of SDN, and it includes a low-cost method that monitors the new-flow attack by reusing the asynchronous messages on the control link. The monitor method can differentiate the new-flow attack from the normal flow burst by checking the hit rate of the flow entries. Based on the monitoring result, the SSM uses a dynamic access control method to mitigate the new-flow attack by perceiving the behavior of the security middleware in the IoT. The dynamic access control method can intercept the attack flows at their access switch. Extensive simulations and testbed-based experiments are conducted and the corresponding results verify the feasibility of our claims.

With the development of modern high-speed vehicles and mobile communication systems, there is a strong demand for operators to provide stable and high-quality onboard Internet services. However, the vehicle-to-ground links may suffer from several problems, such as insufficient bandwidth and long round-trip time (RTT). Although multiple wireless networks, such as Wi-Fi, third-generation (3G), and fourth-generation (4G), may be available along a track, onboard users do not have good experiences if they can only visit the Internet via one wireless network, which may be subject to coverage gaps and signal attenuation. In this paper, the link qualities of multiple existing 3G and 4G technologies are first measured in a typical high-speed environment. These 3G/4G networks are candidates for vehicle-to-ground communication. Then, a concurrent multipath transmission scheme, together with a network adaptive scheduling algorithm, is proposed. The scheme is independent of the protocol stack; therefore, it is easy to deploy. It also provides transparent Internet services for users, without requiring the participation of the user devices in any multipath signaling. Meanwhile, the scheduling algorithm works at the network layer, instead of the transport layer, to meet the diverse transmission requirements of the connection-oriented and connectionless user applications. The algorithm can effectively aggregate the bandwidth of multiple available wireless links, as well as avoid the reordering of packets based on both the practical tracing databases and the active path monitoring. Analysis and experiments show that the proposed algorithm can provide better onboard Internet services with lower cache requirements than the Earliest Delivery Path First (EDPF) and Weighted Round Robin (WRR) scheduling algorithms, in terms of bandwidth improvement and packet disorder reduction.

Due to unpredictable noise and ambient interference along high-speed railways (HSRs), it is challenging to provide reliable Internet services in severe HSR network environments. Most existing research that requires expensive modifications for large-scale already in-used base stations cannot be immediately deployed into the existing HSR systems. In this paper, we propose a quite lightweight but effective solution to improve the Internet experience for HSR passengers. Different from other existing approaches, we employ a data-driven link state prediction (LSP) mechanism for HSR reliable transmission, called LSP4HSR, which directly operates in HSR's on-board routers. In particular, we conduct an extensive measurement of network status on several realistic HSR lines and collect a first-hand dataset in terms of round-trip time and packet loss rate. By analyzing this real dataset, we find that HSR link quality presents obvious two-time-scale variation characteristics. We execute a lot of in-depth studies to explore potential reasons for this interesting phenomenon. Furthermore, based on the two-time-scale Markov chain, we establish an accurate HSR link prediction approach, which brings an LSP-based transmission enhancement mechanism to alleviate the impact from poor link status along HSR lines. Extensive experiments verify that the proposed solution can not only improve the packet transmission reliability in HSR networks but can be also deployed in existing HSR systems quite smoothly and easily.

With the development of modern High-Speed Railway (HSR) and mobile communication systems, network operators have a strong demand to provide high-quality on-board Internet services for HSR passengers. Multi-path TCP (MPTCP) provides a potential solution to aggregate available network bandwidth, greatly overcoming throughout degradation and severe jitter using single transmission path during the high-speed train moving. However, the choose of MPTCP algorithms, i.e., Coupled or Uncoupled, has a great impact on the performance. In this paper, we investigate this interesting issue in the practical datasets along multiple HSR lines. Particularly, we collect the first-hand network datasets and analyze the characteristics and category of traffic flows. Based on this statistics, we measure and analyze the transmission performance for both mice flows and elephant ones with different MPTCP congestion control algorithms in HSR scenarios. The simulation results show that, by comparing with the coupled MPTCP algorithms, i.e., Fully Coupled and LIA, the uncoupled EWTCP algorithm provides more stable throughput and balances congestion window distribution, more suitable for the HSR scenario for elephant flows. This work provides significant reference for the development of on-board devices in HSR network systems.

In-network cache is a key service of content-centric networks. As an instance of content-centric networks, Named Data Networking (NDN) uses the traditional Least Recently Used (LRU) and Least Frequently Used (LFU) cache replacement strategy, which will cause large storage redundancy. Besides, as the content cache pollution attack may degrade the performance of the cache mechanisms and increase the content retrieval latency, a robust cache mechanism is especially required. To solve these problems, in this paper we propose a new intra-network cache replacement strategy, which integrates evaluating the popularity of caching contents and the betweenness of the nodes in the network topology. This strategy realizes the best performance of cache replacement in the network by weighing the importance of each node and the cache content popularity within the domain. Finally, the simulation results show that the new cache replacement strategy proposed in this paper can achieve a higher cache hit rate and less average hops than the LRU and the LFU cache replacement strategy in the NDN network.

Information-Centric Networking (ICN) provides great potential to promote the development of the Internet of Things (IoT) due to its multicast nature and mobility support. However, the stateful forwarding peculiarity introduces new varietal attacks named Interest Flooding Attacks (IFA), which is stealthy but destructive for the resource-limited IoT devices. In this paper, we propose a lightweight BLoom-filter based Attack Mitigating (BLAM) mechanism to reduce the detecting memory cost, while guaranteeing both the detecting accuracy and delay. Specifically, each IoT node employs a small Bloom filter to check attack behaviors instead of the traditional memory-consuming operations, i.e., recording malicious requests. Bloom filter values by hashing the published data names with a set of hash functions, are encapsulated and distributed via a new message named Ba-NACK. Based on this design, two specific schemes are further proposed for the attack detecting and Bloom filter updating. We formulate the memory cost minimum problem and theoretically analyze that BLAM can reduce the memory cost. We also implement BLAM in a realistic network testbed to evaluate its performance. The results show that BLAM reduces the memory cost by 78.6%, and reduces the delay from millisecond to microsecond with slight sacrifice of the accuracy by 0.4% compared with other state-of-the-art mechanisms.

With the emergence of vehicular Internet-of-Things (IoT) applications, it is a significant challenge for vehicular IoT systems to obtain higher throughput in vehicle-to-cloud multipath transmission. Network Coding (NC) has been recognized as a promising paradigm for improving vehicular wireless network throughput by reducing packet loss in transmission. However, existing researches on NC do not consider the influence of the rapid quality change of wireless links on NC schemes, which poses a great challenge to dynamically adjust the coding rate according to the variation of link quality in vehicle-to-cloud multipath transmission in order to avoid consuming unnecessary bandwidth resources and to increase network throughput. Therefore, we propose an Adaptive Network Coding (ANC) scheme brought by the novel integration of the Hidden Markov Model (HMM) into the NC scheme to efficiently adjust the coding rate according to the estimated packet loss rate (PLR). The ANC scheme conquers the rapid change of wireless link quality to obtain the utmost throughput and reduce the packet loss in transmission. In terms of the throughput performance, the simulations and real experiment results show that the ANC scheme outperforms state-of-the-art NC schemes for vehicular wireless multipath transmission in vehicular IoT systems. This work was supported in part by the Fundamental Research Funds for the Central Universities under Grant No.2019YJS015, in part by the National Natural Science Foundation of China (NSFC) under Grant 61872029, and in part by the Beijing Municipal Natural Science Foundation under Grant 4182048.

The current Internet has many inherent shortcomings, such as poor security, low mobility, and high energy consumption, which all seriously hinder its further development. This article first re-examines the original design of the Internet, and points out the so-called triple bindings, namely resource/location binding, user/network binding, and control/data binding, which are the root causes of the current Internet’s problems. A collaborative Internet architecture named SINET is proposed by removing the restrictions from the triple bindings completely. SINET contains three layers vertically and two domains horizontally. At each layer, there are two domains associated with a pair of xID and xBD. Multiple xAMs among these xIDs and xBDs are established to collaboratively adapt to various services requirements. Experimental tests have verified that SINET improves the performance in many ways and thus has great potential to flexibly satisfy emerging demands.

In networks with identifier/locator separation, packets from a source to a destination are generally tunneled from the source’s ingress tunnel router (ITR) to the destination’s egress tunnel router (ETR). In addition, the source’s ITR often caches the destination’s identifier-to-locator mapping for a certain duration, called cache timeout, in order to avoid frequently querying mapping servers. When the destination moves from an old ETR to a new one, its identifier-to-locator mapping changes accordingly, which makes the destination’s identifier-to-locator mapping cached at some ITRs outdated. While several approaches have been proposed to address this issue, they either cannot deal with all types of outdated mappings cached at the ITRs or face the triangular routing problem. Accordingly, in this paper, we propose a timer-based pointer forwarding (TBPF) approach that can deal with all types of outdated mappings and avoid the triangular routing problem. We present numerical results to compare TBPF with existing approaches and show that TBPF is a very promising solution for dealing with outdated mappings.

The growing popularity of multihoming mobile terminals has encouraged the use of concurrent multipath transfer (CMT) to provide network diversity and accelerated content distribution in ubiquitous and heterogeneous wireless network environments. However, CMT severely degrades its performance, which is mostly due to both data reordering required as a result of great path dissimilarity and frequent packet loss due to wireless channel unreliability. Most delivery approaches follow the packet sequence numbers and thereby result in strict in-order and packet-specific reception. Passively adapting to the network variations, those approaches are not general enough to address CMT problems. This paper proposes to apply network coding (NC) principles to CMT, to break the strong binding between data packets and their sequence numbers, and then improve its performance. The proposed CMT-NC solution avoids data reordering to mitigate buffer blocking and compensates for the lost packets to reduce the number of retransmissions. Its specific encoding approach reduces the encoding complexity and fully ensures decoding feasibility. Furthermore, the group-based transmission management enhances the robustness and reliability of the data transfer. Simulation results show how CMT-NC is a highly efficient data transport solution outperforming existing state-of-the-art solutions.

With the vigorous development of the Internet of Things and 5G technology, such as machine-to-machine and device-todevice, all kinds of data transmission including environmental monitoring and equipment control strengthens the key role of wireless sensor networks in the large-scale wireless communication system. However, especially in the complex industrial wireless applications, the low utilization efficiency of the limited wireless radio resource enhances the coexistence problem between heterogeneous networks. In this paper, from the severe mutual interference point of view, a mathematical model regarding cumulative interferences in the industrial wireless sensor networks is described. Then, from the perspective of mutual interference avoidance, an adaptive power control scheme is proposed in order to handle the normal communication needs on both the primary link and the secondary link. At last, nonlinear programming is taken to solve the corresponding optimization problem. Some typical analyses are given to verify the effectiveness of the proposed scheme on optimizing the tradeoff between the system throughput and energy consumption. Especially, the energy-efficiency of the novel scheme for Industrial Internet of Things is also analysed. Results show that the proposed power control is efficient. The throughput could be enhanced and the energy consumption could be reduced with the guarantee of mutual interference avoidance.

Recently there has been a new emerging trend in integrating Named Data Networking (NDN) and wireless sensor networks (WSNs) together to implement real data-centric Internet of Things (IoT). However, the main solutions in current literature lack energy efficient design to meet the severely limited energy resources in WSNs. In this paper, we propose a dual mode Interest forwarding scheme (called DMIF in short) for NDN-based WSNs. The DMIF consists of two combined forwarding modes, in which several energy efficient mechanisms including flexible mode shift, flooding scope control, broadcast storm avoidance, packet suppression, and energy weight factors are designed to save and balance the energy consumption. We extend the ndnSIM to support wireless multihop communication to validate the proposed scheme. Simulation experiments show that the DMIF outperforms the baseline schemes in terms of total energy consumption, energy equilibrium rate, and network lifetime.

The rapid development of HSR has brought great convenience to people, especially those on long-distance journeys. Existing communication technologies are quite limited in satisfying the challenging demands of HSR networks, providing poor quality of experience for HSR passengers (e.g., frequent link failures and long network delays). 5G mobile communications are expected to overcome these challenging issues in current HSR networks. In this article, we focus on the great innovations of a novel smart network architecture for 5G communications, and propose a specific SCN-R to promote efficient and reliable communications in HSR scenarios. Experiment results have verified that SCN-R provides an efficient solution to improve the usage of network resources and the quality of service with respect to the existing state-of-the-art solutions.

With the large-scale deployment of wireless access technologies and infrastructures, heterogeneous vehicular networks have been widely studied in recent years. However, it produces unstable link reconstruction due to frequent switch among heterogeneous access networks. Multipath TCP (MPTCP) becomes a promising means to maintain link connectivity by using multiple access interfaces. How to efficiently collaborate multiple links is still a challenge. In this article, we propose Hybrid-Aware Collaborative Multipath Communications for Heterogeneous Vehicular Networks, named HCMC-V. First, we accurately evaluate the weights of different paths by real-time sensing the propagation delay, the packet drop rate, and the bottleneck link capacity. Then, we present a hybrid-aware multipath collaboration mechanism which considers path weights in its decision making process. HCMC-V provides transparent and effective vehicular services through multiple available wireless technologies. Finally, extensive simulations show that HCMC-V significantly reduces transmission delay and improves packet transmission reliability.

© 2017 IEEE. Information-Centric Networking (ICN) introduces ubiquitous in-network caching to reduce network load and improve Quality of Service (QoS). This peculiarity requires high-speed caching technologies to support wire-speed and large-amount data forwarding, which brings new challenges to existing routers. To promote practical ICN deployment, many emerging researches focus on how to accelerate caching. In this paper, we propose a novel two-layer High-speed Caching scheme (HCaching), which leverages the characteristics of both SRAM and DRAM to accelerate caching for ICN routers. In particular, using DRAM as a primary cache and SRAM as a secondary one, HCaching is able to: (i) reduce excessive utilization of high-cost SRAM, (ii) speed up access of DRAM, (iii) and improve total network throughput. We implement and analyze HCaching performance by comparing with another two state-of-the-art solutions. The results show that HCaching achieves an improved throughput by 3-10 times faster than the compared solutions.

The growing availability of various wireless access technologies promotes increasing demand for mobile video applications. Stream control transmission protocol (SCTP)-based concurrent multipath transfer (CMT) improves the wireless video delivery performance with its parallel transmission and bandwidth (BW) aggregation features. However, the existing CMT solutions deployed at the transport layer only are not accurate enough due to lower layer uncertainties, such as variations of the wireless channel. In addition, CMT-based video transmission may use excessive BW in comparison with the popular Transmission Control Protocol (TCP)-based flows, which results in unfair sharing of network resources. This paper proposes a novel cross-layer fairness-driven (CL/FD) SCTP-based CMT solution (CMT-CL/FD) to improve video delivery performance, while remaining fair to the competing TCP flows. CMT-CL/FD utilizes a cross-layer approach to monitor and analyze path quality, which includes wireless channel measurements at the data-link layer and rate/BW estimations at the transport layer. Furthermore, an innovative window-based mechanism is applied for flow control to balance delivery fairness and efficiency. Finally, CMT-CL/FD intelligently distributes video data over different paths depending on their estimated quality to mitigate packet reordering and loss, under the constraint of TCP-friendly flow control. Simulation results show how CMT-CL/FD outperforms existing solutions in terms of both video delivery performance and TCP-friendliness.

There were two strategies for the data forwarding in the content-centric networking (CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment. This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base (FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing, reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.

Leveraging the development of mobile communication technologies and increased capabilities of mobile devices, mobile multimedia services have set new trends. To support high-quality Video-on-Demand (VoD) in mobile wireless networks, using virtual community-based approaches to balance the efficiency of content sharing and maintenance cost of performance-aware solutions has attracted increasing research interest. In this paper, we propose a novel Performance-aware Mobile Community-based VoD streaming solution over vehicular ad hoc networks (PMCV). PMCV relies on a newly designed mobile community detection scheme and an innovative community member management mechanism. The former employs a novel fuzzy ant-inspired clustering algorithm and an innovative mobility similarity estimation model to group together the mobile users with similar behavior in terms of playback and movement into mobile communities. The latter introduces the role and task of members, member join and leave, collaborative store and search for resources, and replacement of a broker member. Simulation-based testing shows how PMCV outperforms another state-of-the-art solution in terms of performance.

Information-Centric Networking (ICN) is a novel networking paradigm that attracts increasing research interests in recent years. In-network caching has been viewed as an attractive feature of ICN because it can reduce network traffic, alleviate server bottleneck, and reduce the user access latencies. Because of this, the network community has proposed many in-network caching mechanisms that aim at optimizing various performance metrics such as cache hit ratio and cache hit distance. In this survey, we present a comprehensive overview of the recently proposed in-network caching mechanisms for ICN. For each caching mechanism, we describe it in detail, present examples to illustrate how it works, and analyze its possible benefits and drawbacks. We also compare some typical in-network caching mechanisms through extensive simulations and discuss the remaining research challenges.

Proxy Mobile IPv6 (PMIPv6) is proposed as a promising network-based mobility management protocol, which does not need any participation of mobile nodes. PMIPv6 does not support the multicast well and most of the current research concentrates on the mobile multicast receiver. However, the mobile multicast sender is also very important and challenging, which has not been addressed well. Therefore, in this paper we propose two efficient PMIPv6 based mobile multicast sender support schemes which are PMIP bidirectional tunneling (PMIP-BT) and PMIP direct routing (PMIP-DR). In the PMIP-BT, the multicast traffic can be delivered through the PMIPv6 bidirectional tunnel, while, in the PMIP-DR, the multicast data can be transmitted via an optimized direct multicast routing. Both of them can support the multicast sender mobility transparently enabled in the PMIPv6 networks. We evaluate the performance of the proposed schemes by theoretical analysis, and the numerical results show that the proposed schemes have a better performance in terms of the signaling cost than the current schemes. Meanwhile, the proposed schemes are also implemented on the test bed, and the experimental results not only verify the validity and feasibility of our proposed schemes, but also conclude the different scenarios to which they are applicable.

Stream control transport protocol (SCTP)-based concurrent multipath transfer (CMT) can help multi-homed devices to increase their throughput by making use of parallel transmissions over multiple paths and bandwidth aggregation. However, if CMT cannot identify wireless error, it cannot really achieve the desired performance. Furthermore, if CMT only utilizes all available paths for data delivery, it will undoubtedly degrade application-level performance since the asymmetric paths may involve large quality differences. This paper proposes a novel cross-layer quality-of-service (QoS)-aware adaptive CMT (CMT-CQA) with the following aims: (i) to provide an adaptive ‘CMT-to-partial CMT’ adjustment strategy for efficient bandwidth aggregation by jointly considering transport layer QoS, MAC layer QoS, and path history information; (ii) to address an enhanced congestion window (cwnd) fast recovery mechanism to reduce bursty transmission in multi-homed wireless network environments where fail-over occurs frequently; and (iii) to introduce a proper multimedia transmission behavior to improve users' quality of experience (QoE) for multimedia streaming service. Simulation results show that CMT-CQA outperforms the existing CMT solutions in terms of performance and QoS. © 2014 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

With the prevalence of low-power wireless devices in industrial applications, concerns about timeliness and reliability are bound to continue despite the best efforts of researchers to design Industrial Wireless Sensor Networks (IWSNs) to improve the performance of monitoring and control systems. As mobile devices have a major role to play in industrial production, IWSNs should support mobility. However, research on mobile IWSNs and practical tests have been limited due to the complicated resource scheduling and rescheduling compared with traditional wireless sensor networks. This paper proposes an effective mechanism to guarantee the performance of handoff, including a mobility-aware scheme, temporary connection and quick registration. The main contribution of this paper is that the proposed mechanism is implemented not only in our testbed but in a real industrial environment. The results indicate that our mechanism not only improves the accuracy of handoff triggering, but also solves the problem of ping-pong effect during handoff. Compared with the WirelessHART standard and the RSSI-based approach, our mechanism facilitates real-time communication while being more reliable, which can help end-to-end packet delivery remain an average of 98.5% in the scenario of mobile IWSNs. Timeliness SMART (Smarta system och tjänster för ett effektivt och innovativt samhälle)

Due to the widespread research on Smart Identifier NETwork (SINET), its security has received much attention recently. But most of those attempts consider SINET security from the specific attack perspective. To the best of our knowledge, none so far has paid attention to the security analysis and modeling of separation mechanisms in SINET. Therefore, this paper provides a different approach to security analysis based on Petri net. Our objective is to analyze the separation mechanisms security via the combination of model and state. This method represents the network structure and state transferring by way of Petri net. In addition, it introduces the security analysis method of tokens to explore the potential threatens. Finally, we analyze SINET via the combination of the number, logic, and time series of tokens in Petri net, and present the results. Our results are very promising in using such models to achieve such security objectives.