Jianfeng Guan

CMT-QA: Quality-Aware Adaptive Concurrent Multipath Data Transfer in Heterogeneous Wireless Networks

Mobile devices equipped with multiple network interfaces can increase their throughput by making use of parallel transmissions over multiple paths and bandwidth aggregation, enabled by the stream control transport protocol (SCTP). However, the different bandwidth and delay of the multiple paths will determine data to be received out of order and in the absence of related mechanisms to correct this, serious application-level performance degradations will occur. This paper proposes a novel quality-aware adaptive concurrent multipath transfer solution (CMT-QA) that utilizes SCTP for FTP-like data transmission and real-time video delivery in wireless heterogeneous networks. CMT-QA monitors and analyses regularly each paths data handling capability and makes data delivery adaptation decisions to select the qualified paths for concurrent data transfer. CMT-QA includes a series of mechanisms to distribute data chunks over multiple paths intelligently and control the data traffic rate of each path independently. CMT-QAs goal is to mitigate the out-of-order data reception by reducing the reordering delay and unnecessary fast retransmissions. CMT-QA can effectively differentiate between different types of packet loss to avoid unreasonable congestion window adjustments for retransmissions. Simulations show how CMT-QA outperforms existing solutions in terms of performance and quality of service.

TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in Content-Centric Networking

Content-Centric Networking (CCN) is an entirely novel networking paradigm, in which packet forwarding relies upon lookup operations on content names directly instead of fixed-length host addresses. The unique features of CCN names, i.e., variable length, huge cardinality, and hierarchical structure, introduce new challenges that could hinder the deployment of such a new architecture at the Internet scale. In this paper, we make an in-depth study of characteristics of large-scale CCN names, and propose a simple yet efficient CCN-customized name lookup engine (named by TB2F), which capitalizes the strengths of Tree-Bitmap (TB) and Bloom-Filter (BF) mechanisms, while counteracts their main limitations. To this end, TB2F splits CCN prefix into a constant size T-segment and a variable length B-segment with a relative short length, which are treated using TB and BF, respectively. Furthermore, an optimal length of the T-segment is found to improve the lookup efficiency. Experimental comparisons with respect to the reference Name Prefix-Trie and Bloom-Hash have been also carried out. The results show that TB2 F properly configured has good scalability and efficiency by (i) speeding up lookup operations and reducing the false positive rate with respect to Bloom-Hash; (ii) requiring less memory than Name Prefix-Trie; (iii) achieving a low overhead in updating operations in the large scale case.

Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking

In Named Data Networking (NDN), packet forwarding decisions rely upon lookup operations on variable-length hierarchical names instead of fixed-length host addresses. This pivotal feature introduces new challenges in the deployment of NDN at the Internet scale. In this letter, a novel Name Lookup engine with Adaptive Prefix Bloom filter (NLAPB) is conceived, in which each NDN name/prefix is split into B-prefix followed by T-suffix. B-prefix is matched by Bloom filters whereas T-suffix is processed by the small-scale trie. The length of B-prefixes (and T-suffixes) is dynamically throttled based on their popularity in order to accelerate the lookup. Experimental results show that: (i) NLAPB is able to lower the false positive rate with respect to a lookup entirely based on Bloom filters; (ii) it decreases the memory requirements with respect to a trie-based approach; (iii) it reduces processing time with respect to both them.

Implementation and analysis of proxy MIPv6

Mobile IPv6 (MIPv6) is a host-based mobility support specification which has been approved by the IETF as the standardized solution of global mobility management in IPv6 network for Mobile Node (MN). However, MIPv6 handover procedure results in a large handover delay. To improve its performance, some MIPv6 variants such as Fast Handover for MIPv6 (FMIPv6) and Hierarchical MIPv6 (HMIPv6) were proposed. However, they all require the MN to support the mobility management protocols which increase the difficulty of management and deployment. Recently, IETF NETLMM workgroup published the Proxy Mobile IPv6 (PMIPv6) which is a network-based localized mobility management to provide the mobility support for mobile host without the involvement of the mobility signaling. In this paper, we analyze the singling cost of PMIPv6 and implement it in our test-bed to evaluate its performance. The results show that the PMIPv6 has lower signaling cost and packet delivery cost, and it can improve the handover performance of UDP and TCP than the other mobility management protocols under low-delay networks, as for the wide area networks, it needs to introduce some mechanism like fast handover to further improve its performance. Copyright

A Novel Cooperative Content Fetching-Based Strategy to Increase the Quality of Video Delivery to Mobile Users in Wireless Networks

Cooperatively fetching video content with the help of other mobile nodes can release some of the pressure on storage and bandwidth of the constrained mobile devices in wireless networks and speeds up the localization process of video resources so as to support better quality of viewing experience. In this context, the discovery of the appropriate mobile cooperative node becomes a key factor and is also a challenge for the deployment of such a fetching scheme. In this paper, we introduce a novel cooperative content fetching-based strategy to increase the quality of video delivery to mobile users in wireless networks (CCF). By intelligently monitoring the real-time variation in the state of the one-hop neighbors (immediate-neighbors) of the video resource downloader, CCF employs an innovative estimation model to measure the stability of these immediate-neighbors. In order to enhance the cooperative fetching efficiency, CCF designs a communication quality forecast model to measure link reliability and forecast the available bandwidth. By making use of a newly proposed cooperative fetching algorithm, CCF can speed up fetching and disseminating of video resources with the help of cooperative neighbors selected in terms of stability and communication quality. Simulation results show how CCF obtains higher selection accuracy of cooperative neighbors, lower average end-to-end delay, lower average packet loss ratio, higher average throughput, higher video quality, and lower maintenance overhead in comparison with state-of-the-art solutions.

Environment-Aware CMT for Efficient Video Delivery in Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) have gained significant attention with capabilities of retrieving video and audio streams, still images, and scalar sensor data but with challenge of high data loss. As more and more wireless devices are equipped with multiple network interfaces, multimedia delivery over multipath has been cognized as a more promising approach in wireless transmission. In this paper, based on the Concurrent Multipath Transfer (CMT) extension for Stream Control Transport Protocol (SCTP), we propose a novel environment-aware CMT (e-CMT) to overcome the high data loss challenge, as well as “a hot potato” congestion problem in wireless transmission. The e-CMT provides environment-aware cognitive ability for efficient video delivery with three modules, which are Path Quality-aware Model (PQM) that devotes to estimate path quality and select candidate path using for retransmission, Adaptive Retransmission Trigger (ART) that contributes to cognize packet loss and trigger efficient retransmission behaviors, and Congestion-avoid Data Distributor (CDD) that serves to enable Partial-Reliable retransmission to mitigate congestion condition. We design a close realistic topology to present how the e-CMT outperforms the original CMT for efficient video delivery over multihomed WMSNs.

A Novel Physarum-Inspired Routing Protocol for Wireless Sensor Networks

There is a tradeoff between routing efficiency and energy equilibrium for sensor nodes in wireless sensor networks (WSNs). Inspired by the large and single-celled amoeboid organism, slime mold Physarum polycephalum, this paper presents a novel Physarum-inspired routing protocol (P-iRP) for WSNs to address the above issue. In P-iRP, a sensor node can choose the proper next hop by using a proposed Physarum-inspired selecting next hop model (P-iSNH), which comprehensively considers the distance, energy residue, and location of the next hop. As a result, the P-iRP can get a rather low algorithm complexity of O ( n ) , which greatly reduces the processing delay and saves the energy of sensors. Moreover, by theoretical analysis, the P-iSNH always has an equilibrium solution for multiple next hop candidates, which is vital factor to the stability of routing protocol. Finally, simulation results show that P-iRP can perform better in many scenarios and achieve the effective tradeoff between routing efficiency and energy equilibrium compared to other famous algorithms.

CMT-CC: Cross-Layer Cognitive CMT for Efficient Multimedia Distribution over Multi-homed Wireless Networks

This paper proposes CMT-CC, a novel cross-layer cognitive concurrent multipath transfer (CMT) solution necessitating the following aims: (i) cross-layer design, (ii) fairness to TCP-like flows, and (iii) improve users’ quality of experience for multimedia streaming service. To satisfy above requirements, a newly cross-layer network condition sensor is designed in CMT-CC in order to cognize network condition and distinguishes the causes of network condition change. An intelligent multimedia content distributor is further introduced in CMT-CC for enabling adaptive multimedia distribution behavior appropriate for the varying wireless network condition. To make CMT-CC preserve fairness to TCP flows on congested links, a weighted moving congestion window based TCP-friendly congestion control mechanism is developed in CMT-CC. The results gained by a close realistic simulation topology show how the proposed CMT-CC solution significantly improves throughput, as well as multimedia delivery performance while still remaining fair to TCP-like flows.

Social cooperation for information-centric multimedia streaming in highway VANETs

High-quality multimedia streaming services in Vehicular Ad-hoc Networks (VANETs) are severely hindered by intermittent host connectivity issues. The Information Centric Networking (ICN) paradigm could help solving this issue thanks to its new networking primitives driven by content names rather than host addresses. This unique feature, in fact, enables native support to mobility, in-network caching, nomadic networking, multicast, and efficient content dissemination. In this paper, we focus on exploring the potential social cooperation among vehicles in highways. An ICN-based COoperative Caching solution, namely ICoC, is proposed to improve the quality of experience (QoE) of multimedia streaming services. In particular, ICoC leverages two novel social cooperation schemes, namely partner-assisted and courier-assisted, to enhance information-centric caching. To validate its effectiveness, extensive ns-3 simulations have been executed, showing that ICoC achieves a considerable improvement in terms of start-up delay and playback freezing with respect to a state-of-the-art solution based on probabilistic caching.

Implementation and analysis of network-based mobility management protocol in WLAN environments

Mobile IPv6 (MIPv6) has been approved by the IETF as the standardized solution for mobility management in IPv6 network. MIPv6 is a host-based mobility support specification, and it can provide the global mobility support for mobile terminal. However, MIPv6 handover procedure results in a long handover delay. To improve the handover performance, some MIPv6 variants such as Fast Handover for MIPv6 (FMIPv6) and Hierarchical MIPv6 (HMIPv6) were proposed. However, they all require the mobile terminal to support the mobility management protocols. Recently, the Proxy Mobile IPv6 (PMIPv6) was proposed in IETF NETLMM workgroup, which is a network-based localized mobility management and it can provide the mobility support for mobile node without an involvement in the mobility signaling. The previous work about the performance evaluation of PMIPv6 is mainly based on the analysis and lacks of evaluation in a real system. So, in this paper, we study the PMIPv6 and implement it in the WLAN environments. We set up a test-bed to evaluate its performance and compare it with the other mobility specifications including the MIPv6, FMIPv6 and HMIPv6. The results show that the PMIPv6 can improve the handover performance under low-delay networks, as for the wide are networks, it needs to introduce some mechanism like fast handover needs to further improve its performance.