Opportunistic networks are a class of mobile ad hoc networks (MANETs) where contacts between mobile nodes occur unpredictably and where a complete end-to-end path between source and destination rarely exists at one time. Two important functions, traditionally provided by the transport layer, are ensuring the reliability of data transmission between source and destination, and ensuring that the network does not become congested with traffic. However, modified versions of TCP that have been proposed to support these functions in MANETs are ineffective in opportunistic networks. In addition, opportunistic networks require different approaches to those adopted in the more common intermittently connected networks, e.g. deep space networks. In this article we capture the state of the art of proposals for transfer reliability and storage congestion control strategies in opportunistic networks. We discuss potential mechanisms for transfer reliability service, i.e. hop-by-hop custody transfer and end-to-end return receipt. We also identify the requirements for storage congestion control and categorise these issues based on the number of message copies distributed in the networks. For single-copy forwarding, storage congestion management and congestion avoidance mechanism are discussed. For multiple-copy forwarding, the principal storage congestion control mechanisms are replication management and drop policy. Finally, we identify open research issues in the field where future research could usefully be focused.
This article proposes FRIMF, a fuzzy routing scheme for opportunistic mobile networks (OMNs). In FRIMF, we exploit the pairwise intercontact times to evaluate the connection strength between nodes. Instead of assuming a random movement model, in the present case we consider node contact processes in OMNs as bursty events. Consequently, we introduce a burstiness parameter to characterize the variability in the dynamics of pairwise interactions. This variance metric, along with the statistical mean of pairwise intercontact times, is used to define a single FRIMF routing metric called closeness through a fuzzy inference system. This reflects the tie strength of the pair nodes. To improve the transmission environment, we further propose a method to develop optimal membership functions for the FRIMF’s fuzzy parameters based on the contact information. Particularly, we leverage the membership function elicitation techniques commonly used in collective opinion aggregations based on a direct rating process to establish the relevancy between vagueness estimates of the routing parameters and statistical distributions of the pairwise intercontact times in a way that eventually presents asymmetric triangular fuzzy numbers. In turn, these TFNs are used to properly define the fuzzy sets of the FRIMF’s routing parameters. Through simulations in the real human mobility environments, we show that FRIMF utilizing the enhanced asymmetric TFNs can outperform that using the typical symmetric TFNs developed based on our subjective preferences. Lastly, comparing with several algorithm benchmarks, we confirm the efficiency of FRIMF in transmission cost and delay.
Social opportunistic networks are intermittently connected mobile ad hoc networks (ICNs) that exploit human mobility to physically carry messages between disconnected parts of the network. Human mobility thus plays an essential role in the performance of forwarding protocols in the networks, and people's movements are in turn affected by their social interactions with each other. In this paper we present an analysis of the traffic distribution among the nodes of social opportunistic networks and its impact on network capacity. For our analysis, we use a human contact graph that represents a social network of individuals. We characterize the graph as a scale-free network and apply forwarding strategies based on the information required by a node to select relays for its messages, categorising this information either as isolated or complete network or local network knowledge. We use a social network property, centrality, for the forwarding strategies, additionally considering tie strength in the forwarding metric and investigate their impact on traffic distribution. We show that all the strategies result in unfair traffic distribution due to a strong non-random structure of the networks, where hub nodes process much more relay traffic than non-hub nodes. Finally, we present a mathematical model of network capacity as an upper-bound of network delivery performance where hub nodes' resources become the limiting factors, and show that including tie strength in the forwarding metric improves the network capacity.
Social opportunistic networks (SONs) are delay-tolerant MANETs that exploit human mobility to enable message delivery in the networks. Humans tend to move in a way that is influenced by their social relations. Knowledge of social relationships therefore can be exploited to build social-aware routing protocols. These algorithms typically favour higher (social) ranking nodes as better relays for message transfers. The combination of this forwarding heuristic and the social network structure, which exhibits a non-uniform connectivity distribution with the existence of a few highly-connected nodes, leads the routing algorithm to direct most of the traffic through these hub nodes. Unbalanced traffic distribution therefore results in the network. This paper presents an analysis of traffic distribution in SONs when social-aware routing protocols are applied in the networks. Initially, we survey state-of-the-art social-aware routing protocols. We next investigate the topology characteristics of real-life SONs. Furthermore, we apply three forwarding strategies on these networks, categorising these strategies into social-aware forwarding and social-oblivious forwarding. The social-aware forwarding strategies consider node ranking when choosing traffic relays and the node ranking here is measured by degree and betweeness centralities. The social-oblivious forwarding, however, disregards node ranking on the forwarding decision and selects a relay node randomly. We show that the social-aware forwarding strategies result in very poor traffic distribution fairness, where a few (hub) nodes process a large fraction of the network traffic. Finally, we discuss the strategies for improving traffic distribution fairness in SONs.
Social-rank-based forwarding algorithms favour the most popular nodes as the most likely relay nodes to deliver messages to the destinations. When these strategies are able to deliver messages with a high success rate and a low delay in social opportunistic networks (SONs), this however creates unbalanced load distribution, where the most popular nodes carry a much heavier burden compared to others. In this paper, we analyze the efficiency and fairness trade-off of social-rank-based forwarding strategies in SONs. Initially, we investigate the node popularity distribution in real-life SONs. We confirm that the node popularity is power-law distributed, with the existence of a few hub nodes that have many connections with other nodes and therefore are much popular in the entire network. Subsequently, we apply a social-rank-based forwarding algorithm on these human-centric networks. Moreover, we perform two distinct scenarios as follows. In the first scenario, we consider absolute delivery efficiency and examine the impact that hub nodes have on the network delivery performance. We show that these nodes enable the network to deliver messages with a high probability in a low delay; however, this consumes much resources on the central nodes. In the second scenario, in contrast, we consider the absolute fairness of resource allocation across the network nodes. We confirm that maintaining this fairness significantly degrades the network delivery performances.
Message delivery in opportunistic mobile networks is a challenging task since the network topology constantly changes and end-to-end paths can hardly be sustained. Epidemic routing forwards a copy message to each contacted node to achieve a high network delivery performance; this however easily burdens the network nodes with high traffic load, quickly depleting the node’s resources, e.g. power and storage, and finally degrading the network delivery performance. This paper proposes an interest-based Epidemic that improves Epidemic to be a content-aware forwarding by taking message content, node interest, and node community into consideration. Using simulation, driven by real human contact datasets, we investigate the performance of the proposed algorithm compared with Epidemic (content-oblivious) and Direct Transmission (content-aware), in terms of total delivered messages, average convergence time, and total relayed messages. Simulation results show that Epidemic-Interest outperforms Direct Transmission in terms of total delivered message and average convergence time. Moreover, compared with Epidemic, it can reduces the transmission cost while keeping the total delivered messages as high as Epidemic’s; however, it increases the convergence time beyond that of Epidemic.