LRDC: Learning Resource Diffusion Based on Credibility for Computer-Supported Collaborative Learning

Key Laboratory of Modern Teaching Technology, Ministry of Education, Xi’an 710062, China Key Laboratory of Intelligent Computing and Service Technology for Folk Song, Ministry of Culture and Tourism, Xi’an 710119, China Engineering Laboratory of Teaching Information Technology of Shaanxi Province, Xi’an 710119, China Xi’an Key Laboratory of Culture Tourism Resources Development and Utilization, Xi’an 710062, China School of Computer Science, Shaanxi Normal University, Xi’an 710119, China


Introduction
Collaborative learning (CL) is a strategy that organizes some learners to form some groups or teams to carry out learning tasks [1]. In order to achieve the learning goal, all members of a collaborative learning group work together as a team to solve problems. The individual in a collaborative learning group can share learning resources with other members in the group, or with students outside the group. With the continuous innovation of educational ideology, the idea of collaborative learning has been applied more and more widely, because it can better reflect the learner-centred educational ideology. In the process of group cooperation and interaction between learners, learners' participation and problem-solving skills are improved. Collaborative learning enhances the learning efficiency of individuals and the cohesion of the team in the collaborative group, which is also advantageous to enhancing learners' social skills. Therefore, CL is an effective way to improve learning efficiency.
Computer-supported collaborative learning (CSCL) is a learning strategy that gathers students together through mobile application software on intelligent handheld devices and promotes learners to carry out creative exploration activities and social interaction activities [2,3]. Learning resource diffusion is a very important constituent part of CSCL mobile software. However, learners will receive or forward a large number of learning resources such that short video, images, or short audio which will increase the energy consumption of forwarding nodes and reduce the message delivery success rate. How to improve the message delivery success rate is an urgent problem to be solved. This is the motivation of this paper.
To solve the aforementioned problem, this paper mainly studies the diffusion of learning resources in campus opportunistic networks based on credibility for CSCL. In campus opportunistic networks, learners who participate in collaborative learning can obtain the desired learning resources through the distribution and sharing of learning resources. Learning resource diffusion depends on the credibility of learners who participate in collaborative learning. However, the existing classical algorithms do not take into account the credibility between learners.
First of all, this paper presents the definition of campus opportunistic networks. Opportunistic network [4,5] is a kind of self-organizing network, which does not need a complete link between the source node and the destination node and uses the encounter opportunity brought by node movement to realize communication. The campus opportunistic network is a wireless self-organization network on campus, in which many learner nodes can participate in campus collaborative learning by using handheld smart devices. Every learner is a learner node participating in communication, and the communication manner depends on learner's community and the opportunistic networks formed by the information of the learners in the community.
Next, the concept of credibility in campus opportunistic network is proposed, and the calculation method of credibility is also presented in this paper. In campus opportunistic networks, learning resource diffusion is a very important constituent part for CSCL mobile software. In campus opportunistic networks, the learners who participate in collaborative learning can obtain the desired learning resources through the distribution and sharing of learning resources. Learning resource diffusion depends on credibility of learners who participate in collaborative learning. The diffusion of campus learning resources depends on the credibility between nodes. Because there is no credibility, resource diffusion between nodes is meaningless. However, the existing classical algorithms such as Epidemic [6], DirectDeliver [7], FirstContact [8], and SprayAndWait [9] do not take into account the credibility between learners. These algorithms are not suitable for resource diffusion on campus opportunistic network. This paper studies the diffusion of learning resources in campus opportunistic networks based on credibility for CSCL.
Then, this paper solves the problem of the node initialization starvation on campus opportunistic networks. Campus opportunistic networks have the characteristics of high node density, complex social relations among individuals and communities, and the complicated links among nodes. So, it is particularly difficult to select the suitable node to forward learning resources. The selection of the suitable forwarding node depends on community to which the learner belongs. The community difference between nodes is a key factor for selecting suitable forwarding nodes [10]. However, community difference among nodes is not significant in the early stage forming collaborative learning community. Therefore, it is difficult to select forwarding nodes in this stage. In this paper, in the early stage of community formation, the selection of forwarding nodes is called as the node initialization starvation stage of collaborative learning in campus opportunistic networks. In social networks, the current mainstream solutions of node initialization starvation problem focus on the problems of information overload, accuracy, and efficiency of recommendation. However, node initialization starvation problem of collaborative learning in opportunistic networks is quite different from that of mainstream social networks, because in the general social networks [11], there will be no message forwarding delay which caused by insufficient contact between mobile nodes. Therefore, the solution of node initialization starvation problem in the general social networks cannot be directly applied to campus opportunistic networks.
Finally, for node initialization starvation problem, this paper defines the node initialization starvation stage of collaborative learning in campus opportunistic networks and proposes LRDC algorithm. In the early stage of collaborative learning in campus opportunistic networks, the effective information collected by mobile learner nodes is less, and the community formed is relatively unstable. In order to obtain the effective information of nodes in the community as soon as possible, complete the information transmission between nodes in the node initialization starvation stage, and improve the transmission efficiency of learner nodes, this paper defines the node initialization starvation stage of collaborative learning in campus opportunistic networks.
In this paper, activity and familiarity are comprehensively considered as credibility to select forwarding nodes. According to the rule of node movement, the process of learning resource diffusion is divided into node initialization starvation stage and community operation stage. A novel learning resources diffusion algorithm based on credibility named LRDC is proposed in this paper. For collaborative learning in campus opportunistic networks, the contributions of this paper are given as follows: (i) First of all, this paper defines the concept of campus opportunistic network and proposes the concept of 2 Wireless Communications and Mobile Computing credibility in campus opportunistic network and gives the calculation method of credibility, which is not found in other papers. According to the continuous interaction information between the learner nodes, the familiarity and activity of the nodes are calculated, the credibility of the nodes is accurately evaluated, and the diffusion of learning resources is completed efficiently based on the credibility (ii) Next, this paper effectively solves the problem of node initialization starvation. The learner node can quickly obtain the effective information of the node initialization starvation stage in the learning community, complete the information transmission between the nodes in the node initialization starvation stage, and improve the transmission efficiency (iii) Finally, this paper proposes a complete LRDC algorithm to diffuse learning resources on campus opportunistic networks and improve the delivery success rate of learning resources on the campus. An extensive simulation results show that the average message diffusion success rate of LDRC is higher than that of classic algorithms such as DirectDeliver, Epidemic, FirstContact, and SprayAndWait under the different transmission speed, buffer size, and initial energy, which is averagely improved by 46.83%, 44.43%, and 45.6%, respectively. The scores of LRDC in other aspects is also significantly better than these algorithms The rest of this paper is organized as follows. The second section introduces related work. The third section describes the starvation phase division of learner node initialization. The fourth section introduces modelling process of credibility degree for campus collaborative learning nodes. The fifth section describes the diffusion mechanism of learning resources in the collaborative learning environment of campus opportunity network. The sixth section carries on the simulation and the result analysis. At last, the seventh section summarizes the full paper.

Related Work
In order to solve the information transmission between the nodes in the node initialization starvation stage, researchers propose different routing algorithms for different situations. In social networks, initialization stage refers to the use of a large number of newly created services and these services of no usage records [12], the node initialization starvation problem can be divided into new project initialization starvation problem and new user initialization starvation problem [13]. In order to solve the node initialization starvation problem in social networks, Huang et al. proposed and implemented the prediction of the potential collaboration relationship between users and the relevant recommendation mechanism based on the model of service relationship [14]; Zhang et al. parsed user's demand information based on the LDA (latent Dirichlet allocation) model and keyword information to improve accuracy of the recom-mendation [15]. In social networks, the above mainstream solutions of the node initialization starvation problem are mainly aimed at providing customers with product information and suggestions and dealing with the problems of information overload, accuracy, and efficiency of recommendation and do not consider the node initialization starvation problem in collaborative learning opportunistic networks and the distribution and forwarding of learning resources with social intimacy and node influence. In campus opportunistic networks, the node initialization starvation problem refers to that in the initial stage of opportunistic network; due to the insufficient information of link connection and the delay in obtaining the information of each node, the interaction between nodes and data diffusion are blind, and the message delivery rate is low; at the same time, the transmission opportunity is wasted. Therefore, the above schemes are not suitable for collaborative learning opportunistic networks. This paper considers the node initialization starvation problem of campus collaborative learning opportunistic networks, make full use of contact information between nodes and the characteristics of nodes, and promote the efficient and rapid transmission of node information in the campus collaborative environment.
In the opportunistic network, relevant scholars have carried out a series of explorations on familiarity and activity of nodes. For example, Wang et al. [16] calculated the node activity according to the area covered by moving trajectory of the node and the average dwell time of the node. Feng et al. [17] proposed a delayed back off algorithm based on the active state of neighbour nodes; in the algorithm, the delayed back off window is adaptively adjusted according to the active number of neighbour nodes. Rao et al. [18] considers the link similarity of nodes according to the node link condition in k-hop. The LFM algorithm proposed by Lancichinetti et al. [19] is based on the consideration of the similarity between the feature of nodes in contact with each other. However, these algorithms are not suitable as the diffusion mechanism of collaborative learning resources in campus opportunistic networks.
Among the classical algorithms in opportunistic networks, Amin and David [6] proposed a flooding algorithm named Epidemic similar to the spread of infectious diseases. When two nodes meet, they exchange packets carried by each other. This algorithm has large network load and poor scalability. Shah et al. [7] proposed an algorithm named DirectDeliver that the source node forwards the data only when it meets the destination node. This algorithm has poor performance in delivery rate and delay. Zhao et al. [8] proposed FirstContact algorithm that the source node forwards the data to the meeting node, and then, these mobile nodes forwarded the data to the destination node. Spyropoulos et al. [9] proposed SprayAndWait algorithm to limit the number of data backup. When the number of data backup in the network reaches a certain value, the data will stop spreading and adopt the strategy of direct waiting. The above algorithms have defects in message delivery rate and delivery delay, and they all do not consider credibility between learners in campus opportunistic networks. Therefore, this paper proposes LRDC algorithm to solve the problem of learning resource diffusion based on creativity for computer-supported collaborative learning, and after 3 Wireless Communications and Mobile Computing verification in extensive simulation results, LRDC is better than these classical algorithms.

The Learner Node Initialization Starvation Phase
In the mobile social network, a single learner node is used as a unit for message transmission. Therefore, in the collaborative learning community based on mobile social networks, the running process of the network can be divided into two phases such as the node initialization starvation phase and the normal operation phase according to the communication situation of a single node. In the campus, the learner nodes are denser, and every learner's daily schedule has more obvious regularity and shows more obvious characteristics of group activities, so the community between learner nodes is more obvious. Campus collaborative learning community is a virtual learning organization in which students participate in groups to maximize the acquisition results under a certain incentive mechanism. In the learning community, students cooperate each other based on their own will and the common goal.
As previously mentioned, in the early stage of collaborative learning in campus opportunistic networks, the effective information collected by mobile learner nodes is less, and the formed community is relatively unstable, so this paper will divide the running process of campus opportunistic networks into two phases: the node initialization starvation phase and the normal operation phase.
The node initialization starvation phase is the phase in which the community of the node is in an unstable state. When the community of a learner node is in a stable state, it can be considered that the node initialization starvation phase will end.
Adjacency matrix is the most suitable data structure to express social network relation, NS represents the set of the number of encounters between two nodes, the element NS ij indicates the number of encounters between node i and node j. For any node i, set the initial value of its signal Sig i = n − 1 (n is the upper limit of the number of students in the campus collaboration network), initial queue, initial matrix, and other parameters are maintained (as shown in Table 1).
Next, we show how to determine whether the community in which the node is located is stable, that is, the node initialization starvation phase ends. Firstly, we introduce the initialization adjacency matrix to represent the encounter situation between nodes in the starvation initialization phase. The formation process of the initialization adjacency matrix is as follows: Case 1. When node p encounters to node q and the signal value of node p (p can be any node) and the signal value of node q are not greater than 0, the signal values of p and q will not be changed.

Case 2.
When the signal value of node p is greater than 0 (p can be any node) and node p encounters to node q whose signal value is greater than 0, the signal value of node p and node q are subtracted by one, and the signal value of node q in node p's signal queue is increased by one, simultaneously, and the signal value of node p in node q's signal queue is also increased by one.
Case 3. When the signal value of node p is not greater than 0 (p can be any node), and node p encounters to node q whose signal value is greater than 0: (a) If the queue of node p does not contain node q, the signal value of node p will be kept original, and the node q will be added to the queue of node p, and the signal value of the node q in the node p's queue will be added by one. At the same time, node p is added to the queue of node q, the signal value of node q is subtracted by two, and the signal value of node p in node q's queue is added by one (b) If the initial queue of node p contains node q, the signal value of node q in node p's signal queue is increased by one, and the signal value of node p in node q's signal queue is added by one, and the signal value of node q itself is subtracted by two Case 4. When the signal value of node p is greater than 0 (p can be any node), and node p encounters to node q whose signal value is not greater than 0, node p and node q do nothing. When the signal values of all nodes are less than or equal to 0, the initialization phase is completed. At this time, we need to further judge through the community modularity.
In this section, we use modularity which is a common method to measure the stability of network community to detect the initial communities [20,21]. The definition of community modularity Q is as follows: where m is the total number of edges in the network, d i and d j , respectively, represent the degree of node i and node j. NS ij represents the number of encounters between node i and node j; if there is no encounter between node i and node j, the value of NS ij is 0; otherwise, it is equal to the number of encounters. c i represents the community where node i is located, and c j represents the community where node j is located. If node i and node j are in the same community, the value of εðc i , c j Þ is 1; otherwise, εðc i , c j Þ is 0. In this scenario, c i and c j are unknown, so the value of εðc i , c j Þ cannot be confirmed, but it can be deduced according to the number of encounters between node i and node j. If the number of encounters between node i and node j is greater than the average number of encounters between node i and all other nodes in the community, it indicates that node i and node j are in the same community.
Take node i as an example, and the number of encounters between node i and node j is 5, and the average number of encounters between node i and all initial nodes is 2; it is obvious that node i and node j are in the same community.
The value range of Q is [0, 1], but in the actual network, the value of Q is usually between (0.3, 0.7) [22,23]. So, in this paper, we set that when the Q value is greater than 0.3, the node starvation phase ends, and the network is in a relatively stable community.
This paper simulates and calculates the value of modularity in campus collaborative learning community, and through calculation, it is concluded that the Q is greater than 0.3. At this point, it is determined that the community is in a stable state and obtained the following initialization matrix NS which represents the community network structure.

Model for Credibility between Nodes
In this section, we introduce the concept of credibility between nodes. This concept serves as a metric for selecting the next forwarding node in the normal operation phase. In this section, there basic variables are shown in Table 2.
Matrix A i 1 represents the adjacency relationship between nodes in the community with the node i 1 as the center node. Suppose that A i 1 based on the above NS is given as follows.
Taking the adjacency matrix of aforementioned community network structure NS as an example, suppose that node i 1 carries messages, and nodes i 1 and i 6 are candidate transmission nodes. The matching matrix for node i 6 to node i 1 is calculated as follows: the number of rows and columns of matrix A i 6 &i 1 is the same as that of A i 1 , and if there is a nonzero element in matrix A i 1 and its corresponding position in matrix A i 6 is also a nonzero element, then the value of the element at that position in matrix A i 6 &i 1 is the same as that ; otherwise, the value is 0 in matrix A i 6 &i 1 . In the same way as above, based on A i 6 &i 1 and A i 7 , the matching matrix A i 7 &ði 6 &i 1 Þ can be obtained. For example, the matching matrix A i 6 &i 1 and A i 7 &ði 6 &i 1 Þ are as follows: 4.1.2. Familiarity between Nodes. In this section, this paper calculates the social familiarity between nodes through the situation of nodes' common neighbors. The familiarity between node i and node j is to be calculated as follows: where FD ij is the familiarity between node i and node j and S N ij is the proportion of the common neighbors of nodes i and j to all the nodes contacted by nodes i and j, and SC ij is the link contribution of the common neighbors of nodes i and node j to nodes i and j. WE ij is the edge weight between node i and node j , and S i is the sum of the weights of all edges connected to node i . The edge strength ES ij is defined as the ratio of WE ij to the sum of S i and S j . The calculations of SN ij , ES ij , and SC ij are shown in formulas (5), (6), and (7), respectively.
In formula (7), c is any node in the set of common neighbor nodes of nodes i and j, i Asb is the direct node set of node i, A c&ði&jÞ is the matching matrix of c for nodes i and j, and kA c&ði&jÞ k 2 F represents the F-norm of the matrix A c&ði&jÞ . It can be considered that the larger the SC ij is, the higher the contribution of the shared neighbor nodes to the links of nodes i and j. Let us take adjacency matrix NS in Section 3 as an example to calculate the familiarity between node i 1 and node i 6 .
Wireless Communications and Mobile Computing 4.2. Activity of Node. In the early stage of learning community in campus opportunistic networks, because any node does not contain or only contains less communication characteristic information of other nodes, when any node needs to send messages, it cannot select the forwarding node correctly according to the node information table it maintains, which will cause a lot of contact opportunity waste, message redundancy, and the increase of message transmission delay. When the node in initialization starvation phase performs message transmission, it will select the next hop node by comprehensive consideration of its activity and familiarity.
When calculating the activity of node i (marked as AD i ), the value of AD i can be divided into direct contact degree AD dir i and indirect contact degree AD rel i as shown in formula (9); AD dir i represents the ability that node i contacts directly other nodes, and AD rel i reflects the ability that node i to contact indirectly other nodes through its direct neighbors, as shown in the formulas (10) and (11), respectively. In formula (11), NS ijðcÞ represents the number of times that node j contacts the common neighbors of node i and node j, and it can be calculated by formula (12).
4.3. Credibility of Nodes. In order to solve the problem of finding learning resources for learners in collaborative learning environment, this paper proposes a learning resource diffusion strategy based on credibility for computer-supported collaborative learning. According to common sense, a node that you are familiar with and active, you will believe that it has the ability to spread messages. So, a learner node wants to forward its learning resources as soon as possible; it needs to find a node that is familiar with it and highly active. Therefore, the paper defines the credibility as the weighted sum of familiarity and activity (as shown in formula (13)). The credibility of nodes i to j is denoted C ij , in particular, C ij and C ji are not necessarily equal. AD j is the activity of node j, the familiarity between nodes i and j is represented by FD ij , and θ represents the weight coefficient.
This paper uses formula (14) to normalize the value of C ij , where max and min represent, respectively, the maximum and minimum values of credibility.

Learning Resource Diffusion Algorithm Based on Credibility
In the context of collaborative learning on campus, the movement of learners' nodes has strong regularity and community. Based on the initialization process of node starvation phase proposed in Section 3 and the calculation method of credibility proposed in Section 4, this section proposes LRDC (learning resource diffusion based on credibility) algorithm and discusses the learning resource diffusion strategy in cooperative learning community as follows.
For any node i, establish direct contact node linked list ψ i all = ði, c 1 , c 2 , ⋯, c m , d 1 , d 2 , ⋯, d n Þ, community node linked list ψ i com = ði, c 1 , c 2 , ⋯, c m Þ, and noncommunity node linked list ψ i dir = ði, d 1 , d 2 , ⋯, d n Þ, respectively. In ψ i all , c i ði = 1, 2, ⋯, mÞ indicates the node whose contact times with node i is greater than the average contact number between node i and all nodes, and c i ði = 1, 2, ⋯, mÞ will be added to the community node linked list ψ i com ; d j ðj = 1, 2 , ⋯, nÞ indicates the node whose contact times with node i is not greater than the average contact number between node i and all nodes, and d j ðj = 1, 2, ⋯, nÞ will be added to the community node linked list ψ i dir .
The first element in the above each linked list is the central node i, and the other elements are sorted according to the credibility of the node i to them from large to small. When the credibility is the same, they are sorted according to the times of contact with node i. When any two nodes contact each other, they update their node linked lists according to the contact information of each other. The contact linked list representation of node i is shown in Figure 1.
Region 1 is the community node linked list of node i, region 2 is the noncommunity node linked list ψ i dir = ði, d 1 , d 2 , ⋯, d n Þ of node i and the community node linked list of each element except node i in ψ i com , and region 3 is the noncommunity node linked list of each element except node i in ψ i com .
According to the elements in the linked lists of region 2 and region 3, the matrices A id and A ic are established, respectively, as follows: Taking node i as an example, the priority determination strategy for selecting forwarding nodes is as follows: the priority of nodes in the linked list ψ i com is the highest, the 7 Wireless Communications and Mobile Computing priority of nodes in A id matrix is the second, and the priority of nodes in A ic matrix is the lowest.
Suppose that node i is the sending node and j is the destination node. The routing and forwarding scheme is described as below: (1) If there is a destination node j in the community node linked list of node i, the node i's message is sent directly to the destination node j; otherwise, the matrix A ic and A id are traversed according to the priority order, respectively, and if the node j exists in matrix A ic or A id , the node i's message is forwarded to the destination node j by the corresponding relay nodes (2) If the situation in (1) does not occur, the message is not forwarded The LRDC algorithm is described in Figure 2.

Simulation and Result Analysis
6.1. Simulation Setup. In order to evaluate the performance of the algorithm described in this paper, ONE (Opportunistic Network Environment) simulator is used for experimental simulation. In this paper, the real dataset CRAWDAD dataset Cambridge/haggle [24] is used for simulation experiment, and the main experimental parameters are set as shown in Table 3.

The Evaluation on Message
Transmission. This section presents a set of experiments comparing the performance of LRDC, DirectDeliver, Epidemic, FirstContact, and SprayAnd-Wait and considering the effect of simulation time on the message delivery success rate, the average residual energy of nodes, and the average hops of message transmission. This section has two goals. The first goal is to quantify the effect of simulation time on the message delivery success rate; the second goal is to quantify the average residual energy of nodes and the average hops of message transmission after 90000 s simulation time. Set other main parameters of simulation environment to initialEnergy = 50000, buf f erSize = 100 MB, transmitSpeed = 150 KB/s, and msgtt l = 900 min; the simulation results are given in Tables 4  and 5.
For the first goal, with the increase of simulation time, the success rate of message delivery of five routes is increasing continuously. And in the same simulation time period, LRDC's message delivery success rate is the highest among the five routing algorithms. It can be seen that LRDC can consume less energy and deliver messages to the destination node at a faster speed without causing message redundancy when the community of the node is not fully mature, and its delivery time can approach the theoretical limit.
For the second goal, this section has three subgoals. For the first subgoal, the higher the average residual energy, it indicates that the performance of routing algorithm is better. It can be seen from Table 5 that the average residual energy of DirectDeliver is the highest, but the routing algorithm is not suitable for the campus collaborative learning situation based on opportunistic network. The average residual energy of SprayAndWait and LRDC is also high, but the average delay of message transmission of SprayAndWait is poor. For the second subgoal, the shorter the average delay time of message transmission, it indicates that the performance of routing algorithm is better. It can be seen from Table 5 that the average delay time of message transmission of Epidemic is the shortest and that of LRDC is also shorter, but the average residual energy of nodes of LRDC is much higher than that of Epidemic. For the third subgoal, the lower the average hops of message transmission, the lower the network overhead; it indicates that the performance of routing algorithm is better. The average hops of message It can be seen from Tables 4 and 5 that the performance of LRDC, the average delay of message transmission, and the average hop number of message transmission are the best, so the performance of LRDC is the best.
This paper uses data normalization to process Table 5  and get the normalized score table in Table 6. Data  9 Wireless Communications and Mobile Computing normalization is as follows: because the higher the average residual energy, it indicates that the performance of routing algorithm is better. This paper uses formula (16) to deal with the data of the average residual. Because the shorter the average delay time of message transmission, it indicates that the performance of routing algorithm is better. Because the lower the average hops of message transmission, the lower the network overhead, it indicates that the performance of routing algorithm is better. This paper uses formula (17) to deal with the data of the average delay and the average hops. This section uses max and min to represent the maximum and minimum values of five kinds of routing data, respectively. For the calculation of total score, we use formula (18) to deal with it. The higher the total score, the better the routing algorithm performance. It can be seen from Table 6 that the LRDC has the highest total score, so the performance of LRDC is the best.
Total score = TNARE + TNAD + TNAH, This paper uses data normalization to process Table 7 and uses formula (16) to deal with the data of the RECMSR (ratio of energy consumption to message delivery success rate). And define the following formula:

RECMSR =
the average success delivery rate 5000-the residual enery : ð19Þ As can be seen from Table 7, when TTL is less than 400 min, the impact on each routing algorithm is greater. When TTL is greater than 400 min, the performance of each routing algorithm is gradually stable. Combining with Table 5, it can be seen that the message transmission delay of LRDC and Epidemic is the lowest. Since the message transmission delay of the FirstContact is the highest, the change of TTL also has a great influence on it. The change of TTL also has a great impact on FirstContact, and has little impact on LRDC and Epidemic. The higher the normalized RECMSR, the better the routing algorithm performance. Among them, the normalized RECMSR of LRDC is the highest, so the performance of LRDC is the best.

The Effect of Transmission Speed on LRDC Message
Delivery Success Rate. Set other main parameters of simulation environment to initialEnergy = 50000, buf f erSize = 100 MB, and msgTtl = 900 min, the effect of transmitSpeed on LRDC was tested. The simulation results are as follows.
This section presents a set of experiments comparing the performance of LRDC, DirectDeliver, Epidemic, FirstContact, and SprayAndWait and considering the influence of transmission speed on message delivery success rate.
It can be seen from Table 8 that when the transmitSpeed is less than 50 kb/s, the impact on LRDC, DirectDeliver, Epidemic, FirstContact, and SprayAndWait is greater than that on DirectDeliver. When the transmitSpeed is greater than 50 kb/s, the performance of each routing algorithm gradually stabilizes. It can be seen from Table 5 that the DirectDeliver has less hops for message delivery. It directly transmits the message to the destination node. Therefore, when the trans-mitSpeed is limited, the effect on the DirectDeliver is low, but the overall performance of the routing algorithm is poor.
Relative promotion ratio = the difference average success delivery rate between LRDC and R the average success delivery rate of R :  The higher the average success rate, the better the routing algorithm performance. For the calculation of relative promotion ratio, we use formula (20) to deal with it. R is any of the four routing algorithms of DirectDeliver, Epidemic, FirstContact, and SprayAndWait. Among them, the average success rate of LRDC is the highest, it can be seen that the performance of LRDC is the best, and the average relative promotion ratio is 46.83%.
6.5. The Effect of BufferSize on LRDC Message Delivery Success Rate. Set other main parameters of simulation environment to initialEnergy = 50000, transmitSpeed = 150 KB/ s, and msgTtl = 900 min, the effect of bufferSize on LRDC was tested. The simulation results are as follows. This section presents a set of experiments comparing the performance of LRDC, DirectDeliver, Epidemic, FirstContact, and SprayAndWait and considering the effect of bufferSize on message delivery success rate.
It can be seen from Table 9 that bufferSize has a greater effect on LRDC, Epidemic, and SprayAndWait, while it has less effect on Epidemic and FirstContact. The higher the average success rate, the better the routing algorithm perfor-mance. For the calculation of relative promotion ratio, we use formula (20) to deal with it. R is any of the four routing algorithms of DirectDeliver, Epidemic, FirstContact, and SprayAndWait. Among them, the average success rate of LRDC is the highest, it can be seen that the performance of LRDC is the best, and the average relative promotion ratio is 44.43%.
6.6. The Effect of Initial Node Energy on LRDC Message Delivery Success Rate. Set other main parameters of simulation environment to buf f erSize = 100 MB, transmitSpeed = 150 KB/s, and msgTtl = 900 min, the effect of initialEnergy on LRDC was tested. The simulation results are as follows. This section presents a set of experiments comparing the performance of LRDC, DirectDeliver, Epidemic, First-Contact, and SprayAndWait and considering the effect of initialEnergy of nodes on message delivery success rate.
It can be seen from Table 10 that when the initialEnergy is less than 20000, all routing algorithms will be greatly affected; when the initialEnergy is greater than 20000, the performance of each routing algorithm will gradually stabilize. The lower initialEnergy has the greatest effect on the    Table 5 that the average energy consumption of nodes using Epidemic is higher, which is mainly because nodes routing by Epidemic will transmit all messages to all contact nodes, because it will cause a great waste of energy. The higher the average success rate, the better the routing algorithm performance. For the calculation of relative promotion ratio, we use formula (20) to deal with it. R is any of the four routing algorithms of DirectDeliver, Epidemic, FirstContact, and SprayAndWait. Among them, the average success rate of Epidemic is the highest, but it can be seen from Table 5 that the average energy consumption of nodes using Epidemic is higher, and nodes routing by Epidemic will transmit all messages to all contact nodes, so the performance of LRDC is still the best, and the average relative promotion ratio is 45.6. 6.7. Summary of Experiment Results. In the above simulation experiments, we can see that the proposed LRDC algorithm has achieved good experimental results. The reason is that this paper considers the concept of credibility between nodes in the campus opportunistic network, and effectively solves the problem of resource diffusion in the stage of node starvation. The higher credibility between nodes, the more easily the spread resources are accepted and forwarded by each other. It can effectively improve the message delivery rate of the whole network and reduce the redundancy of messages and the delay of message delivery and the energy consumption of nodes.

Conclusions
The campus opportunistic networks are that many learner nodes use handheld smart devices and participate in campus collaborative learning. In the campus opportunistic network, the LRDC algorithm is proposed to solve the stability problem of initialization node community and the diffusion problem of learning resources. After a large number of simulation experiments, the comparison results between the proposed LDRC algorithm and the classical algorithms DirectDeliver, Epidemic, FirstContact, and SprayAndWait are as follows: in aspects of average delay and the average hop number, the performance of LDRC is the best; in aspect of RECMSR, LRDC is the highest; in addition, when the transmission speed is the same, LRDC is the best in terms of message delivery success rate, and the average relative promotion ratio is 46.83%. When the buffer size is same, the average success rate of LRDC is also the highest, and the average relative promotion ratio is 44.43%. This paper solves the initialization and stability problem of node community and the diffusion problem of learning resources.

Conflicts of Interest
The authors declare that they have no conflicts of interest.

Authors' Contributions
Peng Li, Yuanru Cui, and Qian Liu contributed equally to this work.