Journal Articles
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/19884
Browse
9 results
Search Results
Item Design and evaluation of load balanced termite: A novel load aware bio inspired routing protocol for mobile Ad Hoc network(Kluwer Academic Publishers, 2014) Manjappa, M.; Guddeti, G.Bio inspired computing based on Swarm Intelligence is successful in dealing with the networking problems such as routing, congestion and load balancing by finding an optimal path to the destination. Most of the existing bio inspired protocols for MANETs focused only on the routing problem. In this paper, a novel heuristic bio inspired routing with load balancing algorithm referred to as Load Balanced Termite (LB-Termite) is proposed for MANETs by exploiting the salient features of social insect, "Termites". The primary objective of the LB-Termite algorithm is to find the stable nodes and thereby giving preferences for these stable nodes during the path setup; thus finding the reliable route to the destination. The secondary objective of the proposed LB-Termite algorithm is to mitigate the stagnation problem by using pheromone heuristic control method. The simulation results of LB-Termite are compared with other state-of-the-art bio inspired routing algorithms (ACO based Simple Ant Routing Algorithm and the Termite algorithm) and non bio inspired (Ad Hoc on Demand Distance Vector Routing Algorithm) routing protocols for its performance evaluation and the results are found to be encouraging. © 2013 Springer Science+Business Media New York.Item Bat-termite: A novel hybrid bio inspired routing protocol for mobile ad hoc networks(Inderscience Publishers, 2014) Manjappa, M.; Guddeti, R.M.R.In this paper, the authors have proposed a novel hybrid bio-inspired routing protocol for Mobile Ad Hoc Networks (MANETs), referred to as bat-termite, by combining the unique features of both social insect termites and mammals bats. The primary objective of the proposed work is to design an adaptive routing protocol for MANETs based on the hill building nature of the termites. The secondary objective of the proposed work is to improve the backup route maintenance of the proposed algorithm using the echo-location feature of the bats. The proposed bat-termite algorithm exhibits superior routing features such as quick route discovery, high robustness with efficient management of multiple routes and rapid route repair. The bat-termite algorithm is simulated in NS-2 and the simulation results are compared with the bio-inspired (termite and D-Termite) and non bio-inspired (AODV and AOMDV) routing protocols from the performance evaluation point of view. Copyright © 2014 Inderscience Enterprises Ltd.Item Firefly algorithm for self organization of mobile wireless sensor network(Engineering and Technology Publishing, 2020) Mamatha, K.M.; Manjappa, M.For a Wireless Sensor Network (WSN), designing low power scalable network remains a challenge for researchers. The sensor nodes find it difficult to gather and transfer data to sink node when they are deployed in hostile and unfavorable environment. Hence, establishing and maintaining connectivity among the mobile sensor nodes in decentralized network play an important role when the environment is unfavorable. Senor nodes self organize themselves in order to establish and maintain the connectivity. This paper proposes a nature based Swarm Intelligence (SI) technique, based on insect firefly to enhance connectivity among the sensor nodes for a decentralized mobile WSN in an energy efficient manner. The foraging feature of insect firefly is used in the proposed algorithm for which a multi-objective fitness function with parameter energy and distance has been designed. The proposed algorithm is theoretically analyzed and verified by simulation and the results show that the proposed algorithm leads energy consumption compared to existing firefly algorithm and prolongs the network lifetime significantly. © 2020 Journal of Communications.Item Energy Aware Stable Multipath Disjoint Routing Based on Accumulated Trust Value in MANETs(Modern Education and Computer Science Press, 2022) Benakappa, S.M.; Manjappa, M.Conserving energy and finding the stable path are the two vital issues in Mobile Ad Hoc Networks (MANETs) as the prior increases the network lifetime and the later increases the network throughput. The nodes which are not legitimate in terms of residual energy and packet forwarding history might be a threat to the path thereby making the path unstable. Thus, it results in frequent link failure, reduced throughput, reduced network and path life time. In order to reduce these hazards, authors have proposed an energy efficient, reliable path selecting protocol referred to as Trust Based Energy Aware Multipath Disjoint Routing Protocol (TEA-MDRP) for MANETS in this article. TEA-MDRP finds the optimum route between the source and the destination nodes using two parameters namely, the Accumulated Trust Value (ATV) and the node’s residual energy (Nres). ATV is calculated based on the packet forwarding status of the node which shows how good the node is in terms of packet forwarding point of view. TEA-MDRP allows only the nodes which have a good ATV and sufficient residual energy. A good ATV shows loyalty in forwarding the packets while a sufficiently large residual energy node avoids frequent path breakups and packet drops. Thus, the TEA-MDRP not only increases the network and path lifetime but also increases the throughput of the communication. Further, with the legitimate nodes in the paths, the TEA-MDRP considerably reduces the control packet overhead which might occur because of the frequent route re-discovery process. An extensive simulation is carried out using Network Simulator-2.35 for the quantitative and qualitative analysis of TEA-MDRP. The results obtained are compared with classical AOMDV and the results are satisfactory. © 2022 MECS.Item Improved Harmony Search Algorithm for Multihop Routing in Wireless Sensor Networks(Pleiades Publishing, 2022) Sowmya, G.V.; Manjappa, M.Abstract: Energy efficiency is critical for prolonging the network lifetime of Wireless Sensor Network (WSN), and is the most important objective for any routing algorithm for WSN. In this article authors have proposed a Multihop harmony search algorithm for WSN with two objectives, first being increasing the throughput of the network and second being optimizing the energy consumption of the sensor nodes and thereby prolonging the lifetime of network. Finding the goodness of the communication channel/path is quite important. Sometimes, though the channel capacity is more, fewer amounts of data may be transmitted in the channel resulting in under utilization of the resources; and other times, though the channel capacity is less, more data may be dumped into the channel resulting in channel congestion and less output. Thus, if the goodness of the communication channel is known in advance, then it is easy for the algorithms to decide the upper bound of the channel and can have a congestion free and error free information transmission. Thus, the proposed algorithm employ Shannon channel capacity ‘C’ (baud rate) for finding the best next hop and the same is used for initialization of Harmony Memory. An effective local search strategy is also proposed to strengthen the local harmony search ability so that the convergence speed and the accuracy of routing algorithm is improved. Finally, an objective function model is developed by taking path length, energy consumption, and residual energy in to consideration. The proposed algorithm is compared with existing Multihop LEACH, BRM (Baud rate based Multihop routing protocol) and EEHSBR (Energy Efficient Harmony Search Based Routing) algorithm for the quantitative and qualitative analysis. The simulation results reveal that the proposed algorithm performs better than the considered algorithms in terms of network lifetime, throughput and energy consumption. © 2022, Pleiades Publishing, Ltd.Item An Iterative-Based Optimum Power and Resource Allocation in Application-Dependent Scenarios for One-to-One D2D Communication(Institute of Electrical and Electronics Engineers Inc., 2024) Raghu, T.V.; Manjappa, M.Efficient and timely sharing of critical information is crucial for Public Safety (PS) communications, which can be fulfilled using one of the cutting-edge technologies, Device-to-device (D2D) communication. During an emergency, the PS applications should be prioritized over other applications, ensuring the emergency messages reach the first responders in time. Due to its inherent characteristics, the evolved Node Base station will not prioritize or categorize the D2D communication based on its application type, thus treating all applications equally. Further, D2D communication introduces significant interference to cellular users and vice-versa while sharing resources, and it is vital to reduce the impact of these interferences to ensure the Quality of Service for all users in the network. Hence, this article proposes a novel interference management approach to increase the overall sum rate of the system. In addition, the proposed approach also allows more D2D communication in general, particularly PS application-based D2D communication, to be active in the network. As the formulated problem is a Mixed-Integer Non-Linear Programming (MINLP) type of problem, it is split into two sub-problems, namely, Iterative Resource Allocation and Sharing and Iterative Power Optimization to achieve a polynomial time complexity. The theoretical proofs adequately explain the algorithm's time complexity and convergence property. The simulation results show that the proposed system enhances the overall sum rate by allowing more active PS D2D applications in the network. © 2013 IEEE.Item Priority-Driven Resource Allocation and Power Optimization in D2D Communication(Institute of Electrical and Electronics Engineers Inc., 2024) Raghu, T.V.; Manjappa, M.This research proposes priority-driven application-based channel assignment and power optimization frameworks called Channel State Information-based Resource Allocation (CSIRA) and Binary Search Power Control Mechanism (BSPCM) in D2D-enabled cellular communication. The CSIRA framework is cluster-based and uses a K-means clustering algorithm to group the D2D users into clusters. CSIRA allows the D2D users to share the cellular user's resources without compromising the cellular user's Quality of Service (QoS) in each cluster. Also, CSIRA ensures that public safety communication will get an edge over commercial communication during resource allocation. In order to ensure the QoS for cellular users is maintained while also enhancing the sum rate of D2D communication, the CSIRA employs the BSPCM framework. BSPCM framework utilizes a binary search algorithm to determine the optimal transmission power required for guaranteed D2D transmission within a cluster, thereby mitigating interference effects. A theoretical proof is provided to show that the suggested frameworks converge to a stable matching and end after a finite number of iterations. Simulation results demonstrate that the proposed frameworks effectively prioritizes public safety over commercial applications while preserving optimal system efficiency and quality with minimal complications. © 2017 IEEE.Item Blockchain based secure Ownership Transfer Protocol for smart objects in the Internet of Things(Elsevier B.V., 2024) Manjappa, M.; Ray, B.; Hassan, J.; Kashyap, A.; Chandrappa, V.Y.Secure digital ownership transfer is critical for smart objects within the Internet of Things (IoT) ecosystem. This paper presents the Ownership Transfer Protocol (OTP), which leverages Physically Unclonable Function (PUF) and blockchain technology to ensure the secure transfer of ownership for smart objects in the IoT. The proposed protocol can securely track and trace smart objects during their movement in the IoT supply chain. Unlike the traditional Ownership Transfer (OT) architecture, the proposed architecture does not require a Trusted Third Party (TTP) and can support Partial Ownership Transfer (POT). The innovative use of immutable blockchain architecture enabled the proposed protocol to effectively support distributed environments and authenticate both the device and involved parties. The proposed protocol is evaluated for its robustness against common attacks outlined in this paper and implemented using the Ethereum blockchain. The testbed results on Ethereum confirm the optimal gas consumption of the proposed model. Furthermore, utilizing the security claim verification tool, Scyther, the experiment validates the security claim regarding the communication between the parties involved in the proposed protocol's OT process. © 2023 Elsevier B.V.Item Physical unclonable functions and QKD-based authentication scheme for IoT devices using blockchain(Elsevier B.V., 2024) Cunha, T.B.D.; Manjappa, M.; Ranjan, R.; Vasilakos, A.V.As the number of Internet of Things (IoT) devices is increasing exponentially, strong security measures are needed to guard against different types of cyberattacks. This research offers a novel IoT device authentication technique to mitigate these challenges by integrating three cutting-edge technologies namely blockchain technology, Quantum Key Distribution (QKD), and Physically Unclonable Functions (PUFs). By utilizing the distinctive qualities of PUFs for device identification and the unrivaled security of QKD for key exchange, the proposed approach seeks to address the significant security issues present in IoT environments. Adopting blockchain technology ensures transparency and verifiability of the authentication process across distributed IoT networks by adding an unchangeable, decentralized layer of trust. An examination of the computing and communication costs reveals that the proposed protocol is effective, necessitating low computational resources that are critical for IoT devices with limited resources. The protocol's resistance against a variety of attacks is demonstrated by formal proofs based on the Real-Or-Random (ROR) model and security evaluations using the Scyther tool, ensuring the integrity and secrecy of communications. Various threats are analyzed, and the protocol is proven to be secure and efficient from all forms of attacks. © 2024 Elsevier B.V.