Routing in Mobile Ad-Hoc Networks using Social Tie Strengths and Mobility Plans

We consider the problem of routing in a mobile ad-hoc network (MANET) for which the planned mobilities of the nodes are partially known a priori and the nodes travel in groups. This situation arises commonly in military and emergency response scenarios. Optimal routes are computed using the most reliable path principle in which the negative logarithm of a node pair's adjacency probability is used as a link weight metric. This probability is estimated using the mobility plan as well as dynamic information captured by table exchanges, including a measure of the social tie strength between nodes. The latter information is useful when nodes deviate from their plans or when the plans are inaccurate. We compare the proposed routing algorithm with the commonly-used optimized link state routing (OLSR) protocol in ns-3 simulations. As the OLSR protocol does not exploit the mobility plans, it relies on link state determination which suffers with increasing mobility. Our simulations show considerably better throughput performance with the proposed approach as compared with OLSR at the expense of increased overhead. However, in the high-throughput regime, the proposed approach outperforms OLSR in terms of both throughput and overhead

Adaptive real-time predictive collaborative content discovery and retrieval in mobile disconnection prone networks

Emerging mobile environments motivate the need for the development of new distributed technologies which are able to support dynamic peer to peer content sharing, decrease high operating costs, and handle intermittent disconnections. In this paper, we investigate complex challenges related to the mobile disconnection tolerant discovery of content that may be stored in mobile devices and its delivery to the requesting nodes in mobile resource-constrained heterogeneous environments. We propose a new adaptive real-time predictive multi-layer caching and forwarding approach, CafRepCache, which is collaborative, resource, latency, and content aware. CafRepCache comprises multiple multi-layer complementary real-time distributed predictive heuristics which allow it to respond and adapt to time-varying network topology, dynamically changing resources, and workloads while managing complex dynamic tradeoffs between them in real time. We extensively evaluate our work against three competitive protocols across a range of metrics over three heterogeneous real-world mobility traces in the face of vastly different workloads and content popularity patterns. We show that CafRepCache consistently maintains higher cache availability, efficiency and success ratios while keeping lower delays, packet loss rates, and caching footprint compared to the three competing protocols across three traces when dynamically varying content popularity and dynamic mobility of content publishers and subscribers. We also show that the computational cost and network overheads of CafRepCache are only marginally increased compared with the other competing protocols

Collaborative cognitive content dissemination and query in heterogeneous mobile opportunistic networks

This paper investigates complex challenges of opportunistic discovery of content stored in remote mobile devices and delivery to the requesting nodes in heterogeneous mobile disconnection prone environments. We propose new latency aware collaborative cognitive caching approach suitable for content dissemination and query in heterogeneous opportunistic mobile networks and dynamic workloads. Utilising fully localised and ego networks multi-layer predictive heuristics about dynamically changing topology, dynamic resources and varying popularity content, our cognitive caching achieves high success ratio, low delays and high caching efficiency for very different real world dynamically changing mobile topologies

Understanding complementary multi-layer collaborative heuristics for adaptive caching in heterogeneous mobile opportunistic networks

Current research aims to deal with emerging challenges of the opportunistic discovery of content stored in remote mobile publishers and the delivery to the subscribers in heterogeneous mobile opportunistic networks. Innovative network and service architectures leverage in-network caching to improve transmission efficiency, reduce delay and handle disconnections. In this paper, we investigate the influences of multi-dimensional heuristics utilised by our adaptive collaborative caching framework CafRepCache on the performance of content dissemination and query in heterogeneous mobile opportunistic environments. We consider the complementary multi-layer heuristics that combine social driven, resources driven, ego network driven and content popularity driven analytics. We extensively evaluate the performance of each complementary heuristic and discuss the impact of each one on every layer of our caching framework across heterogeneous real-world mobility, connectivity traces and use YouTube dataset for different workload and content popularity patterns. We show that the multilayer heuristics enable CafRepCache to be responsive to dynamically changing network topology, congestion avoidance and varying patterns of content publishers/subscribers which balances the trade-off that achieves higher cache hit ratio, delivery success ratios while keeping lower delays and packet loss

Understanding information centric layer of adaptive collaborative caching framework in mobile disconnection-prone networks

Smart networks and services leverage in-network caching to improve transmission efficiency and support large amount of content sharing, decrease high operating costs and handle disconnections. In this paper, we investigate the complex challenges related to content popularity weighting process in collaborative caching algorithm in heterogeneous mobile disconnection prone environments. We describe a reputation-based popularity weighting mechanism built in information-centric layer of our adaptive collaborative caching framework CafRepCache which considers a realistic case where caching points gathering content popularity observed by nodes differentiates between them according to node's reputation and network's connectivity. We extensively evaluate CafRepCache with competitive protocols across three heterogeneous real-world mobility, connectivity traces and use YouTube dataset for different workload and content popularity patterns. We show that our collaborative caching mechanism CafRepCache balances the trade-off that achieves higher cache hit ratio, efficiency and success ratios while keeping lower delays, packet loss and caching footprint compared to competing protocols across three traces in the face of dynamic mobility of publishers and subscribers

Understanding complementary multi-layer collaborative heuristics for adaptive caching in heterogeneous mobile opportunistic networks

Current research aims to deal with emerging challenges of the opportunistic discovery of content stored in remote mobile publishers and the delivery to the subscribers in heterogeneous mobile opportunistic networks. Innovative network and service architectures leverage in-network caching to improve transmission efficiency, reduce delay and handle disconnections. In this paper, we investigate the influences of multi-dimensional heuristics utilised by our adaptive collaborative caching framework CafRepCache on the performance of content dissemination and query in heterogeneous mobile opportunistic environments. We consider the complementary multi-layer heuristics that combine social driven, resources driven, ego network driven and content popularity driven analytics. We extensively evaluate the performance of each complementary heuristic and discuss the impact of each one on every layer of our caching framework across heterogeneous real-world mobility, connectivity traces and use YouTube dataset for different workload and content popularity patterns. We show that the multilayer heuristics enable CafRepCache to be responsive to dynamically changing network topology, congestion avoidance and varying patterns of content publishers/subscribers which balances the trade-off that achieves higher cache hit ratio, delivery success ratios while keeping lower delays and packet loss

Understanding information centric layer of adaptive collaborative caching framework in mobile disconnection-prone networks

Smart networks and services leverage in-network caching to improve transmission efficiency and support large amount of content sharing, decrease high operating costs and handle disconnections. In this paper, we investigate the complex challenges related to content popularity weighting process in collaborative caching algorithm in heterogeneous mobile disconnection prone environments. We describe a reputation-based popularity weighting mechanism built in information-centric layer of our adaptive collaborative caching framework CafRepCache which considers a realistic case where caching points gathering content popularity observed by nodes differentiates between them according to node's reputation and network's connectivity. We extensively evaluate CafRepCache with competitive protocols across three heterogeneous real-world mobility, connectivity traces and use YouTube dataset for different workload and content popularity patterns. We show that our collaborative caching mechanism CafRepCache balances the trade-off that achieves higher cache hit ratio, efficiency and success ratios while keeping lower delays, packet loss and caching footprint compared to competing protocols across three traces in the face of dynamic mobility of publishers and subscribers

A geographic opportunistic forwarding strategy for vehicular named data networking

Studies in Computational Intelligence, 616Recent advanced intelligent devices enable vehicles to retrieve information while they are traveling along a road. The store-carry-and-forward paradigm has a better performance than traditional communication due to the tolerance to intermittent connectivity in vehicular networks. Named Data Networking is an alternative to IP-based networks for data retrieval. On account of most vehicular applications taking interest in geographic location related information, this paper propose a Geographical Opportunistic Forwarding Protocol (GOFP) to support geo-tagged name based information retrieval in Vehicle Named Data Networking (V-NDN). The proposed protocol adopts the opportunistic forwarding strategy, and the position of interest and trajectories of vehicles are used in forwarding decision. Then the ONE simulator is extended to support GOFP and simulation results show that GOFP has a better performance when compared to other similar protocols in V-NDN.This work is supported in part by the Fundamental Research Funds of Jilin University, No. 450060491509 and partially supported by FCT-Fundacao para a Ciencia e Tecnologia Portugal in the scope of the project: UID/CEC/00319/2013