# A Machine Learning-Based Intelligence Approach for Multiple-Input/Multiple-Output Routing in Wireless Sensor Networks

Authors: V. Sridhar; K. V. Ranga Rao; V. Vinay Kumar; Muaadh Mukred; Syed Sajid Ullah; Hussain AlSalman
Journal: Mathematical Problems in Engineering
 (2022)

---

## Abstract

Computational intelligence methods play an important role for supporting smart networks operations, optimization, and management. In wireless sensor networks (WSNs), increasing the number of nodes has a need for transferring large volume of data to remote nodes without any loss. These large amounts of data transmission might lead to exceeding the capacity of WSNs, which results in congestion, latency, and packet loss. Congestion in WSNs not only results in information loss but also burns a significant amount of energy. To tackle this issue, a practical computational intelligence approach for optimizing data transmission while decreasing latency is necessary. In this article, a Softmax-Regressed-Tanimoto-Reweight-Boost-Classification- (SRTRBC-) based machine learning technique is proposed for effective routing in WSNs. It can route packets around busy locations by selecting nodes with higher energy and lower load. The proposed SRTRBC technique is composed of two steps: route path construction and congestion-aware MIMO routing. Prior to constructing the route path, the residual energy of the node is determined. After that, the residual energy level is analyzed using softmax regression to determine whether or not the node is energy efficient. The energy-efficient nodes are located, and numerous paths between the source and sink nodes are established using route request and route reply. Following that, the SRTRBC technique is used for congestion-aware routing based on buffer space and bandwidth capability. The path that requires the least buffer space and has the highest bandwidth capacity is picked as the optimal route path among multiple paths. Finally, congestion-aware data transmission is used to minimize latency and data loss along the route path. The simulation considers a variety of performance metrics, including energy consumption, data delivery rate, data loss rate, throughput, and delay, in relation to the amount of data packets and sensor nodes.


---

## Body

## 1. Introduction

Wireless sensor networks (WSNs) help in monitoring and recording the physical environmental conditions as well as transmitting the collected data to base station. The network-on-chip (NoC) architecture was constructed in [1] to perform the efficient communication between the multiple cores. The designed system performed on-chip antennas utilization between long distance cores to reduce the latency. However, energy efficiency was not improved by network-on-chip (NoC) architecture.An opportunistic routing was carried out in [2] for MIMO in wireless ad-hoc networks (WANETs). But, the latency was not reduced by opportunistic routing. A new congestion-aware routing algorithm was introduced in [3] that splits the network-on-chip (NoC) into number of subnets. But the computational complexity was not reduced by congestion routing aware algorithm.A new functional gradient boosting was introduced in [4] for learning the deep residual networks on multiclass classification tasks. However, the packer delivery ratio was not reduced by functional gradient boosting. Two boosting algorithms termed RBoost1 and RBoost2 were introduced in [5], robust to noisy data with AdaBoost. RBoost1 and RBoost2 failed to focus on samples misclassified by base learners.A congestion-aware routing algorithm was introduced in [6] through sending the congestion information in data packet. Congestion Aware Routing using Fuzzy Rule sets (CARF) was designed in [7] for managing the excess traffic conditions through finding the nonlocalized node paths. But throughput level was not improved by CARF.A routing method was designed in [8] to reduce the congestion. The weights estimated from congestion-related parameters were sent to subsequent modules, but the routing cost was not minimized by designed method. Congestion Aware Lifetime Improving Routing Protocol (CALIRP) was designed in [9] to increase the network lifetime through reducing the congestion. However, the computational complexity was not reduced by CALIRP. A congestion-aware clustering and routing (CCR) protocol was designed in [10] to avoid the congestion problem over network. However, the data delivery rate was not improved by designed CCR protocol.The issues identified from the above literature are higher computational cost, lesser energy efficiency, lesser network lifetime, lesser data delivery rate, lesser computational complexity, higher packet loss rate, higher latency, etc. In order to address these problems, a congestion-aware routing technique called Softmax Regressed Tanimoto Reweight Boost Classification (SRTRBC) method for reliable and congestion routing aware in WSNs is designed.The main contributions of the work are as follows:(i)
A machine learning concept that combines the weak learners to form the strong one is used for developing the proposed SRTRBC method. The main aim of SRTRBC method is to route the packets around congested areas through identifying the energy-efficient and underloaded nodes. SRTRBC method comprises two processes like route path construction and congestion aware MIMO routing. The residual energy of node is determined for route path construction.(ii)
Softmax regression analysis examined the residual energy level to identify if the node is energy efficient node or nonenergy efficient node. The energy-efficient nodes are identified and constructed through the multiple paths from source node to sink node with help of route request and route reply.(iii)
Tanimoto Reweight Boost Classification is carried out for congestion aware routing depending on buffer space and bandwidth capacity. The route path with lesser buffer space and higher bandwidth capacity is selected as an optimal route path among multiple paths. At last, congestion-aware data delivery is performed along route path to minimize the latency and packet loss.The rest of the paper is structured as follows: Section2 reviews the related works of congestion routing aware in WSNs. Section 3 provides brief explanation of the proposed SRTRBC method with neat diagram. In Section 4, simulation settings and result analysis are discussed. The conclusion is given in Section 5.


## 2. Related Works

A congestion control algorithm depending on multiobjective optimization algorithm called PSOGSA was introduced in [11] for rate optimization. The network lifetime was not reduced by congestion control algorithm. A reliable and congestion based protocol was introduced in [12] for enhancing the reliability results. The designed protocol used Order Preference by Similarity to Ideal Solution (TOPSIS) technique to choose an optimal path for data transmission. However, the computational cost was not minimized by reliable and congestion based protocol.A centralized congestion control routing protocol depending on multimetrics (CCRPM) was introduced in [13] to minimize the network congestion effects. The computational complexity was not reduced by CCRPM. An Enhanced Congestion Control-Random Early Detection (EnCoCo-RED) was designed in [14] to enhance the congestion control performance. Though the congestion control was carried out, the energy efficiency was not improved by EnCoCo-RED.A fuzzy sliding mode congestion control algorithm (FSMC) was designed in [15] for WSN. However, the packet loss rate was not reduced by FSMC. A congestion control mechanism was designed in [16] on optimized rate for energy efficient transmissions. Though the energy efficiency was improved, routing overhead was not reduced by congestion control mechanism.An efficient congestion avoidance approach was introduce in [17] with Huffman coding algorithm to enhance the network performance. An ant colony optimization was used to identify the congestion-free alternate paths. However, the complexity level was not reduced by congestion avoidance approach.A dynamic approach was designed in [18] for queue management to identify the congestion with minimal time consumption and prevent the collision. The back-pressure method was employed depending on queue quality to minimize the linking probability in pathway. The latency was not reduced by dynamic approach.A PACC protocol was designed in [19] for improving the QoS performance in WSNs, namely latency, data delivery ratio, loss ratio, and network channel efficiency. Though the data delivery rate was improved, the time consumption was not reduced by PACC protocol.A two-level Fuzzy-Logic-Controller- (FLC-) based dynamic clustering scheme was designed in [20] for congestion prevention. The sink nodes forecasted the current load depending on the loads in preceding rounds, but the clustering accuracy was not improved by FLC-based dynamic clustering scheme.


## 3. Methodology

WSN is a group of sensor nodes to transfer the sensed data to sink node. Multiple-input/multiple-out (MIMO) technology is wireless communication used for transmitting the multiple data signals. MIMO method plays an essential role in 3G, 4G, and 4G LTE networks. WSN has experienced from different problems like frequently varying the network topology and congestion problems which affect network bandwidth usage. Congestion occurs when resource demand increase the system available capacity to reduce the latency and packet loss. The congestion avoidance is equal to the traffic load balancing in WSN. The possible congestion avoidance affects the excessive traffic distribution. Consequently, a new scheme is required to enhance the data delivery and minimize the latency. In this paper, reliable and congestion-aware routing technique called SRTRBC method is designed to route the packets around the congested areas by identifying the energy-efficient and underloaded nodes. The key idea of SRTRBC method is to construct the energy-efficient path identification and congestion aware routing correspondingly.Figure1 reveals the structural design of proposed SRTRBC method to perform the route path identification and MIMO routing in wireless technology. The proposed method computes the energy for every distributed sensor node. After that, the route path between the source and destination is identified through transmitting the request and reply message. The route with minimum distance is selected for efficient routing. In data transmission, the congestion-aware routing is carried out to minimize the network congestion with minimal latency.Figure 1
Structural design of the proposed SRTRBC method.


### 3.1. Network Model

A system model of proposed SRTRBC method is introduced. The number of sensor nodes ‘SNi=SN1,SN2,SN3…SNn’ are distributed in the squared area ‘n∗n’ within the transmission range ‘TR’. The sensor nodes are located independently and collect the information from environment. The collected data packets ‘dpj=dp1,dp2,…,dpm’ are sent to the destination node ‘dn’ through energy-efficient and congestion aware intermediate nodes ‘I1,I2,…,In’ to improve the lifetime in WSN and to choose the route paths for avoiding the congestion.


### 3.2. Softmax Regression Analysis-Based Route Path Construction

The SRTRBC method performs the route path classification between sensor nodes through performing the softmax regression analysis. The softmax regression analysis is a machine learning technique to find the relationship between the dependent variable (i.e., ‘outcomes’) and independent variables (i.e., features). The softmax regression function observes the sensor node features (i.e., energy). For every sensor node, energy level is calculated. Initially, all sensor nodes have similar energy level and it gets minimized during the sensing process. The energy level is computed as product of power and time. It is determined as(1)EnergySN=Power∗Time.From (1), ‘EnergySN’ represents the energy level of sensor nodes. ‘Power’ is measured in terms of watts. The time is measured in terms of seconds (sec). The energy of sensor node is computed in terms of joule (J). The energy level of sensor gets reduced during the sensing process in wireless network. Consequently, the residual energy of node is determined as(2)ResidualEnergySN=TotalEnergySN−ConsumedEnergySN.From (2), ‘ResidualEnergySN’ represents the residual energy of the sensor node, ‘TotalEnergySN’ represents the total energy of sensor nodes, and ‘ConsumedEnergySN’ denotes the consumed energy. The softmax regression analysis in SRTRBC method examines the predicted node energy level and finds the energy-efficient nodes. Softmax regression analysis is the simplification of logistic function to multiple dimensions. It is employed as the activation function to categorize the sensor node output to the probability distribution over the predicted output classes. It is formulated as(3)SRA=ezi∑k=1pezk.From (3), ‘σz’ denotes the softmax regression analysis. ‘zi’ represents the residual energy of the sensor node ‘i’ ranges from 0top. Normally, the output of the softmax regression analysis ranges from ‘0to1’. When regression analysis provides the output ranges from ‘0to0.5’, then the sensor node is said to nonenergy efficient node. When the regression analysis provides the output ranges from ‘0.5to1’, then the sensor node is said to be energy efficient node. After performing the regression analysis, the node with higher residual energy is chosen for route path construction. The number of route paths is constructed between the source node and destination node using two control messages like route request ‘Rreq’ and route reply ‘Rreq’. The source node distributes the request message to the destination node through the intermediate nodes.(4)Source node⇒Rreq∑k=1dIntermediatenodesk⇒RreqDestination Node.The source node transmits the route request packet to the sink node through the intermediate nodes. After collecting the request message, the destination node replies to the source node.(5)Source node⇐Rrep∑k=1dIntermediatenodesk⇐RrepDestination Node.From (5), ‘Rreq’ denotes the reply from destination node ‘dn’ to the source node ‘sn’ via the intermediate nodes Ii. Depending on two control message transmission, the multiple routes from source to the destination are illustrated in Figure 2.Figure 2
Route path construction.Figure2 demonstrates the multiple paths between source and destination node in SRTRBC method. The route paths from above graph are listed in Table 1.Table 1
Tabulation of route paths.
RouteRoute pathsHopsr1sn⟶I1⟶I5⟶dn2r2sn⟶I3⟶I6⟶dn2r3sn⟶I2⟶I4⟶I7⟶dn3Table1 describes the multiple route paths from source to destination node. There are three route paths ‘r1,r2andr3’ given in Table 1. The third column represents the number of hops between the source and destination. The multiple route paths are constructed in SRTRBC method from source to destination with higher network lifetime.


### 3.3. Reweight Adaptive Boosting Classification

Boosting is a machine learning algorithm that combines the weak learners to form the strong one. Boosting classifier is a strong classifier that presents the accurate classification results through combing all the weak learners. As a result, SRTRBC method employs the reweight adaptive boosting classification algorithm to increase the classification performance. The boosting algorithm uses the Tanimoto similarity function in SRTRBC method to categorize the route path into congestion aware and noncongestion aware route path. The flow process of reweight adaptive boosting classifier is illustrated in Figure3.Figure 3
Structure of reweight adaptive boost classification.Figure3 shows the structure of the reweight adaptive boost ensemble classifier in SRTRBC method to classify the route path into different classes for further processing. Let us consider the training data as multiple route paths ‘r1,r2andr3’ and ‘y1,y2andy3’ represent the classification output. The set of weak learners w1,w2,w3….wn are constructed to train the input and combined to form the strong one. A decision stump is the decision tree where route path is classified based on the similarity measure. Tanimoto similarity correlation is used in SRTRBC method to determine the linear relationship between congestion-free route path and constructed route path. It is measured as follows:(6)TSCC=congestion−free route path∩​constructed route pathcongestion−free route path+constructed route path−congestion−free route path∩​constructed route path.From (6), the Tanimoto similarity correlation coefficient ‘TSCC’ provides the value between 0 and 1. The threshold value of softmax regression analysis is set through taking the average of maximum and minimum value. The minimum value is considered as zero and the maximum value is considered as 1. Through taking the average value, we obtain the threshold value as 0.5. If the Tanimoto similarity correlation value ranges from ‘0to0.5’, it denotes noncongestion aware path. If the Tanimoto similarity correlation value ranges from ‘0.5to1’, it denotes congestion aware path. Based on the correlation value, the decision dump categorizes the route path into two different classes. After classification, the weak learners are joined into forming the strong learner. It is mathematically formulated as(7)WC=∑j=1lwj.From (7), ‘WC’ denotes the output of weak classifier and ‘wj’ symbolizes the number of weak learner output. After that, the similar weight is allocated in SRTRBC method to each weak learner. It is calculated as(8)WC=∑j=1lδ∗wj.From (8), ‘δ’represents the similar weight allocated to the weak learners ‘wj’. After that, the training error of each base learner is computed as(9)Error=yj−wj2.From (9), ‘yi’ represents the actual output and ‘wj’ symbolizes the observed output. Depending on the error, every base learner is reweighted. The boosting classifier identifies the classification results with lesser error rate. The reweighted classification results are attained as(10)RCR=∑δw∗wj.From (10), ‘RCR’ represents the output of reweighted classification results. ‘δw’ denotes the reweight of weak learner ‘wj’. Depending on the classification results, the route path is correctly classified into two classes. After that, source node sends the data packets to the destination node in congestion-free manner for further processing. The algorithmic process of reweight adaptive boosting classification in SRTRBC method is described as follows.Algorithm1 explains the softmax regressed Tanimoto reweight boost classification based reliable and congestion aware routing process. For every sensor node in WSN, the residual energy level is determined. Then, the regression function examines the estimated energy level of sensor node. Depending on regression analysis, the energy-efficient nodes are selected for MIMO routing. With help of energy-efficient nodes, multiple route paths are constructed between source and destination node. The multiple route paths are recognized through transmitting two control messages like route request and reply from source to the destination. The ensemble technique constructs the number of weak learners. After that, the weak learners are combined and similar weight is allocated to the weak learners. Subsequently, the error is determined for each classification result of the weak learner to improve the classification performance. After that, the weak learner weights are recomputed consistent with the error value. Afterwards, the classifier with minimum error is chosen as final strong classification results. Finally, the congestion-free data transmission is carried out in efficient manner with higher data delivery.Algorithm 1: Softmax regressed Tanimoto reweight boost classification-based reliable and congestion aware routing algorithm.
Input: sensor NodesSN1,SN2,SN3…SNn , source node, destination nodeOutput: improve congestion aware routing in WSNBegin(1)
For eachSNi(2)
Measure residual energy of sensor node(3)
Analyze the residual energy by using softmax regression(4)
ifSRA<0.5, then(5)
SNi is energy-efficient node(6)
else(7)
SNi is nonenergy efficient node(8)
end if(9)
end for(10)
Create the route paths between source and destination node(11)
sn sends ReqR to sink(12)
sn send RepR to source(13)
Construct the multiple routes ‘r1, r2 and r3’(14)
for each constructed route path(15)
Construct ‘n’ weak learners(16)
Measure the Tanimoto similarity correlation(17)
Classifies route path into two different classes(18)
Combines all weak learnersyi(19)
Assign similar weights to the weak classifier(20)
Compute the error(21)
Update the weight of weak classifiers(22)
Find classifier with minimum error(23)
Attain the strong classification results(24)
End forEnd


## 3.1. Network Model

A system model of proposed SRTRBC method is introduced. The number of sensor nodes ‘SNi=SN1,SN2,SN3…SNn’ are distributed in the squared area ‘n∗n’ within the transmission range ‘TR’. The sensor nodes are located independently and collect the information from environment. The collected data packets ‘dpj=dp1,dp2,…,dpm’ are sent to the destination node ‘dn’ through energy-efficient and congestion aware intermediate nodes ‘I1,I2,…,In’ to improve the lifetime in WSN and to choose the route paths for avoiding the congestion.


## 3.2. Softmax Regression Analysis-Based Route Path Construction

The SRTRBC method performs the route path classification between sensor nodes through performing the softmax regression analysis. The softmax regression analysis is a machine learning technique to find the relationship between the dependent variable (i.e., ‘outcomes’) and independent variables (i.e., features). The softmax regression function observes the sensor node features (i.e., energy). For every sensor node, energy level is calculated. Initially, all sensor nodes have similar energy level and it gets minimized during the sensing process. The energy level is computed as product of power and time. It is determined as(1)EnergySN=Power∗Time.From (1), ‘EnergySN’ represents the energy level of sensor nodes. ‘Power’ is measured in terms of watts. The time is measured in terms of seconds (sec). The energy of sensor node is computed in terms of joule (J). The energy level of sensor gets reduced during the sensing process in wireless network. Consequently, the residual energy of node is determined as(2)ResidualEnergySN=TotalEnergySN−ConsumedEnergySN.From (2), ‘ResidualEnergySN’ represents the residual energy of the sensor node, ‘TotalEnergySN’ represents the total energy of sensor nodes, and ‘ConsumedEnergySN’ denotes the consumed energy. The softmax regression analysis in SRTRBC method examines the predicted node energy level and finds the energy-efficient nodes. Softmax regression analysis is the simplification of logistic function to multiple dimensions. It is employed as the activation function to categorize the sensor node output to the probability distribution over the predicted output classes. It is formulated as(3)SRA=ezi∑k=1pezk.From (3), ‘σz’ denotes the softmax regression analysis. ‘zi’ represents the residual energy of the sensor node ‘i’ ranges from 0top. Normally, the output of the softmax regression analysis ranges from ‘0to1’. When regression analysis provides the output ranges from ‘0to0.5’, then the sensor node is said to nonenergy efficient node. When the regression analysis provides the output ranges from ‘0.5to1’, then the sensor node is said to be energy efficient node. After performing the regression analysis, the node with higher residual energy is chosen for route path construction. The number of route paths is constructed between the source node and destination node using two control messages like route request ‘Rreq’ and route reply ‘Rreq’. The source node distributes the request message to the destination node through the intermediate nodes.(4)Source node⇒Rreq∑k=1dIntermediatenodesk⇒RreqDestination Node.The source node transmits the route request packet to the sink node through the intermediate nodes. After collecting the request message, the destination node replies to the source node.(5)Source node⇐Rrep∑k=1dIntermediatenodesk⇐RrepDestination Node.From (5), ‘Rreq’ denotes the reply from destination node ‘dn’ to the source node ‘sn’ via the intermediate nodes Ii. Depending on two control message transmission, the multiple routes from source to the destination are illustrated in Figure 2.Figure 2
Route path construction.Figure2 demonstrates the multiple paths between source and destination node in SRTRBC method. The route paths from above graph are listed in Table 1.Table 1
Tabulation of route paths.
RouteRoute pathsHopsr1sn⟶I1⟶I5⟶dn2r2sn⟶I3⟶I6⟶dn2r3sn⟶I2⟶I4⟶I7⟶dn3Table1 describes the multiple route paths from source to destination node. There are three route paths ‘r1,r2andr3’ given in Table 1. The third column represents the number of hops between the source and destination. The multiple route paths are constructed in SRTRBC method from source to destination with higher network lifetime.


## 3.3. Reweight Adaptive Boosting Classification

Boosting is a machine learning algorithm that combines the weak learners to form the strong one. Boosting classifier is a strong classifier that presents the accurate classification results through combing all the weak learners. As a result, SRTRBC method employs the reweight adaptive boosting classification algorithm to increase the classification performance. The boosting algorithm uses the Tanimoto similarity function in SRTRBC method to categorize the route path into congestion aware and noncongestion aware route path. The flow process of reweight adaptive boosting classifier is illustrated in Figure3.Figure 3
Structure of reweight adaptive boost classification.Figure3 shows the structure of the reweight adaptive boost ensemble classifier in SRTRBC method to classify the route path into different classes for further processing. Let us consider the training data as multiple route paths ‘r1,r2andr3’ and ‘y1,y2andy3’ represent the classification output. The set of weak learners w1,w2,w3….wn are constructed to train the input and combined to form the strong one. A decision stump is the decision tree where route path is classified based on the similarity measure. Tanimoto similarity correlation is used in SRTRBC method to determine the linear relationship between congestion-free route path and constructed route path. It is measured as follows:(6)TSCC=congestion−free route path∩​constructed route pathcongestion−free route path+constructed route path−congestion−free route path∩​constructed route path.From (6), the Tanimoto similarity correlation coefficient ‘TSCC’ provides the value between 0 and 1. The threshold value of softmax regression analysis is set through taking the average of maximum and minimum value. The minimum value is considered as zero and the maximum value is considered as 1. Through taking the average value, we obtain the threshold value as 0.5. If the Tanimoto similarity correlation value ranges from ‘0to0.5’, it denotes noncongestion aware path. If the Tanimoto similarity correlation value ranges from ‘0.5to1’, it denotes congestion aware path. Based on the correlation value, the decision dump categorizes the route path into two different classes. After classification, the weak learners are joined into forming the strong learner. It is mathematically formulated as(7)WC=∑j=1lwj.From (7), ‘WC’ denotes the output of weak classifier and ‘wj’ symbolizes the number of weak learner output. After that, the similar weight is allocated in SRTRBC method to each weak learner. It is calculated as(8)WC=∑j=1lδ∗wj.From (8), ‘δ’represents the similar weight allocated to the weak learners ‘wj’. After that, the training error of each base learner is computed as(9)Error=yj−wj2.From (9), ‘yi’ represents the actual output and ‘wj’ symbolizes the observed output. Depending on the error, every base learner is reweighted. The boosting classifier identifies the classification results with lesser error rate. The reweighted classification results are attained as(10)RCR=∑δw∗wj.From (10), ‘RCR’ represents the output of reweighted classification results. ‘δw’ denotes the reweight of weak learner ‘wj’. Depending on the classification results, the route path is correctly classified into two classes. After that, source node sends the data packets to the destination node in congestion-free manner for further processing. The algorithmic process of reweight adaptive boosting classification in SRTRBC method is described as follows.Algorithm1 explains the softmax regressed Tanimoto reweight boost classification based reliable and congestion aware routing process. For every sensor node in WSN, the residual energy level is determined. Then, the regression function examines the estimated energy level of sensor node. Depending on regression analysis, the energy-efficient nodes are selected for MIMO routing. With help of energy-efficient nodes, multiple route paths are constructed between source and destination node. The multiple route paths are recognized through transmitting two control messages like route request and reply from source to the destination. The ensemble technique constructs the number of weak learners. After that, the weak learners are combined and similar weight is allocated to the weak learners. Subsequently, the error is determined for each classification result of the weak learner to improve the classification performance. After that, the weak learner weights are recomputed consistent with the error value. Afterwards, the classifier with minimum error is chosen as final strong classification results. Finally, the congestion-free data transmission is carried out in efficient manner with higher data delivery.Algorithm 1: Softmax regressed Tanimoto reweight boost classification-based reliable and congestion aware routing algorithm.
Input: sensor NodesSN1,SN2,SN3…SNn , source node, destination nodeOutput: improve congestion aware routing in WSNBegin(1)
For eachSNi(2)
Measure residual energy of sensor node(3)
Analyze the residual energy by using softmax regression(4)
ifSRA<0.5, then(5)
SNi is energy-efficient node(6)
else(7)
SNi is nonenergy efficient node(8)
end if(9)
end for(10)
Create the route paths between source and destination node(11)
sn sends ReqR to sink(12)
sn send RepR to source(13)
Construct the multiple routes ‘r1, r2 and r3’(14)
for each constructed route path(15)
Construct ‘n’ weak learners(16)
Measure the Tanimoto similarity correlation(17)
Classifies route path into two different classes(18)
Combines all weak learnersyi(19)
Assign similar weights to the weak classifier(20)
Compute the error(21)
Update the weight of weak classifiers(22)
Find classifier with minimum error(23)
Attain the strong classification results(24)
End forEnd


## 4. Simulation Settings and Result Discussion

The simulation of SRTRBC method and existing methods is done using MATLAB. In order to conduct the simulation, 1000 sensor nodes are considered as input. The proposed and existing method performance is determined with help of ten runs. The performance analysis of the proposed SRTRBC method and existing methods namely network-on-chip (NoC) architecture [1] and opportunistic routing [2] are explained with five different metrics, namely energy efficiency, data delivery rate, data loss rate, throughput, and latency. The performances of different techniques are analyzed with help of table and graphical illustration. The parameters are explained as given below.


### 4.1. Impact of Energy Efficiency

Energy efficiency is defined as the proportion of output energy and input energy. Energy efficiency is determined as(11)EnerEff=OenergyIenergy×100.From (11), ‘EnerEff ’denotes the energy efficiency. Energy efficiency is computed in terms of percentage (%). Table 2 describes the energy efficiency performance results with respect to number of sensor nodes.Table 2
Tabulation of energy efficiency.
Number of sensor nodes (number)Energy efficiency (%)NoC architectureOpportunistic routingSRTRBC method10088.590.296.120090.692.594.230089.992.696.540090.193.497.450088.691.196.860088.990.297.870087.591.795.480088.190.896.790087.291.595.3100082.892.294.1As shown in Table2, the three different methods of energy efficiency are SRTRBC method, NoC Architecture [1] and Opportunistic Routing [2]. Among these three different methods, the SRTRBC method outperforms well through increasing the energy efficiency during the data transmission. Let us consider the 100 sensor nodes in wireless network and the initial energy level of every sensor node is predefined as‘0.5J’. Because of transmission process, the energy level of sensor nodes gets reduced. Consequently, the energy efficiency of the SRTRBC method using 100 sensor nodes is 96.1%, while the energy efficiency of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 88.5% and 90.2%, respectively. Likewise, different energy efficiency results are obtained by applying different number of sensor nodes. The attained energy efficiency results are evaluated for three different existing methods.Figure4 illustrates the performance results of energy efficiency linked with three different methods. The x-axis represents that the various number of sensor nodes. The y-axis denotes the energy efficiency of the sensor nodes. In graphical representation, the blue colour bar denotes the energy efficiency of NoC Architecture [1] and the red colour bar represents the energy efficiency of Opportunistic Routing [2]. The green colour bar symbolizes the energy efficiency of SRTRBC method. The graph denotes that the proposed SRTRBC method outperforms well through increasing the energy efficiency. This is due to the application of softmax regression analysis and Tanimoto reweight boost classification for congestion aware routing in WSN. The route path with lesser buffer space and higher bandwidth capacity is selected as the best route among the multiple paths. The regression analysis identify if the node is energy efficient or nonenergy efficient. The energy-efficient nodes identified the multiple paths from source node to the sink node through transmitting the route request and route reply. This in turn helps to improve the energy efficiency during efficient data transmission in WSN. The average of ten results describes the overall energy efficiency using the proposed SRTRBC method comparatively increased by 9% and 5% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 4
Measurement of energy consumption.


### 4.2. Impact of Data Delivery Rate

Data delivery rate is computed as ratio of the number of data packets correctly delivered to the total number of data packets sent. The data delivery rate is formulated as(12)data  delivery rate=Number of data packet correctly deliveredNumber of data packets sent∗100.From (12), the data delivery rate is determined. The data delivery rate is computed in terms of percentage (%). Table 3 explains the results of data delivery rate with respect to the number of data packets.Table 3
Tabulation of data delivery rate.
Number of data packets (number)Data delivery rate (%)NoC architectureOpportunistic routingSRTRBC method1007380932008588953008890924008788945008992976009294967009295988009295989009196981000959698From Table3, we can conclude that there are three different methods with their data delivery rates: SRTRBC method, NoC Architecture [1], and Opportunistic Routing [2]. Among these three different methods, the SRTRBC method outperforms well through increasing the data delivery rate during the data transmission. Let us consider the 500data packets in wireless network. Consequently, the data delivery rate of the SRTRBC method is 97%, while the data delivery rate of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 89% and 92%, respectively. Similarly, different data delivery rate results are attained by applying different number of data packets. The data delivery rate results are determined for three different existing techniques.Figure5 explains performance results of data delivery rate for three different techniques. The x-axis denotes different number of data packets. The y-axis symbolizes the data delivery rate of three different methods. In graphical illustration, the blue colour bar represents the data delivery rate of NoC Architecture [1] and the red colour bar denotes the data delivery rate of Opportunistic Routing [2]. The green colour bar represents the data delivery rate of SRTRBC method. The graph represents the proposed SRTRBC method performed well through increasing the data delivery rate. This is due to the application of softmax regression analysis for determining the residual energy level. The regression analysis helps to find if the node is energy efficient or nonenergy efficient. After that, the energy-efficient nodes are recognized and construct the number of paths from source node to the sink node through transmitting route request and route reply. This in turn helps to improve the data delivery rate during efficient data transmission in WSN. The average of ten results explains that the overall data delivery rate using the proposed SRTRBC method is comparatively increased by 5% and 9% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 5
Measurement of data delivery rate.


### 4.3. Impact of Latency

Latency is defined as the variation between the expected arrival time and actual arrival time of data packet. Latency of data transmission is determined as(13)L=ATactual−ATExpected.From (8), ‘L’ denotes the latency.‘ATactual’ represents the actual arrival time, and ‘ATExpected’ symbolizes the expected arrival time. The latency is computed in milliseconds (ms). Table 4 describes the performance results of latency with respect to the number of data packets varying from 100 to 1000.Table 4
Tabulation of latency.
Number of data packets (number)Latency (ms)NoC architectureOpportunistic routingSRTRBC method1003122152003326193003729214004032255004335276004738307005041328005244359005547371000574940It describes the performance results of latency with respect to the number of data packets varying from 100 to 1000. The table explains latency of three different methods, SRTRBC method, NoC Architecture [1], and Opportunistic Routing [2]. Among three different methods, the SRTRBC method attained better results through reducing the latency during the data transmission. Let us consider the number of data packets is 800 in wireless network. Consequently, the latency of the SRTRBC method is 35ms while the latency of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 52ms and 44ms, respectively. Similarly, different latency performance results are attained for different number of data packets. The latency results are computed for three different existing techniques.Figure6 explains the performance results of latency for three different methods. The x-axis denotes different number of data packets. The y-axis symbolizes the latency of the three different methods. In graphical illustration, the blue colour bar represents the latency of NoC Architecture [1] and the red colour bar denotes latency of Opportunistic Routing [2]. The green colour bar symbolizes the latency of SRTRBC method. The graph represents the proposed SRTRBC method performs well through reducing the latency. This is because of applying the softmax regression analysis for calculating the residual energy level. The regression analysis helps to find if the node is energy efficient or non-energy efficient. The energy-efficient nodes are identified and construct multiple paths from source node to destination through sending the route request message and route reply message. This in turn helps to minimize the latency during efficient data transmission in WSN. The average of ten results explains that the overall latency using the proposed SRTRBC method is comparatively reduced by 38% and 23% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 6
Measurement of latency.


### 4.4. Impact of Data Loss Rate

Data loss rate is computed as the ratio of the number of data packets correctly delivered to the total number of data packets transmitted. The data delivery rate is formulated as(14)data loss rate=Number of data packet lostNumber of data packets sent∗100.From (14), the data loss rate is determined. The data loss rate is measured in terms of percentage (%). Table 5explains the performance results of data loss rate with respect to the number of data packets.Table 5
Tabulation of data loss rates.
Number of data packets (number)Data loss rate (%)NoC architectureOpportunistic routingSRTRBC method1002720720015125300121084001312650011836008647008528008529009421000542In Table5, the data loss rate of three different methods (SRTRBC, NoC Architecture [1], and Opportunistic Routing [2]) is given. Among these three different methods, the SRTRBC method reduces the data loss rate during the data transmission. Let us consider the 900 data packets in wireless network. Consequently, the data loss rate of the SRTRBC method is 2% while the data loss rate of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 9% and ,4% respectively. Similarly, different data loss rate results are obtained by applying different number of data packets. The data loss rate results are computed for three different existing techniques.Figure7 explains the performance results of data loss rate for three different techniques. The x-axis denotes different number of data packets. The y-axis represents the data loss rate of the three different methods. In graphical illustration, the blue colour bar denotes the data loss rate of NoC Architecture [1] and the red colour bar denotes the data loss rate of Opportunistic Routing [2]. The green colour bar represents the data loss rate of SRTRBC method. The graph represents the proposed SRTRBC method performed well through reducing the data loss rate. This is due to the application of softmax regression analysis for computing the residual energy level. The regression analysis helps to identify if the node is energy efficient or nonenergy efficient. With energy-efficient nodes, multiple paths are constructed from source node to the sink node through transmitting the route request and route reply. This in turn helps to reduce the data loss rate during efficient data transmission in WSN. The average of ten results explains that the overall data loss rate using proposed SRTRBC method is comparatively reduced by 64% and 51% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 7
Measurement of data loss rate.


### 4.5. Impact of Throughput

Throughput is defined as the amount of packets broadcasted from the sensor nodes at a certain interval. It is measured as(15)T=number of packets transmittedtime interval.From (15), the throughput ‘T’ is determined. Throughput is measured in bits per seconds (bps). Table 6 describes the performance result of throughput with respect to the number of data packets.Table 6
Tabulation of throughput.
Number of sensor nodes (number)Throughput (bps)NoC architectureOpportunistic routingSRTRBC method1001501651842001812092453002653013274003673954065004034574986004915065877006196496818007267678049008118658871000925954979It portrays the throughput of three different methods, SRTRBC method, NoC Architecture [1], and Opportunistic Routing [2]. We see that the SRTRBC method increases the throughput during the data transmission. Let us consider the 800 data packets in wireless network. Consequently, the throughput of the SRTRBC method is 804bps, while the throughput of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 726bps and 767bps, respectively. Similarly, different throughput results are obtained for different number of sensor nodes. The throughput results are computed for three different existing techniques.Figure8 explains the performance results of throughput for three different techniques. The x-axis denotes different number of sensor nodes. The y-axis denotes the throughput of the three different methods. In graphical illustration, the blue colour bar represents the throughput of NoC Architecture [1] and the red colour bar denotes the throughput of Opportunistic Routing [2]. The green colour bar represents the throughput of SRTRBC method. The graph represents the proposed SRTRBC method performed well through increasing the throughput. This is because of applying softmax regression analysis and Tanimoto reweight boost classification for congestion aware routing depending on buffer space and bandwidth capacity. The regression analysis identify if the node is energy efficient or nonenergy efficient. With energy-efficient nodes, multiple paths are constructed from source node to the sink node through transmitting the route request and route reply. In this way, it gets increased during efficient data transmission in WSN. The average of ten results explains that the overall throughput using proposed SRTRBC method is comparatively increased by 17% and 8% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 8
Measurement of throughput.


## 4.1. Impact of Energy Efficiency

Energy efficiency is defined as the proportion of output energy and input energy. Energy efficiency is determined as(11)EnerEff=OenergyIenergy×100.From (11), ‘EnerEff ’denotes the energy efficiency. Energy efficiency is computed in terms of percentage (%). Table 2 describes the energy efficiency performance results with respect to number of sensor nodes.Table 2
Tabulation of energy efficiency.
Number of sensor nodes (number)Energy efficiency (%)NoC architectureOpportunistic routingSRTRBC method10088.590.296.120090.692.594.230089.992.696.540090.193.497.450088.691.196.860088.990.297.870087.591.795.480088.190.896.790087.291.595.3100082.892.294.1As shown in Table2, the three different methods of energy efficiency are SRTRBC method, NoC Architecture [1] and Opportunistic Routing [2]. Among these three different methods, the SRTRBC method outperforms well through increasing the energy efficiency during the data transmission. Let us consider the 100 sensor nodes in wireless network and the initial energy level of every sensor node is predefined as‘0.5J’. Because of transmission process, the energy level of sensor nodes gets reduced. Consequently, the energy efficiency of the SRTRBC method using 100 sensor nodes is 96.1%, while the energy efficiency of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 88.5% and 90.2%, respectively. Likewise, different energy efficiency results are obtained by applying different number of sensor nodes. The attained energy efficiency results are evaluated for three different existing methods.Figure4 illustrates the performance results of energy efficiency linked with three different methods. The x-axis represents that the various number of sensor nodes. The y-axis denotes the energy efficiency of the sensor nodes. In graphical representation, the blue colour bar denotes the energy efficiency of NoC Architecture [1] and the red colour bar represents the energy efficiency of Opportunistic Routing [2]. The green colour bar symbolizes the energy efficiency of SRTRBC method. The graph denotes that the proposed SRTRBC method outperforms well through increasing the energy efficiency. This is due to the application of softmax regression analysis and Tanimoto reweight boost classification for congestion aware routing in WSN. The route path with lesser buffer space and higher bandwidth capacity is selected as the best route among the multiple paths. The regression analysis identify if the node is energy efficient or nonenergy efficient. The energy-efficient nodes identified the multiple paths from source node to the sink node through transmitting the route request and route reply. This in turn helps to improve the energy efficiency during efficient data transmission in WSN. The average of ten results describes the overall energy efficiency using the proposed SRTRBC method comparatively increased by 9% and 5% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 4
Measurement of energy consumption.


## 4.2. Impact of Data Delivery Rate

Data delivery rate is computed as ratio of the number of data packets correctly delivered to the total number of data packets sent. The data delivery rate is formulated as(12)data  delivery rate=Number of data packet correctly deliveredNumber of data packets sent∗100.From (12), the data delivery rate is determined. The data delivery rate is computed in terms of percentage (%). Table 3 explains the results of data delivery rate with respect to the number of data packets.Table 3
Tabulation of data delivery rate.
Number of data packets (number)Data delivery rate (%)NoC architectureOpportunistic routingSRTRBC method1007380932008588953008890924008788945008992976009294967009295988009295989009196981000959698From Table3, we can conclude that there are three different methods with their data delivery rates: SRTRBC method, NoC Architecture [1], and Opportunistic Routing [2]. Among these three different methods, the SRTRBC method outperforms well through increasing the data delivery rate during the data transmission. Let us consider the 500data packets in wireless network. Consequently, the data delivery rate of the SRTRBC method is 97%, while the data delivery rate of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 89% and 92%, respectively. Similarly, different data delivery rate results are attained by applying different number of data packets. The data delivery rate results are determined for three different existing techniques.Figure5 explains performance results of data delivery rate for three different techniques. The x-axis denotes different number of data packets. The y-axis symbolizes the data delivery rate of three different methods. In graphical illustration, the blue colour bar represents the data delivery rate of NoC Architecture [1] and the red colour bar denotes the data delivery rate of Opportunistic Routing [2]. The green colour bar represents the data delivery rate of SRTRBC method. The graph represents the proposed SRTRBC method performed well through increasing the data delivery rate. This is due to the application of softmax regression analysis for determining the residual energy level. The regression analysis helps to find if the node is energy efficient or nonenergy efficient. After that, the energy-efficient nodes are recognized and construct the number of paths from source node to the sink node through transmitting route request and route reply. This in turn helps to improve the data delivery rate during efficient data transmission in WSN. The average of ten results explains that the overall data delivery rate using the proposed SRTRBC method is comparatively increased by 5% and 9% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 5
Measurement of data delivery rate.


## 4.3. Impact of Latency

Latency is defined as the variation between the expected arrival time and actual arrival time of data packet. Latency of data transmission is determined as(13)L=ATactual−ATExpected.From (8), ‘L’ denotes the latency.‘ATactual’ represents the actual arrival time, and ‘ATExpected’ symbolizes the expected arrival time. The latency is computed in milliseconds (ms). Table 4 describes the performance results of latency with respect to the number of data packets varying from 100 to 1000.Table 4
Tabulation of latency.
Number of data packets (number)Latency (ms)NoC architectureOpportunistic routingSRTRBC method1003122152003326193003729214004032255004335276004738307005041328005244359005547371000574940It describes the performance results of latency with respect to the number of data packets varying from 100 to 1000. The table explains latency of three different methods, SRTRBC method, NoC Architecture [1], and Opportunistic Routing [2]. Among three different methods, the SRTRBC method attained better results through reducing the latency during the data transmission. Let us consider the number of data packets is 800 in wireless network. Consequently, the latency of the SRTRBC method is 35ms while the latency of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 52ms and 44ms, respectively. Similarly, different latency performance results are attained for different number of data packets. The latency results are computed for three different existing techniques.Figure6 explains the performance results of latency for three different methods. The x-axis denotes different number of data packets. The y-axis symbolizes the latency of the three different methods. In graphical illustration, the blue colour bar represents the latency of NoC Architecture [1] and the red colour bar denotes latency of Opportunistic Routing [2]. The green colour bar symbolizes the latency of SRTRBC method. The graph represents the proposed SRTRBC method performs well through reducing the latency. This is because of applying the softmax regression analysis for calculating the residual energy level. The regression analysis helps to find if the node is energy efficient or non-energy efficient. The energy-efficient nodes are identified and construct multiple paths from source node to destination through sending the route request message and route reply message. This in turn helps to minimize the latency during efficient data transmission in WSN. The average of ten results explains that the overall latency using the proposed SRTRBC method is comparatively reduced by 38% and 23% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 6
Measurement of latency.


## 4.4. Impact of Data Loss Rate

Data loss rate is computed as the ratio of the number of data packets correctly delivered to the total number of data packets transmitted. The data delivery rate is formulated as(14)data loss rate=Number of data packet lostNumber of data packets sent∗100.From (14), the data loss rate is determined. The data loss rate is measured in terms of percentage (%). Table 5explains the performance results of data loss rate with respect to the number of data packets.Table 5
Tabulation of data loss rates.
Number of data packets (number)Data loss rate (%)NoC architectureOpportunistic routingSRTRBC method1002720720015125300121084001312650011836008647008528008529009421000542In Table5, the data loss rate of three different methods (SRTRBC, NoC Architecture [1], and Opportunistic Routing [2]) is given. Among these three different methods, the SRTRBC method reduces the data loss rate during the data transmission. Let us consider the 900 data packets in wireless network. Consequently, the data loss rate of the SRTRBC method is 2% while the data loss rate of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 9% and ,4% respectively. Similarly, different data loss rate results are obtained by applying different number of data packets. The data loss rate results are computed for three different existing techniques.Figure7 explains the performance results of data loss rate for three different techniques. The x-axis denotes different number of data packets. The y-axis represents the data loss rate of the three different methods. In graphical illustration, the blue colour bar denotes the data loss rate of NoC Architecture [1] and the red colour bar denotes the data loss rate of Opportunistic Routing [2]. The green colour bar represents the data loss rate of SRTRBC method. The graph represents the proposed SRTRBC method performed well through reducing the data loss rate. This is due to the application of softmax regression analysis for computing the residual energy level. The regression analysis helps to identify if the node is energy efficient or nonenergy efficient. With energy-efficient nodes, multiple paths are constructed from source node to the sink node through transmitting the route request and route reply. This in turn helps to reduce the data loss rate during efficient data transmission in WSN. The average of ten results explains that the overall data loss rate using proposed SRTRBC method is comparatively reduced by 64% and 51% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 7
Measurement of data loss rate.


## 4.5. Impact of Throughput

Throughput is defined as the amount of packets broadcasted from the sensor nodes at a certain interval. It is measured as(15)T=number of packets transmittedtime interval.From (15), the throughput ‘T’ is determined. Throughput is measured in bits per seconds (bps). Table 6 describes the performance result of throughput with respect to the number of data packets.Table 6
Tabulation of throughput.
Number of sensor nodes (number)Throughput (bps)NoC architectureOpportunistic routingSRTRBC method1001501651842001812092453002653013274003673954065004034574986004915065877006196496818007267678049008118658871000925954979It portrays the throughput of three different methods, SRTRBC method, NoC Architecture [1], and Opportunistic Routing [2]. We see that the SRTRBC method increases the throughput during the data transmission. Let us consider the 800 data packets in wireless network. Consequently, the throughput of the SRTRBC method is 804bps, while the throughput of the NoC Architecture [1] and Opportunistic Routing [2] is observed as 726bps and 767bps, respectively. Similarly, different throughput results are obtained for different number of sensor nodes. The throughput results are computed for three different existing techniques.Figure8 explains the performance results of throughput for three different techniques. The x-axis denotes different number of sensor nodes. The y-axis denotes the throughput of the three different methods. In graphical illustration, the blue colour bar represents the throughput of NoC Architecture [1] and the red colour bar denotes the throughput of Opportunistic Routing [2]. The green colour bar represents the throughput of SRTRBC method. The graph represents the proposed SRTRBC method performed well through increasing the throughput. This is because of applying softmax regression analysis and Tanimoto reweight boost classification for congestion aware routing depending on buffer space and bandwidth capacity. The regression analysis identify if the node is energy efficient or nonenergy efficient. With energy-efficient nodes, multiple paths are constructed from source node to the sink node through transmitting the route request and route reply. In this way, it gets increased during efficient data transmission in WSN. The average of ten results explains that the overall throughput using proposed SRTRBC method is comparatively increased by 17% and 8% when compared to other NoC Architecture [1] and Opportunistic Routing [2].Figure 8
Measurement of throughput.


## 5. Conclusion

A new routing method termed SRTRBC method is introduced to route packets around congested areas through identifying the energy-efficient and underloaded nodes in WSN. SRTRBC method comprised route path construction and congestion aware MIMO routing. The node residual energy is determined for route path construction in WSN. Softmax regression analysis examines the residual energy level to identify if the node is energy efficient or nonenergy efficient. The energy-efficient nodes constructed multiple paths from source node to the sink node through route request and route reply. The Tanimoto Reweight Boost Classification method performed the congestion aware routing with minimal latency and packet loss during the data transmission in WSN. The qualitative and quantitative results discussion shows that SRTRBC method attained better performance in terms of achieving higher data delivery rate and lesser latency and energy efficiency when compared to other related works. The future direction of the work can be carried out through introducing the deep learning concept during MIMO routing in WSN. With the help of deep learning method, the energy efficiency gets increased at the required level and latency time gets reduced.



---

*Source: 6391678-2022-01-24.xml*