Fame-Based Probabilistic Routing for Delay-Tolerant Networks

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 329
  • Download : 0
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.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2010-06
Language
English
Article Type
Article
Keywords

CENTRALITY

Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E93B, pp.1451 - 1458

ISSN
0916-8516
DOI
10.1587/transcom.E93.B.1451
URI
http://hdl.handle.net/10203/100791
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0