Đang chuẩn bị liên kết để tải về tài liệu:
Modified dijkstra’s routing algorithm for security with different trust degrees

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG Tải xuống

A great number of efficient methods to improve the performance of the networks have been proposed in physicallayer 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. |