Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
23 results
Search Results
Item Cross layer service driven adaptive retry limit for IEEE 802.11 mobile ad-hoc networks(2011) Manjappa, M.; Guddeti, G.Traffic in future Mobile Ad-Hoc Network (MANET) is expected to carry a mix of real time multimedia, and non real time file transfer etc. Providing Quality of Service (QoS) for these different applications is difficult and the current research on MANET is choosing the Cross Layer Design for providing QoS. The packet loss due to collision is misinterpreted by MANET as route failure and this triggers route maintenance phase causing unnecessary overhead resulting in low throughput. In this paper, we propose a service driven cross layer model in order to increase the throughput by dynamically adjusting the limits of Request to Send (RTS) retransmission for different flows in the network according to the priority. Simulation is done in NS-2 and the proposed method is compared with IEEE 802.11 DCF MAC using two ad-hoc routing protocols namely AODV and DSR. The results show that the prioritized flow achieves higher throughput over un-prioritized flow when compared to IEEE 802.11 MAC. © 2011 IEEE.Item Throughput enhancement of the prioritized flow in self aware MANET based on neighborhood node distances(2011) Manjappa, M.; Guddeti, G.Mobility causes frequent link failures in ad hoc network resulting in packet losses. Another cause of packet loss is collision which MANET misinterprets as link failure and triggers route maintenance phase. Triggering of this unnecessary route maintenance phase adds extra overhead to the network resulting in low throughput. In this paper a Quality of Service (QoS) aware cross layer model PrioritizedQoS (PrQoS) is proposed to improve the throughput of the prioritized flow in Self Aware MANET. According to the distance of the receiving node from the transmitting node, which is found using Received Signal Strength, packets are treated differently in lower layers by dynamically adjusting the Request To Send (RTS) retry limit based on the priority of the flow. The simulation is done in ns-2 and the PrQoS is compared with the traditional methods i.e. default behavior of the protocols. The results show that the prioritized flow achieves higher throughput than the unprioritized flow when compared to traditional method. Further the PrQoS also avoids unnecessary route re-discovery attempts by finding the root cause of the packet drop based on the distance between the nodes thereby reducing the network load. © 2011 IEEE.Item Cognitive network layer in MANETs mobility aware routing protocol(2012) Zakeerhusen, A.G.; Manjappa, M.; Guddeti, G.It is intended to add cognition to make cognitive network layer in order to design and develop Quality of Service (QoS) aware adaptive routing protocol in Mobile Adhoc Networks (MANETs). QoS-aware routing is challenging as nodes in the network are free to move, the topology will be changing dynamically. Performance of AODV will be less when nodes in the network are highly mobile. In this paper, Mobility Aware Routing Protocol (MARP) model is proposed to extract a core part in MANET that is stable in terms of mobility of the nodes. This core part is a subset of MANET mobile nodes through which transmission will be done. Here selection of paths through this extracted core can ensure more QoS in time. The MARP model not only provides a better way to discover a QoS but it considers an efficient route maintenance scheme by selecting the route which has more stability as source is having knowledge about other available paths. Since MARP is multipath routing protocol, route maintenance is easy and it robust. By simulation MARP show better performance over existing AODV-on demand routing protocol. © 2012 Springer-Verlag.Item Distance based termite algorithm for mobile ad-hoc networks(2012) Manjappa, M.; Praveenkumar, G.H.; Guddeti, G.Providing Quality of Service (QoS) in Mobile Ad-Hoc Networks (MANET's) is difficult due to dynamic nature of its topology. Today's research trends show that Swarm Intelligence (SI) can be used effectively to provide QoS in MANET and also MANET is not much explored in the area of SI. Motivated by their self organizing behavior and robustness many routing algorithms have been proposed for both wired and wireless networks. SI routing algorithms are driven by mainly two functions, Pheromone update-decay functions and Forwarding functions. In this paper, a new pheromone update and decay function for Termite algorithm is proposed for MANET which reflects the current context of the network that is the distance between the Mobile Nodes at the time of transmitting the packets. Received Signal Strength (Pr) from Physical Layer is used to find the distance and it is made visible at the Network Layer through Cross Layer Model. The proposed model is simulated and the results are compared with the existing methods and the metric used for the comparison are throughout and control packet overhead. The results show that the new distance based pheromone update and decay methods perform better than the other existing methods. © 2012 Springer-Verlag.Item Optimized Termite: A bio-inspired routing algorithm for MANET's(2012) Hoolimath, P.K.G.; Manjappa, M.; Guddeti, G.A Mobile Adhoc Network (MANET) is a collection of mobile nodes connected by the Wireless medium and each mobile node is aware of only its neighbours. Due to mobility of these mobile nodes the topology changes dynamically. Such a dynamic network topology makes the task of routing a challenging one. Recently, a new class of routing algorithms based on Swarm Intelligence has emerged. These algorithms are inspired by nature's self-organizing systems like ant-colonies, bird-flocks, honey-bees, school of fish, spiders and fireflies. The characteristics of such algorithms are their capability of self-organization, adaptation to the changing conditions, self healing and local decision making. In this work, a routing protocol inspired by the termite activity in nature, called Optimized-Termite (Opt-Termite), is proposed. Opt-Termite uses concept of stigmergy for self-organization, thereby reducing the control packet overhead. Opt-Termite mainly concentrates on load balancing for optimization. With Opt-Termite, a route with less loaded mobile nodes in terms of traffic will be chosen to reach destination. The routing information at each node gets influenced by the movement of packets and the routing table will be updated accordingly. It also allows the use of multiple paths and each packet is routed randomly and independently. Opt-Termite is implemented in ns-2 and its performance is compared with traditional routing protocol AODV. Opt-Termite's performance has been promising. © 2012 IEEE.Item A gene expression based quality of service aware routing protocol for mobile ad hoc networks(2013) Kubusada, Y.; Mohan, G.; Manjappa, M.; Guddeti, G.Mobile Ad Hoc Network (MANET) is a collection of infrastructure less multi-hop wireless mobile nodes which communicate together to achieve the global task. Despite lack of centralized control these mobile nodes still coordinate together to deliver the message to the destination node. MANET is gaining its popularity due to its easy deployment and self-organizing ability. In spite of its unique characteristics, mobility of mobile nodes causes frequent link breakups in MANET and thus makes route setup and maintenance a critical and challenging task. As real time and multimedia applications are increasing, there is a need of an efficient Quality of Service (QoS) aware routing protocol for MANET to support such applications. In the present work, the authors proposed an efficient QoS aware routing protocol for MANET based on upcoming Gene Expression Programming. In the proposed work, the information regarding the availability of resources is managed by a resource management module, which assists in selecting the resource rich path. Further, a theoretical proof is given for the proposed model for its correctness. The results are compared with the state of art artificial neural network and support vector regression methods from the performance evaluation point of view and the results are encouraging. © 2013 Springer Science+Business Media.Item Baud Rate-Based Hierarchical Multihop Routing Protocol for WSNs(Springer Science and Business Media Deutschland GmbH, 2020) Sowmya, G.V.; Manjappa, M.In wireless sensor networks (WSNs), the data sensed by the sensor node are forwarded to the sink node either by direct communication or by multihop communication. The disadvantage of direct communication is that the sensor nodes consume more energy to reach the sink node as each sensor node has to work alone to reach the sink node, and if the sink node is too far, condition gets worsens. Contrary to direct communication, the multihop communication saves energy as it forwards the data to the nearest neighbor node which in turn forwards the data toward the sink node. In multihop communication, choosing the best neighbor node for forwarding the data is the most challenging task. Hence, in this article, a novel hierarchical multihop routing protocol for WSNs referred to as “Baud Rate-Based Hierarchical Multihop Routing Protocol for WSNs†has been proposed which uses Shannon channel capacity model ‘C’ and neighbor node distance to choose the best neighbor node; the chosen neighbor node will be capable of transmitting data with high baud rate, thereby increasing the throughput of the network. Further, the proposed model also increases the lifetime of the network as the nearest neighbor node will be chosen for the data transfer which saves the energy of the sensor node. The proposed algorithm is compared against the LEACH routing protocol and multihop LEACH protocol and is implemented in MATLAB. The quantitative and qualitative analysis of the simulation results depicts that the proposed algorithm performs better against the parameters remaining energy of the sensor nodes, network lifetime, and data throughput when compared to LEACH and multihop LEACH protocols. © 2020, Springer Nature Singapore Pte Ltd.Item Inter-Planetary File System Enabled Blockchain Solution for Securing Healthcare Records(Institute of Electrical and Electronics Engineers Inc., 2020) Marangappanavar, R.K.; Manjappa, M.The sharing of health-related data has become challenging in terms of data security which may lead to compromise patient's privacy. Generally, once the report generated by the health provider is final, it will be uploaded to the hospital's private repository. When it comes to the hospital as an organization, many participants [Doctor, Patient, Researcher, Insurance company] requires the report of patients for one or other reasons. Providing a single platform for all participants to share confidential data securely is a difficult and challenging task. Care should be taken such that the personal data of the patients should not be misused or tampered. Existing methods have been proved insufficient to effectively manage and secure health records. Blockchain technology, a recent research trend, has shown promising results for such secure data sharing. Since the contents of blockchain are tamper-proof, all participants can access the data but cannot change the data. By employing smart contracts and access control programs one can monitor data activity in the blockchain network. In this article, a blockchain architecture has been designed and discussed for secure and easy sharing of patient's Personal Health Report(PHR) among the different players of health organization. Further, Inter-Planetary File System (IPFS) has also used in the proposed blockchain architecture for faster retrieval of PHR's. We demonstrate the strengths of our proposed model, its user-centric focus and also the experimental results. © 2020 IEEE.Item Peer Consonance in Blockchain based Healthcare Application using AI-based Consensus Mechanism(Institute of Electrical and Electronics Engineers Inc., 2020) Kumar, N.; Parangjothi, C.; Guru, S.; Manjappa, M.The term 'Blockchain', commonly referred to as the brain behind the Bitcoin network, works on the simple principle of the presence of a distributed and decentralized ledger in a public or private network. Since blockchain is decentralized, it is the duty of the Consensus Algorithm to substantiate the details in the blockchain. Traditional consensus algorithms such as Proof of Work (PoW) and Proof of Stake (PoS), although widely used, are a matter of concern due to computationally expensive operations and convergence towards a monopolized system respectively. Though optimizations of PoW and PoS algorithms were subsequently introduced, their features precincts. This paper aims to provide a solution by presenting a consensus algorithm based on Artificial Intelligence (AI) technology while maintaining the fairness of the system. A Healthcare based system was set up on top of the blockchain network to generate the dataset about the miners in order to train our neural network. On the whole, it incorporated the advantages of the state of the art consensus models which can increase the efficiency of the healthcare industry while diminishing their demerits. © 2020 IEEE.Item ShardCons - A Sharding Based Consensus Algorithm for Blockchain(Institute of Electrical and Electronics Engineers Inc., 2021) Kumar, A.; Sangoi, A.; Raj, S.; Manjappa, M.Blockchain, the foundation of Bitcoin, has received extensive attentions in recent days. Blockchain-based applications are springing up, covering numerous fields including financial services, reputation system, Internet of Things (IoT), Healthcare systems, Supply Chain Management and so on. Blockchain serves as an immutable ledger which allows transactions to be securely accomplished via point-to-point connections in a distributed system without the need for a third-party. Since it is decentralized, consensus algorithms keeps hold the integrity of the transactions which are added in the chain. Consensus algorithms are the primary root of the blockchain technology and a good consensus algorithm can guarantee the fault tolerance and security of the blockchain systems. In this article, authors present a novel consensus algorithm for public blockchain which shards the miners based on their performance. Once the sharding of miners is done, the best miner from each shard is chosen to form a Super shard of miners, and then from Super shard, one miner is randomly chosen as a winner miner who will mine the next block in the blockchain network. For sharding, performance history of miners will be maintained in each miner and re-sharding will be done at regular intervals in order to bring fairness in the system. The proposed sharding based consensus algorithm solves one of the main problem of public blockchain which is scalability issue. This performance based consensus algorithm also ensures more fairness, avoids starvation, improves the trust among the miners and enhances the overall performance of the blockchain network. © 2021 IEEE.
- «
- 1 (current)
- 2
- 3
- »