Brain image fusion-based tumour detection using grey level co-occurrence matrix Tamura feature extraction with backpropagation network classification

R. Bhavani; K. Vasanth; R. Bhavani; K. Vasanth

doi:10.3934/mbe.2023383

Mathematical Biosciences and Engineering

2023, Volume 20, Issue 5: 8727-8744. doi: 10.3934/mbe.2023383

Previous Article Next Article

Research article Special Issues

Brain image fusion-based tumour detection using grey level co-occurrence matrix Tamura feature extraction with backpropagation network classification

R. Bhavani ^{1
,
,},
K. Vasanth ²

1.
Department of ECE, Sathyabama Institute of Science and Technology, Chennai 600119, India
2.
Department of ECE, Vidya Jyothi Institute of Technology, Hyderabad 500075, India

Academic Editor: Danilo Pelusi

Received: 16 November 2022 Revised: 12 January 2023 Accepted: 19 January 2023 Published: 07 March 2023

Most challenging task in medical image analysis is the detection of brain tumours, which can be accomplished by methodologies such as MRI, CT and PET. MRI and CT images are chosen and fused after preprocessing and SWT-based decomposition stage to increase efficiency. The fused image is obtained through ISWT. Further, its features are extracted through the GLCM-Tamura method and fed to the BPN classifier. Will employ supervised learning with a non-knowledge-based classifier for picture classification. The classifier utilized Trained databases of the tumour as benign or malignant from which the tumour region is segmented via k-means clustering. After the software needs to be implemented, the health status of the patients is notified through GSM. Our method integrates image fusion, feature extraction, and classification to distinguish and further segment the tumour-affected area and to acknowledge the affected person. The experimental analysis has been carried out regarding accuracy, precision, recall, F-1 score, RMSE and MAP.

Keywords:

Citation: R. Bhavani, K. Vasanth. Brain image fusion-based tumour detection using grey level co-occurrence matrix Tamura feature extraction with backpropagation network classification[J]. Mathematical Biosciences and Engineering, 2023, 20(5): 8727-8744. doi: 10.3934/mbe.2023383

Related Papers:

[1]	Nawaz Ali Zardari, Razali Ngah, Omar Hayat, Ali Hassan Sodhro . Adaptive mobility-aware and reliable routing protocols for healthcare vehicular network. Mathematical Biosciences and Engineering, 2022, 19(7): 7156-7177. doi: 10.3934/mbe.2022338
[2]	B. Kiruthika, Shyamala Bharathi P . Intelligent dynamic trust secure attacker detection routing for WSN-IoT networks. Mathematical Biosciences and Engineering, 2023, 20(2): 4243-4257. doi: 10.3934/mbe.2023198
[3]	Tahir Rasheed, Faran Nabeel, Muhammad Bilal, Yuping Zhao, Muhammad Adeel, Hafiz. M. N. Iqbal . Aqueous monitoring of toxic mercury through a rhodamine-based fluorescent sensor. Mathematical Biosciences and Engineering, 2019, 16(4): 1861-1873. doi: 10.3934/mbe.2019090
[4]	Yong Zhu, Zhipeng Jiang, Xiaohui Mo, Bo Zhang, Abdullah Al-Dhelaan, Fahad Al-Dhelaan . A study on the design methodology of TAC³ for edge computing. Mathematical Biosciences and Engineering, 2020, 17(5): 4406-4421. doi: 10.3934/mbe.2020243
[5]	Tamás Tekeli, Attila Dénes, Gergely Röst . Adaptive group testing in a compartmental model of COVID-19^. Mathematical Biosciences and Engineering, 2022, 19(11): 11018-11033. doi: 10.3934/mbe.2022513*
[6]	Honglei Wang, Wenliang Zeng, Xiaoling Huang, Zhaoyang Liu, Yanjing Sun, Lin Zhang . MTTLm⁶A: A multi-task transfer learning approach for base-resolution mRNA m⁶A site prediction based on an improved transformer. Mathematical Biosciences and Engineering, 2024, 21(1): 272-299. doi: 10.3934/mbe.2024013
[7]	Yejun Hu, Liangcai Dong, Lei Xu . Multi-AGV dispatching and routing problem based on a three-stage decomposition method. Mathematical Biosciences and Engineering, 2020, 17(5): 5150-5172. doi: 10.3934/mbe.2020279
[8]	Hao Yuan, Qiang Chen, Hongbing Li, Die Zeng, Tianwen Wu, Yuning Wang, Wei Zhang . Improved beluga whale optimization algorithm based cluster routing in wireless sensor networks. Mathematical Biosciences and Engineering, 2024, 21(3): 4587-4625. doi: 10.3934/mbe.2024202
[9]	Xiao Chu, Weiqing Wang, Zhaoyun Sun, Feichao Bao, Liang Feng . An N⁶-methyladenosine and target genes-based study on subtypes and prognosis of lung adenocarcinoma. Mathematical Biosciences and Engineering, 2022, 19(1): 253-270. doi: 10.3934/mbe.2022013
[10]	Fang Zhang, Wenzhe Cui, Yanfei Dai, Yulin Zhao . Bifurcations of an SIRS epidemic model with a general saturated incidence rate. Mathematical Biosciences and Engineering, 2022, 19(11): 10710-10730. doi: 10.3934/mbe.2022501

Abstract

1. Introduction

The hydrodynamics is about fluid mechanics which present the flow of fluids in any channel. The fluid has different properties which change according to the friction and volume. When a pipeline has different junction or obstacles, the flow of fluid gets disturbed and its velocity has been decreased. The velocity of the fluid is depending on the number of obstacles and size of the channel considered. They intended to perform any data collection or to provide any service. The nodes of WSN perform data transmission in a cooperative manner. They have bounded energy which gets lost at each data transmission and reception.

The packets transmitted through any route in WSN faces many challenges. The presence of number of sensor node increases the latency which in turn reduces the throughput performance. When the same routes or the hops are used by several nodes, the traffic gets increased and turns the latency to higher and throughput to lower.

The active routing is the procedure of choosing an efficient route to transmit a packet towards any destination. As the status of node keep changing at all the time, it is necessary to choose an optimal route towards destination. As the physical characteristics of the sensor nodes gets changed dynamically, the dynamic routing algorithm has to consider the traffic, flow of packets, the nodes energy, and hops before choosing a route for data transmission.

The most algorithms consider only the flow and friction to choose the route towards the destination. This highly affects the performance of the wireless sensor network. Towards this issue, a BF³-VHDR (BackForward-Flow-Friction-Velocity HDR) routing is presented in this paper. The algorithm considers the flow frequency and velocity in both the directions of the route to choose a route. Because, there will be condition that the packets being reroute due to higher traffic or route failure. Also there will be better route being used by an intermediate route to reach the destination. By considering all this, the proposed algorithm is presented to improve the network performance. The detailed approach is presented in the next section.

2. Related works

There are number of routing approaches has been discussed in literature. This section discusses set of methods towards the problem of routing and QoS development of WSN.

PACO (Probabilistic Ant Colony Optimization) ^[1] routing algorithm minimizes the number of hops. Further, the algorithm defines the energy distance and discusses a routing algorithm to minimize the distance. The algorithm overrides the performance of ant colony optimization based routing and improves the performance of routing. Mohsen Kariman-Khorasani et al. discuss a joint routing method which employs the duty cycle scheduling algorithm ^[2]. Also, the algorithm presents an energy balance technique for the wireless sensor networks. The author further introduces a flow sharing algorithm for the maximization of network lifetime.

H. R. Karkvandi et al. maintains various information of resource nodes using which the method computes the lifetime value for each of the nodes ^[3]. The method uses transmission range to compute their confidence level. Also, the authors introduce a lifetime criterion approach to improve the network lifetime. P. Edith et al. introduce a lifetime maximization technique for the wireless sensor networks ^[4]. The method computes the task cycles and uses the mean square error function. Finally, an optimal multi path routing is described to improve the network lifetime.

Veeranji Reddy et al. consider the transmission power assignment strategy in Wireless Sensor Networks to increase lifespan ^[5]. Gribaudo et al. consider that a WSN inquiry to prove that the investigation is based on hydrodynamics ^[6]. In the model, the sensor nodes are taken as a liquid component and are reported in soft and non-interactive space. It is characterized by the concept of near-knuckle thickness which is indirectly the size of the nodes intended to be given in the unit by the creators. They are expected to be fixed on the nodes in the networks. Nodes are spread with multiple nodes through multi-hop data. Limited time network regulated state. However, regardless of its various problems, such as the noses 'use of vulnerability and the ends of the' fight for just routine routing wireless channels.

Erkmen et al. exhibited a novel hydrodynamic reenactment strategy to take care of the organization issue of versatile sensor networks in an obscure situation with respect to every node in the network as liquid component ^[7]. Concerning this, the liquid drove nodes to "stream" with liquid, in order to make the network sending with a normal powerful inclusion rate.

Zhao Wei et al. discuss the author considers the packets as fluids in field. Also, the sink nodes are considered as the sink flow where the packets are flowing to their potential to reach the sink nodes ^[8]. Alexandros Schillings et al. discuss a theory of games where the players are as nodes of wireless sensor networks. In the theory the algorithm looks to maximize the profits of players ^[9].

Khawam et al. discuss a fluid model to improve the network lifetime and accounts the network interference, radio propagation to estimate the network lifetime ^[10]. Also, the algorithm counts the network density as a key factor to improve the network lifetime. Chiasserini et al. discuss the development of large scale of WSN ^[11]. The authors present fluid scheme which represent the network by continuous fluid flow. The algorithm estimates the network traffic by computing the fluid flow.

H. Kim and C. Jennifer ^[12] develop the method approximates the behaviors in the simulation model. The algorithm adapts various measures to improve the lifetime of the wireless sensor networks. Aysal et al. describe a decentralized model to maximize the network lifetime ^[13,14]. The algorithm uses the newton’s law in estimating the maximum likelihood of the node. Also, the algorithm uses a polynomial algorithm to select the region o f interest to schedule the nodes.

In ^[15], Mohammed Zaki Hasan et al. proposes a bio-motivated Particle Multi-Swarm Optimization (PMSO) Routing calculation, k is a period of time, and a selective selection is common in common ways that management fails when parameters are fulfilled. Many swarm techniques have the power to determine the best bearings for selecting routing of the same time business in all situations in the network.

Psychometric data drives sensor networks. G. Singh et al. discuss that wireless sensor networks speak of which a world view from the sense of data is using sensitive data, which speaks, and intelligence components are used to convey data end-fulfillment quality tank ^[16]. The specific edges are known as Local Cognition Node (LCNs), learning information as a rational component in thinking networking.

Blame tolerant calculations for availability rebuilding in wireless sensor networks. Y. Zeng et al. presents F2CRA (Full 2 Line Current Rehabilitation Algorithm) for a full 2-line rehabilitation, which performs routing based on delay tolerant ^[17].

Molecule swarm improvement with versatile time-fluctuating topology network ^[18], W. H. Lim et al. proposes another PSO variation called PSO with versatile time-changing topology availability (PSO-ATVTC) that utilizes an ATVTC module and another learning system. The proposed ATVTC module explicitly expects to adjust the calculation's investigation/abuse seeks by shifting the molecule's topology availability with time as indicated by its looking execution. The proposed learning structure comprises of another speed refresh system and another area seek administrator to enhance the calculation's execution. Similarly in ^[19] H. Bagci et al. present a distributed fault-tolerant topology control algorithm for heterogeneous wireless sensor networks.

Vitality mindful multipath routing plan dependent on molecule swarm streamlining in versatile specially appointed networks ^[20]. Y. H. Robinson et al. proposed a vitality mindful multipath routing plan dependent on molecule swarm enhancement that utilizes ceaseless time repetitive neural network (CTRNN) to take care of improvement issues. CTRNN finds the ideal circle free ways to comprehend connect disjoint ways in a MANET. The CTRNN is utilized as an ideal way choice strategy that creates a lot of ideal ways among source and goal.

Energy-Efficient Algorithm for Reliable Routing of Wireless Sensor Networks ^[21], Habib Mostafaei et al. proposed a distributed learning automata (DLA) based multi constrained routing. The method is focused to leverage and maintain the QoS performance even with the presence of small set of nodes. The method considered delay and link reliability in path selection.

From the above review, it has been identified that the algorithms suffer to achieve higher performance in all the QoS parameters. The PACO consider the distance which affects the throughput and PDF of the network ^[1]. Similarly, Mohsen et al. consider the energy parameter and lifetime of the network ^[2]. This makes the most nodes to be in sleep mode in most time. Also, this affects the throughput and packet delivery of the network. The methods focused on identifying the trusted route and this reduces the lifetime of the network ^[3,4] but the throughput ratio does not considered in ^[5]. The approaches ^{[8,9,10,11,12]} have considered the network lifetime and suffer with higher latency. In general, the methods reviewed have the problem of poor efficiency in routing and produces inefficient results. The PACO algorithm works towards the minimization of number of hops with the ant colony optimization routing. But suffer to produce higher throughput performance as there will be huge traffic or friction would be present in the shortest route. The VGTR (Virtual Game Theory Routing) algorithm considers only the flow factor to identify the route for data transmission which increases the latency and affects the throughput performance. The DLA algorithm considers only link quality and latency but does not considered the traffic parameters. Similarly, the self-deployment algorithm considers the flow factor as the key to perform routing which affects the throughput performance and increases the latency as well. All the above discussed methods have the problem of poor efficiency in routing and produce inefficient results.

3. BF²-V based hydrodynamic routing

The proposed hydrodynamic routing algorithm consider number of features of hydrodynamic namely back flow, forward flow, traffic, velocity to perform route selection. The method monitors the network at each time and estimates the velocity and friction measures. Using the measures estimated, the method computes the packet transmission strength to select a single route among number of available routes. The detailed approach work is showed in Figure 1.

Figure 1. Architecture of BF²VHDR Routing System.

DownLoad: Full-Size Img PowerPoint

Figure 1 demonstration the construction of the proposed algorithm and shows the functional stages. The proposed BF²VHDR algorithm performs route discovery to identify the list of routes available towards the destination. For each route being identified, the route support weight has been measured according to friction, flow, and velocity factors. According to the value of route support weight, a single route has been selected by the packet forwarding algorithm.

3.1. Route discovery

The route discovery is the procedure of recognizing the list of routes available in the network considered. Consider, there exist N amount of nodes present in the simulation where each has been located in a geographic position Gp. However, they are located within the coverage of others. By using this, the number of routes available between any source S and destination D can be identified. To perform this task, the method generates a route request HDR-RR and broadcast into the network. The broadcast is utilized to override the neighbor discovery process initially. The nodes in a sleep state would not receive in the next cycle but initially it will be obtained. Upon receiving this, the neighbor sensor forwards them to its neighbors. When a node identifies the presence of the destination in its neighbor list, it generates the route reply HDR-RREP. Generated reply will be reversed in the same route the RR is received. The source node collects all the routes and extracts the friction, flow, back-flow and its energy details with the reply. From the reply received, the source extracts various features and updates the node table.

From the route reply message, the method extracts various features required to perform route selection.

3.2. Route support weight estimation

In this stage, the method compute different measures on the route identified. First, the number of packets being sent on the route has been identified and the number of bytes being sent also identified. Using the node table entries, the technique recognizes the list of hops and friction in each hop and back flow and forward flow on the hop are identified. Then the node energy on each hop also identified. Using all the features identified, the method compute the route factor, friction factor, forward flow factor, backward flow factor, and velocity factor are estimated. Using the estimated measures, the route support weight has been estimated.

Route Support Weight Estimation Algorithm:

Input: Route R, Node Table NT

Output: RSW

Start

Read Route R given.

Read Node Table NT.

Identify the list of hops present in the route R.

Hop List Hl = $\sum{{}}Hops\in R$

For each hop Hi from Hl

Identify forward flow in Hi as FH.

$\text{FH} = _{\ \ \ \ \ \ \ \ \ \ i=1}^{size\text{ }(NT)}NT(i).{Hop} = = Hi\text{ }\!\!\And\!\!\text{ }\!\!\And\!\!\text{ }NT(i).Hop\xrightarrow[Forward]{}$

(1)

Identify back flow in Hi as BFH

$\text{BFH } = _{\ \ \ \ \ \ \ \text{i = 1}}^{\text{size (NT)}}\text{NT(i)}.\text{Hop} = = \text{Hi }\!\!\And\!\!\text{ }\!\!\And\!\!\text{ }NT\text{(i)}\text{.Hop}\xleftarrow[\text{Back}]{}$

(2)

Identify the energy of Hi as EH

$\text{EH } = _{\ \ \ \ \ \ \ \text{i = 1}}^{\text{size (NT)}}\text{NT(i)}.\text{Hop} = = \text{Hi }\!\!\And\!\!\text{ }\!\!\And\!\!\text{ }NT\text{(i)}\text{.Hop}\left( .\text{Energy} \right)$

(3)

End

Compute total number of packets sent in R as Tps

$\text{Tps} = \sum\nolimits_{\text{i = 1}}^{\text{size(Hl)}}{{}}\text{TPS}+\text{BFH}+\text{FH}$

(4)

$\text{ Compute}\ \ \text{route}\ \ \text{ factor}\ \ \text{ RF} = \frac{\text{TPS}}{\operatorname{size}(\text{Hl})\times \text{ }\!\!\beta\!\!\text{ }}\times \left( \frac{\sum\nolimits_{\text{i = 1}}^{\text{size(Hl)}}{{}}\text{EH}}{\text{ }\!\!\mu\!\!\text{ }} \right)$

(5)

Here β-represent the initial energy of the nodes where μ-represent the energy required to transmit or receive a packet.

$\text{ Compute }\ \ \text{Friction }\ \ \text{Factor}\ \ \text{ FF } = _{i = 1}^{size(Hl)}FF+\frac{FH+BFH}{TPS}$

(6)

$\text{ Compute}\ \ \text{ Forward }\ \ \text{Flow }\ \ \text{Factor}\ \ \text{ FoFF } = _{i = 1}^{size(Hl)}FoFF+\frac{FH}{TPS}$

(7)

$\text{ Compute }\ \ \text{ Backward}\ \ \text{ Flow }\ \ \text{ Factor }\ \ \text{ BFF } = \text{ }_{i = 1}^{size(Hl)}BFF+\frac{BFH}{TPS}$

(8)

$\text{ Compute }\ \ \text{ Velocity}\ \ \text{ Factor}\ \ \text{ VF} = \frac{RF}{FF}\times k$

(9)

Here k- minimum latency value.

$\text{ Compute}\ \ \text{ Route }\ \ \text{Support}\ \ \text{ Weight }\ \ \text{RSW } = \frac{FoFF}{FF}\times \frac{BFF}{FF}\times \frac{FF}{VF}\times RF$

(10)

The route support weight estimation algorithm has computed the different factors of flow, friction, velocity. Using the factors estimated, the method computes the route support weight.

3.3. BF²VHDR routing

The routing is the major issue in the wireless sensor networks. The routing is performed based on the details of various factors of the sensor nodes present in the network. In this approach, the list of routes available in the network is identified. Then for each route the method identifies the list of hops present. For each hop, the method maintains the node details in the Node Table NT, which contains the information regarding the flow, friction, back flow ad energy. Using all these information, the method estimates the route support weight, which has been used to select a single optimal route for data transmission.

The dynamic routing procedure calculates the direction support weight for the routes available. Among them a single one is selected for data transmission which has higher RSW value.

4. Results and discussion

The proposed method has been realized and estimated for its routine in various factors. The detail of implementation and evaluation has been given in Table 1.

Table 1. Details of simulation parameter.

Parameter	Value
Tool Used	Advanced Java
Number of nodes	50
Transmission Range	100
Simulation Area	1000/1000 meters
Simulation Time	5 minutes

| Show Table

DownLoad: CSV

The Table 1 presents the reproduction details being used and lists the set of parameters of simulation. To evaluate the performance, the simulation has been carried out with the presence of large number of nodes and data rate has been varied for different simulations. In each duty cycle, the algorithm estimates the route support weight for each route identified. According to the weight being estimated, an optimal route has been selected for data transmission.

Figure 2 shows the sample network topology considered for the evaluation of proposed algorithm.

Figure 2. Network Topology.

DownLoad: Full-Size Img PowerPoint

The Table 2 shows the details of traffic present in different intermediate nodes of the network considered. Also, it shows the value of forward flow, backward flow, and energy of the nodes. Also, it is considered that, the nodes have the initial energy as 100 joules and current energy represents the energy value the nodes have right now.

Table 2. Details of traffic, energy and flow in hops.

Node ID	Current Energy in joules	Traffic bytes/sec	Forward Flow	Backward Flow
1	67	0	32	0
2	72	3	12	0
3	68	5	14	0
4	59	7	15	2
5	85	6	11	1
6	64	3	16	1
7	76	4	21	3
8	79	8	14	2
9	83	9	16	5
10	79	8	17	1
21	78	7	18	3
11	69	8	15	2
12	59	9	16	4
13	72	11	12	3
14	82	9	13	7
15	86	11	11	8
16	89	12	13	4
17	93	11	18	3
18	94	13	19	7
19	95	16	21	6
20	97	17	11	1

| Show Table

DownLoad: CSV

Using the details of traffic value and the traffic constant value is of 1.273, the velocity, hydro dynamic weight and cumulative hydrodynamic weight. For example, for the route “1-2-8-9-15-12-20”, we can compute different measures as follows:

Compute Total number of packets sent in R as Tps = $\sum\nolimits_{i = 1}^{size(Hl)} {} TPS + BFH + FH$

$\text { Tps } = (32+0)+(0+0)+(12+0)+(14+2)+(16+5)+(11+8)+(16+4)+(11+1) = 130$

Compute route factor RF = $\frac{{TPS}}{{size(Hl) \times \beta }} \times \left({\frac{{\sum\nolimits_{i = 1}^{size(Hl)} {} EH}}{\mu }} \right)$

$\mathrm{RF} = (100 /(7 * 100)) *(67+72+79+83+86+59+97) / 0.5 = 54.212$

Consider the minimum joules for a data transmission is 0.5 joules and the value of ${\rm{ \mathit{ μ} }} = 0.5\; \; joules$ .

Compute Friction Factor FF.

$\mathrm{FF} = \frac{32+0}{130}+\frac{12+0}{130}+\frac{14+2}{130}+\frac{16+5}{130}+\frac{11+8}{130}+\frac{16+4}{130}+\frac{11+1}{130} = 0.99$

Compute Forward Flow Factor FoFF.

$\text { FoFF } = \frac{32}{130}+\frac{12}{130}+\frac{14}{130}+\frac{16}{130}+\frac{11}{130}+\frac{16}{130}+\frac{11}{130} = 0.83$

Compute Backward Flow Factor BFF

$\mathrm{BFF} = \frac{0}{130}+\frac{0}{130}+\frac{2}{130}+\frac{5}{130}+\frac{8}{130}+\frac{4}{130}+\frac{1}{130} = 0.98$

Compute Velocity Factor VF = $\frac{154.21}{0.99} \times 0.8$ = 125.3

Here k- minimum latency value = 0.88 milliseconds.

Compute Route Support Weight RSW = $\frac{0.83}{0.99} \times \frac{0.98}{0.99} \times \frac{0.99}{125.3} \times 154.2$ = 0, 89

Similarly, the route support weight can be measured for different routes. Based on the values of route support weight, the optimal route can be selected.

The performance of the proposed method has been measured by computing different parameters namely throughput performance, packet delivery ratio and latency. The throughput performance is computed using the equation (11)

${\rm{ Throughput}}\;{\rm{Performance }} = \frac{{{\rm{ }}Number\;\;of\;\;{\rm{ }}bytes\;\;{\rm{ }}delivered\;\;{\rm{ }}per{\rm{ }}\;\;sec ond{\rm{ }}}}{{{\rm{ }}Total\;\;{\rm{ }}Number\;\;{\rm{ }}of\;\;{\rm{ }}bytes\;\;{\rm{ }}sent{\rm{ }}\;\;per\;\;{\rm{ }}sec ond{\rm{ }}}}$

(11)

The Figure 3 shows the comparison of throughput performance achieved by various approaches in varying number of nodes. Also the Figure 3 claims that the proposed method has produced higher throughput than other methods. The PACO algorithm works towards the minimization of number of hops with the ant colony optimization routing. However, the PACO would select a shortest route but there will be always higher traffic in the shortest route which leads to packet drop. Also, the PACO algorithm does not consider the other factors like flow, friction, velocity and so on. Similarly, the VGTR algorithm focused to improve the throughput performance with the consideration of channel allocation, which produces low throughput performance. The DLA algorithm considers only the reliability of links in achieving higher throughput performance but misses the traffic conditions which affect the throughput performance. Also, the Self Deployment algorithm considers only the value of flow to perform routing. However, all the PACO, VGTR, Self-Deployment and DLA algorithms produces low throughput performance. But the enforcement of proposed BF²VHDR algorithm selects the routes based on the above mentioned parameters which support the improvement of throughput performance. By considering the friction which represents the traffic, flow and backflow which represent the amount of data pass through and velocity, the proposed algorithm performs route selection. This helps to achieve higher throughput compare to other methods.

Figure 3. Comparison of throughput performance.

DownLoad: Full-Size Img PowerPoint

The packet delivery ratio represents the efficiency in packet delivery by the protocol discussed. The packet delivery ratio is computed using the equation (12)

${\rm{Packet}}\;\;{\rm{ Delivery}}\;\;{\rm{Ratio }} = \frac{{{\rm{ }}Number\;\;{\rm{ }}of\;\;{\rm{ }}packets\;\;{\rm{ }}delivered\;\;{\rm{ }}successfully{\rm{ }}}}{{{\rm{ }}Total\;\;{\rm{ }}Number\;\;{\rm{ }}of{\rm{ }}\;\;Packets\;\;{\rm{ }}Sent{\rm{ }}}}$

(12)

The Figure 4 demonstrates the examination of packet transport part created by various strategies and it indicates obviously that the proposed technique has produces higher parcel conveyance portion than different techniques. The PACO algorithm works towards the minimization of number of hops with the ant colony optimization routing. However, the PACO would select a shortest route but there will be always higher traffic in the shortest route which leads to packet drop. Similarly, the VGTR algorithm works based on tokens which produce less packet delivery ratio. Also, the Self Deployment algorithm considers only the value of flow to perform routing. The DLA algorithm considers only the link quality which reduces the packet delivery ratio. However, all the PACO, VGTR, Self-Deployment and DLA algorithms produces less packet delivery ratio. However, the adaption of BF²VHDR algorithm increases the packet delivery ratio as it selects the transmission route according to back flow, flow, friction, and velocity. Because of the proposed algorithm, considers the friction, flow, forward flow an backward flow and velocity features of available routes in route selection stage, the algorithm could deliver the data packets in least time. This helps to improve the packet delivery fraction of the network.

Figure 4. Comparison of packet delivery ratio.

DownLoad: Full-Size Img PowerPoint

Similarly the latency ratio is measured by computing the time duration between the packet sent time and the packet delivery time. The efficiency of the protocol will be higher when the latency ratio is less.

The Figure 5 shows the comparison of latency ratio produced by different methods and it shows clearly that the method has produces less latency than other methods. The PACO algorithm works towards the minimization of number of hops with the ant colony optimization routing. However, the PACO would select a shortest route but there will be always higher traffic in the shortest route which leads to packet drop. So that, the packet has to be retransmitted this increases the latency of transmission. Similarly, the VGTR algorithm uses only the channel availability to perform routing which leads to higher latency. Also, the Self Deployment algorithm considers only the value of flow to perform routing. The self-deployment method selects the route with least flow for transmission, which leads to higher latency. The DLA algorithm considers the link quality in path selection which introduces the selection of higher hop counted route which increases the latency. However, all the PACO, VGTR, Self-Deployment and DLA algorithms produces low throughput performance. However, the adaption of BF²VHDR algorithm reduces the latency value as it considers back flow, flow, friction, and velocity in the selection of route. However the route may be longer, the latency of the packet has been reduced. The Figure 5, shows the proposed algorithm, performs route selection based on six factors namely friction, flow, forward flow, backward flow, energy and velocity. By considering these factors, the algorithm is capable of identifying the traffic free route and transmits through the identified route. This helps to reduce the latency of the data packets.

Figure 5. Comparison on latency ratio.

DownLoad: Full-Size Img PowerPoint

The Table 3 shows the near outcomes on different nature of management parameters created by various techniques and it demonstrates plainly that the proposed strategy has produces proficient outcomes on every one of the variables of nature of administration of wireless sensor networks. The proposed algorithm outperform efficiently in each factors considered and produces efficient results than other methods considered.

Table 3. Comparative Results on various QoS parameters for different simulation time.

S.No	Protocol	Throughput % with number of nodes			Average Delay(ms) with number of nodes			PDF % with number of nodes
S.No	Protocol	70	100	200	70	100	200	70	100	200
1.	PACO	72	76	81	72	68	61	74	77	81
2.	VGTR	79	81	85	43	39	32	76	79	83
3.	Self-Deployment	83	86	89	32	29	23	81	84	87
4.	DLA	86	88	91	29	26	21	84	87	89
5.	F2VHDR	96.5	97.8	98.9	17	14	11	97	98.5	99.6
6	BF2VHDR	97.2	98.3	99.4	15	12	8	97.6	99.1	99.8

| Show Table

DownLoad: CSV

The Figure 6 shows the comparison of throughput performance achieved by various approaches in different simulation time. Also the Figure 6 claims that the proposed method has produced higher throughput than other methods. The PACO algorithm works towards the minimization of number of hops with the ant colony optimization routing. However, the PACO would select a shortest route but there will be always higher traffic in the shortest route which leads to packet drop. Also, the PACO algorithm does not consider the other factors like flow, friction, velocity and so on. Similarly, the VGTR algorithm focused to improve the throughput performance with the consideration of channel allocation, which produces low throughput performance. The DLA algorithm considers only the reliability of links in achieving higher throughput performance but misses the traffic conditions which affect the throughput performance. Also, the Self Deployment algorithm considers only the value of flow to perform routing. However, all the PACO, VGTR, Self-Deployment and DLA algorithms produces low throughput performance, because the methods does not considered the dynamic conditions as the set of sensor nodes would be down after some time which affect the throughput performance. But the enforcement of proposed BF²VHDR algorithm selects the routes based on the above mentioned parameters which support the improvement of throughput performance. By considering the friction which represents the traffic, flow and backflow which represent the amount of data pass through and velocity, the proposed algorithm performs route selection. This helps to achieve higher throughput compare to other methods.

Figure 6. Comparison of throughput performance.

DownLoad: Full-Size Img PowerPoint

The Figure 7 demonstrates the examination of packet transport part created by various strategies and it indicates obviously that the proposed technique has produces higher parcel conveyance portion than different techniques. The PACO algorithm works towards the minimization of number of hops with the ant colony optimization routing. However, the PACO would select a shortest route but there will be always higher traffic in the shortest route which leads to packet drop. Similarly, the VGTR algorithm works based on tokens which produce less packet delivery ratio. Also, the Self Deployment algorithm considers only the value of flow to perform routing. The DLA algorithm considers only the link quality which reduces the packet delivery ratio. However, all the PACO, VGTR, Self-Deployment and DLA algorithms produces less packet delivery ratio. The methods produces poor packet delivery ratio in different simulation time because they does not consider all the parameters which reduces the packet delivery ratio. However, the adaption of BF²VHDR algorithm increases the packet delivery ratio as it selects the transmission route according to back flow, flow, friction, and velocity. Because of the proposed algorithm, considers the friction, flow, forward flow an backward flow and velocity features of available routes in route selection stage, the algorithm could deliver the data packets in least time. This helps to improve the packet delivery fraction of the network.

Figure 7. Comparison of packet delivery ratio.

DownLoad: Full-Size Img PowerPoint

The Figure 8 shows the comparison of latency ratio produced by different methods at different simulation time and it shows clearly that the method has produces less latency than other methods. The PACO algorithm works towards the minimization of number of hops with the ant colony optimization routing. However, the PACO would select a shortest route but there will be always higher traffic in the shortest route which leads to packet drop. So that, the packet has to be retransmitted this increases the latency of transmission. Similarly, the VGTR algorithm uses only the channel availability to perform routing which leads to higher latency. Also, the Self Deployment algorithm considers only the value of flow to perform routing. The self-deployment method selects the route with least flow for transmission, which leads to higher latency. The DLA algorithm considers the link quality in path selection which introduces the selection of higher hop counted route which increases the latency. However, all the PACO, VGTR, Self Deployment and DLA algorithms produces low throughput performance. However, the adaption of BF²VHDR algorithm reduces the latency value as it considers back flow, flow, friction, and velocity in the selection of route. However the route may be longer, the latency of the packet has been reduced. The Figure 8, shows the proposed algorithm, performs route selection based on six factors namely friction, flow, forward flow, backward flow, energy and velocity. By considering these factors, the algorithm is capable of identifying the traffic free route and transmits through the identified route. This helps to reduce the latency of the data packets.

Figure 8. Comparison on latency ratio.

DownLoad: Full-Size Img PowerPoint

The Table 4 shows the near outcomes on different nature of management parameters created by various techniques and it demonstrates plainly that the proposed strategy has produces proficient outcomes on every one of the variables of nature of administration of wireless sensor networks. The evaluation result is obtained at different simulation time. The proposed algorithm outperform efficiently in each factors considered and produces efficient results than other methods considered.

Table 4. Comparative Results on various Qos parameters for various simulation time.

S.No	Protocol	Throughput % with number of nodes			Average Delay(ms) with number of nodes			PDF % with number of nodes
S.No	Protocol	1 Min.	3 Min.	5 Min.	1 Min.	3 Min.	5 Min.	1 Min.	3 Min.	5 Min.
1.	PACO	72	70	69	72	68	61	74	70	67
2.	VGTR	79	77	73	43	39	32	76	72	70
3.	Self-Deployment	83	80	77	32	29	23	81	78	75
4.	DLA	86	84	82	29	26	21	84	81	78
5.	F²VHDR	96.5	97.8	98.9	17	14	11	97	98.5	99.6
6	BF²VHDR	97.2	98.3	99.4	15	12	8	97.6	99.1	99.8

| Show Table

DownLoad: CSV

5. Conclusion

In this paper, we proposed a novel BF2VHDR-based hydraulic based routing program to improve the performance of wireless sensor networks. First the method identifies the list of paths available to reach the destination. For each route, the flow rate, forward flow factor, calculates backward flow factor, speed, and energy factors has been identified. Using this, the method calculates the weight of the weight supported. We will send the packet through a single path selection and the selected route, based on the calculated path weight support weight. All the factors of the quality of service in the wireless sensor networks were made efficiently. By considering the back flow, flow, velocity, friction and other factors, the method achieves higher performance in hydro dynamic routing in WSN. The protocol increases the throughput performance up to 98.3% and reduces the 11 seconds latency.

Conflict of interest

The authors declare no competing interests.

References

[1]	D. Sara, A. K. Mandava, A. Kumar, S. Duela, A. Jude, Hyperspectral and multispectral image fusion techniques for high-resolution applications: A review, Earth Sci. Inf., 14 (2021), 1685–1705. https://doi.org/10.1007/s12145-021-00621-6 doi: 10.1007/s12145-021-00621-6
[2]	X. Feng, L. He, Q. Cheng, X. Long, Y. Yuan, Hyperspectral and multispectral remote sensing image fusion based on endmember spatial information, Remote Sens., 12 (2020), 1009. https://doi.org/10.3390/rs12061009 doi: 10.3390/rs12061009
[3]	U. Subramaniam, M. M. Subashini, D. Almakhles, A. Karthick, S. Manoharan, An expert system for COVID-19 infection tracking in lungs using image processing and deep learning techniques, BioMed Res. Int., 2021 (2021), 1–17. https://doi.org/10.1155/2021/1896762 doi: 10.1155/2021/1896762
[4]	S. S. Ganesh, G. Kannayeram, A. Karthick, M. Muhibbullah, A novel context-aware joint segmentation and classification framework for glaucoma detection, Comput. Math. Methods Med., 2021 (2021), 1–19. https://doi.org/10.1155/2021/2921737 doi: 10.1155/2021/2921737
[5]	T. Saba, A. S. Mohamed, M. El-Affendi, J. Amin, M. Sharif, Brain tumour detection using fusion of handcrafted and deep learning features, Cognit. Syst. Res., 59 (2020), 221–230. https://doi.org/10.1016/j.cogsys.2019.09.007 doi: 10.1016/j.cogsys.2019.09.007
[6]	X. Liu, A. Yu, X. Wei, Z. Pan, J. Tang, Multimodal MR image synthesis using gradient prior and adversarial learning, IEEE J. Sel. Top. Signal Process., 14 (2020), 1176–1188. https://doi.org/10.1109/JSTSP.2020.3013418 doi: 10.1109/JSTSP.2020.3013418
[7]	M. Sharif, J. Amin, M. Raza, M. Yasmin, S. C. Satapathy, An integrated design of particle swarm optimization (PSO) with the fusion of features for detection of brain tumor, Pattern Recognit. Lett., 129 (2020), 150–157. https://doi.org/10.1016/j.patrec.2019.11.017 doi: 10.1016/j.patrec.2019.11.017
[8]	X. Liu, Z. Guo, J. Cao, J. Tang, MDC-net: A new convolutional neural network for nucleus segmentation in histopathology images with distance maps and contour information, Comput. Biol. Med., 135 (2021), 104543. https://doi.org/10.1016/j.compbiomed.2021.104543 doi: 10.1016/j.compbiomed.2021.104543
[9]	Z. Hu, J. Tang, Z. Wang, K. Zhang, L. Zhang, Q. Sun, Deep learning for image-based cancer detection and Diagnosis—A survey, Pattern Recognit., 83 (2018), 134–149. https://doi.org/10.1016/j.patcog.2018.05.014 doi: 10.1016/j.patcog.2018.05.014
[10]	H. Kaur, D. Koundal, V. Kadyan, N. Kaur, K. Polat, Automated Multimodal image fusion for brain tumor detection, J. Artif. Intell. Syst., 3 (2021), 68–82. https://doi.org/10.33969/AIS.2021.31005 doi: 10.33969/AIS.2021.31005
[11]	J. Amin, M. Sharif, N. Gul, M. Yasmin, S. A. Shad, Brain tumor classification based on DWT fusion of MRI sequences using convolutional neural network, Pattern Recognit. Lett., 129 (2020), 115–122. https://doi.org/10.1016/j.patrec.2019.11.016 doi: 10.1016/j.patrec.2019.11.016
[12]	R. Nanmaran, S. Srimathi, G. Yamuna, S. Thanigaivel, A. S. Vickram, A. K. Priya, et al., Investigating the role of image fusion in brain tumor classification models based on machine learning algorithm for personalized medicine, Comput. Math. Methods Med., 2022 (2022), 1–13. https://doi.org/10.1155/2022/7137524 doi: 10.1155/2022/7137524
[13]	A. Selvapandian, K. Manivannan, Fusion based Glioma brain tumor detection and segmentation using ANFIS classification, Comput. Methods Programs Biomed., 166 (2018), 33–38. https://doi.org/10.1016/j.cmpb.2018.09.006 doi: 10.1016/j.cmpb.2018.09.006
[14]	S. Preethi, P. Aishwarya, An efficient wavelet-based image fusion for brain tumor detection and segmentation over PET and MRI image, Multimed Tools Appl., 80 (2021), 14789–14806. https://doi.org/10.1007/s11042-021-10538-3 doi: 10.1007/s11042-021-10538-3
[15]	P. M. Kumar, R. Saravanakumar, A. Karthick, V. Mohanavel, Artificial neural network-based output power prediction of grid-connected semitransparent photovoltaic system, Environ. Sci. Pollut. Res., 29 (2022), 10173–10182. https://doi.org/10.1007/s11356-021-16398-6 doi: 10.1007/s11356-021-16398-6
[16]	N. Jeevanand, P. A. Verma, S. Saran, Fusion of hyperspectral and multispectral imagery with regression Kriging and the Lulu operators: A comparison, Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., 5 (2018), 583–588. https://doi.org/10.5194/isprs-archives-XLⅡ-5-583-2018 doi: 10.5194/isprs-archives-XLⅡ-5-583-2018
[17]	V. Chandran, M. G. Sumithra, A. Karthick, T. George, M. Deivakani, B. Elakkiya, et al., Diagnosis of cervical cancer based on ensemble deep learning network using colposcopy images, BioMed Res. Int., 2021 (2021), 1–15. https://doi.org/10.1155/2021/5584004 doi: 10.1155/2021/5584004
[18]	D. Jiang, D. Zhuang, Y. Huang, J. Fu, Survey of multispectral image fusion techniques in remote sensing applications, in Image Fusion and its Applications (ed. Y. Zheng), IntechOpen, (2011), 1–23.
[19]	R. Kabilan, V. Chandran, J. Yogapriya, A. Karthick, P. P. Gandhi, V. Mohanavel, et al., Short-term power prediction of building integrated photovoltaic (BIPV) system based on machine learning algorithms, Int. J. Photoenergy, 2021 (2021), 1–11. https://doi.org/10.1155/2021/5582418 doi: 10.1155/2021/5582418
[20]	B. K. Umri, M. W. Akhyari, K. Kusrini, Detection of covid-19 in chest X-ray image using CLAHE and convolutional neural network, in 2020 2nd International Conference on Cybernetics and Intelligent System (ICORIS), IEEE, Manado, Indonesia, (2020), 1–5. https://doi.org/10.1109/ICORIS50180.2020.9320806
[21]	V. Chandran, C. K. Patil, A. M. Manoharan, A. Ghosh, M. G. Sumithra, A. Karthick, et al., Wind power forecasting based on time series model using deep machine learning algorithms, Mater. Today Proc., 47 (2021), 115–126. https://doi.org/10.1016/j.matpr.2021.03.728 doi: 10.1016/j.matpr.2021.03.728
[22]	V. Chandran, C. K. Patil, A. Karthick, D. Ganeshaperumal, R. Rahim, A. Ghosh, State of charge estimation of lithium-ion battery for electric vehicles using machine learning algorithms, WEVJ, 12 (2021), 38. https://doi.org/10.3390/wevj12010038 doi: 10.3390/wevj12010038

Reader Comments

Your name:*

Email:*
© 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)