Visible to the public Biblio

Filters: Keyword is source location privacy routing schemes  [Clear All Filters]
2020-10-26
Mutalemwa, Lilian C., Seok, Junhee, Shin, Seokjoo.  2019.  Experimental Evaluation of Source Location Privacy Routing Schemes and Energy Consumption Performance. 2019 19th International Symposium on Communications and Information Technologies (ISCIT). :86–90.
Network lifetime and energy consumption of sensor nodes have an inversely proportional relationship. Thus, it is important to ensure source location privacy (SLP) routing schemes are energy-efficient. This work performs an experimental evaluation of some existing routing schemes and proposes a new angle-based routing algorithm to modify the schemes. The dynamic route creation process of the modified schemes is characterized by processes which include determination of route and banned regions and computation of control angle and lead factor parameters. Results of the analysis show that the modified schemes are effective at obfuscating the adversaries to provide strong SLP protection. Furthermore, the modified schemes consume relatively lower energy and guarantee longer network lifetime.
Mutalemwa, Lilian C., Shin, Seokjoo.  2019.  Investigating the Influence of Routing Scheme Algorithms on the Source Location Privacy Protection and Network Lifetime. 2019 International Conference on Information and Communication Technology Convergence (ICTC). :1188–1191.
There exist numerous strategies for Source Location Privacy (SLP) routing schemes. In this study, an experimental analysis of a few routing schemes is done to investigate the influence of the routing scheme algorithms on the privacy protection level and the network lifetime performance. The analysis involved four categories of SLP routing schemes. Analysis results revealed that the algorithms used in the representative schemes for tree-based and angle-based routing schemes incur the highest influence. The tree-based algorithm stimulates the highest energy consumption with the lowest network lifetime while the angle-based algorithm does the opposite. Moreover, for the tree-based algorithm, the influence is highly dependent on the region of the network domain.