Email this article Enhanced Overlay routing With Efficient Key Distribution in Network
Abstract
We demonstrate the issue of secure routing utilizing weighted coordinated graphs and propose a boolean linear programming (LP) issue to locate the ideal way. Though the way that the answers for boolean LP issues are of considerably higher complexities, we propose a technique for tackling our issue in polynomial time. So as to assess its execution and safety efforts, we apply our proposed calculation to various as of late proposed symmetric and unbalanced key pre-dissemination strategies. The outcomes demonstrate that our proposed algorithm offers extraordinary system execution changes and in addition security upgrades while augmenting benchmark procedures.
References
S. Camtepe and B. Yener, “Combinatorial design of key distributionmechanisms for wireless sensor networks,” Networking, IEEE/ACMTransactions on, vol. 15, no. 2, pp. 346–358, April 2007.
S. Ruj, A. Nayak, and I. Stojmenovic, “Fully secure pairwise andtriple key distribution in wireless sensor networks using combinatorialdesigns,” in INFOCOM, 2011 Proceedings IEEE, April 2011, pp. 326–330.
W. Bechkit, Y. Challal, A. Bouabdallah, and V. Tarokh, “A highlyscalable key pre-distribution scheme for wireless sensor networks,”Wireless Communications, IEEE Transactions on, vol. 12, no. 2, pp.948–959, February 2013.
M. e. a. Gharib, “A novel probabilistic key management algorithm forlarge-scale manets,” in Advanced Information Networking and ApplicationsWorkshops (WAINA), 2013 27th International Conference on,March 2013, pp. 349–356.
L. Eschenauer and V. D. Gligor, “A key-management schemefor distributed sensor networks,” in Proceedings of the 9th ACM
Conference on Computer and Communications Security, ser. CCS ’02.New York, NY, USA: ACM, 2002, pp. 41–47. [Online]. Available:
http://doi.acm.org/10.1145/586110.586117
H. Chan, A. Perrig, and D. Song, “Random key predistribution schemesfor sensor networks,” in Security and Privacy, 2003. Proceedings. 2003Symposium on, May 2003, pp. 197–213.
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 Securityof Information and Networks, ser. SIN ’13. New York,NY, USA: ACM, 2013, pp. 347–351. [Online]. Available:
http://doi.acm.org/10.1145/2523514.2523556
T. Choi, H. B. Acharya, and M. Gouda, “The best keying protocol forsensor networks,” in Proceedings of IEEE WoWMoM, June 2011.
S. Zhu, S. Setia, and S. Jajodia, “Leap: Efficient security mechanismsor large-scale distributed sensor networks,” in Proceedings of the10th ACM Conference on Computer and Communications Security, ser.CCS ’03. New York, NY, USA: ACM, 2003, pp. 62–72. [Online].Available: http://doi.acm.org/10.1145/948109.948120
S. Ruj and B. Roy, “Key predistribution using combinatorial designsfor grid-group deployment scheme in wireless sensor networks,” ACMTrans. Sen. Netw., vol. 6, no. 1, pp. 4:1–4:28, Jan. 2010. [Online].Available: http://doi.acm.org/10.1145/1653760.1653764
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.