A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy. (3rd March 2021)

• Record Type: Journal Article
• Authors: Xu, Gang; Wang, Xinyue; Zhang, Na; Wang, Zhifei; Yu, Lin; He, Liqiang
• Other Names: Zhou Zhili Academic Editor.
• Is Part Of: Wireless communications and mobile computing. Volume 2021(2021)
• Publication Date: 2021-03-03
• Subjects: Wireless communication systems -- Periodicals; Mobile communication systems -- Periodicals; 621.38205
• DOI: 10.1155/2021/6666211
• Languages: English
• ISSNs: 1530-8669

Abstract

Abstract : Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.