We consider a location-aware store-carry-forward routing scheme based on node density estimation (LA Routing in short), which adopts different message forwarding strategies depending on node density at contact locations where two nodes encounter. To do so, each node estimates a node density distribution based on information about contact locations. In this paper, we clarify how the estimation accuracy affects the performance of LA Routing. We also examine the performance of LA Routing when it applies to networks with homogeneous node density. Through simulation experiments, we show that LA Routing is fairly robust against the accuracy of node density estimation and its performance is comparable with Probabilistic Routing even in the case that that node density is homogeneous.
Tomotaka KIMURA
Osaka University
Takahiro MATSUDA
Osaka University
Tetsuya TAKINE
Osaka University
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.
Copy
Tomotaka KIMURA, Takahiro MATSUDA, Tetsuya TAKINE, "Location-Aware Store-Carry-Forward Routing Based on Node Density Estimation" in IEICE TRANSACTIONS on Communications,
vol. E98-B, no. 1, pp. 99-106, January 2015, doi: 10.1587/transcom.E98.B.99.
Abstract: We consider a location-aware store-carry-forward routing scheme based on node density estimation (LA Routing in short), which adopts different message forwarding strategies depending on node density at contact locations where two nodes encounter. To do so, each node estimates a node density distribution based on information about contact locations. In this paper, we clarify how the estimation accuracy affects the performance of LA Routing. We also examine the performance of LA Routing when it applies to networks with homogeneous node density. Through simulation experiments, we show that LA Routing is fairly robust against the accuracy of node density estimation and its performance is comparable with Probabilistic Routing even in the case that that node density is homogeneous.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.99/_p
Copy
@ARTICLE{e98-b_1_99,
author={Tomotaka KIMURA, Takahiro MATSUDA, Tetsuya TAKINE, },
journal={IEICE TRANSACTIONS on Communications},
title={Location-Aware Store-Carry-Forward Routing Based on Node Density Estimation},
year={2015},
volume={E98-B},
number={1},
pages={99-106},
abstract={We consider a location-aware store-carry-forward routing scheme based on node density estimation (LA Routing in short), which adopts different message forwarding strategies depending on node density at contact locations where two nodes encounter. To do so, each node estimates a node density distribution based on information about contact locations. In this paper, we clarify how the estimation accuracy affects the performance of LA Routing. We also examine the performance of LA Routing when it applies to networks with homogeneous node density. Through simulation experiments, we show that LA Routing is fairly robust against the accuracy of node density estimation and its performance is comparable with Probabilistic Routing even in the case that that node density is homogeneous.},
keywords={},
doi={10.1587/transcom.E98.B.99},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Location-Aware Store-Carry-Forward Routing Based on Node Density Estimation
T2 - IEICE TRANSACTIONS on Communications
SP - 99
EP - 106
AU - Tomotaka KIMURA
AU - Takahiro MATSUDA
AU - Tetsuya TAKINE
PY - 2015
DO - 10.1587/transcom.E98.B.99
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2015
AB - We consider a location-aware store-carry-forward routing scheme based on node density estimation (LA Routing in short), which adopts different message forwarding strategies depending on node density at contact locations where two nodes encounter. To do so, each node estimates a node density distribution based on information about contact locations. In this paper, we clarify how the estimation accuracy affects the performance of LA Routing. We also examine the performance of LA Routing when it applies to networks with homogeneous node density. Through simulation experiments, we show that LA Routing is fairly robust against the accuracy of node density estimation and its performance is comparable with Probabilistic Routing even in the case that that node density is homogeneous.
ER -