Abstract
In opportunistic complex networks, information transmission between nodes is inevitable through broadcast. The purpose of broadcasting is to distribute data from source nodes to all nodes in the network. In opportunistic complex networks, it is mainly used for routing discovery and releasing important notifications. However, when a large number of nodes in the opportunistic complex networks are transmitting information at the same time, signal interference will inevitably occur. Therefore, we propose a low-latency broadcast algorithm for opportunistic complex networks based on successive interference cancellation techniques to improve propagation delay. With this kind of algorithm, when the social network is broadcasting, this algorithm analyzes whether the conditions for successive interference cancellation are satisfied between the broadcast links on the assigned transmission time slice. If the conditions are met, they are scheduled at the same time slice, and interference avoidance scheduling is performed when conditions are not met. Through comparison experiments with other classic algorithms of opportunistic complex networks, this method has outstanding performance in reducing energy consumption and improving information transmission efficiency.
Highlights
With the development of mobile communications in recent years, opportunistic complex networks appear in people’s vision. e difference between opportunistic complex networks and the traditional mesh network mainly lying in their nodes deployment is not uniform, the network size and initial location of the nodes are not set in advance, and there is no need for a complete path between the source node and the target node [1,2,3,4]
When data are transmitted from the source node to other nodes in the network through broadcast, in many cases, it is desirable that the broadcast delay can be as low as possible [7]. erefore, research on a low-latency broadcast algorithm is of great theoretical significance and practical application value for the study of information transmission in opportunistic complex networks [15, 16]
In order to better judge its performance, EDTC will be compared with four other algorithms: ICMT [1], SECM [47], Spray and Wait routing algorithm [36], and greedy broadcast algorithm (GreedyA) algorithm. e following is an introduction to the principles of these algorithms: (1) ICMT: this algorithm is an information cache management and transmission algorithm based on node data information cache
Summary
With the development of mobile communications in recent years, opportunistic complex networks appear in people’s vision. e difference between opportunistic complex networks and the traditional mesh network mainly lying in their nodes deployment is not uniform, the network size and initial location of the nodes are not set in advance, and there is no need for a complete path between the source node and the target node [1,2,3,4]. With the development of mobile communications in recent years, opportunistic complex networks appear in people’s vision. Because people always move with these mobile devices, these devices have random mobility [11, 12] In this way, they can be regarded as a social node, and the community can be established through the relationship between the nodes [13, 14]. When data are transmitted from the source node to other nodes in the network through broadcast, in many cases, it is desirable that the broadcast delay can be as low as possible [7]. Erefore, research on a low-latency broadcast algorithm is of great theoretical significance and practical application value for the study of information transmission in opportunistic complex networks [15, 16] When data are transmitted from the source node to other nodes in the network through broadcast, in many cases, it is desirable that the broadcast delay can be as low as possible [7]. erefore, research on a low-latency broadcast algorithm is of great theoretical significance and practical application value for the study of information transmission in opportunistic complex networks [15, 16]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
