Email this article 
Hide
Show allA PROTECTED TRANSFER ROUTING WITH KEY PRE-SHARING: A LINEAR COLDNESS OPTIMIZATION APPROACH
Abstract
Trivial secure communications inside the random quantity of network nodes requires each node to help keep n - 1 pairwise keys inside the situation of symmetric cryptography and n - 1 public keys inside the situation of uneven cryptography where n represents the quantity of network nodes. Within the network operation phase, each node finds the underlay path length connected getting its overlay neighbors by delivering simple route demands. An important pool for key pre-distribution schemes that's built based on symmetric cryptography concepts contains secret pairwise keys. In this particular paper, we reference the network layer since the underlay layer together with cryptographic layer since the overlay layer. Our recommended option is basically damaged whipped cream an LP problem derived by relaxing all of the Boolean constraints inside the original problem. The effectiveness of our formula reaches solving the Boolean LP challenge with a while complexity not exceeding individuals of solving the relaxed LP problem while guaranteeing to know the very best solution. We noted the main advantage of our formula as acquiring the opportunity to solve the very best routing problem for each graph either directed or undirected in addition to weighted or unweighted. evaluating network performance, security, and consumption characteristics inside the recommended formula for symmetric and uneven key pre-distribution methods operating on top of on-demand routing protocols. So that you can think about the performance within our recommended formula, we employ it three key pre-distribution methods, namely, 2-UKP, SST, and PAKP running on top of ad-hoc when needed distance vector routing protocol.
Keywords
References
N. Potlapally, S. Ravi, A. Raghunathan, and N. Jha, “A study of the energy consumption characteristics of cryptographic algorithms and security protocols,” Mobile Computing, IEEE Transactions on, vol. 5, no. 2, pp. 128–143, Feb 2006.
M. Huson and A. Sen, “Broadcast scheduling algorithms for radio networks,” in Military Communications Conference, 1995. MILCOM ’95, Conference Record, IEEE, vol. 2, Nov 1995, pp. 647–651 vol.2.
D. Liu and P. Ning, “Establishing pairwise keys in distributed sensor networks,” in Proceedings of the 10th ACM Conference on Computer and Communications Security, ser. CCS ’03. New York, NY, USA: ACM, 2003, pp. 52–61.
Mohammed Gharib, Student Member, IEEE, HomayounYousefi’zadeh, Senior Member, IEEE,and Ali Movaghar, Senior Member, IEEE, “Secure Overlay Routing Using Key Pre-Distribution:A Linear Distance Optimization Approach”, IEEE Transactions on Mobile Computing 2016.
M. e. a. Gharib, “A novel probabilistic key management algorithm for large-scale manets,” in Advanced Information Networking and Applications Workshops (WAINA), 2013 27th International Conference on, March 2013, pp. 349–356.
A. Vannelli, “An adaptation of the interior point method for solving the global routing problem,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, pp. 193–203, Feb 1991.
M. e. a. Gharib, “Expert key selection impact on the manets’ performance using probabilistic key management algorithm,” in Proceedings of the 6th International Conference on Security of Information and Networks, ser. SIN ’13. New York, NY, USA: ACM, 2013, pp. 347–351.
Refbacks
- There are currently no refbacks.
Copyright © 2012 - 2023, All rights reserved.| ijitr.com
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.