Home Base-Aware Store-Carry-Forward Routing Using Location-Dependent Utilities of Nodes
Summary :
We propose a home base-aware store-carry-forward routing scheme using location-dependent utilities of nodes, which adopts different message forwarding strategies depending on location where nodes encounter. Our routing scheme first attempts to deliver messages to its home base, the area with the highest potential for the presence of the destination node in the near future. Once a message copy reaches its home base, message dissemination is limited within the home base, and nodes with message copies wait for encountering the destination node. To realize our routing scheme, we use two different utilities of nodes depending on location: Outside the home base of a message, nodes approaching to the home base have high utility values, while within the home base, nodes staying the home base have high utility values. By using these utilities properly, nodes with message copies will catch the destination node “by ambush” in the home base of the destination node. Through simulation experiments, we demonstrate the effectiveness of our routing scheme.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E100-B No.1 pp.17-27
- Publication Date
- 2017/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2016CQP0004
- Type of Manuscript
- Special Section PAPER (Special Section on Challenged Networking Technologies and Its Service Quality)
- Category
- Network
Authors
Tomotaka KIMURA
Tokyo University of Science
Yutsuki KAYAMA
Nara Institute of Science and Technology
Tetsuya TAKINE
Osaka University
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
Tomotaka KIMURA, Yutsuki KAYAMA, Tetsuya TAKINE, "Home Base-Aware Store-Carry-Forward Routing Using Location-Dependent Utilities of Nodes" in IEICE TRANSACTIONS on Communications,
vol. E100-B, no. 1, pp. 17-27, January 2017, doi: 10.1587/transcom.2016CQP0004.
Abstract: We propose a home base-aware store-carry-forward routing scheme using location-dependent utilities of nodes, which adopts different message forwarding strategies depending on location where nodes encounter. Our routing scheme first attempts to deliver messages to its home base, the area with the highest potential for the presence of the destination node in the near future. Once a message copy reaches its home base, message dissemination is limited within the home base, and nodes with message copies wait for encountering the destination node. To realize our routing scheme, we use two different utilities of nodes depending on location: Outside the home base of a message, nodes approaching to the home base have high utility values, while within the home base, nodes staying the home base have high utility values. By using these utilities properly, nodes with message copies will catch the destination node “by ambush” in the home base of the destination node. Through simulation experiments, we demonstrate the effectiveness of our routing scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2016CQP0004/_p
Copy
@ARTICLE{e100-b_1_17,
author={Tomotaka KIMURA, Yutsuki KAYAMA, Tetsuya TAKINE, },
journal={IEICE TRANSACTIONS on Communications},
title={Home Base-Aware Store-Carry-Forward Routing Using Location-Dependent Utilities of Nodes},
year={2017},
volume={E100-B},
number={1},
pages={17-27},
abstract={We propose a home base-aware store-carry-forward routing scheme using location-dependent utilities of nodes, which adopts different message forwarding strategies depending on location where nodes encounter. Our routing scheme first attempts to deliver messages to its home base, the area with the highest potential for the presence of the destination node in the near future. Once a message copy reaches its home base, message dissemination is limited within the home base, and nodes with message copies wait for encountering the destination node. To realize our routing scheme, we use two different utilities of nodes depending on location: Outside the home base of a message, nodes approaching to the home base have high utility values, while within the home base, nodes staying the home base have high utility values. By using these utilities properly, nodes with message copies will catch the destination node “by ambush” in the home base of the destination node. Through simulation experiments, we demonstrate the effectiveness of our routing scheme.},
keywords={},
doi={10.1587/transcom.2016CQP0004},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Home Base-Aware Store-Carry-Forward Routing Using Location-Dependent Utilities of Nodes
T2 - IEICE TRANSACTIONS on Communications
SP - 17
EP - 27
AU - Tomotaka KIMURA
AU - Yutsuki KAYAMA
AU - Tetsuya TAKINE
PY - 2017
DO - 10.1587/transcom.2016CQP0004
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2017
AB - We propose a home base-aware store-carry-forward routing scheme using location-dependent utilities of nodes, which adopts different message forwarding strategies depending on location where nodes encounter. Our routing scheme first attempts to deliver messages to its home base, the area with the highest potential for the presence of the destination node in the near future. Once a message copy reaches its home base, message dissemination is limited within the home base, and nodes with message copies wait for encountering the destination node. To realize our routing scheme, we use two different utilities of nodes depending on location: Outside the home base of a message, nodes approaching to the home base have high utility values, while within the home base, nodes staying the home base have high utility values. By using these utilities properly, nodes with message copies will catch the destination node “by ambush” in the home base of the destination node. Through simulation experiments, we demonstrate the effectiveness of our routing scheme.
ER -
English
