scispace - formally typeset
Search or ask a question
Author

Bibhash Roy

Bio: Bibhash Roy is an academic researcher from Tripura Institute of Technology. The author has contributed to research in topics: Routing protocol & Optimized Link State Routing Protocol. The author has an hindex of 5, co-authored 7 publications receiving 153 citations.

Papers
More filters
Posted Content
TL;DR: A new QoS algorithm for mobile ad hoc network has been proposed that combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.
Abstract: Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. When it comes to MANET, the complexity increases due to various characteristics like dynamic topology, time varying QoS requirements, limited resources and energy etc. QoS routing plays an important role for providing QoS in wireless ad hoc networks. The biggest challenge in this kind of networks is to find a path between the communication end points satisfying user’s QoS requirement. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. In this paper, a new QoS algorithm for mobile ad hoc network has been proposed. The proposed algorithm combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.

82 citations

Proceedings ArticleDOI
24 Mar 2011
TL;DR: The theoretical analysis and implementations shows the proposed DNA cryptography method to be efficient in computation, storage and transmission; and it is very powerful against certain attacks.
Abstract: Cryptography is one of the major concerned areas of computer and data security and a very promising direction in cryptography research is known as DNA Cryptography. DNA computational logic can be used in cryptography for encrypting, storing and transmitting the information, as well as for computation. Although in its primitive stage, DNA cryptography is shown to be very effective. In this paper, a proposal is given where the concept of DNA is being used in the encryption and decryption process. The theoretical analysis and implementations shows this method to be efficient in computation, storage and transmission; and it is very powerful against certain attacks. This paper also proposes a unique cipher text generation procedure as well as a new key generation procedure. Finally, to demonstrate the performance of the proposed method, its implementation is explained and the results are analyzed.

39 citations

Proceedings ArticleDOI
16 Oct 2010
TL;DR: A new algorithm has been proposed to map the QoS parameters into a single numeric weight in order to select the MPR node using OLSR (Optimized Link State Routing) by enhancing the M PR (Multi Point Relay) selection criteria.
Abstract: Mobile Ad-hoc Networks (MANET) is the self organizing collection of mobile nodes. The communication in MANET is done via a wireless media. In order to support the growing need for multimedia and real time applications, QoS support has become essential. However it is a challenge to route QoS in wireless environment due to node’s dynamic nature and mobility. This paper aims towards efficient QoS routing using OLSR (Optimized Link State Routing) by enhancing the MPR (Multi Point Relay) selection criteria. Considering the QoS parameters of effective bandwidth and end-to-end delay, a new algorithm has been proposed to map the QoS parameters into a single numeric weight in order to select the MPR node. The simulation results establish the efficiency of the proposed methodology.

14 citations

Book ChapterDOI
01 Jan 2016
TL;DR: This work attempts in identifying key risk factors and risk types for each of the development phases of SDLC, which would help in identifying the risks at a much early stage of development.
Abstract: In recent years, despite several risk management models proposed by different researchers, software projects still have a high degree of failures. Improper risk assessment during software development was the major reason behind these unsuccessful projects as risk analysis was done on overall projects. This work attempts in identifying key risk factors and risk types for each of the development phases of SDLC, which would help in identifying the risks at a much early stage of development.

11 citations

Proceedings ArticleDOI
16 Oct 2010
TL;DR: This paper aims towards proposing a new route maintenance strategy with multiple options that will lead to better performance during link failure on a route.
Abstract: The challenges of mobile ad hoc network are to maintain quality of services and performance. Many routing protocols like AODV discover routes whenever required by the source node and the benefit in doing so is that no prior knowledge of the topology is required. The AODV routing protocol is commonly and effectively used for mobile, ad-hoc nodes [4, 7, 8, 15, 22, 23]. So far, many maintenance strategies have been proposed on AODV to provide better QoS services [7, 10, 19, 21] performances. Some has used the radio propagation characteristics of mobile nodes in ad hoc network [12, 23] during route maintenance [22]. Some modification has been done on computation of delay parameter [16, 19, 22]. The other modification was on multi route selection during route discovery considering only delay as QoS parameter [5, 23]. This paper aims towards proposing a new route maintenance strategy with multiple options that will lead to better performance during link failure on a route. During route discovery and route reply procedure [26] two different QoS parameters considered here are delay and bandwidth. The routes should be selected during route discovery process. The route maintenance strategy may be applied to both the routes independently and simultaneously by the internal nodes where the link failure has occurred.

6 citations


Cited by
More filters
Posted Content
TL;DR: This paper is a general survey of all the security issues existing in the Internet of Things along with an analysis of the privacy issues that an end-user may face as a consequence of the spread of IoT.
Abstract: This paper is a general survey of all the security issues existing in the Internet of Things (IoT) along with an analysis of the privacy issues that an end-user may face as a consequence of the spread of IoT. The majority of the survey is focused on the security loopholes arising out of the information exchange technologies used in Internet of Things. No countermeasure to the security drawbacks has been analyzed in the paper.

431 citations

Journal ArticleDOI
TL;DR: This paper provides a taxonomy of various ant colony algorithms with advantages and disadvantages of each others with respect to various metrics.

86 citations

Posted Content
TL;DR: A new QoS algorithm for mobile ad hoc network has been proposed that combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.
Abstract: Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. When it comes to MANET, the complexity increases due to various characteristics like dynamic topology, time varying QoS requirements, limited resources and energy etc. QoS routing plays an important role for providing QoS in wireless ad hoc networks. The biggest challenge in this kind of networks is to find a path between the communication end points satisfying user’s QoS requirement. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. In this paper, a new QoS algorithm for mobile ad hoc network has been proposed. The proposed algorithm combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.

82 citations

Journal ArticleDOI
TL;DR: This paper proposes an Innovative ACO based Routing Algorithm (ANTALG) by considering a random selection of source and destination nodes and exchanges the Ants (agents) between them and shows that throughput in the proposed ANTALG algorithm is more than in AODV, ADSR and HOPNET.

56 citations

Journal ArticleDOI
TL;DR: TERP incorporates a composite routing function that encompasses trust, residual-energy, and hop count of neighbor nodes in making routing decisions that helps to balance out energy consumption among trusted nodes while routing data using shorter paths.
Abstract: The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can't be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust based solutions have proved to be more effective to address nodes' misbehavior attacks. Apart from isolating misbehaving nodes, the existing trust based schemes lacks the capability to minimize link failure notifications due to transient transmission disruption which consequently give rise to frequent route breakages thereby undermining throughput and route stability. Moreover, the existing solutions give rise to high energy consumption and control overhead in pursuit of trust estimation and network-wide dissemination which not only adds to network congestion but also undermines network lifetime. In this paper, we present a Trust and Energy aware Routing Protocol (TERP) that makes use of a distributed trust model for the detection and isolation of misbehaving nodes. TERP incorporates a composite routing function that encompasses trust, residual-energy, and hop count of neighbor nodes in making routing decisions. This multi-facet routing strategy helps to balance out energy consumption among trusted nodes while routing data using shorter paths. Moreover, TERP intelligently evaluates the actual link breakage thereby avoiding unnecessary route discoveries. Simulation results demonstrate improved throughput, network lifetime and route stability of TERP when compared to existing work.

46 citations