Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Bansal, N."

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    A partial key pre-distribution based en-route filtering scheme for wireless sensor networks
    (Springer Science and Business Media Deutschland GmbH, 2021) Kumar, A.; Bansal, N.; Pais, A.R.
    Compromised sensor nodes can be used to inject false reports (bogus reports) in wireless ssensor networks (WSNs). This can cause the sink to take wrong decisions. En-route filtering is a method to detect and filter false reports from WSNs. Most of the existing en-route filtering schemes use probabilistic approaches to filter false reports from the network, where filtering of false reports is based on a fixed probability. Thus false reports can travel multiple hops before being dropped. In this article we seek to overcome limitations of the existing schemes and reduce the overall key storage overhead in the cluster heads. In this article we propose a combinatorial design based partial en-route filtering scheme (CD-PEFS) which filters the fabricated reports deterministically. CD-PEFS reduces the energy requirements in the network by early detection and elimination of the false reports. Adoption of combinatorial design based keys get rid of shared key discovery phase from the network. This considerably reduces the communication overhead in the network. We carried out a detailed analysis of CD-PEFS against an increasing number of compromised sensor nodes in the network. We found that our scheme performs better than existing schemes in terms of filtering efficiency while maintaining low key storage overhead in the network. Further the performance of CD-PEFS is at par with existing schemes in terms of other protocol overheads. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature.
  • No Thumbnail Available
    Item
    New key pre-distribution scheme based on combinatorial design for wireless sensor networks
    (2019) Kumar, A.; Bansal, N.; Pais, A.R.
    Key pre-distribution in wireless sensor networks is an important area of research due to limited resource availability in sensor nodes. In this study, the authors propose a novel key pre-distribution scheme for wireless sensor networks based on combinatorial design. The proposed scheme is used to assign secret keys to the sensor nodes so that they can securely communicate among themselves. It also aims to decrease the key storage overhead and improve the overall resiliency of the network. They use the ratio of links broken/affected and the ratio of nodes disconnected to measure the resiliency when some sensor nodes are compromised in the network. They observed that the proposed scheme reduces the key storage overhead in the network while maintaining the desired connectivity among all the sensor nodes. Further, the proposed scheme is more resilient than the majority of existing schemes present in the literature. The Institution of Engineering and Technology 2019.
  • No Thumbnail Available
    Item
    New key pre-distribution scheme based on combinatorial design for wireless sensor networks
    (Institution of Engineering and Technology journals@theiet.org, 2019) Kumar, A.; Bansal, N.; Pais, A.R.
    Key pre-distribution in wireless sensor networks is an important area of research due to limited resource availability in sensor nodes. In this study, the authors propose a novel key pre-distribution scheme for wireless sensor networks based on combinatorial design. The proposed scheme is used to assign secret keys to the sensor nodes so that they can securely communicate among themselves. It also aims to decrease the key storage overhead and improve the overall resiliency of the network. They use the ratio of links broken/affected and the ratio of nodes disconnected to measure the resiliency when some sensor nodes are compromised in the network. They observed that the proposed scheme reduces the key storage overhead in the network while maintaining the desired connectivity among all the sensor nodes. Further, the proposed scheme is more resilient than the majority of existing schemes present in the literature. © The Institution of Engineering and Technology 2019.

Maintained by Central Library NITK | DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify