M. Soperi Mohd Zahid

E-DROP An Effective Drop Buffer Management Policy for DTN Routing Protocols

In this paper, we propose effective buffer management drop policy E-DROP for delay tolerant networks. We illustrate that conventional buffer management policy like MOFO be unsuccessful to consider all relevant information in this framework. E-DROP policy can be adjust to minimize the metrics of relayed, dropped , average latency ,overhead ratio ,hop count and to maximize the average delivery probability and buffer time. Using simulations support on an imitation mobility models shortest path map based and Map route movements, we show that our buffer management E-DROP with random message sizes drop policy performs better as the existing MOFO.

Message Drop Control Buffer Management Policy for DTN Routing Protocols

In delay tolerant network interruptions will occur continuously because there is no end-to-end path exists for the longer period of time from source to destination. In this context, delays can be immensely large due to its environment contrails e.g. wildlife tracking, sensor network, deep space and ocean networks. Furthermore, larger replication of messages put into the network is to increase delivery probability. Due to this high buffer occupancy storage space and replication result in a huge overhead on the network. Consequently, well-ordered intelligent message control buffer drop policies are necessary to operate on buffer that allows control on messages drop when the node buffers are near to overflow. In this paper, we propose an efficient buffer management policy which is called message drop control source relay (MDC-SR) for delay tolerant routing protocols. We also illustrate that conventional buffer management policy like Drop oldest, LIFO and MOFO be ineffective to consider all appropriate information in this framework. The proposed MDC-SR buffer policy controls the message drop while at the same time maximizes the delivery probability and buffer time average and reduces the message relay, drop and hop count in the reasonable amount. Using simulations support on an imitation mobility models Shortest Path Map Based Movement and Map Route Movements, we show that our drop buffer management MDC-SR with random message sizes performs better as compared to existing MOFO, LIFO and DOA.

Contact quality based forwarding strategy for delay tolerant network

The probabilistic routing protocols accelerate the network traffic towards more vital nodes to achieve high delivery ratio and low delays. However, as the traffic burden rises, the nodes turn into soaked and drop previously stored messages that reduce the delivery ratio and increase end-to-end delay. Hereby it is vital to compute the accurate quality value of nodes. In this paper, we have proposed a Contact Quality Based Forwarding strategy (CQBFS) for city-based environments where nodes are heterogeneous, resources are scarce and traffic density is high. The activity of a node is measured in terms of its ability to transmit the carried message and drop magnitude. Moreover, an effective quality impact based buffer management policy has been used to control the impact of message drop on network throughput. The proposed CQBFS outperforms PRoPHET, Epidemic, Maxprop and TTL based routing protocols in terms of message transmissions, delivery probability, message drop, end-to-end delay and Hop count average under the real time traces Sassy and Helsinki city.

Dynamic Prediction based Multi Queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network

Abstract Two most important issues should be considered to achieve data delivery in DTN networking: routing protocols for the network and intelligent buffer management policy for everyone node in the network. The routing scheme decides which messages should be forwarded when nodes meet, and the buffer management policy determines which message is purged when the buffer overflows in a node. This study proposes a buffer management policy named as Dynamic Prediction based Multi Queue (DPMQ) for probabilistic routing protocols. It works by classification of local buffer into three queues of messages, which are DCTL, HPTL and LPTL. The simulation results have proven that the DPMQ performs well as compared to DLA, DOA, MOFO, LIFO, LEPR and LIFO in terms of reducing the message relay, message drop, hop counts average and overhead while rising in the delivery probability.

Impact of Mobility Models on DLA (Drop Largest) Optimized DTN Epidemic Routing Protocol

mobile nodes depend on their mobility to carry the message to destination. Therefore it is important to understand the effect of buffer management policies on the performance of DTN routing protocols under different mobility models. In our previous work of DLA we examine that epidemic router was not showing good delivery probability in case of SPMBM. This paper is the performance of DLA (drop largest) and DOA (Drop oldest) buffer management policy with impact of varying mobility models under epidemic routing protocol. We show that how combination of mobility models and queuing mechanism can optimize the performance of epidemic routing protocol in term of delivery probability, message dropped, buffer time average, overhead ratio and hop count averages.

Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network

DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.

Threshold based locking routing strategy for delay tolerant network

Delay tolerance network probabilistic routing protocols forward message to a node by observing its predictability value to meet the message destination. However, it is vital to predict the ability of node to carry the transmitted message. For instance, the traffic confluence on the high probable nodes can produce congestion that results in the drop of previously stored messages. These drops diminish the delivery ratio because the dropped message lost its opportunity to be delivered. Since, there exist multiple copies of each message; therefore, the same node invariably receives the dropped messages from other parts of the network and causes the highest number of transmissions. Additionally, the replication from source node continues on the high probable peers even the previous copies were transmitted on the better predictable neighbors than the current. In this paper, we have proposed a novel routing method called as the adaptive threshold based locking method that maintains the contemporary status of the node based on its activity in the network. We have used the adaptive status measuring metrics such as transmit factor, drop factor and hop away count. Moreover, a threshold based locking method has been introduced to control the diffusion of messages. We have performed the comparison of existing and proposed routing methods with real time mobility traces. The proposed strategy has bolstered the delivery ratio and minimizes hop count, end-to-end delay and number of transmission.

DF++: an adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network

The delegated forwarding (DF) curb transmissions by forwarding the message to a node that holds high quality value seen by the message. However, DF assumes infinite buffer space that is not possible in real time applications. In addition, quality value computation considers the encountering history and does not account for additional network parameters such as aging and transitive connectivity. In this paper, we have proposed a routing protocol called as DF++ that compute quality value based on probabilistic model used in PRoPHET protocol and forwards the message to current node by adaptive computation of available buffer space. We have compared performance of DF++ with DF, Epidemic and PRoPHET routing protocols. The proposed DF++ has higher delivery probability and fewer message drop and transmissions.

Forwarding Impact Aware Routing Protocol for Delay Tolerant Network

The Delay Tolerant Network (DTN) multi-copy protocols transmits multiple copies of each message on all or several neighbors. Hence, message can reach to its destination via multiple nodes at higher consumption of buffer space, energy and bandwidth. This paper has proposed a Forwarding Impact Aware Probabilistic Routing Protocol (FIAR) to control the redundant message transmission. The FIAR has used two metrics called as Forwarding Impact (FI) and Drop Impact. The Forwarding Impact (FI) is used to decide which message to forward when connection opportunity arises while Drop Impact (DI) is used to decide which message to drop when a node receives a message with no buffer space. Simulation results shown that proposed FIAR outperforms existing Epidemic protocol, Prophet protocol and Spray and Wait routing protocol in terms of reducing the number of transmissions, message drop and raising delivery ratio.