BS-10-34 A Probabilistic Location-based Routing Scheme for Delay-Tolerant Networks

• Yasmeen Farzana

  Department of Informatics, The Graduate University for Advanced Studies

• Yamada Shigeki

  National Institute of Informatics

抄録

Many real-world DTN applications involve nodes that do not inherently have a purely random mobility pattern. Observably, nodes in these scenarios repeatedly traverse specific locations based on routine characteristics. In this paper we propose a DTN routing scheme which utilizes historical location visitations of nodes to predict future probability of progression towards an identifiable destination. In this scheme, a source considers next- hop forwarding based on a benefit-metric. Our formulation of the benefit-metric takes into account a nodes frequented trajectories, its current Euclidian distance from the destination and the possibility of any of it trajectories bridging the gap to the destination. Naturally, the source selects the node providing the maximum 'benefit'. With this scheme flooding is preventable and only one copy of a bundle circulates in the network at any time. Using prior movement patterns to reduce uncertainty and progressively forward to a location proximal to the destination in a controlled manner improves the delivery ratio and optimizes resource utilization. We analyze the performance of our protocol with intuitive methods.

収録刊行物

• 電子情報通信学会ソサイエティ大会講演論文集

  電子情報通信学会ソサイエティ大会講演論文集 2009 (2), "S-131"-"S-132", 2009-09-01

  一般社団法人電子情報通信学会

詳細情報

• CRID: 1572261552461075840
• NII論文ID: 110007870429
• NII書誌ID: AN10489017
• 本文言語コード: en
• データソース種別:
  • CiNii Articles