Kalishankar Tiwary

Dr. Kalishankar Tiwary

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 March 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Supriyan SenSupriyan Sen
Supriyan Sen
Laxminarayan SahooLaxminarayan Sahoo
Laxminarayan Sahoo
KTKalishankar Tiwary
Kalishankar Tiwary
Vladimir SimicVladimir Simic
Vladimir Simic
Tapan SenapatiTapan Senapati
Tapan Senapati
In this study, the multi-criteria decision-making (MCDM) technique is used in collaboration with K-medoids clustering to establish a novel algorithm for extending the lifetime of wireless sensor networks (WSNs) in the presence of uncertainty. One of the most important problems in WSNs is the energy consumption. Furthermore, extending the network lifetime in WSNs is highly dependent on selecting the appropriate cluster heads (CHs), and this can be a challenging task for the decision makers. In addition, parameters associated with WSNs are completely unexpected due to uncertainty. Therefore, after proposing K-medoids clustering and a MCDM technique, we have developed a novel algorithm for extending the lifetime of WSNs. As criteria, we have taken into account four important aspects of the proposed WSN: the distance from sink, average distance of cluster nodes, reliability of cluster and residual energy. To represent uncertain parameters in this work, we have considered triangular fuzzy numbers (TFNs). Finally, an experiment involving a WSN under uncertainty was investigated, and the findings have been graphically displayed. In this research, it has been observed that the proposed strategy with the novel algorithm exhibits 42% greater network lifetime as compared with a hybrid energy efficient distributed (HEED) algorithm and 11% and 18% with respect to optimal clustering artificial bee colony (OCABC) and particle swarm optimization (PSO) applied to a clustering optimization problem. We have also conducted statistical hypotheses for the purpose of confirming the presented outcomes.

3 October 2023 in Telecom
Verified
Journal Article
Open access
PDF file
Supriyan SenSupriyan Sen
Supriyan Sen
Laxminarayan SahooLaxminarayan Sahoo
Laxminarayan Sahoo
KTKalishankar Tiwary
Kalishankar Tiwary
Tapan SenapatiTapan Senapati
Tapan Senapati
In recent decades, wireless sensor networks (WSNs) have become a popular ambient sensing and model-based solution for various applications. WSNs are now achievable due to the developments of micro electro mechanical and semiconductors logic circuits with rising computational power and wireless communication technology. The most difficult issues concerning WSNs are related to their energy consumption. Since communication typically requires a significant amount of energy, there are some techniques/ways to reduce energy consumption during the operation of the sensor’s communication systems. The topology control technique is one such effective method for reducing WSNs’ energy usage. A cluster head (CH) is usually selected using a topology control technique known as clustering to control the entire network. A single factor is inadequate for CH selection. Additionally, with the traditional clustering method, each round exhibits a new batch of head nodes. As a result, when using conventional techniques, nodes decay faster and require more energy. Furthermore, the inceptive energy of nodes, the range between sensor nodes and base stations, the size of data packets, voltage and transmission energy measurements, and other factors linked to sensor nodes are also completely unexpected due to irregular or hazardous natural circumstances. Here, unpredictability represented by Triangular Fuzzy Numbers (TFNs). The associated parameters of nodes were converted into crisp ones via the defuzzification of fuzzy numbers. The fuzzy number has been defuzzified using the well-known signed distance approach. Here, we have employed a multi-criteria decision-making (MCDM) approach to choosing the CHs depending on a bunch of characteristics of each node (i) residual energy, (ii) the number of neighbors, (iii) distance from the sink, (iv) average distance of cluster node, (v) distance ratio, and (vi) reliability. This study used the entropy-weighted Technique for Order Preference by Similarity to the Ideal Solution (TOPSIS) approach to select the CH in WSNs. For experiments, we have used the NSG2.1 simulator, and based on six characteristics comprising residual energy, number of neighbor nodes, distance from the sink or base station (BS), average distance of cluster nodes, distance ratio, and reliability, optimal CHs have been selected. Finally, experimental results have been presented and compared graphically with the existing literature. A statistical hypothesis test has also been conducted to verify the results that have been provided.

1 January 2022 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
PDF file
Laxminarayan SahooLaxminarayan Sahoo
Laxminarayan Sahoo
Supriyan SenSupriyan Sen
Supriyan Sen
KTKalishankar Tiwary
Kalishankar Tiwary
Sovan  SamantaSovan Samanta
Sovan Samanta
Tapan SenapatiTapan Senapati
Tapan Senapati
The main objective of this paper is to find the duration of maximum time connectivity of sensor nodes under uncertainty utilizing the prespecified voltage/power of each sensor node. Wireless sensor networks (WSNs) are composed of nodes that transmit data between each other over routing. A variety of routing protocols and algorithms exist, each related to a particular set of conditions. There are a variety of routing algorithms available, some of which can be used in WSNs for routing. The goal of the fastest distance routing algorithms in a WSN is to use the least amount of energy possible. In a WSN, Dijkstra’s algorithm is typically used for shortest path routing. The Floyd–Warshall’s algorithm is used to compute the shortest paths between distinct nodes in a regular graph, but due to the absence of a communication mode, this algorithm is not ideal for routing in wireless networks. In this research work, we have considered a WSN to find out the maximum connectivity time utilizing optimum voltage. On the other hand, duration of connectivity and energy/voltage are two vital parameters that are difficult to manage. Because of limited resources and safety concerns, safety implementation is limited. Also, due to the irregular/hazardous environmental situations, the distance between sensor nodes and its voltage to link up the nodes are totally unpredictable. In this work, we employ triangular fuzzy numbers to express unpredictability. Then, utilizing defuzzification of fuzzy numbers, the associated WSN problem was transformed into a crisp one. The widely used signed distance approach has been applied for the defuzzification of fuzzy numbers in this case. To determine the best outcome and to illustrate the usefulness of the suggested technique, a numerical example has been solved using the modified Floyd–Warshall’s algorithm. Finally, concluding remarks on the proposed approach as well as future studies have been provided.

13 July 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
LSLaxman Saha
Laxman Saha
MBMithun Basak
Mithun Basak
KTKalishankar Tiwary
Kalishankar Tiwary
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
Yilun ShangYilun Shang
Yilun Shang
For a simple connected graph G=(V,E), an ordered set W⊆V, is called a resolving set of G if for every pair of two distinct vertices u and v, there is an element w in W such that d(u,w)≠d(v,w). A metric basis of G is a resolving set of G with minimum cardinality. The metric dimension of G is the cardinality of a metric basis and it is denoted by β(G). In this article, we determine the metric dimension of power of finite paths and characterize all metric bases for the same.

1 January 2022 in Opuscula Mathematica
Verified
Journal Article
Closed access
LSLaxman Saha
Laxman Saha
MBMithun Basak
Mithun Basak
KTKalishankar Tiwary
Kalishankar Tiwary
For a simple connected graph \(G=(V,E)\) and an ordered subset \(W = \{w_1,w_2,\ldots, w_k\}\) of \(V\), the code of a vertex \(v\in V\), denoted by \(\mathrm{code}(v)\), with respect to \(W\) is a \(k\)-tuple \((d(v,w_1),\ldots, d(v, w_k))\), where \(d(v, w_t)\) represents the distance between \(v\) and \(w_t\). The set \(W\) is called a resolving set of \(G\) if \(\mathrm{code}(u)\neq \mathrm{code}(v)\) for every pair of distinct vertices \(u\) and \(v\). A metric basis of \(G\) is a resolving set with the minimum cardinality. The metric dimension of \(G\) is the cardinality of a metric basis and is denoted by \(\beta(G)\). A set \(F\subset V\) is called fault-tolerant resolving set of \(G\) if \(F\setminus{\{v\}}\) is a resolving set of \(G\) for every \(v\in F\). The fault-tolerant metric dimension of \(G\) is the cardinality of a minimal fault-tolerant resolving set. In this article, a complete characterization of metric bases for \(G_{mn}^2\) has been given. In addition, we prove that the fault-tolerant metric dimension of \(G_{mn}^2\) is 4 if \(m+n\) is even. We also show that the fault-tolerant metric dimension of \(G_{mn}^2\) is at least 5 and at most 6 when \(m+n\) is odd.

1 January 2022 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
PDF file
Laxminarayan SahooLaxminarayan Sahoo
Laxminarayan Sahoo
Supriyan SenSupriyan Sen
Supriyan Sen
KTKalishankar Tiwary
Kalishankar Tiwary
Sovan  SamantaSovan Samanta
Sovan Samanta
Tapan SenapatiTapan Senapati
Tapan Senapati
The major network design or data distributed problems may be described as constrained optimization problems. Constrained optimization problems include restrictions imposed by the system designers. These limitations are basically due to the system design’s physical limitations or functional requirements of the network system. Constrained optimization is a computationally challenging job whenever the constraints/limitations are nonlinear and nonconvex. Furthermore, nonlinear programming methods can easily deal same optimization problem if somehow the constraints are nonlinear and convex. In this paper, we have addressed a distributed network design problem involving uncertainty that transmits data across a parallel router. This distributed network design problem is a Jackson open‐type network design problem that has been formulated based on the M/M/1 queueing system. Because our network design problem is a nonlinear, convex optimization problem, we have employed a well‐known Kuhn–Tucker (K‐T) optimality algorithm to solve the same. Here, we have used triangular fuzzy numbers to express uncertain traffic rates and data processing rates. Then, by applying α‐level interval of fuzzy numbers and their corresponding parametric representation of α‐level intervals, the associated network design problem has been transformed to its parametric form and later has been solved. To obtain the optimal data stream rate in terms of interval and to illustrate the applicability of the entire approach, a hypothetical numerical example has been exhibited. Finally, the most important results have been reported.