Privacy Improvement Of Opportunistic Network Routing

Please enable javascript in your browser.

Shahamat Naderi, Mona | 2021

546 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 54069 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Movaghar, Ali
Abstract:
Opportunistic delay tolerance networks are widely used networks that do not require infrastructure. Many routing algorithms have been proposed for these networks in which nodes need to compare their metrics (such as visit frequency, node geographical location, etc.)Therefore, routing in these networks has a high security risk and the possibility of violating privacy. There are many ways to protect privacy, but these methods have limitations: some are limited to vehicles and some are limited to social networks and node communities. Also, more general methods require a lot of complexity, including processing time, storage resources, and key management.In this study, we propose a method with low time complexity and without the need for memory, which at the same time preserves the privacy of the nodes. Nodes should be kept private and the best node may not be identifiable by the metric used
Keywords:
Routing Algorithm ; Routing ; Privacy ; Opportunistic Networks ; Privacy Preserving