Secure Overlay Routing Using Key Pre-Distribution: A Linear Distance Optimization Approach

Key pre-distribution algorithms have recently emerged as efficient alternatives of key management in today's secure communications landscape. Secure routing techniques using key pre-distribution algorithms require special algorithms capable of finding optimal secure overlay paths. To the best of our knowledge, the literature of key pre-distribution systems is still facing a major void in proposing optimal overlay routing algorithms. In the literature work, traditional routing algorithms are typically used twice to find a NETWORK layer path from the source node to the destination and then to find required cryptographic paths. In this paper, we model the problem of secure routing using weighted directed graphs and propose a Boolean linear programming (LP) problem to find the optimal path. Albeit the fact that the solutions to Boolean LP problems are of much higher complexities, we propose a method for solving our problem in polynomial time. In order to evaluate its performance and security measures,we apply our proposed algorithm to a number of recently proposed symmetric and asymmetric key pre-distribution methods. The results show that our proposed algorithm offers great network performance improvements as well as security enhancements when augmenting baseline techniques.

[1]  Jennifer D. Key,et al.  Designs and their codes , 1992, Cambridge tracts in mathematics.

[2]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[3]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[4]  Mohammed Gharib,et al.  Expert key selection impact on the MANETs' performance using probabilistic key management algorithm , 2013, SIN.

[5]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[6]  Peng Ning,et al.  2008 International Conference on Information Processing in Sensor Networks TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks ∗ , 2022 .

[7]  Arunabha Sen,et al.  Broadcast scheduling algorithms for radio networks , 1995, Proceedings of MILCOM '95.

[8]  Hamid Jafarkhani,et al.  An optimal power-throughput tradeoff study for MIMO fading ad-hoc networks , 2010, Journal of Communications and Networks.

[9]  Ivan Stojmenovic,et al.  Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs , 2011, 2011 Proceedings IEEE INFOCOM.

[10]  Yuguang Fang,et al.  Securing wireless sensor networks: a survey , 2008, IEEE Communications Surveys & Tutorials.

[11]  Anthony Vannelli.  An adaptation of the interior point method for solving the global routing problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Johann van der Merwe,et al.  A survey on peer-to-peer key management for mobile ad hoc networks , 2007, CSUR.

[13]  Mohammed Gharib,et al.  A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs , 2013, 2013 27th International Conference on Advanced Information Networking and Applications Workshops.

[14]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[15]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[16]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[17]  Zhihong Liu,et al.  Asymmetric Key Pre-distribution Scheme for sensor networks , 2009, IEEE Transactions on Wireless Communications.

[18]  Vladimir D. Tonchev,et al.  Unital designs in planes of order 16 , 2000, Discret. Appl. Math..

[19]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[20]  Yacine Challal,et al.  A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks , 2013, IEEE Transactions on Wireless Communications.

[21]  Xiaoyan Hong,et al.  Scalable routing protocols for mobile ad hoc networks , 2002, IEEE Netw..

[22]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[23]  Sushmita Ruj,et al.  Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks , 2009, TOSN.

[24]  Hrishikesh B. Acharya,et al.  The best keying protocol for sensor networks , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[25]  Santosh S. Vempala,et al.  Solving convex programs by random walks , 2004, JACM.

[26]  Srivaths Ravi,et al.  A study of the energy consumption characteristics of cryptographic algorithms and security protocols , 2006, IEEE Transactions on Mobile Computing.

[27]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[28]  Stoicho D. Stoichev.  Experimental Results of the Search for Unitals in Projective Planes of Order 25 , 2012 .

[29]  Bülent Yener,et al.  Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks , 2004, IEEE/ACM Transactions on Networking.