Modified Dijkstra's Routing Algorithm for Security with Different Trust Degrees

Abstract

A great number of efficient methods to improve the performance of the networks have been proposed in physical-layer security for wireless communications. So far, the security and privacy in wireless communications is optimized based on a fixed assumption about the trustworthiness or trust degrees (TD) of certain wireless nodes. The nodes are often classified into different types such as eavesdroppers, untrusted relays, and trusted cooperative nodes. Wireless nodes in different networks do not completely trust each other when cooperating or relaying information for each other. Optimizing the network based on trust degrees plays an important role in improving the security and privacy for the modern wireless network. We proposed a novel algorithm to find the route with the smallest total transmission time from the source to the destination and still guarantee that the accumulated TD is larger than a trust degree threshold. Simulation results are presented to analyze the affects of the transmit SNR, node density, and TD threshold on different network performance elements.

Security for Multi-hop Communication of Two-tier Wireless Networks with Different Trust Degrees

“…As of now, wireless communications security and privacy are maximized based on a predetermined belief in the dependability of the wireless nodes. According to [12]- [14], they are frequently divided into several sorts, such as eavesdroppers, untrusted relays, and trusted cooperative nodes [15]. However, a node's trustworthiness or TD may not always be obvious and is heavily influenced by the social connections between its users and those of legitimate nodes (such as friendship in social networks) [16]- [18].…”