Exploiting social preferences for congestion control in opportunistic networks (original) (raw)

Social-based Routing with CongestionAvoidance in Opportunistic Networks

In particular types of Delay-Tolerant Networks (DTN) such as Opportunistic Mobile Networks, node connectivity is transient. For this reason, traditional routing mechanisms are no longer suitable. New approaches use social relations between mobile users as a criterion for the routing process. We argue that in such an approach, nodes with high social popularity may become congested. We show that social-based routing algorithms such as Bubble Rap are prone to congestion, and introduce two algorithms: Outer and LowerEps. We present experimental results showing that the latter outperform Bubble Rap and solve the congestion problem.

A survey on Congestion Handling Techniques in Opportunistic Networks

Opportunistic Networks an emerging research area that encompasses Mobile Adhoc Networks (MANETs) and a subset of Delay Tolerant Network (DTNs). In such networks one of the most dynamic and challenging tasks is to detect congestion timely and effectively. Congestion both at link and node level can occur due to Irregular Connectivity, Long and Variable Length Delays, and Heterogeneous Networks Infrastructure. Intermediate nodes between source and destination are seems to be critical for detecting a congestion issue as they have to store data in their respective buffer until a next best forwarding opportunistic node is found. The prime objective of our research is to evaluate different congestion handling techniques that addressed issues of storage/node level congestion in opportunistic networks. Consequently it may help to detect congestion issue at node level in a Pre-active manner rather than pro-active manner.

" A Model to Overcome Node Level Congestion in Opportunistic Networks "

Opportunistic Networks are now a days emerging and hot research area which belongs from a class of Mobile Adhoc Networks (MANETs) and a subset of Delay Tolerant Network (DTNs). Intermediate nodes between source and destination are the critical one in terms of congestion to be occurs as they have to store data in buffer until next best forwarding opportunity occurs. In this research study we have proposed and as well as validated a reactive buffer management model to overcome node level congestion issue in Opportunistic Networks in a batter way.

Socially-Aware Congestion Control in Ad-Hoc Networks: Current Status and The Way Forward

Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in which a user's social properties (such as the social connections and communications metadata as well as application data) are leveraged for offering enhanced services in a distributed infrastructureless environments. However , the wireless medium, due to limited bandwidth, can easily suffer from the problem of congestion when social metadata and application data are exchanged among nodes-a problem that is compounded by the fact that some nodes may act selfishly and not share its resources. While a number of congestion control schemes have been proposed for the traditional ad-hoc networks, there has been limited focus on incorporating social awareness into congestion control schemes. We revisit the existing traditional ad-hoc congestion control and data distribution protocols and motivate the need for embedding social awareness into these protocols to improve performance. We report that although some work is available in opportunistic network that uses socially-aware techniques to control the congestion issue, this area is largely unexplored and warrants more research attention. In this regards, we highlight the current research progress and identify multiple future directions of research.

Evaluation of Congestion Aware Social Metrics for Centrality-Based Routing

Wireless Communications and Mobile Computing

Opportunistic networks utilize pocket switching for routing where each node forwards its messages to a suitable next node. The selection of the forwarder node is crucial for the efficient performance of a routing protocol. In any opportunistic network, some nodes have a paramount role in the routing process and these nodes could be identified with the assistance of the existing centrality measures available in network theory. However, the central nodes tend to suffer from congestion because a large number of nodes that are relatively less central attempt to forward their payload to the central nodes to increase the probability of the message delivery. This paper evaluates mechanisms to transform the social encounters into congestion aware metrics so that high-ranking central nodes are downgraded when they encounter congestion. The network transformations are aimed at aggregating the connectivity patterns of the nodes to implicitly accumulate the network information to be utilized by...

Routing in Mobile Opportunistic Social Networks with Selfish Nodes

Wireless Communications and Mobile Computing, 2019

When the connection to Internet is not available during networking activities, an opportunistic approach exploits the encounters between mobile human-carried devices for exchanging information. When users encounter each other, their handheld devices can communicate in a cooperative way, using the encounter opportunities for forwarding their messages, in a wireless manner. But, analyzing real behaviors, most of the nodes exhibit selfish behaviors, mostly to preserve the limited resources (data buffers and residual energy). That is the reason why node selfishness should be taken into account when describing networking activities: in this paper, we first evaluate the effects of node selfishness in opportunistic networks. Then, we propose a routing mechanism for managing node selfishness in opportunistic communications, namely, SORSI (Social-based Opportunistic Routing with Selfishness detection and Incentive mechanisms). SORSI exploits the social-based nature of node mobility and other...