Exploiting social preferences for congestion control in opportunistic networks

Abstract

Abstract-It has been observed that opportunistic networks exhibit a highly unbalanced traffic load distribution, mainly because of the heterogeneity in mobility and the greedy routing decisions, leading to packet drops due to storage constraints. The existing strategies rely either on fairness techniques or on diverting traffic to alternative routes in order to control congestion. The result is a dilemma between performance and fairness. In this work, we introduce a congestion control mechanism that provides a tunable trade-off between efficiency and fairness. We rely on the social preferences of the nodes for dynamically tuning the aforementioned trade-off. Our simulations show that the proposed algorithm achieves high delivery ratio, combined with low endto-end delay and routing cost, without sacrificing fairness under high traffic load.

Addressing the Issue of Routing Unfairness in Opportunistic Backhaul Networks for Collecting Sensed Data

“…Solutions addressing the issue of unfairness in SCF-based networks include FairRoute [23], the Context Aware Forwarding Algorithm (CAFÉ) [60], the Fairness-based Opportunistic Networking (FOG) framework [19] and Congestion Control with Adjustable Fairness (CCAF) [61]. FairRoute's idea is to allow less popular nodes to find alternative routes by considering long-term interactions, while directing traffic towards nodes with less buffer occupancy.…”

Improving Message Dissemination in Opportunistic Networks

“…There are more protocols such as LSF, MSF Spray and Wait [147], LSF Spray and Focus [146], Encounter-Based Routing [111], Delegation Forwarding [39], Coordinated Delegation Forwarding [119], and Optimal routing (some of them based on above algorithms) that can be used. Moreover, Adyton has implemented some Congestion Control Mechanisms such as Avoid Overflow, Autonomous Congestion Control (ACC) [20], FairRoute (FR) [127], Buffer Space Advertisements (BSA) [91], Context-Aware Congestion Control (CACC) [163], Congestion Control with Adjustable Fairness (CCAF) [5].…”

Energy - efficient networking in wireless ad hoc networks

“…Also, the user is able to set a scheduling policy [157,158] which de-termines the transmission sequence of data packets at the sending nodes. Moreover, Adyton offers a diverse range of congestion control mechanisms 1 [159][160][161][162][163] that have been proposed in the literature. In case of multi-copy algorithms, Adyton supports different deletion mechanisms, i.e., the mechanism for deleting the packet replicas in the network when one of them reaches the destination.…”

“…Motivated by the observation that a profitable trade-off between fairness and efficiency can be achieved, we devise a novel congestion control mechanism that maximizes the delivery efficiency while achieving a low end-to-end delay at the expense of a reasonably low cutback in fairness. The proposed algorithm called Congestion Control with Adjustable Fairness (CCAF) [163] incarnates the described functionality in a generic manner that can be incorporated into virtually any utility-based routing protocol. CCAF provides, through a tunable parameter, a trade-off between fairness and end-to-end delay without impacting and in some cases improving the delivery ratio.…”