Using a Random Perturbation-based Scheme for establishing Authentic Associations in Wireless Mesh Network
|
10.5120/16551-6198 |
Walaa El-salhy, Fayed F M Ghaleb and Ahmed M Khedr. Article: Using a Random Perturbation-based Scheme for establishing Authentic Associations in Wireless Mesh Network. International Journal of Computer Applications 94(20):18-22, May 2014. Full text available. BibTeX
@article{key:article,
author = {Walaa El-salhy and Fayed F. M. Ghaleb and Ahmed M. Khedr},
title = {Article: Using a Random Perturbation-based Scheme for establishing Authentic Associations in Wireless Mesh Network},
journal = {International Journal of Computer Applications},
year = {2014},
volume = {94},
number = {20},
pages = {18-22},
month = {May},
note = {Full text available}
}
Abstract
Establishing an Authentic Association among entities in Wireless Mesh Networks WMN is a nontrivial problem and the architecture of WMN is relatively new and lacks a robust secure scheme . In this paper, we develop a Polynomial Based scheme which provides pair-wise connectivity, low communication, marginal storage overhead and high scalability while making on the fly Authentic Association feasible by using random perturbation based (RPB) scheme. New Proposed scheme is not only observed to be resilient against both traffic analysis and node capture attacks but also it is more secure , only requires a small storage space and has a little communication overhead.
References
- Nandiraju, N. , et al. , Wireless Mesh Networks: Current Challenges and Future Directions of Web-In-The-Sky. Wireless Commun. , 2007. 14(4): p. 79-89.
- Gaur, A. , et al. , Polynomial based scheme (PBS) for establishing Authentic Associations in Wireless Mesh Networks. J. Parallel Distrib. Comput. , 2010. 70(4): p. 338-343.
- Eschenauer, L. and V. D. Gligor, A key-management scheme for distributed sensor networks, in Proceedings of the 9th ACM conference on Computer and communications security2002, ACM: Washington, DC, USA. p. 41-47.
- Chan, H. , A. Perrig, and D. Song, Random Key Predistribution Schemes for Sensor Networks. IEEE SYMPOSIUM ON SECURITY AND PRIVACY, 2003: p. 197-215.
- Blom, R. , An optimal class of symmetric key generation systems, in Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques1985, Springer-Verlag New York, Inc. : Paris, France. p. 335-338.
- Du, W. , et al. , A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inf. Syst. Secur. , 2005. 8(2): p. 228-258.
- 7. Blundo, C. , et al. , Perfectly-Secure Key Distribution for Dynamic Conferences, in Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology1993, Springer-Verlag. p. 471-486.
- Zhang, W. , et al. , A random perturbation-based scheme for pairwise key establishment in sensor networks, in Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing2007, ACM: Montreal, Quebec, Canada. p. 90-99.
- Liu, D. g. and P. Ning, Location-Based Pairwise Key Establishments for Relatively Static Sensor Networks. ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'03), October 31, 2003 George W. Johnson Center at George Mason University, Fairfax, VA, USA. , 2003.
- Cheng, Y. and D. P. Agrawal. Efficient pairwise key establishment and management in static wireless sensor networks. in Mobile Adhoc and Sensor Systems Conference, 2005. IEEE International Conference on. 2005.
- Cheng, Y. , et al. , Enhanced Approach for Random Key Pre-Distribution in Wireless Sensor Networks in international Conference on Communication, Networking and Information Technology , 2008.