A Wireless Mesh Opportunistic Network Routing Algorithm Based on Trust Relationships

Abstract

To solve the problem of low message delivery rate and high network resource consumption when forwarding messages in opportunistic networks, an opportunistic routing algorithm based on trust relationships for wireless mesh networks is proposed. Firstly, the wireless mesh network is analyzed and the opportunistic routing model is constructed; By analyzing the security mechanism and security threat of communication entities, then measuring the trust degree of links and nodes, establishing the trust relationship between nodes, and defining and quantifying a new security measurement method based on the trust model; Finally, according to the security measurement method defined by the model, select the node with high trust value to participate in the message forwarding process. At the same time, give priority to the node with greater trust with the destination node as the relay node, and allocate the message copy according to the trust degree to make the message pass along the direction of increasing trust, to complete the design of opportunistic routing algorithm in wireless mesh networks. Experimental results show that the routing algorithm can effectively improve the message delivery rate, up to about 95%, and reduce the consumption of network resources.

Energy-Efficient Opportunistic Routing Algorithm for Post-Disaster Mine Internet of Things Networks

“…DDA divides the nodes in the CFS into different fully connected relay networks and chooses the most appropriate relay network based on the multi-attribution decision-making (MADM) theory. Zhao et al [ 24 ] proposed an opportunistic routing algorithm based on trust relationships for wireless mesh networks (WMNs) to solve the problem of low message delivery rate and high network resource consumption when forwarding messages in opportunistic networks. Li et al [ 25 ] proposed an efficient and reliable transmission power control-based opportunistic routing (ERTO) for wireless ad hoc networks to improve packet delivery probability and reduce energy consumption and network interference.…”

“…However, ORR, OBRN, and ECSOR only consider the energy and load factors to make routing decisions. When encountering void nodes, a large number of control packets need to be sent to update network information to calculate a new forwarder set, which leads to a higher probability of packet loss; see Formula (24). As a result, the DEOR algorithm outperforms the other three algorithms in terms of PDR.…”

Exploring Trust Modeling and Management Techniques in the Context of Distributed Wireless Networks: A Literature Review

“…Along with energy, resource consumption poses an additional significant criteria while working with sensors. This constraint was prioritised by Zhao and Srivastava [120], where an opportunistic trust-based routing algorithm was proposed. The intrusion detection aspect on routing protocols was approached by two works.…”

An Intelligent Routing for Internet of Things Mesh Networks

“…In many applications, a vast generation of data from WSN causes substantial strain on their delivery, so data fusion is increasingly becoming an essential part of routing to reduce redundancy. 57 Alam et al 58 describe multi-domain data fusion and classify it into various categories concerning the type of data and target. Yadav and Chitra 59 proposed a modern data collection system called the tree-based fusion technique (TBFT).…”