Copy Adaptive Routing Algorithm Based on Network Connectivity in Flying Ad Hoc Networks

The Flying Ad Hoc Network (FANET) is a kind of mobile network which is composed of flying UAVs (Unmanned Aerial Vehicles) as network nodes. With the high node mobility and dynamic topology, data transmission in FANETs is faced with severe challenges, such as unstable communication links and limited resources in the network. Due to the uncertainty of node encounters, data transmission is usually carried out by opportunistic transmission. However, the opportunistic delivery of data using multicopy routing not only consumes a large amount of network resources but also causes too much transmission overhead and low delivery quality. Thus, this paper designs a connectivity-based copy adaptive transmit routing algorithm (CCAT). Considering the network interruptions caused by high-speed node movement, CCAT makes packet forwarding decisions by estimating network connectivity and uses node transmit prediction value as forwarding utility value to control the number of copies of packets. Simulation results show that the delivery rate of CCAT can be improved by about 30% at the peak compared with traditional multicopy routing strategies and the transmission latency of CCAT is minimal.

VideoOR: A Quality Oriented Replication Scheme for Video Opportunistic Transmission

With the development of various mobile social applications, video data has already occupied a dominant proportion of mobile Internet traffic, and is still growing rapidly, which not only brings economic pressure to users, but also causes traffic explosion on Internet. Data delivery through mobile opportunistic networks is regarded as an efficient way to deal with this problem. But, due to the characteristics of video data and the mode of multi-copy routing, video opportunistic delivery will consume large amount of network resources, resulting in excessive transmission overhead and lower delivery quality. Fortunately, the strong aggregation of human activity gives us some inspiration, which can provide more space of deep optimization on video opportunistic transmission. Thus, in this paper, taking fully advantage of the connectivity of cluster formed by the gathering crowds, we propose a Video Opportunistic Replication scheme based on multi-player cooperative games, named VideoOR, which can achieve the double optimizations of transmission overhead and video delivery quality by scheduling the replication and forwarding of video packets under the guidance of Nash Equilibrium solution. Extensive simulations have been done based on the synthetic and real mobility traces, and the results show that our scheme can maximize the quality of reconstructed video and minimize the average replication times of each video packet.

Effective Data Transmission Based on Path Prediction in Opportunistic Social Networks

With the development of social media, social networks have become an important platform for people to share and communicate. In social network communication, each participant can only pass information correctly if we find the goal of our communication. In other words, when people carry mobile devices for data transmission, they need to find a definite transmission destination to ensure the normal conduct of information exchange activities. In social networks, this is manifested in the process of data transmission by nodes, which requires analysis and judgment of surrounding areas, and finds suitable nodes for effective data classification and transmission. However, the node cache space in social networks is limited, and the process of waiting for the target node will cause end-to-end transmission delay. In order to improve such a transmission environment, this paper proposes a node trajectory prediction method named EDPPM algorithm. This algorithm can guarantee that nodes with high probability are given priority to obtain data information, which realized an effective data transmission mechanism. Through experiments and comparison of opportunistic transmission algorithms in social networks, such as Epidemic algorithm, Spray and Wait algorithm, and PRoPHET algorithm, our algorithm can improve the cache utilization of nodes, reduce data transmission delay, and improve the overall network efficiency.

The study of chained routing algorithm for WNS based on group perception

In order to effectively solve the problem of routing efficiency in wireless sensor networks, a new chained routing algorithm based on group perception is proposed in this paper. First, the performance index parameters such as energy consumption and area coverage are given. Meanwhile, a chained routing strategy based on node utility value is established, which combines the “storage-carrying-forwarding” opportunistic transmission mode and decides whether a message needs to be forwarded to an encounter node according to a message forwarding strategy. Finally, the key factors affecting the chained routing algorithm are studied through simulation experiments. The results show that compared with random routing, the chained routing algorithm has great advantages in message delivery rate, collision probability, accuracy, etc.