-Ting Yu

Interest propagation in named data manets

Named Data MANETs (NDM) is a recently emerging research area. The in-network chunk-based caching feature of NDN is beneficial in coping with the mobility and intermittent connectivity challenges in MANETs. In this paper, we conduct both simulation and emulation study of NDM forwarding designs: NDN Forwarding (NDNF), Listen-First, Broadcast-Later (LFBL), and the proposed Neighborhood-Aware Interest Forwarding (NAIF). NAIF aims for reducing the bandwidth usage induced by indiscriminate interest flooding in NDNF. It decreases the interest traffic by letting eligible relays work cooperatively, each forwards only a fraction of interest packets. The results show that NAIF achieves the best performance in multi-consumer scenarios. In particular, compared to NDNF, NAIF reduces bandwidth usage by up to 54%, shortens response time in low-mobility scenarios, and achieves high completion ratio.

Information-centric delay-tolerant mobile ad-hoc networks

Information-centric networks have recently been drawing increasing attention in academia as well as in industry. Information and content retrieval is a critical service for mobile ad-hoc networks. It relies on other resources and tools, such as internal storage, content searching and sharing, delay-tolerant delivery, etc. Previous studies have shown that social networking can assist delay-tolerant routing design in many respects. In this paper, we specifically address content retrieval in delay-tolerant mobile ad-hoc networks. We propose a social-tie based content retrieval scheme to support the delay-tolerant MANET. The social hierarchy is structured using balanced connectivity criteria and a K-mean clustering algorithm. The proposed scheme has been evaluated and validated on a real social network dataset.

Scalable VANET content routing using hierarchical bloom filters

In this paper, we discuss scalable content-oriented routing that enables storing, sharing and searching data totally within the VANET. We introduce a proactive content discovery scheme, Hierarchical Bloom-Filter Routing (HBFR), to tackle mobility, large population and rich content challenges of VANETs. HBFR is compared to the popular ICN reactive content discovery scheme in practical VANET scenarios. The results show that HBFR suits non-sharable data services, while reactive ICN inspired content discovery works well with popular sharable data. We suggest a hybrid approach that adaptively utilizes proactive and reactive schemes for time-sensitive data in ICN VANET.

Scalable opportunistic VANET Content Routing with encounter information

Recently, Information Centric Networking (ICN) has attracted much attention also for mobiles. Unlike host-based communication models, ICN promotes data names as the first-class citizen in the network. However, the current ICN name-based routing requires Interests be routed by name to the nearest replica, implying the Interests are flooded in VANET. This introduces large overhead and consequently degrades wireless network performance. In order to maintain the efficiency of ICN implementation in VANET, we propose an opportunistic geo-inspired content based routing method. Our method utilizes the last encounter information of each node to infer the locations of content holders. With this information, the Interests can be geo-routed instead of being flooded to reduce the congestion level of the entire network. The simulation results show that our proposed method reduces the scope of flooding to less than two hops and improves retrieval rate by 1.42 times over flooding-based methods.

Congestion-aware edge caching for adaptive video streaming in Information-Centric Networks

This paper proposes a network-aware resource management scheme that improves the quality of experience (QoE) for adaptive video streaming in CDNs and Information-Centric Networks (ICN) in general, and Dynamic Adaptive Streaming over HTTP (DASH) in particular. By utilizing the DASH manifest, the network (by way of a logically centralized controller) computes the available link resources and schedules the chunk dissemination to edge caches ahead of the end-users requests. Our approach is optimized for multi-rate DASH videos. We implemented our resource management scheme, and demonstrated that in the scenario when network conditions evolve quickly, our approach can maintain smooth high quality playback. We show on actual video server data and in our own simulation environment that a significant reduction in peak bandwidth of 20% can be achieved using our approach.

Content routing in the Vehicle Cloud

The advance of vehicle technology has brought to us the concept of Vehicle Cloud (VC). When Vehicle-to-Infrastructure (V2I) communications are unavailable, have failed or are too costly, Vehicle-to-Vehicle (V2V) communications fill the gap enabling VC services. In this paper, we discuss an important VC service, content-based routing, that allows future VC applications to store, share and search data totally within the Cloud. We review the critical issues of content discovery and forwarding in a content-based VC. Moreover, we introduce Bloom-Filter Routing (BFR), a proactive content discovery scheme for popular contents, to tackle the mobility and large content population challenges. BFR is compared to popular reactive content discovery schemes in practical VANET scenarios. The results show that proactive content discovery (i.e. BFR) suits non-sharable data, while reactive content discovery works well with popular sharable data. Consequently, we propose an adaptive hybrid approach that combines proactive and reactive strategies.

Network coding for content-based intermittently connected emergency networks

First responders at the edge of the network rely on situation awareness updates to arrive in a timely matter, even when the fixed infrastructure is unavailable. The technical advancements of the commercial mobile phones make them capable of supporting such requirements under very disruptive network conditions. In this demo, we present a network architecture that exploits partial caches by utilizing network coding to deliver large files (e.g. images) to first responders. The architecture is based on a content centric network platform called ICEMAN(Information CEntric Mobile Ad-hoc Networking) and runs on Android phones. We demonstrate our system in a file dissemination scenario in a CORE/EMANE network emulation. We measure file delivery ratio, latency, and network overhead and report significant improvements that network coding achieves over fragmentation.

CodeMP: Network coded multipath to support TCP in disruptive MANETs

TCP over Mobile Ad-hoc Networks (MANETs) is challenging due to frequent route breaks, high random errors, and DATA-ACK interference. Network coded multipath approaches have been shown in several previous studies to be an effective transmission paradigms in disruptive networks. However, most of the previous studies either have no adaptive redundancy control or rely on theoretical models that require knowledge at all relays of the entire network state. In this paper, we propose a network coded multipath scheme for conventional TCPCodeMP that adapts to frequent link changes in MANET and requires no explicit control messages. The scheme exploits multiple-path redundancy and maintains total transparency to transport layer protocols. The proposed coding scheme is based on three components: (1) random linear coding scheme with adjustable redundancy, (2) multipath routing, (3) ACK Piggy coding. Simulation results show that in a 3-hop static scenario, the proposed multipath scheme improves TCP flows goodput by 70% compared to our previous single-path scheme. In an extreme MANET scenario where two TCP sessions co-exists and nodes are moving as fast as 25 m/s with up to 40% packet error rate (an environment in which regular TCP collapses completely), CodeMP achieves at least 700Kbps aggregate TCP goodput, with a Jains fairness index of 0.99.

Social network based security scheme in mobile information-centric network

With the spread of mobile Internet, users have increased opportunities to retrieve content from the content producer via the application in mobile information-centric network. For security consideration, the content data must be encrypted and the content producer must be authenticated. Content data is signed by the producer and delivered to the requester via the public-key cryptography. A Certificate Authority (CA) generally verifies the binding between public-key and the producer identity. However, CA verification is not suitable in a mobile information-centric network where connection to a CA cannot be guaranteed. In this paper, we propose a social network based security scheme to verify the public-key and producer identity binding. The proposed scheme is evaluated on an artificial social network model first and is then validated on a real social network data.

RobustGeo: A Disruption-Tolerant Geo-Routing Protocol

While geo-routing is a promising routing algorithm in urban vehicular ad-hoc networks (VANETs), there is still much work to be done for it to become truly usable for such environments. One of the biggest obstacles to this goal is the intermittent nature of VANETs due to mobility. Traditional geo-routing algorithms do not perform well in these conditions because they drop packets whenever they cannot find an immediate forwarder for the packet. In this paper, we propose RobustGeo, a routing protocol that combines the simplicity and efficiency of the greedy forwarding technique in geo-routing algorithms, with the robustness of delay tolerant networks in the face of disruptions in network connectivity. When there exists a good connection between the source and destination, RobustGeo can route the packet like the traditional geo-routing algorithms, and when the network faces disruptions, RobustGeo relies upon vehicle mobility and packet replication to explore multiple georoute paths and quickly recover the packet back to greedy forwarding. We show that for a highly intermittent scenario, RobustGeo has a delivery ratio of over 20% (compared to a pure geo-routing protocols delivery ratio of 0), and it reduces delay by over 40% as compared to a more pure delay-tolerant routing solution.