Open Access   Article Go Back

A Location Dependent Key Management Method for WSN With Reduced Path Length And Considering Cell Head

Nidhi Tawra1 , Prerna 2 , Bhawna Gupta3

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-6 , Page no. 1468-1474, Jun-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i6.14681474

Online published on Jun 30, 2018

Copyright © Nidhi Tawra, Prerna, Bhawna Gupta . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Nidhi Tawra, Prerna, Bhawna Gupta, “A Location Dependent Key Management Method for WSN With Reduced Path Length And Considering Cell Head,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.6, pp.1468-1474, 2018.

MLA Style Citation: Nidhi Tawra, Prerna, Bhawna Gupta "A Location Dependent Key Management Method for WSN With Reduced Path Length And Considering Cell Head." International Journal of Computer Sciences and Engineering 6.6 (2018): 1468-1474.

APA Style Citation: Nidhi Tawra, Prerna, Bhawna Gupta, (2018). A Location Dependent Key Management Method for WSN With Reduced Path Length And Considering Cell Head. International Journal of Computer Sciences and Engineering, 6(6), 1468-1474.

BibTex Style Citation:
@article{Tawra_2018,
author = {Nidhi Tawra, Prerna, Bhawna Gupta},
title = {A Location Dependent Key Management Method for WSN With Reduced Path Length And Considering Cell Head},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2018},
volume = {6},
Issue = {6},
month = {6},
year = {2018},
issn = {2347-2693},
pages = {1468-1474},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2369},
doi = {https://doi.org/10.26438/ijcse/v6i6.14681474}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i6.14681474}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2369
TI - A Location Dependent Key Management Method for WSN With Reduced Path Length And Considering Cell Head
T2 - International Journal of Computer Sciences and Engineering
AU - Nidhi Tawra, Prerna, Bhawna Gupta
PY - 2018
DA - 2018/06/30
PB - IJCSE, Indore, INDIA
SP - 1468-1474
IS - 6
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
570 397 downloads 262 downloads
  
  
           

Abstract

Wireless Sensor Networks (WSNs) consists of sensor nodes (SNs) which are deployed in hostile areas to monitor the environmental* or physical conditions such as temperature, sound, pressure etc. WSNs are used in military operations, civilian operations, forest fire detection and healthcare monitoring etc. These SNs forwards their sensor data via multi-hop wireless paths to the Base Station (BS) and are assembled with limited energy, resource, and memory and communication range. We consider base station to be highly secure, unlike sensor nodes which are threat prone. We assume that the attacker can extract security credentials from the compromised nodes. As these sensor nodes are resource constraint, so the number of hops required sending data from event region to base station needs to be reduced. Moreover, as the sensor nodes have limited memory so the number of keys to be stored on these sensor nodes needs to be reduced. This paper basically focuses on reducing the path length of an event region to the base station as well as reducing the number of keys. We also calculate the number of suspicious nodes and cells in the network.

Key-Words / Index Term

Sensor nodes, security, key management, data gathering, wireless sensor networks

References

[1]. Redondo-López, L., Prayati, A., López-Navarro, J. M., Martínez-Ortega, J. F., & García-Hernando,”Problem Solving for Wireless Sensor Networks”:, Computer Communications and Networks. ISBN 978-1-84800-203-6. Springer-Verlag London, 2008.
[2]. Chan, H., Perrig, A., & Song, D. “Random key predistribution schemes for sensor networks,”. In proceedings of IEEE Security and Privacy, Symposium, May 2003, pp 197-213.
[3]. Sahoo, S. K., & Sahoo, M. N. “An elliptic-curve-based hierarchical cluster key management in wireless sensor network,” In Proceedings of Springer In Intelligent Computing, Networking, and Informatics, 2014,pp. 397-408.
[4]. X. He, M. Niedermeier, and H. de Meer, “Dynamic key management in wireless sensor networks: A survey,” J. Netw. Comput. Appl., vol. 36, no. 2, pp. 611–622, 2013.
[5]. S. H. Seo, J. Won, S. Sultana, and E. Bertino, “Effective key management in dynamic wireless sensor networks,” IEEE Trans. Inf. Forensics Security, vol. 10, no. 2, pp. 371–383, Feb. 2015.
[6]. K. Ren, W. Lou, and Y. Zhang, “LEDS: Providing location-aware end-to-end data security in wireless sensor networks,” IEEE Trans. Mobile Comput., vol. 7, no. 5, pp. 585–598, May 2008.
[7]. Eschenauer, L., & Gligor, V. D. A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM conference on Computer and communications security, November 2012, pp. 41-47.
[8]. S. Zhu, S. Setia, S. Jajodia, and P. Ning, “An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks,” in Proc. IEEE Symp. Secur. Privacy, May 2004, pp. 259–271.
[9]. F. Ye, H. Luo, S. Lu, and L. Zhang, “Statistical en-route filtering of injected false data in sensor networks,” IEEE J. Sel. Areas Commun., vol. 23, no. 4, pp. 839–850, Apr. 2005.
[10]. H. Yang, F. Ye, Y. Yuan, S. Lu, and W. Arbaugh, “Toward resilient security in wireless sensor networks,” in Proc. 6th ACM Int. Symp. Mobile Ad Hoc Netw. Comput. (MobiHoc), 2005, pp. 34–45.
[11]. K. Ren, W. Lou, and Y. Zhang, “LEDS: Providing location-aware end-to-end data security in wireless sensor networks,” IEEE Trans. Mobile Comput., vol. 7, no. 5, pp. 585–598, May 2008.
[12]. H.-W. Ferng, J. Nurhakim, and S.-J. Horng, “Key management protocol with end-to-end data security and key revocation for a multi-bs wireless sensor network,” Wireless Netw., vol. 20, no. 4, pp. 625–637, 2014.
[13]. Fakhrey, H., Tiwari, R., Johnston, M., & Al-Mathehaji, Y. A,”The Optimum Design of Location-Dependent Key Management Protocol for a WSN With a Random Selected Cell Reporter”,IEEE Sensors Journal, 16(19),2016,pp.7217-7226
[14]. Bahi, Jacques M., Christophe Guyeux, and Abdallah Makhoul, "Two security layers for hierarchical data aggregation in sensor networks, "International Journal of Autonomous and Adaptive Communications Systems”pp. 239-270,2014.
[15]. B. Przydatek, D. Song, and A. Perrig. Sia: Se-cure information aggregation in sensor networks,”In Proceedings of ACM SenSys conference”, pages 255–265, 2003.
[16]. H. Cam, S. Ozdemir, P. Nair, D. Muthuavinashinap-pan, and H. O. Sanli, ”Espda: Energy-efficient secure pattern based data aggregation for wireless sensor networks”, Computer Communication journal (29), pages 446–455, 2006.
[17]. S. Sharma, D. Kumar, K. Kishore, “Wireless Sensor Networks-A Review on Topologies and Node Architecture”, International Journal of Computer Engineering, Vol-1(2), pp(19-25) Oct-2013.
[18]. F. Ye, H. Lou, S. Lu, L. Zhang, "Statistical En-Route Filtering of Injected False Data in Sensor Networks", Proc. IEEE INFOCOM, 2004-Mar.
[19]. S. Zhu, S. Setia, S. Jajodia, P. Ning, "An Interleaved Hop-By-Hop Authentication Scheme for Filtering False Data in Sensor Networks", Proc. IEEE Symp. Security and Privacy, 2004
[20]. A. Perrig, R. Canetti, J. Tygar, D. Song, "Efficient Authentication and Signing of Multicast Streams over Lossy Channels", Proc. IEEE Symp. Security and Privacy, 2000-May.
[21]. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U.Vaccaro, M. Yung, "Perfectly-Secure Key Distribution for Dynamic Conferences", Proc. Advances in Cryptology (Crypto `92), pp. 471-486, 1992-Apr.
[22]. W. Zhang, N. Subramanian, G. Wang, "Lightweight and Compromise-Resilient Message Authentication in Sensor Networks", April 2008 Proc. IEEE INFOCOM, 2008-Apr.
[23]. D. Chaum, "Untraceable Electronic Mail Return Addresses and Digital Pseudonyms", Comm. ACM, vol. 24, no. 2, pp. 84-88, Feb. 1981.
[24]. D. Chaum, "The Dinning Cryptographer Problem: Unconditional Sender and Recipient Untraceability", J. Cryptology, vol. 1, no. 1, pp. 65-75, 1988.
[25]. R. Rivest, A. Shamir, Y. Tauman, "How to Leak a Secret", Proc. Advances in Cryptology (ASIACRYPT), 2001.
[26]. M. Wei, R. Aragues, C. Sagues, and G. C. Calafiore, “Noisy range network localization based on distributed multidimensional scaling,” IEEE Sensors J., vol. 15, no. 3, pp. 1872–1883, Mar. 2015.
[27]. S. Tomic, M. Beko, and R. Dinis, “RSS-based localization in wireless sensor networks using convex relaxation: Noncooperative and cooperative schemes,” IEEE Trans. Veh. Technol., vol. 64, no. 5, pp. 2037–2050, May 2015.
[28]. O. Gungor, F. Chen, and C. E. Koksal, “Secret key generation via localization and mobility,” IEEE Trans. Veh. Technol., vol. 64, no. 6, pp. 2214–2230, Jun. 2015.
[29]. V. Prasad, V.S. Sunsan, “Multi path dynamic routing for data integrity and delay Minimization differentiated services in wireless sensor network”, International Journal of Scientific Research inResearch Paper” Vol.4, Issue.4, pp.20-23, August 2016.