Intensive continuing research has been noticed among scholars in the literature with a particular appreciable interest in developing new enhanced variants for the long-standing Random Early Detection (RED) algorithm. Contemporary trends shows that researchers continue to follow a research line thereby exchanging the linear curve needed in RED with nonlinear curves. Several reports have shown that RED’s sole linear function is insufficiently powered for managing rising degrees of traffic congestion in the network. In this paper, Amended Dropping – Random Early Detection (AD-RED), a revised version of RED is presented. AD-RED algorithm consists in combining two nonlinear packet dropping functions: quadratic plus exponential. What’s more, results from ns-3 simulator shows that AD-RED reasonably stabilized and minified the (average) queue size; and obtained a whittled down end-to-end delay when compared with RED itself and another variant of RED. Hence, AD-RED is offered as a fully sufficient replacement for RED’s algorithm implementation in routers.
学者们对长期存在的随机早期检测(RED)算法开发新的增强变体特别感兴趣，已经注意到深入的持续研究。当代趋势表明，研究人员继续遵循一条研究路线，从而将RED所需的线性曲线与非线性曲线交换。几份报告表明，RED唯一的线性功能不足以管理网络中日益严重的交通拥堵。本文提出了一种改进版的随机早期检测(drop - Random Early Detection, AD-RED)。AD-RED算法是将两个非线性丢包函数:二次加指数函数组合而成。此外，ns-3模拟器的结果表明，AD-RED合理地稳定并减小了(平均)队列大小;与RED本身和RED的另一个变体相比，得到了一个精简的端到端延迟。因此，AD-RED在路由器中完全可以替代RED的算法实现。
{"title":"AD-RED: A new variant of random early detection AQM algorithm","authors":"Samuel Hassan","doi":"10.3233/jhs-222055","DOIUrl":"https://doi.org/10.3233/jhs-222055","url":null,"abstract":"Intensive continuing research has been noticed among scholars in the literature with a particular appreciable interest in developing new enhanced variants for the long-standing Random Early Detection (RED) algorithm. Contemporary trends shows that researchers continue to follow a research line thereby exchanging the linear curve needed in RED with nonlinear curves. Several reports have shown that RED’s sole linear function is insufficiently powered for managing rising degrees of traffic congestion in the network. In this paper, Amended Dropping – Random Early Detection (AD-RED), a revised version of RED is presented. AD-RED algorithm consists in combining two nonlinear packet dropping functions: quadratic plus exponential. What’s more, results from ns-3 simulator shows that AD-RED reasonably stabilized and minified the (average) queue size; and obtained a whittled down end-to-end delay when compared with RED itself and another variant of RED. Hence, AD-RED is offered as a fully sufficient replacement for RED’s algorithm implementation in routers.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136293236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cong Li, Haiyang Wang, Weipeng Liang, Yunhao Li, Hongyang Yan, Teng Huang, Bo Li, Jianwei He
With the development of the space industry, LEO simulation platforms are increasingly important. Prior work mainly focused on the dynamics of constellation topology, routing algorithms against the topological motion, and the behavior of LEO constellation networks, but neglected real-time and completeness properties. In our work, we design a real-time and complete network simulation framework, named LEOCN, that is more meaningful and detailed for researchers than previous work on LEO satellite constellation simulations. LEOCN is supported by Linux System, which makes the framework more realistic and relieves the computational burden. Meanwhile, LEOCN deeply considers topology and routing algorithms, visualization, satellite mobility, communication protocols, and network traffic problems. On LEOCN, we can deploy routing algorithm experiments via SDN. We evaluate the performance of LEOCN in large-scale constellation scenarios, and the results demonstrate the superiority of the real-time and complete network simulation framework.
{"title":"LEOCN: Real-time and complete network simulation framework for LEO constellation networks1","authors":"Cong Li, Haiyang Wang, Weipeng Liang, Yunhao Li, Hongyang Yan, Teng Huang, Bo Li, Jianwei He","doi":"10.3233/jhs-222061","DOIUrl":"https://doi.org/10.3233/jhs-222061","url":null,"abstract":"With the development of the space industry, LEO simulation platforms are increasingly important. Prior work mainly focused on the dynamics of constellation topology, routing algorithms against the topological motion, and the behavior of LEO constellation networks, but neglected real-time and completeness properties. In our work, we design a real-time and complete network simulation framework, named LEOCN, that is more meaningful and detailed for researchers than previous work on LEO satellite constellation simulations. LEOCN is supported by Linux System, which makes the framework more realistic and relieves the computational burden. Meanwhile, LEOCN deeply considers topology and routing algorithms, visualization, satellite mobility, communication protocols, and network traffic problems. On LEOCN, we can deploy routing algorithm experiments via SDN. We evaluate the performance of LEOCN in large-scale constellation scenarios, and the results demonstrate the superiority of the real-time and complete network simulation framework.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135194375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The methods of network attacks are becoming more and more diverse In high-speed networks, and protecting private data is a key issue for users’ security. Proxy blind signature technology combines proxy and blind signature technology to achieve signature transitivity and message confidentiality. However, current signature schemes will not be secure in quantum environments. Meanwhile, the certificate storage of the existing scheme is relatively complicated. Therefore, to avoid the need for certificates and resist quantum attacks, this paper proposes an anti-quantum identity-based proxy blind signature (ID-Proxy-BS) scheme on lattice. This ID-Proxy-BS scheme improves the efficiency of signature through Gaussian distribution and sampling techniques. Security analysis shows that the scheme satisfies correctness, efficiency, blindness, and unforgeability.
{"title":"Identity-based proxy blind signature scheme on lattice in high-speed network environment","authors":"Mengjiao Yang, Dongmei Ke, Fengyin Li","doi":"10.3233/jhs-222021","DOIUrl":"https://doi.org/10.3233/jhs-222021","url":null,"abstract":"The methods of network attacks are becoming more and more diverse In high-speed networks, and protecting private data is a key issue for users’ security. Proxy blind signature technology combines proxy and blind signature technology to achieve signature transitivity and message confidentiality. However, current signature schemes will not be secure in quantum environments. Meanwhile, the certificate storage of the existing scheme is relatively complicated. Therefore, to avoid the need for certificates and resist quantum attacks, this paper proposes an anti-quantum identity-based proxy blind signature (ID-Proxy-BS) scheme on lattice. This ID-Proxy-BS scheme improves the efficiency of signature through Gaussian distribution and sampling techniques. Security analysis shows that the scheme satisfies correctness, efficiency, blindness, and unforgeability.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135785005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An intrusion detection method using rough-fuzzy set and parallel quantum genetic algorithm (RFS-QGAID) is proposed in this paper. The RFS-QGAID is applied to solve the serious problems of determining the optimal antibodies subsets used to detect an anomaly. To obtain a simplified antibodies collection for high dimensional Log data sets, RFS is applied to delete the redundant antibody features and obtain the optimal antibodies features combination. Then, the optimal attitudes are entered into the QGA classifier for learning and training in the following stage. At last, the detected Log antigens are fed into RFS-QGAID, and we can classify the intrusion types. With RFS-QGAID, we give the simulations, the results on real Log data sets show that: the higher detection accuracy of RFS-QGAID is higher detection accuracy, but the false negative rate is lower for small samples sets, the adaptive performance is higher than other detection algorithms.
{"title":"Intrusion detection using rough-fuzzy set and parallel quantum genetic algorithm","authors":"Zhang Ling, Gui Qi, Huang Min","doi":"10.3233/jhs-222070","DOIUrl":"https://doi.org/10.3233/jhs-222070","url":null,"abstract":"An intrusion detection method using rough-fuzzy set and parallel quantum genetic algorithm (RFS-QGAID) is proposed in this paper. The RFS-QGAID is applied to solve the serious problems of determining the optimal antibodies subsets used to detect an anomaly. To obtain a simplified antibodies collection for high dimensional Log data sets, RFS is applied to delete the redundant antibody features and obtain the optimal antibodies features combination. Then, the optimal attitudes are entered into the QGA classifier for learning and training in the following stage. At last, the detected Log antigens are fed into RFS-QGAID, and we can classify the intrusion types. With RFS-QGAID, we give the simulations, the results on real Log data sets show that: the higher detection accuracy of RFS-QGAID is higher detection accuracy, but the false negative rate is lower for small samples sets, the adaptive performance is higher than other detection algorithms.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49660622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Radha, G. Bala, Nalluri Prophess Rajkumar, G. Indumathi, P. Nagabushanam
Wireless Sensor Networks (WSN) play a major role in the wide variety of applications like underground pipeline and leaks monitoring, temperature distribution monitoring in industrial cyber systems, military, forest life monitoring, and environmental and geographical monitoring. Sensors are widely used in these different applications. The number of sensors and the application concerned mainly decides the energy consumption, network lifetime. In this process relay nodes may help the sensors as backbone to connect with sink node or base stations. In this paper, we introduce a new approach for relay node selection in WSN to minimize the energy consumption of the network. It uses channel aware relay selection technique using game theory optimization and act as a virtual backbone in connecting to the base station. However, the relay nodes are varied to check the optimal number of relays required for the small, medium and large number of nodes deployed in the network. Simulations are carried out using Network Simulator NS-2.35 and network is analyzed in wide variety of scenarios. Results show that the proposed relay node selection algorithm reduces energy consumption, improves lifetime, throughput of the network.
{"title":"Optimal relay nodes placement with game theory optimization for Wireless Sensor Networks","authors":"S. Radha, G. Bala, Nalluri Prophess Rajkumar, G. Indumathi, P. Nagabushanam","doi":"10.3233/jhs-222038","DOIUrl":"https://doi.org/10.3233/jhs-222038","url":null,"abstract":"Wireless Sensor Networks (WSN) play a major role in the wide variety of applications like underground pipeline and leaks monitoring, temperature distribution monitoring in industrial cyber systems, military, forest life monitoring, and environmental and geographical monitoring. Sensors are widely used in these different applications. The number of sensors and the application concerned mainly decides the energy consumption, network lifetime. In this process relay nodes may help the sensors as backbone to connect with sink node or base stations. In this paper, we introduce a new approach for relay node selection in WSN to minimize the energy consumption of the network. It uses channel aware relay selection technique using game theory optimization and act as a virtual backbone in connecting to the base station. However, the relay nodes are varied to check the optimal number of relays required for the small, medium and large number of nodes deployed in the network. Simulations are carried out using Network Simulator NS-2.35 and network is analyzed in wide variety of scenarios. Results show that the proposed relay node selection algorithm reduces energy consumption, improves lifetime, throughput of the network.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43501116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Weiqing Sun, Shengxin Wang, Shen Wei, Pengfei Cao, Yan Zhao, Lechao Xi, Xinlu Liu, Lihua Wang
Blockchain has the advantages of tamper proof, high reliability and traceability, so it can better support the agricultural product traceability system. However, the agricultural product supply chain has the characteristics of long chain and decentralized production, which makes the application of the combination of blockchain technology and agricultural product traceability have many nodes, large system overhead and other problems. In order to solve the above problems, this paper proposes a Practical Byzantine Fault Tolerance (PBFT) consensus mechanism based on trust value evaluation, and uses this optimization algorithm to propose an architecture model to meet the demand for trusted traceability of agricultural product supply chain, so as to realize the distributed storage and security protection of supply chain data. In order to ensure the effective operation of the blockchain system, this paper studies the consensus mechanism in the blockchain network, designs a trust value evaluation model to calculate the trust value of nodes, and selects trusted nodes to join the consensus group based on the trust value, which ensures the credibility of the consensus nodes. At the same time, the consistency protocol is optimized to reduce the communication overhead in the consensus process. The experimental results show that the consensus mechanism improved in this paper has certain advantages in communication overhead, transaction delay and throughput. Compared with the existing storage model, the model described in this paper has higher security and throughput efficiency, effectively ensures the reliable traceability of data, and can be better applied to the traceability scenario of agricultural product supply chain.
{"title":"An improved PBFT consensus mechanism with trust value evaluation application in the agricultural product trusted traceability system","authors":"Weiqing Sun, Shengxin Wang, Shen Wei, Pengfei Cao, Yan Zhao, Lechao Xi, Xinlu Liu, Lihua Wang","doi":"10.3233/jhs-222077","DOIUrl":"https://doi.org/10.3233/jhs-222077","url":null,"abstract":"Blockchain has the advantages of tamper proof, high reliability and traceability, so it can better support the agricultural product traceability system. However, the agricultural product supply chain has the characteristics of long chain and decentralized production, which makes the application of the combination of blockchain technology and agricultural product traceability have many nodes, large system overhead and other problems. In order to solve the above problems, this paper proposes a Practical Byzantine Fault Tolerance (PBFT) consensus mechanism based on trust value evaluation, and uses this optimization algorithm to propose an architecture model to meet the demand for trusted traceability of agricultural product supply chain, so as to realize the distributed storage and security protection of supply chain data. In order to ensure the effective operation of the blockchain system, this paper studies the consensus mechanism in the blockchain network, designs a trust value evaluation model to calculate the trust value of nodes, and selects trusted nodes to join the consensus group based on the trust value, which ensures the credibility of the consensus nodes. At the same time, the consistency protocol is optimized to reduce the communication overhead in the consensus process. The experimental results show that the consensus mechanism improved in this paper has certain advantages in communication overhead, transaction delay and throughput. Compared with the existing storage model, the model described in this paper has higher security and throughput efficiency, effectively ensures the reliable traceability of data, and can be better applied to the traceability scenario of agricultural product supply chain.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45946779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ensuring the security of transmitted content is an important task in network communication. Signcryption technology combines signature and encryption operations in a single step to achieve message authentication and confidentiality. In practical applications, users are usually in different cryptographic systems, the ordinary signcryption technology cannot realize communication between two different cryptographic systems. And the ciphertext structure of the existing signcryption schemes is relatively complex, signcryption is not efficient. Therefore, in order to solve the problem of efficient communication between different cryptosystems and ensure quantum security, this paper proposes a lattice-based efficient heterogeneous signcryption scheme for secure network communications. This signcryption scheme accomplishes signcryption through matrix operations and hash functions, which avoids complex signcryption structures, efficiently realizes bidirectional message communication between identity-based cryptosystems and certificateless cryptosystems.
{"title":"A lattice-based efficient heterogeneous signcryption scheme for secure network communications","authors":"Siqi Yu, Mengxue Shang, Fengyin Li","doi":"10.3233/jhs-222020","DOIUrl":"https://doi.org/10.3233/jhs-222020","url":null,"abstract":"Ensuring the security of transmitted content is an important task in network communication. Signcryption technology combines signature and encryption operations in a single step to achieve message authentication and confidentiality. In practical applications, users are usually in different cryptographic systems, the ordinary signcryption technology cannot realize communication between two different cryptographic systems. And the ciphertext structure of the existing signcryption schemes is relatively complex, signcryption is not efficient. Therefore, in order to solve the problem of efficient communication between different cryptosystems and ensure quantum security, this paper proposes a lattice-based efficient heterogeneous signcryption scheme for secure network communications. This signcryption scheme accomplishes signcryption through matrix operations and hash functions, which avoids complex signcryption structures, efficiently realizes bidirectional message communication between identity-based cryptosystems and certificateless cryptosystems.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"1 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42270931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. R. Krishna, V. Mahalakshmi, Gopala Krishna Murthy Nookala
Recently, deep learning has been used in enormous successful applications, specifically considering medical applications. Especially, a huge number of data is captured through the Internet of Things (IoT) based devices related to healthcare systems. Moreover, the given captured data are real-time and unstructured. However, the existing approaches failed to reach a better accuracy rate, and the processing time needed to be lower. This work considers the medical database for accessing the patient’s record to determine the outliers over the dataset. Based on this successful analysis, a novel approach is proposed where some feasible and robust features are extracted to acquire the emotional variations for various ways of expression. Here, a novel dense-Convolutional Neural Network (CNN) with ResNet (CNN-RN) extracts features from patients’, while for establishing visual modality, deep residual network layers are used. The significance of feature extraction is less sensitive during outlier prediction while modeling the context. To handle these issues, this dense network model is used for training the network in an end-to-end manner by correlating the significance of CNN and RN of every stream and outperforming the overall approach. Here, MATLAB 2020b is used for simulation purposes, and the model outperforms various prevailing methods for consistent prediction. Some performance metrics include detection accuracy, F1-score, recall, MCC, p-value, etc. Based on this evaluation, the experimental results attained are superior to other approaches.
{"title":"Modelling a stacked dense network model for outlier prediction over medical-based heart prediction data","authors":"B. R. Krishna, V. Mahalakshmi, Gopala Krishna Murthy Nookala","doi":"10.3233/jhs-222079","DOIUrl":"https://doi.org/10.3233/jhs-222079","url":null,"abstract":"Recently, deep learning has been used in enormous successful applications, specifically considering medical applications. Especially, a huge number of data is captured through the Internet of Things (IoT) based devices related to healthcare systems. Moreover, the given captured data are real-time and unstructured. However, the existing approaches failed to reach a better accuracy rate, and the processing time needed to be lower. This work considers the medical database for accessing the patient’s record to determine the outliers over the dataset. Based on this successful analysis, a novel approach is proposed where some feasible and robust features are extracted to acquire the emotional variations for various ways of expression. Here, a novel dense-Convolutional Neural Network (CNN) with ResNet (CNN-RN) extracts features from patients’, while for establishing visual modality, deep residual network layers are used. The significance of feature extraction is less sensitive during outlier prediction while modeling the context. To handle these issues, this dense network model is used for training the network in an end-to-end manner by correlating the significance of CNN and RN of every stream and outperforming the overall approach. Here, MATLAB 2020b is used for simulation purposes, and the model outperforms various prevailing methods for consistent prediction. Some performance metrics include detection accuracy, F1-score, recall, MCC, p-value, etc. Based on this evaluation, the experimental results attained are superior to other approaches.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44937314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, an improved routing protocol for multipath network load balancing is proposed for defects in the traditional AOMDV (Ad hoc On-demand Multipath Distance Vector) protocol. This research work analyzes problems in traditional routing protocols and estimates the available path load according to network transmission in Wireless Mesh Networks (WMN). Moreover, we design a load distribution scheme according to a given load and improve multi-path load balancing by using the MCMR method. We also control path discovery and the number of paths while also establishing routing paths and probability balancing. Lastly, improvements are made to the AOMDV protocol and efficient data transmission is acheived. The performance results of the modified routing protocol show that the designed protocol can improve successful delivery rate and prolong network survival time.
针对传统AOMDV (Ad hoc On-demand multipath Distance Vector)协议存在的缺陷，提出了一种改进的多径网络负载均衡路由协议。本研究分析了传统路由协议存在的问题，并根据无线网状网络(WMN)的网络传输情况估计了可用路径负载。此外，根据给定的负载设计了负载分配方案，并利用MCMR方法改进了多路径负载均衡。我们还控制路径发现和路径数量，同时建立路由路径和概率平衡。最后，对AOMDV协议进行了改进，实现了高效的数据传输。改进后的路由协议性能结果表明，改进后的路由协议能够提高成功投递率，延长网络生存时间。
{"title":"Improved design of load balancing for multipath routing protocol","authors":"Daqiang Liao, Du Zou, Gautam Srivastava","doi":"10.3233/jhs-222063","DOIUrl":"https://doi.org/10.3233/jhs-222063","url":null,"abstract":"In this paper, an improved routing protocol for multipath network load balancing is proposed for defects in the traditional AOMDV (Ad hoc On-demand Multipath Distance Vector) protocol. This research work analyzes problems in traditional routing protocols and estimates the available path load according to network transmission in Wireless Mesh Networks (WMN). Moreover, we design a load distribution scheme according to a given load and improve multi-path load balancing by using the MCMR method. We also control path discovery and the number of paths while also establishing routing paths and probability balancing. Lastly, improvements are made to the AOMDV protocol and efficient data transmission is acheived. The performance results of the modified routing protocol show that the designed protocol can improve successful delivery rate and prolong network survival time.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45647754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Monire Norouzi, Zeynep Gürkas Aydin, Sefer Ergen, Mehmet Serif Bakir
Today, with the fast growth of emerging technologies and applying numerous advantages of 5G communications, there is a critical gap between the supporting security of data transmission and resource management of Software Defined Networks (SDN). To provide a secure communication perspective for Internet of Things (IoT) devices and smart applications, network slicing in resource management is currently an important issue and is widely studied for the SDN. Due to the importance of security-aware resource management in several aspects of the SDN, this research aims to represent a new comprehensive review of existing technical classification and deep-detailed categorization of resource management approaches for SDN communications in the IoT environments. Based on each category, a technical taxonomy is presented to show a variety of security-aware platforms that include resource allocation, service composition, task scheduling, and service offloading in the IoT environments. According to the main state-of-the-art discussed comprehensive technical review, some important evaluation factors, main methodologies, advantages, and disadvantages of each case study are elaborated. Finally, some important new research directions and open challenges are presented for future scientific efforts.
{"title":"Security-aware resource management approaches in software defined networks: Comprehensive analysis, opportunities and challenges","authors":"Monire Norouzi, Zeynep Gürkas Aydin, Sefer Ergen, Mehmet Serif Bakir","doi":"10.3233/jhs-230004","DOIUrl":"https://doi.org/10.3233/jhs-230004","url":null,"abstract":"Today, with the fast growth of emerging technologies and applying numerous advantages of 5G communications, there is a critical gap between the supporting security of data transmission and resource management of Software Defined Networks (SDN). To provide a secure communication perspective for Internet of Things (IoT) devices and smart applications, network slicing in resource management is currently an important issue and is widely studied for the SDN. Due to the importance of security-aware resource management in several aspects of the SDN, this research aims to represent a new comprehensive review of existing technical classification and deep-detailed categorization of resource management approaches for SDN communications in the IoT environments. Based on each category, a technical taxonomy is presented to show a variety of security-aware platforms that include resource allocation, service composition, task scheduling, and service offloading in the IoT environments. According to the main state-of-the-art discussed comprehensive technical review, some important evaluation factors, main methodologies, advantages, and disadvantages of each case study are elaborated. Finally, some important new research directions and open challenges are presented for future scientific efforts.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"19 1","pages":"169-181"},"PeriodicalIF":0.9,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88995752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：