TY - GEN
T1 - Aggressive Recovery Scheme for Multicast Communication in Intermittently Connected Mobile Ad-Hoc Networks
AU - Kimura, Tomotaka
AU - Premachandra, Chinthaka
N1 - Funding Information:
Acknowledgment This work was partially supported by JSPS KAKENHI Grant Number 17K12679.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/5/17
Y1 - 2019/5/17
N2 - We consider recover schemes suitable for multicast communication in intermittently connected mobile ad hoc networks. In these networks, conventional routing schemes do not work properly. Store-carry-forward routing has been considered as a promising solution in such a circumstance. In many store-carry-forward routing schemes, even when a message reaches its destination node, some nodes stores its copies. To solve this problem, many recovery schemes have been proposed for unicast communications. These recovery schemes, however, could not work properly for multicast communications. In this paper, we propose a new recovery scheme that is suitable for multicast communications. Our recovery scheme aggressively discards message copies before all the anti-packets that all destination nodes generate are received. Through simulation experiments, we demonstrate that our recovery scheme works well compared with the existing recovery scheme when messages are delivered for many destination nodes.
AB - We consider recover schemes suitable for multicast communication in intermittently connected mobile ad hoc networks. In these networks, conventional routing schemes do not work properly. Store-carry-forward routing has been considered as a promising solution in such a circumstance. In many store-carry-forward routing schemes, even when a message reaches its destination node, some nodes stores its copies. To solve this problem, many recovery schemes have been proposed for unicast communications. These recovery schemes, however, could not work properly for multicast communications. In this paper, we propose a new recovery scheme that is suitable for multicast communications. Our recovery scheme aggressively discards message copies before all the anti-packets that all destination nodes generate are received. Through simulation experiments, we demonstrate that our recovery scheme works well compared with the existing recovery scheme when messages are delivered for many destination nodes.
KW - DTN
KW - multicast communication
KW - recovery scheme
KW - store-carry-forward routing
UR - http://www.scopus.com/inward/record.url?scp=85066762146&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85066762146&partnerID=8YFLogxK
U2 - 10.1109/ICOIN.2019.8718145
DO - 10.1109/ICOIN.2019.8718145
M3 - Conference contribution
AN - SCOPUS:85066762146
T3 - International Conference on Information Networking
SP - 414
EP - 416
BT - 33rd International Conference on Information Networking, ICOIN 2019
PB - IEEE Computer Society
T2 - 33rd International Conference on Information Networking, ICOIN 2019
Y2 - 9 January 2019 through 11 January 2019
ER -