Abstract
Computer‐supported collaborative learning (CSCL) is a learning strategy that gathers students together on campus through mobile application software on intelligent handheld devices to carry out creative exploration learning activities and social interaction learning activities. 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. 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. Firstly, the concept of credibility in campus opportunistic networks is proposed, and the calculation method of credibility is also presented. Next, the problem of node initialization starvation is solved in this paper. The node initialization starvation phase of collaborative learning is defined and resolved in campus opportunistic networks. Based on the information of familiarity and activity between nodes formed in the process of continuous interaction, a learning resource diffusion mechanism based on node credibility is proposed. Finally, the paper proposes a complete learning resource diffusion algorithm based on credibility for computer‐supported collaborative learning (LRDC for short) to improve the delivery success rate of learning resources on the campus. Extensive simulation results show that the average message diffusion success rate of LDRC is higher than that of classical 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 are also significantly better than these classical algorithms.
Highlights
Collaborative learning (CL) is a strategy that organizes some learners to form some groups or teams to carry out learning tasks [1]
To solve the aforementioned problem, this paper mainly studies the diffusion of learning resources in campus opportunistic networks based on credibility for Computer-supported collaborative learning (CSCL)
This paper studies the diffusion of learning resources in campus opportunistic networks based on credibility for CSCL
Summary
Collaborative learning (CL) is a strategy that organizes some learners to form some groups or teams to carry out learning tasks [1]. 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) 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) 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.