Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
8 results
Search Results
Item En-Route Filtering Techniques in Wireless Sensor Networks: A Survey(Springer New York LLC barbara.b.bertram@gsk.com, 2017) Kumar, A.; Pais, A.R.Majority of wireless sensor networks (WSNs) are deployed in unattended environments and thus sensor nodes can be compromised easily. A compromised sensor node can be used to send fake sensing reports to the sink. If undetected these reports can raise false alarms. To deal with the problem of fake report generation, a number of en-route filtering schemes have been proposed. Each of these schemes uses different cryptographic methods to check the authenticity of reports while they are being forwarded hop by hop toward base station. However, majority of these techniques can handle only limited compromised nodes or they either need node localization or statically configured routes for sending reports. Furthermore, majority of en-route filtering techniques are vulnerable to various denial of service attacks. Our main aims in this survey are: (a) to describe the major en-route filtering techniques, (b) to analyze these techniques on various parameters including security and (c) to outline main unresolved research challenges in en-route filtering in WSNs. © 2017, Springer Science+Business Media New York.Item Deterministic En-Route Filtering of False Reports: A Combinatorial Design Based Approach(Institute of Electrical and Electronics Engineers Inc., 2018) Kumar, A.; Pais, A.R.Wireless sensor networks are an easy target for report fabrication attack, where compromised sensor nodes can be used by an adversary to flood the network with bogus/false reports. En-route filtering is a mechanism where intermediate forwarding nodes identify and drop false reports while they are being forwarded toward the sink. Most of the existing en-route filtering schemes are probabilistic, where sensor nodes in each cell share secret keys with a fixed probability with intermediate nodes. Thus, forwarded reports are verified probabilistically by intermediate nodes, because of which false reports can travel several hops before being dropped. Few deterministic en-route filtering schemes have also been proposed in the literature, but all such schemes require a source to send the reports through a fixed path to reach the sink. In this paper, we propose a novel deterministic en-route filtering scheme based on a combinatorial design to overcome the above-mentioned limitations of the existing schemes. The use of combinatorial design-based keys ensures direct communication between all the sensor nodes while maintaining low key storage overhead in the network. We provide a comprehensive analysis of the proposed scheme. The proposed scheme notably performs better than the existing schemes in terms of the expected filtering position of false reports. Furthermore, the proposed scheme improves data authenticity in the network and is more buoyant to selective forwarding and report disruption attacks. © 2013 IEEE.Item A new hybrid key pre-distribution scheme for wireless sensor networks(Springer New York LLC barbara.b.bertram@gsk.com, 2019) Kumar, A.; Pais, A.R.This article presents a novel hybrid key pre-distribution scheme based on combinatorial design keys and pair-wise keys. For the presented scheme, the deployment zone is cleft into equal-sized cells. We use the combinatorial design based keys to secure intra-cell communication, which helps to maintain low key storage overhead in the network. For inter-cell communication, each cell maintain multiple associations with all the other cells within communication range and these associations are secured with pair-wise keys. This helps to ensure high resiliency against compromised sensor nodes in the network. We provide in-depth analysis for the presented scheme. We measure the resiliency of the presented scheme by calculating fraction of links effected and fraction of nodes disconnected when adversary compromises some sensor nodes in the network. We find that the presented scheme has high resiliency than majority of existing schemes. Our presented scheme also has low storage overhead than existing schemes. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.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.Item A new combinatorial design based key pre-distribution scheme for wireless sensor networks(Springer Verlag service@springer.de, 2019) Kumar, A.; Pais, A.R.In this paper we present a new Combinatorial Design based Key Pre-Distribution scheme (CD-KPD). For the scheme, the network region is divided into cells of equal size and each cell has two types of sensor nodes namely, normal sensor nodes and cluster heads. Within a particular cell, normal sensor nodes can communicate with each other directly and cluster heads are used for inter-cell communication. To ensure secure communication we use CD-KPD to assign keys to all the sensor nodes including cluster heads. We further modify CD-KPD to propose Combinatorial Design based Reduced Key Pre-Distribution scheme (CD-RKPD) by reducing the number of keys stored in each cluster head. The CD-RKPD was need of the hour when we consider to limit the inter-cell communication of each cell within its Lee sphere region. We give in-detail analysis of both the proposed schemes. We measure the resiliency of both proposed schemes by calculating fraction of links disrupted and fraction of cells disconnected when few sensor nodes are compromised in the network. We found that CD-KPD and CD-RKPD outperforms (Ruj and Roy in ACM Trans Sens Netw 6(1):4, 2009) by 59 and 6.5% respectively in terms of Global Resiliency and 5 and 9.7% respectively in terms of fraction of cell disconnected in the network. Further, we found that both our proposed schemes achieves high resiliency than majority of existing schemes. © 2018, Springer-Verlag GmbH Germany, part of Springer Nature.Item A trust model based batch verification of digital signatures in IoT(Springer, 2020) Kittur, A.S.; Pais, A.R.In the modern day world, the Internet of things (IoT) is not a new concept. IoT is getting deployed in various applications and fields. Hence with this fast-growing trend, it is essential to maintain the security in the IoT network. Digital Signature is one of the important ways to authenticate an electronic document or a message during communication. Multiple digital signatures are verified at once through the concept of batch verification. Batch verification of multiple digital signatures reduces the computation load and time. Hence this concept is beneficial in IoT environment where nodes have low computation power and operate in a real-time environment. In this paper, we have developed a Trust Model for IoT which helps the Gateway node to identify the trusted sensor nodes which perform batch verification. The sensor nodes receive a batch of signatures from the Gateway node and verify signatures through batch verification and accordingly send back the results. The trust model that we have developed in this paper significantly reduces the probability of selecting unreliable nodes for verification and also reduces the computation load at Gateway node. We have implemented our trust model and presented the results for batch verification of digital signatures. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.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.Item Combinatorial Design Based Key Pre-distribution Scheme with High Scalability and Minimal Storage for Wireless Sensor Networks(Springer, 2023) Kittur, L.J.; Pais, A.R.Given the sensitivity of applications and the sensor node’s resource constraints, key management is an important security concern in Wireless Sensor Networks (WSNs). Combinatorial Design based schemes are used to propose key pre-distribution in WSNs as they have patterns that can be mapped to the WSNs. We employ Combinatorial Designs to pre-distribute the keys to the sensor nodes. The deployment area is divided into equal-sized regions called cells. The network comprises two types of sensor nodes: ordinary sensor nodes and cell masters. The ordinary sensor nodes within a cell can communicate with each other directly. The inter-cell communication is through the cell masters, which have higher resource capabilities than the ordinary sensor nodes. To take into account the Radio Frequency range of cell masters, we use Lee sphere region around each cell (Ruj in ACM Transactions on Sensor Networks (TOSN) 6:4, 2009, Rui Key predistribution using partially balanced designs in wireless sensor networks, 2007). The proposed key pre-distribution scheme for cell masters provides high network scalability with low key storage overhead compared to other schemes. The model’s performance is measured in terms of key storage overhead and the number of sensor nodes supported. A detailed analysis of resiliency in terms of fractions of links disrupted is also presented. Also, the proposed scheme achieved better resiliency and requires much less number of keys to be stored in sensor nodes than the existing schemes. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.