IEICE TRANSACTIONS on Communications
Virtual Temporal Friendship Creation: Autonomous Decentralized Friendship Management for Improving Robustness in D2D-Based Social Networking Service
Summary :
In this paper, for improving the robustness of D2D-based SNS by avoiding the cascading failure, we propose an autonomous decentralized friendship management called virtual temporal friendship creation. In our proposed virtual temporal friendship creation, some virtual temporal friendships are created among users based on an optimization problem to improve the robustness although these friendships cannot be used to perform the message exchange in SNS. We investigate the impact of creating a new friendship on the node resilience for the optimization problem. Then we consider an autonomous decentralized algorithm based on the obtained results for the optimization problem of virtual temporal friendship creation. We evaluate the performance of the virtual temporal friendship creation with simulation and investigate the effectiveness of this method by comparing with the performance of a method with meta-heuristic algorithm. From numerical examples, we show that the virtual temporal friendship creation can improve the robustness quickly in an autonomous and decentralized way.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E105-B No.4 pp.379-387
- Publication Date
- 2022/04/01
- Publicized
- 2021/10/12
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2021WWP0001
- Type of Manuscript
- Special Section PAPER (Special Section on Wired-and-Wireless Network System Technologies in Beyond 5G Era)
- Category
- Overlay Network
Authors
Hanami YOKOI
University of Fukui
Takuji TACHIBANA
University of Fukui
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
Hanami YOKOI, Takuji TACHIBANA, "Virtual Temporal Friendship Creation: Autonomous Decentralized Friendship Management for Improving Robustness in D2D-Based Social Networking Service" in IEICE TRANSACTIONS on Communications,
vol. E105-B, no. 4, pp. 379-387, April 2022, doi: 10.1587/transcom.2021WWP0001.
Abstract: In this paper, for improving the robustness of D2D-based SNS by avoiding the cascading failure, we propose an autonomous decentralized friendship management called virtual temporal friendship creation. In our proposed virtual temporal friendship creation, some virtual temporal friendships are created among users based on an optimization problem to improve the robustness although these friendships cannot be used to perform the message exchange in SNS. We investigate the impact of creating a new friendship on the node resilience for the optimization problem. Then we consider an autonomous decentralized algorithm based on the obtained results for the optimization problem of virtual temporal friendship creation. We evaluate the performance of the virtual temporal friendship creation with simulation and investigate the effectiveness of this method by comparing with the performance of a method with meta-heuristic algorithm. From numerical examples, we show that the virtual temporal friendship creation can improve the robustness quickly in an autonomous and decentralized way.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2021WWP0001/_p
Copy
@ARTICLE{e105-b_4_379,
author={Hanami YOKOI, Takuji TACHIBANA, },
journal={IEICE TRANSACTIONS on Communications},
title={Virtual Temporal Friendship Creation: Autonomous Decentralized Friendship Management for Improving Robustness in D2D-Based Social Networking Service},
year={2022},
volume={E105-B},
number={4},
pages={379-387},
abstract={In this paper, for improving the robustness of D2D-based SNS by avoiding the cascading failure, we propose an autonomous decentralized friendship management called virtual temporal friendship creation. In our proposed virtual temporal friendship creation, some virtual temporal friendships are created among users based on an optimization problem to improve the robustness although these friendships cannot be used to perform the message exchange in SNS. We investigate the impact of creating a new friendship on the node resilience for the optimization problem. Then we consider an autonomous decentralized algorithm based on the obtained results for the optimization problem of virtual temporal friendship creation. We evaluate the performance of the virtual temporal friendship creation with simulation and investigate the effectiveness of this method by comparing with the performance of a method with meta-heuristic algorithm. From numerical examples, we show that the virtual temporal friendship creation can improve the robustness quickly in an autonomous and decentralized way.},
keywords={},
doi={10.1587/transcom.2021WWP0001},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Virtual Temporal Friendship Creation: Autonomous Decentralized Friendship Management for Improving Robustness in D2D-Based Social Networking Service
T2 - IEICE TRANSACTIONS on Communications
SP - 379
EP - 387
AU - Hanami YOKOI
AU - Takuji TACHIBANA
PY - 2022
DO - 10.1587/transcom.2021WWP0001
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E105-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2022
AB - In this paper, for improving the robustness of D2D-based SNS by avoiding the cascading failure, we propose an autonomous decentralized friendship management called virtual temporal friendship creation. In our proposed virtual temporal friendship creation, some virtual temporal friendships are created among users based on an optimization problem to improve the robustness although these friendships cannot be used to perform the message exchange in SNS. We investigate the impact of creating a new friendship on the node resilience for the optimization problem. Then we consider an autonomous decentralized algorithm based on the obtained results for the optimization problem of virtual temporal friendship creation. We evaluate the performance of the virtual temporal friendship creation with simulation and investigate the effectiveness of this method by comparing with the performance of a method with meta-heuristic algorithm. From numerical examples, we show that the virtual temporal friendship creation can improve the robustness quickly in an autonomous and decentralized way.
ER -
English
