Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments

Abstract

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

Dynamic Co-Operative Energy-Efficient Routing Algorithm Based on Geographic Information Perception in Opportunistic Mobile Networks

“…In order to assess the routing performance of DCEE-GIP, the opportunistic network environment (ONE) [11,12] simulator was adopted to perform numerous simulation experiments. For attesting to the superiority of DCEE-GIP, we chose direct delivery (DD) [5], which is the most energy-efficient routing algorithm (in theory), epidemic [8], which is the representative of flooding algorithms without any constraints, spray & wait [7], which is the classic routing algorithm with the best comprehensive performance, and EASE [23], which is an energy-efficient algorithm based on the sleep mechanism published in 2021 and GEER [28], another geographic and energy-aware epidemic strategy published in 2020 for OMNs.…”

“…We have simulated and analyzed the existing and proposed algorithms with ONE simulation [11,12], and the result shows that DCEE-GIP extends the network service time and successfully delivers the most messages. When compared with the five existing algorithms, the service time of DCEE-GIP increased by 8.05∼31.11%, and more messages were delivered by 14.82∼115.9%.…”

Performance Analysis of the Impact of Time to Leave on Different Drop Policies for Delay Tolerant Networks

“…The TTL directly affects the delivery of messages in the DTN. As a result, the DTN established a deadline for the transmission of message copies [46,47]. The message is automatically deleted from all nodes if it is not delivered within the TTL.…”

TSN Algorithms for Large Scale Networks: A Survey and Conceptual Comparison

“…DRR can satisfy end-to-end latency bound on the order of milliseconds for realistic network scenarios. Whereas, for a Delay Tolerant Network (DTN), Ayub et al [40] have presented a mechanism to address the congestion originating from multiple copies (replicas) of packets that are sent for reliability. Multi-copy routing protocols duplicates the packets which results in a network congestion.…”

“…The dropping of packets should be done in a controlled way such that there is no negative impacts to the reliability mechanism. Ayub et al [40] mainly considers reactive dropping, i.e., dropping of packets only occurs when the queue overflows. This is achieved by a Priority Queue Based Reactive Buffer Management Policy (PQB-R) in an urban environment scenario.…”