Limits...
An improved PRoPHET routing protocol in delay tolerant network.

Han SD, Chung YW - ScientificWorldJournal (2015)

Bottom Line: These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops.The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio.Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

View Article: PubMed Central - PubMed

Affiliation: School of Electronic Engineering, Soongsil University, 511 Sangdo-dong, Dongjak-gu, Seoul 156-743, Republic of Korea.

ABSTRACT
In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity) protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

No MeSH data available.


Delivery probability for varying the value of Hm.
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4306380&req=5

fig5: Delivery probability for varying the value of Hm.

Mentions: Figure 5 shows the delivery probability for varying the values of Hm, where Nm = 5,10,20, and 40. The delivery probability of the proposed protocol is higher than that of epidemic protocol always. Also, the delivery probability of the proposed protocol is higher than that of PRoPHET protocol for most values of Hm; that is, Hm ≤ 15, and it is slightly lower than that of PRoPHET protocol for large values of Hm, since too many message copies result in message drop in buffer and thus, reduces delivery probability of the proposed protocol. The delivery probability of the proposed protocol increases as Hm increases from Hm = 0 and decreases as Hm increases from Hm = 2 or 3 in the considered parameter setting. This is because increasing the spreading of message copies from Hm = 0 to Hm = 2 has a positive effect on increasing delivery probability due to higher message copies but the increasing the spreading of message copies too high, that is, from Hm = 2 or 3, results in higher buffer occupancy and this results in message drop. The delivery probability of the proposed scheme when the values of Hm are small increases as Nm increases but it is saturated for large values of Hm.


An improved PRoPHET routing protocol in delay tolerant network.

Han SD, Chung YW - ScientificWorldJournal (2015)

Delivery probability for varying the value of Hm.
© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4306380&req=5

fig5: Delivery probability for varying the value of Hm.
Mentions: Figure 5 shows the delivery probability for varying the values of Hm, where Nm = 5,10,20, and 40. The delivery probability of the proposed protocol is higher than that of epidemic protocol always. Also, the delivery probability of the proposed protocol is higher than that of PRoPHET protocol for most values of Hm; that is, Hm ≤ 15, and it is slightly lower than that of PRoPHET protocol for large values of Hm, since too many message copies result in message drop in buffer and thus, reduces delivery probability of the proposed protocol. The delivery probability of the proposed protocol increases as Hm increases from Hm = 0 and decreases as Hm increases from Hm = 2 or 3 in the considered parameter setting. This is because increasing the spreading of message copies from Hm = 0 to Hm = 2 has a positive effect on increasing delivery probability due to higher message copies but the increasing the spreading of message copies too high, that is, from Hm = 2 or 3, results in higher buffer occupancy and this results in message drop. The delivery probability of the proposed scheme when the values of Hm are small increases as Nm increases but it is saturated for large values of Hm.

Bottom Line: These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops.The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio.Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

View Article: PubMed Central - PubMed

Affiliation: School of Electronic Engineering, Soongsil University, 511 Sangdo-dong, Dongjak-gu, Seoul 156-743, Republic of Korea.

ABSTRACT
In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity) protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

No MeSH data available.