Using Buffer Space Advertisements to Avoid Congestion in Mobile Opportunistic DTNs

Abstract

Abstract. This paper investigates congestion control in opportunistic networks that use delay-tolerant networking (DTN) as a basis for communication. We propose a mechanism that advertises buffer occupancy information to adjacent nodes and avoids forwarding through nodes with high buffer occupancy. The nodes then achieve global congestion avoidance simply based on locally available information. The proposed mechanism works independent of the routing protocol and is thus applicable to wide array of scenarios. Extensive simulations, with different node mobility models and radio modeling, indicate that the proposed mechanism improves message delivery ratio and decreases end-to-end delay.

A survey on congestion control for delay and disruption tolerant networks

“…As illustrated in Table 6, over 80% of the DTN congestion control mechanisms considered here [55,43,32,38,36,37,50,42,46,34,53,39,41,31,54,35,40,48,49,52] can be classified as closed loop. For example, the approach described in [38] is based on the observation that congestion in DTN nodes builds up gradually.…”

“…Drop-random [56,31,36,41] A message from the queue is selected at random to be dropped Drop-head [56,43] The first message in the queue, i.e., the head of the queue, is dropped Drop-tail [56,43,32,42,50,52] The most recently received message, i.e., the tail of the queue, is removed NHop-Drop [51] Any message that has been forwarded over N hops is dropped Drop-least-Recently-received [56,46] The message that has been in the node buffer longest is removed Drop-oldest [56,39,43] The message that has been in the network longest is dropped Drop-youngest [56] Drops the message with the longest remaining life time Table 2 DTN drop policies.…”

“…Several DTN congestion control mechanisms use buffer occupancy rate, that is, the availability of buffer space, as an indicator of congestion [31][32][33][34][35][36][37][38][39][40][41][42][43][44][45][46][47][48][49].…”

A novel queue management policy for delay-tolerant networks

“…The congestion level is an estimation of traffic amount at nodes that is collected during node encounters. Similarly, in [54], nodes broadcast their buffer occupancy to their neighbours. Then, this information is used to decide which nodes to forward.…”

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].…”