Debajit Sensarma | Vidyasagar University (original) (raw)

Books by Debajit Sensarma

Papers by Debajit Sensarma

International Journal of Research Publication and Reviews, 2024

The rapid growth of cloud computing has led to an unprecedented demand for efficient virtual mach... more The rapid growth of cloud computing has led to an unprecedented demand for efficient virtual machine (VM) allocation strategies in data centers. One critical challenge is the Affinity-Aware VM Colocation Problem, which aims to optimise the placement of virtual machines while considering the affinity relationships between co-located VMs. In this paper, a study on some existing approaches to cope with affinity-aware VM Colocation problems based on graph theory is given.

International journal of innovative technology and exploring engineering, Aug 30, 2019

Now-a-days in the era of Big Data huge information is gathered in every second. Humans are now al... more Now-a-days in the era of Big Data huge information is gathered in every second. Humans are now already interconnected via smart phones, gadgets, smart meters and other smart appliances. Also all these computing devices are fully connected to each other and this is known as "Internet of Things" which produces crucial information in every moment. These sensitive information needs to be protected. So, design of a good security mechanism is needed to provide protection against unauthorized attacks on this information. This article mainly takes cryptography and graph as a tool and concentrated on designing two public key encryption scheme based on graph where the first protocol is based on properties of matrices generated from graph. The aim is to protect the message graph generated from a given message. The second protocol is based on the properties of graphical codes.

Handbook of Research on Data-Driven Mathematical Modeling in Smart Cities

Many megacities will emerge in the twenty-first century as a result of urbanization as a megatren... more Many megacities will emerge in the twenty-first century as a result of urbanization as a megatrend. Essential services like electricity, water, mobility, manufactured products, and healthcare will have to be delivered effectively in these densely, hugely populated centers. While these services may be regarded separately, they are in fact interconnected, particularly in light of the requirement for optimal resource use and, as a result, integration. Because the modelling foundations for these services are typically discipline specific, this offers a severe engineering challenge. Here comes the applications of graphs. Graphs can be used to model a smart city efficiently and solving graph theoretic problems can solve various real-life problems of smart cities. In this chapter a survey of works related to the applications of graphs in smart cities like modelling smart city, security, anomaly detection, transport, logistics, energy management etc. has been depicted, along with some futur...

ArXiv, 2015

Data hiding has received much attention due to rapid development of internet and multimedia techn... more Data hiding has received much attention due to rapid development of internet and multimedia technologies where security of information is a very important concern. This is achieved by Steganography, which is the art or science of hiding data into another data, so that human eyes cannot catch the hidden information easily. There are many ways to hide information-like inside an image, text, audio/ video etc. Among them image steganography is a very attractive research area. The goal is to transmit a data within a modified image (called stego-image)by minimizing the number of bit flips. In this paper, a new steganography technique has been proposed using Graphical codes and also comparison with steganography technique using BCH codes has been studied.

International Journal of Advance Engineering and Research Development, 2015

In formation security and Information storage are two important research aspects now-a-days. Whil... more In formation security and Information storage are two important research aspects now-a-days. While information security plays an important role in protecting the data and assets of an organization, there is a need for efficient storage of information to manage and process large graphs like web, socia l network, RDF graph, protein network and many more. In this paper, we investigate some algorithms to cope with the above two important problems in brief using a unified framework called graph because graph algorithm provides unified solution approach to many classical and modern application areas by taking graph as an omnipotent mathematical tool. Along with this some future scope have been discussed, which is inferred after studying the existing algorithms.

International Journal of Research in Engineering and Technology, 2014

Cryptography is one of the prime techniques of secured symbolic data transmission over any commun... more Cryptography is one of the prime techniques of secured symbolic data transmission over any communication channel. Security is the most challenging and essential aspects in today's internet and network applications. Thus, design of a secure encryption algorithm is very necessary which can protect the unauthorized attacks. An encryption algorithm is computationally secure if it cannot be intruded with the standard resources. The algorithm proposed here is graph based. Its efficiency surpasses the standard DES algorithm in general. Graphs can be used for designing block ciphers, stream ciphers or public-key ciphers. The algorithm is graph automorphism based partial symmetric key algorithm and it is not fully depended on secret key and produces different cipher text by applying same key on the same plain text.

International journal of Computer Networks & Communications, 2013

A Mobile Ad hoc network (MANET) is a self configurable network connected by wireless links. This ... more A Mobile Ad hoc network (MANET) is a self configurable network connected by wireless links. This type of network is only suitable for temporary communication links as it is infrastructure-less and there is no centralised control. Providing QoS aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of QoS aware routing is to find a feasible path from source to destination which will satisfy two or more end to end QoS constrains. Therefore, the task of designing an efficient routing algorithm which will satisfy all the quality of service requirements and be robust and adaptive is considered as a highly challenging problem. In this work we have designed a new efficient and energy aware multipath routing algorithm based on ACO framework, inspired by the behaviours of biological ants. Basically by considering QoS constraints and artificial ants we have designed an intelligent version of classical Temporally Ordered Routing Algorithm (TORA) which will increase network lifetime and decrease packet loss and average end to end delay that makes this algorithm suitable for real time and multimedia applications.

International journal of Computer Networks & Communications, 2013

MANET is a collection of mobile devices with no centralized control and no pre-existing infrastru... more MANET is a collection of mobile devices with no centralized control and no pre-existing infrastructures. Due to the nodal mobility, supporting QoS during routing in this type of networks is a very challenging task. To tackle this type of overhead many routing algorithms with clustering approach have been proposed. Clustering is an effective method for resource management regarding network performance, routing protocol design, QoS etc. Most of the flat network architecture contains homogeneous capacity of nodes but in real time nodes are with heterogeneous capacity and transmission power. Hierarchical routing provides routing through this kind of heterogeneous nodes. Here, routes can be recorded hierarchically, across clusters to increase routing flexibility. Besides this, it increases scalability and robustness of routes. In this paper, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster based topology in MANET which will be more scalable and efficient compared to flat architecture and will give better throughput.

International journal of applied engineering research, 2015

Zero Knowledge Protocol is an interactive proof system where one party (Prover) proves a statemen... more Zero Knowledge Protocol is an interactive proof system where one party (Prover) proves a statement to another party (Verifier) without yielding anything beyond the validity of assertion. Now-a-days, communication protocols are vulnerable to impersonation attack and the performance of the protocol degrades because without proper security, any time an eavesdropper or an intruder may listen in on the communication. Zero Knowledge protocol tries to cope with this type of situation. In this paper, we proposed a novel Zero Knowledge Protocol using well known Bin Packing Problem considering it as a special case of 3-PARTITION problem.

Lecture Notes in Electrical Engineering, 2022

A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre existing i... more A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre existing infrastructure or centralized control. Supporting QoS during routing is a very challenging task. Clustering is an effective method for resource management regarding network performance, routing protocol design, QoS etc. In real time various types of nodes with different computing and transmission power, different rolls and different mobility pattern may exist. Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper, HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster based topology in MANET which will be more scalable and efficient compared to flat architecture and will give better throughput.

Abstract: The Bin Packing Problem (BPP) is one of the most known combinatorial optimization probl... more Abstract: The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. The main objective of the problem is to minimize the number of bins used and pack the items with different sizes in finite number of bins efficiently. This paper introduces a new graph based algorithm for one dimensional bin packing problem. The proposed algorithm is implemented and tested with the well known benchmark instances and a comparison with existing First-Fit Decreasing (FFD) algorithm is given with respect to number of bins and waste space. In most of the cases the new algorithm produces near optimal solutions and performs better than FFD.

Journal of Global Research in Computer Sciences, 2014

The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. The m... more The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. The main objective of the problem is to minimize the number of bins used and pack the items with different sizes in finite number of bins efficiently. This paper introduces a new graph based algorithm for one dimensional bin packing problem. The proposed algorithm is implemented and tested with the well known benchmark instances and a comparison with existing First-Fit Decreasing (FFD) algorithm is given with respect to number of bins and waste space. In most of the cases the new algorithm produces near optimal solutions and performs better than FFD.

Key management represents a major and the most sensitive part of cryptographic systems. It includ... more Key management represents a major and the most sensitive part of cryptographic systems. It includes key generation, key distribution, key storage, and key deletion. It is also considered the hardest part of cryptography. Designing secure cryptographic algorithms is hard, and keeping the keys secret is much harder. Cryptanalysts usually attack both symmetric and public key cryptosystems through their key management. We introduce a protocol to exchange keys over insecure communication channel. This protocol generates keys for symmetric encryption, especially a key exchange based on Binary Decision Diagram.

Role of networks in our daily lives is very important. Effectiveness of network decreases with th... more Role of networks in our daily lives is very important. Effectiveness of network decreases with the breaking down of some nodes or links. So, less vulnerable communication network is required for greater stability. Vulnerability is the measure of the resistance of the network after failure of communication links. In this article, a graph has been considered for modeling a network and integrity as the measure of vulnerability, and the aim is to construct a graphic integer sequence of a graph or network with maximum number of edges from a given vertex order or number of vertices and graph integrity in linear time. Experiments show some possible graphs with maximum number of edges which obeys the given vertex order and integrity.

Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are int... more Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active research area, basically for supporting real time applications that are based upon interaction between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve more deterministic behavior of the network i.e. a stable path, so that information carried by the network can be delivered in an uninterrupted fashion and for better resource utilization. In this paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing algorithm for MANETs with better route failure management and which will be highly adaptive and energy efficient.

International Journal of Computer Sciences and Engineering

International Journal of Research Publication and Reviews, 2024

The rapid growth of cloud computing has led to an unprecedented demand for efficient virtual mach... more The rapid growth of cloud computing has led to an unprecedented demand for efficient virtual machine (VM) allocation strategies in data centers. One critical challenge is the Affinity-Aware VM Colocation Problem, which aims to optimise the placement of virtual machines while considering the affinity relationships between co-located VMs. In this paper, a study on some existing approaches to cope with affinity-aware VM Colocation problems based on graph theory is given.

International journal of innovative technology and exploring engineering, Aug 30, 2019

Now-a-days in the era of Big Data huge information is gathered in every second. Humans are now al... more Now-a-days in the era of Big Data huge information is gathered in every second. Humans are now already interconnected via smart phones, gadgets, smart meters and other smart appliances. Also all these computing devices are fully connected to each other and this is known as "Internet of Things" which produces crucial information in every moment. These sensitive information needs to be protected. So, design of a good security mechanism is needed to provide protection against unauthorized attacks on this information. This article mainly takes cryptography and graph as a tool and concentrated on designing two public key encryption scheme based on graph where the first protocol is based on properties of matrices generated from graph. The aim is to protect the message graph generated from a given message. The second protocol is based on the properties of graphical codes.

Handbook of Research on Data-Driven Mathematical Modeling in Smart Cities

Many megacities will emerge in the twenty-first century as a result of urbanization as a megatren... more Many megacities will emerge in the twenty-first century as a result of urbanization as a megatrend. Essential services like electricity, water, mobility, manufactured products, and healthcare will have to be delivered effectively in these densely, hugely populated centers. While these services may be regarded separately, they are in fact interconnected, particularly in light of the requirement for optimal resource use and, as a result, integration. Because the modelling foundations for these services are typically discipline specific, this offers a severe engineering challenge. Here comes the applications of graphs. Graphs can be used to model a smart city efficiently and solving graph theoretic problems can solve various real-life problems of smart cities. In this chapter a survey of works related to the applications of graphs in smart cities like modelling smart city, security, anomaly detection, transport, logistics, energy management etc. has been depicted, along with some futur...

ArXiv, 2015

Data hiding has received much attention due to rapid development of internet and multimedia techn... more Data hiding has received much attention due to rapid development of internet and multimedia technologies where security of information is a very important concern. This is achieved by Steganography, which is the art or science of hiding data into another data, so that human eyes cannot catch the hidden information easily. There are many ways to hide information-like inside an image, text, audio/ video etc. Among them image steganography is a very attractive research area. The goal is to transmit a data within a modified image (called stego-image)by minimizing the number of bit flips. In this paper, a new steganography technique has been proposed using Graphical codes and also comparison with steganography technique using BCH codes has been studied.

International Journal of Advance Engineering and Research Development, 2015

In formation security and Information storage are two important research aspects now-a-days. Whil... more In formation security and Information storage are two important research aspects now-a-days. While information security plays an important role in protecting the data and assets of an organization, there is a need for efficient storage of information to manage and process large graphs like web, socia l network, RDF graph, protein network and many more. In this paper, we investigate some algorithms to cope with the above two important problems in brief using a unified framework called graph because graph algorithm provides unified solution approach to many classical and modern application areas by taking graph as an omnipotent mathematical tool. Along with this some future scope have been discussed, which is inferred after studying the existing algorithms.

International Journal of Research in Engineering and Technology, 2014

Cryptography is one of the prime techniques of secured symbolic data transmission over any commun... more Cryptography is one of the prime techniques of secured symbolic data transmission over any communication channel. Security is the most challenging and essential aspects in today's internet and network applications. Thus, design of a secure encryption algorithm is very necessary which can protect the unauthorized attacks. An encryption algorithm is computationally secure if it cannot be intruded with the standard resources. The algorithm proposed here is graph based. Its efficiency surpasses the standard DES algorithm in general. Graphs can be used for designing block ciphers, stream ciphers or public-key ciphers. The algorithm is graph automorphism based partial symmetric key algorithm and it is not fully depended on secret key and produces different cipher text by applying same key on the same plain text.

International journal of Computer Networks & Communications, 2013

A Mobile Ad hoc network (MANET) is a self configurable network connected by wireless links. This ... more A Mobile Ad hoc network (MANET) is a self configurable network connected by wireless links. This type of network is only suitable for temporary communication links as it is infrastructure-less and there is no centralised control. Providing QoS aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of QoS aware routing is to find a feasible path from source to destination which will satisfy two or more end to end QoS constrains. Therefore, the task of designing an efficient routing algorithm which will satisfy all the quality of service requirements and be robust and adaptive is considered as a highly challenging problem. In this work we have designed a new efficient and energy aware multipath routing algorithm based on ACO framework, inspired by the behaviours of biological ants. Basically by considering QoS constraints and artificial ants we have designed an intelligent version of classical Temporally Ordered Routing Algorithm (TORA) which will increase network lifetime and decrease packet loss and average end to end delay that makes this algorithm suitable for real time and multimedia applications.

International journal of Computer Networks & Communications, 2013

MANET is a collection of mobile devices with no centralized control and no pre-existing infrastru... more MANET is a collection of mobile devices with no centralized control and no pre-existing infrastructures. Due to the nodal mobility, supporting QoS during routing in this type of networks is a very challenging task. To tackle this type of overhead many routing algorithms with clustering approach have been proposed. Clustering is an effective method for resource management regarding network performance, routing protocol design, QoS etc. Most of the flat network architecture contains homogeneous capacity of nodes but in real time nodes are with heterogeneous capacity and transmission power. Hierarchical routing provides routing through this kind of heterogeneous nodes. Here, routes can be recorded hierarchically, across clusters to increase routing flexibility. Besides this, it increases scalability and robustness of routes. In this paper, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster based topology in MANET which will be more scalable and efficient compared to flat architecture and will give better throughput.

International journal of applied engineering research, 2015

Zero Knowledge Protocol is an interactive proof system where one party (Prover) proves a statemen... more Zero Knowledge Protocol is an interactive proof system where one party (Prover) proves a statement to another party (Verifier) without yielding anything beyond the validity of assertion. Now-a-days, communication protocols are vulnerable to impersonation attack and the performance of the protocol degrades because without proper security, any time an eavesdropper or an intruder may listen in on the communication. Zero Knowledge protocol tries to cope with this type of situation. In this paper, we proposed a novel Zero Knowledge Protocol using well known Bin Packing Problem considering it as a special case of 3-PARTITION problem.

Lecture Notes in Electrical Engineering, 2022

A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre existing i... more A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile devices with no pre existing infrastructure or centralized control. Supporting QoS during routing is a very challenging task. Clustering is an effective method for resource management regarding network performance, routing protocol design, QoS etc. In real time various types of nodes with different computing and transmission power, different rolls and different mobility pattern may exist. Hierarchical routing provides routing through this kind of heterogeneous nodes. In this paper, HAQR, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster based topology in MANET which will be more scalable and efficient compared to flat architecture and will give better throughput.

Abstract: The Bin Packing Problem (BPP) is one of the most known combinatorial optimization probl... more Abstract: The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. The main objective of the problem is to minimize the number of bins used and pack the items with different sizes in finite number of bins efficiently. This paper introduces a new graph based algorithm for one dimensional bin packing problem. The proposed algorithm is implemented and tested with the well known benchmark instances and a comparison with existing First-Fit Decreasing (FFD) algorithm is given with respect to number of bins and waste space. In most of the cases the new algorithm produces near optimal solutions and performs better than FFD.

Journal of Global Research in Computer Sciences, 2014

The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. The m... more The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. The main objective of the problem is to minimize the number of bins used and pack the items with different sizes in finite number of bins efficiently. This paper introduces a new graph based algorithm for one dimensional bin packing problem. The proposed algorithm is implemented and tested with the well known benchmark instances and a comparison with existing First-Fit Decreasing (FFD) algorithm is given with respect to number of bins and waste space. In most of the cases the new algorithm produces near optimal solutions and performs better than FFD.

Key management represents a major and the most sensitive part of cryptographic systems. It includ... more Key management represents a major and the most sensitive part of cryptographic systems. It includes key generation, key distribution, key storage, and key deletion. It is also considered the hardest part of cryptography. Designing secure cryptographic algorithms is hard, and keeping the keys secret is much harder. Cryptanalysts usually attack both symmetric and public key cryptosystems through their key management. We introduce a protocol to exchange keys over insecure communication channel. This protocol generates keys for symmetric encryption, especially a key exchange based on Binary Decision Diagram.

Role of networks in our daily lives is very important. Effectiveness of network decreases with th... more Role of networks in our daily lives is very important. Effectiveness of network decreases with the breaking down of some nodes or links. So, less vulnerable communication network is required for greater stability. Vulnerability is the measure of the resistance of the network after failure of communication links. In this article, a graph has been considered for modeling a network and integrity as the measure of vulnerability, and the aim is to construct a graphic integer sequence of a graph or network with maximum number of edges from a given vertex order or number of vertices and graph integrity in linear time. Experiments show some possible graphs with maximum number of edges which obeys the given vertex order and integrity.

Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are int... more Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active research area, basically for supporting real time applications that are based upon interaction between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve more deterministic behavior of the network i.e. a stable path, so that information carried by the network can be delivered in an uninterrupted fashion and for better resource utilization. In this paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing algorithm for MANETs with better route failure management and which will be highly adaptive and energy efficient.

International Journal of Computer Sciences and Engineering

International Journal of Advanced Computer Science and Applications, 2017

In the age of Big Data the problem of storing huge volume of data in a minimum storage space by u... more In the age of Big Data the problem of storing huge volume of data in a minimum storage space by utilizing available resources properly is an open problem and an important research aspect in recent days. This problem has a close relationship with the famous classical NP-Hard combinatorial optimization problem namely the "Bin Packing Problem" where bins represent available storage space and the problem is to store the items or data in minimum number of bins. This research work mainly focuses on to find a near optimal solution of the offline one dimensional Bin Packing Problem based on two heuristics by taking the advantages of graph. Additionally, extreme computational results on some benchmark instances are reported and compared with the best known solution and solution produced by the four other well-known bin oriented heuristics. Also some future directions of the proposed work have been depicted.