.png){kind=icon}
.png){kind=icon}
Return
RAPAR: Routing algorithm based on node relationship mining in opportunistic network
.png){kind=icon}
PRE
AI
DOI：10.1007/s12083-022-01331-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Information-assisted routing algorithms improve the performance of mobile opportunistic networks (MONs), where node utility and packet redundancy are used in the data forwarding process. Making a tradeoff between the forwarding performance and network overhead is the key problem in MONs. In this study, we propose a multiple-copy routing scheme based on node relationship mining. This scheme considers the influence of the difference and dynamic variability of the relationship between nodes on the routing packets. First, it uses the complex contact information of the nodes to reflect the social relationship of the nodes. Second, to further reduce the network overhead, the relationship model is constructed using the Apriori algorithm to calculate the social forwarding utility of the node. The experimental results show that the proposed scheme can achieve better network performance. This effectively reduces the network overhead on the premise of higher delivery rate and lower transmission delay.
Keywords:
Apriori
Opportunistic networks
Routing algorithm
Social relationship
Journal
IF:
2.6
Papers:
2.2K
Citations:
2.9K