“…Figures 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , and 20 , determined for Routing Protocols Communication for Rushing Attack concerning the routing communication with route projection for instance of "Attacker detection automation," Modified AODV and Hybrid Random Late Detection (HRLD), "Swift Implicit Response Round Trip Time" mechanism, "Use Best Approximation" and "Past Interaction History" [ 77 , 80 , 83 ]. Fig.…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
confidence: 99%
“…Attacker detection automation of Bees Colony Optimization (ADABCP) was developed to overcome route optimization concerns on the MANET against rushing assaults. Route Organization and Route Reorganization are two steps of the ADABCP [ 22 , 83 ]. A significant data stream is evaluated while defining Route Organization, which gets values for numerous mobile node attributes.…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
confidence: 99%
“…The nodes create rushing assaults if they are dormant. Thus attackers appear in the routing path [ 80 , 83 ].…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
confidence: 99%
“…If either single customer is not maintaining the distance from others and the other is also not warned by an alarm. Since, among all individuals in the simulation, those who are not keeping the space for more than 30 s to the nearby person are in the waring stage for more than 30 s [ 83 ]. Hence the alarm gets continuous warning exposed with minimal probability distance.…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
In MANET, routing plays a vital role in packet interaction and data transmission. It is always easy to manage the data transmission over the MANET because of uncentralized control on the MANET nodes. Since the efficient route on MANET controls the packets and does not simplify the route between the source and destination. Hence the maintenance of route interaction becomes a crucial process. Methods: It is critical to enhance the route and decrease the attacker to sustain successful data transfers via the MANET Network. MANET, on the other hand, permits route interaction with security threads. The four processing schema are proposed in this study work to retain the security safeguards against Routing Protocols. The Rushing Attacker has significantly influenced MANET packet-based data transfer, particularly node communication. The Attacker Detection Automation of Bee Colony Optimization (ADABCP) Method is proposed in this article. Results: Existing ESCT, ZRDM-LFPM, and ENM-LAC techniques were compared to the suggested outcome. Consequently, routing and data transfer have enhanced the proposed illustration (SIRT-ADABCP-HRLD). Compared to the recommended approach, the end-to-end latency, communication overhead, packet delivery ratio, network lifetime, and energy usage are all improved. Discussion: The performance evaluation results of SIRT–ADABCP-HRLD with existing methods in terms of low End to End Delay (ms) of 49.8361% compared to existing methods ESCT, ENM-LAC, and ZRDM-LFPM. In terms of low Communication Overhead, an 81.4462% decrease compared to existing methods. However, it improves packet delivery by 56.9775%, more than ESCT, ENM-LAC, and ZRDM-LFPM. The energy consumption decreased by 36.31% less value than the existing process.
“…Figures 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 , 18 , 19 , and 20 , determined for Routing Protocols Communication for Rushing Attack concerning the routing communication with route projection for instance of "Attacker detection automation," Modified AODV and Hybrid Random Late Detection (HRLD), "Swift Implicit Response Round Trip Time" mechanism, "Use Best Approximation" and "Past Interaction History" [ 77 , 80 , 83 ]. Fig.…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
confidence: 99%
“…Attacker detection automation of Bees Colony Optimization (ADABCP) was developed to overcome route optimization concerns on the MANET against rushing assaults. Route Organization and Route Reorganization are two steps of the ADABCP [ 22 , 83 ]. A significant data stream is evaluated while defining Route Organization, which gets values for numerous mobile node attributes.…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
confidence: 99%
“…The nodes create rushing assaults if they are dormant. Thus attackers appear in the routing path [ 80 , 83 ].…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
confidence: 99%
“…If either single customer is not maintaining the distance from others and the other is also not warned by an alarm. Since, among all individuals in the simulation, those who are not keeping the space for more than 30 s to the nearby person are in the waring stage for more than 30 s [ 83 ]. Hence the alarm gets continuous warning exposed with minimal probability distance.…”
Section: Routing Protocols Communication For Rushing Attacker Detectionmentioning
In MANET, routing plays a vital role in packet interaction and data transmission. It is always easy to manage the data transmission over the MANET because of uncentralized control on the MANET nodes. Since the efficient route on MANET controls the packets and does not simplify the route between the source and destination. Hence the maintenance of route interaction becomes a crucial process. Methods: It is critical to enhance the route and decrease the attacker to sustain successful data transfers via the MANET Network. MANET, on the other hand, permits route interaction with security threads. The four processing schema are proposed in this study work to retain the security safeguards against Routing Protocols. The Rushing Attacker has significantly influenced MANET packet-based data transfer, particularly node communication. The Attacker Detection Automation of Bee Colony Optimization (ADABCP) Method is proposed in this article. Results: Existing ESCT, ZRDM-LFPM, and ENM-LAC techniques were compared to the suggested outcome. Consequently, routing and data transfer have enhanced the proposed illustration (SIRT-ADABCP-HRLD). Compared to the recommended approach, the end-to-end latency, communication overhead, packet delivery ratio, network lifetime, and energy usage are all improved. Discussion: The performance evaluation results of SIRT–ADABCP-HRLD with existing methods in terms of low End to End Delay (ms) of 49.8361% compared to existing methods ESCT, ENM-LAC, and ZRDM-LFPM. In terms of low Communication Overhead, an 81.4462% decrease compared to existing methods. However, it improves packet delivery by 56.9775%, more than ESCT, ENM-LAC, and ZRDM-LFPM. The energy consumption decreased by 36.31% less value than the existing process.
“…From Eqs. (8) and 9, we obtain QQ T = WW T , and then Q and W have the same singular values, i.e., q = w . Additionally, the left singular vectors of both Q and W are equal, i.e., U q = U w .…”
Section: Lemma 1 (Equivalence Of Interleaving Svd Mergence)mentioning
In edge computing, for dimensionality reduction and core data extraction, both edge computing node (ECN) and cloud server may implement a high-order singular value decomposition (HOSVD) algorithm before data are passed to local computing models. However, at present, many edge computing systems regard the two HOSVD procedures as two independent parts, which leads to repeated calculations in the cloud. In this paper, we propose an aggregative HOSVD method by reusing intermediate results of subtensor HOSVD in ECNs to reduce the HOSVD computing cost of the merged tensor in the cloud server. First, two equivalence lemmas of singular value decomposition (SVD) are proven. Second, the SVD left mergence algorithm (SVDLM), hierarchical-SVDLM (H-SVDLM) algorithm and aggregative HOSVD (AHOSVD) algorithm are proposed to obtain the HOSVD result of the merged tensor by efficiently merging the unfolded matrix SVD results of the subtensors. Finally, the efficiency and accuracy between the HOSVD and the AHOSVD are compared, and the experimental results validate that the proposed AHOSVD algorithm improves efficiency compared with the HOSVD algorithm in circumstances with comparable accuracy results with the HOSVD algorithm. INDEX TERMS Tensor, high-order singular value decomposition, edge computing, Internet of Things.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
