Faculty Publications

Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736

Publications by NITK Faculty

Browse

Search Results

Now showing 1 - 5 of 5
  • Item
    A Firefly Optimization Algorithm for Maximizing the Connectivity in Mobile Wireless Sensor Network
    (Springer, 2020) Mamatha, M.; Manjappa, K.
    For the effective functioning of a Mobile Wireless Sensor Networks (MWSN), the connectivity maintenance of the sensor nodes is of significant concern. Otherwise, it may result in an independent node or nodes wholly get detached from the network. Though such detached sensor nodes are functioning correctly and have good energy backup, its service cannot be utilized for the purpose it is intended for as it is isolated from the core network. These sensor nodes are sophisticated tiny devices and costlier depending on the application; therefore, proper care should be taken to keep them connected to the network. Hence, a firefly based algorithm, a Swarm Intelligence technique, referred to as Firefly Algorithm for Connectivity in Mobile WSN (FACM) has been proposed in this article in order to establish proper connectivity among the sensor nodes in MWSN. FACM is based on the insect fireflies, which have a unique feature of producing light, a result of chemical reaction, at different intervals to escape from the predators and most of the time to attract prey. The inevitable feature of insect firefly, attracting the prey, is exploited in the proposed FACM where a brighter sensor node (in terms of energy and distance) will attract the less bright neighboring sensor nodes. Thus, the less bright sensor node can depend on the brighter sensor node for the data transfer, thereby saving its energy. A fitness function has been designed based on the combination of two parameters energy and the distance, which decides the brightness of the sensor node. The effectiveness of the proposed FACM has been theoretically analyzed and verified by simulation through MATLAB. The results obtained are compared with classical FA and are found to be inspiring. © 2020, Springer Nature Switzerland AG.
  • Item
    Parallelized K-Means clustering algorithm for self aware mobile Ad-hoc networks
    (2011) Thomas, L.; Manjappa, K.; Annappa, B.; Guddeti, G.R.M.
    Providing Quality of Service (QoS) in Mobile Ad-hoc Network (MANET) in terms of bandwidth, delay, jitter, throughput etc., is critical and challenging issue because of node mobility and the shared medium. The work in this paper predicts the best effective cluster while taking QoS parameters into account. The proposed work uses K-Means clustering algorithm for automatically discovering clusters from large data repositories. Further, iterative K-Means clustering algorithm is parallelized using Map-Reduce technique in order to improve the computational efficiency and thereby predicting the best effective cluster. Hence, parallel K-Means algorithm is explored for finding the best effective cluster containing the hops which lies in the best cluster with the best throughput in self aware MANET. Copyright © 2011 ACM.
  • Item
    Decentralised Authentication Protocol for Devices & Users to Access Private Network Services Using Blockchain
    (IEEE Computer Society, 2023) Praneeth, P.; Tanguturu, R.; Aenugutala, S.P.; Cunha, T.B.D.; Manjappa, K.
    With recent advancements in the Internet of things, challenges to secure devices and data related to devices have increased. Adversaries using different threats manage to clone/hack/tamper devices by hacking credentials stored in centralised databases. In this work, a decentralised approach using blockchain is proposed to check the authenticity of the device/user trying to access the services of the service provider network. The proposed method uses public and private blockchain networks and Physical Unclonable Function (PUF) to authenticate the device/user and to store their credentials. The decentralised application runs on Hyperledger Fabric, an open-source platform for building blockchain networks. The proposed protocol is tested and implemented in the physical testbed containing Raspberry Pi and Arduino Mega's. © 2023 FRUCT.
  • Item
    An Efficient Application based Many-to-Many Resource Allocation and Sharing with Power Optimization for D2D Communication - A Clustered Approach
    (Korean Institute of Communications and Information Sciences, 2024) Raghu, R.T.; Manjappa, K.
    This study aims to give an edge to public safety applications over commercial applications in an underlay cellular-assisted device-to-device (D2D) communication. The proposed framework introduces two frameworks: Cluster-based many-to-many resource allocation and resource sharing framework (CMMRARS) and constant time power control algorithm (CTPCA). The RB assigned to a CUE can share with multiple DUE pairs, and the DUE pairs can also use RB assigned to multiple CUEs under the many-to-many strategy. The CMMRARS framework is responsible for resource allocation and resource sharing and accordingly, it is further divided into three sub-problems. The CTPCA framework is divided into two sub-problems and used to find optimal power for cellular users and D2D transmitters to avoid cross-tier and co-tier interference. The K-means clustering algorithm is employed to form application-specific clusters, and it ensures that more cellular users fall into the public safety clusters so that the D2D users will get more resource-sharing options. Cellular users use a weighted bipartite graph to form a priority list of D2D users for resource sharing. The main objective of the proposed work is to enhance the system’s sum rate by simultaneously reusing the same resource by multiple D2D pairs and safeguarding the Quality of Services provided to all kinds of network users. A theoretical justification is presented to ensure that the proposed frameworks terminate after a certain number of runs and congregate to a consistent matching. Simulation results show that the proposed method influences the overall system’s sum rate and provides a preference for public safety applications over commercial applications. © 2024 KICS.
  • Item
    Private and Consortium Blockchain-based Authentication Protocol for IoT Devices Using PUF
    (Korean Institute of Communications and Information Sciences, 2024) Cunha, T.B.D.; Manjappa, K.
    In this work, a static random access memory-physical unclonable function (SRAM-PUF) based device security framework is proposed which uses the trending blockchain technology for securing the device credentials. The proposed framework produces a unique fingerprint called PUF key for each device based on its hardware characteristics which will act as an authenticating parameter for the devices during the authentication and re-authentication phase. The proposed work uses both consortium and private blockchains for storing device credentials and authentication, unlike the current trend of using either a secured database or only a public blockchain. The consortium blockchain is used for first-time authentication, while the private blockchain is used for repeated authentication which saves the time incurred in accessing the consortium blockchain during repeated authentication. The proposed protocol also includes mutual authentication between the entities involved and thus provides dual security (device authentication and mutual authentication) to the proposed protocol making the system more secure and robust against attacks. Security analysis of the proposed protocol is done using the Scyther tool and the protocol is also theoretically proven to be stable under various attacks using threat analysis and the real-or-random model (ROR). The performance analysis of the protocol is done by analyzing the computation and communication cost of the proposed protocol against other state-of-the-art protocols. Further, the proposed protocol is also evaluated in the blockchain testbed which includes Raspberry PI and Arduino components. The results conveyed that the introduction of a private blockchain reduces the time incurred in the device re-authentication. © 2024 KICS.