IEICE TRANSACTIONS on Communications
Fame-Based Probabilistic Routing for Delay-Tolerant Networks
Summary :
One of the important technologies for the Future Internet is the delay-tolerant network, which enables data transfers even when mobile nodes are connected intermittently. Routing algorithms for a delay-tolerant network generally aim to increase the message delivery rate and decrease the number of forwarded messages in the situation of an intermittent connection. A fame-based strategy for delay-tolerant network routing is suggested in this work. The number of contacts of a node with other nodes, known as the fame degree in this work, is counted to rank the fame degree of the node. By utilizing the fame degree, the proposed routing algorithm determines the probability of forwarding the messages of a node to the contact node. Due to the characteristics of the proposed algorithm, it can be combined harmonically with the PROPHET routing algorithm. Through experiments on well-known benchmark datasets, the proposed algorithms shows better delivery rates with much lower number of forwarded messages and lower average hop counts of delivered messages compared to Epidemic, PROPHET and SimBet.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.6 pp.1451-1458
- Publication Date
- 2010/06/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.1451
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kwangcheol SHIN, Dongman LEE, "Fame-Based Probabilistic Routing for Delay-Tolerant Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 6, pp. 1451-1458, June 2010, doi: 10.1587/transcom.E93.B.1451.
Abstract: One of the important technologies for the Future Internet is the delay-tolerant network, which enables data transfers even when mobile nodes are connected intermittently. Routing algorithms for a delay-tolerant network generally aim to increase the message delivery rate and decrease the number of forwarded messages in the situation of an intermittent connection. A fame-based strategy for delay-tolerant network routing is suggested in this work. The number of contacts of a node with other nodes, known as the fame degree in this work, is counted to rank the fame degree of the node. By utilizing the fame degree, the proposed routing algorithm determines the probability of forwarding the messages of a node to the contact node. Due to the characteristics of the proposed algorithm, it can be combined harmonically with the PROPHET routing algorithm. Through experiments on well-known benchmark datasets, the proposed algorithms shows better delivery rates with much lower number of forwarded messages and lower average hop counts of delivered messages compared to Epidemic, PROPHET and SimBet.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1451/_p
Copy
@ARTICLE{e93-b_6_1451,
author={Kwangcheol SHIN, Dongman LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Fame-Based Probabilistic Routing for Delay-Tolerant Networks},
year={2010},
volume={E93-B},
number={6},
pages={1451-1458},
abstract={One of the important technologies for the Future Internet is the delay-tolerant network, which enables data transfers even when mobile nodes are connected intermittently. Routing algorithms for a delay-tolerant network generally aim to increase the message delivery rate and decrease the number of forwarded messages in the situation of an intermittent connection. A fame-based strategy for delay-tolerant network routing is suggested in this work. The number of contacts of a node with other nodes, known as the fame degree in this work, is counted to rank the fame degree of the node. By utilizing the fame degree, the proposed routing algorithm determines the probability of forwarding the messages of a node to the contact node. Due to the characteristics of the proposed algorithm, it can be combined harmonically with the PROPHET routing algorithm. Through experiments on well-known benchmark datasets, the proposed algorithms shows better delivery rates with much lower number of forwarded messages and lower average hop counts of delivered messages compared to Epidemic, PROPHET and SimBet.},
keywords={},
doi={10.1587/transcom.E93.B.1451},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - Fame-Based Probabilistic Routing for Delay-Tolerant Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1451
EP - 1458
AU - Kwangcheol SHIN
AU - Dongman LEE
PY - 2010
DO - 10.1587/transcom.E93.B.1451
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2010
AB - One of the important technologies for the Future Internet is the delay-tolerant network, which enables data transfers even when mobile nodes are connected intermittently. Routing algorithms for a delay-tolerant network generally aim to increase the message delivery rate and decrease the number of forwarded messages in the situation of an intermittent connection. A fame-based strategy for delay-tolerant network routing is suggested in this work. The number of contacts of a node with other nodes, known as the fame degree in this work, is counted to rank the fame degree of the node. By utilizing the fame degree, the proposed routing algorithm determines the probability of forwarding the messages of a node to the contact node. Due to the characteristics of the proposed algorithm, it can be combined harmonically with the PROPHET routing algorithm. Through experiments on well-known benchmark datasets, the proposed algorithms shows better delivery rates with much lower number of forwarded messages and lower average hop counts of delivered messages compared to Epidemic, PROPHET and SimBet.
ER -
English
