Wireless multipath propagation causes different paths taken by the signal due to interacting objects present in the environment producing multipath components (MPCs). Cluster-based channel models characterize the wireless channel, and different approaches are utilized to cluster the MPCs. Data mining requires different techniques such as visualization to extract important information and find patterns and clusters in the data. A Graphical User Interface (GUI) is developed in this paper to aid the visualization and the manual clustering of MPCs using t-distributed Stochastic Neighborhood Embedding (t-SNE) and Uniform Manifold Approximation and Projection (UMAP). The clustering results of Simultaneous Clustering and Model Selection (SCAMS) are used in this paper. The datasets are embedded into low-dimensional projection and are manually re-clustered. The manual clustering was performed visually and interactively, which achieves a higher Jaccard membership index with a low value of 0.3368, a median of 0.4697, and a high value of 0.8884 for all the datasets.
{"title":"High-Accuracy Visualization-Based Grouping of MIMO Multipath Waves","authors":"Emmanuel T. Trinidad, Lawrence Materum","doi":"10.12720/jcm.18.1.68-75","DOIUrl":"https://doi.org/10.12720/jcm.18.1.68-75","url":null,"abstract":"Wireless multipath propagation causes different paths taken by the signal due to interacting objects present in the environment producing multipath components (MPCs). Cluster-based channel models characterize the wireless channel, and different approaches are utilized to cluster the MPCs. Data mining requires different techniques such as visualization to extract important information and find patterns and clusters in the data. A Graphical User Interface (GUI) is developed in this paper to aid the visualization and the manual clustering of MPCs using t-distributed Stochastic Neighborhood Embedding (t-SNE) and Uniform Manifold Approximation and Projection (UMAP). The clustering results of Simultaneous Clustering and Model Selection (SCAMS) are used in this paper. The datasets are embedded into low-dimensional projection and are manually re-clustered. The manual clustering was performed visually and interactively, which achieves a higher Jaccard membership index with a low value of 0.3368, a median of 0.4697, and a high value of 0.8884 for all the datasets.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"27 1","pages":"68-75"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83367245","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}
Pub Date : 2023-01-01DOI: 10.12720/jcm.18.3.140-146
A. Al-Ka'bi
Radio Frequency Identification technology aims at identifying and tracking objects labeled with tags. To achieve this goal, the need for antennas with certain characteristics and specifications becomes of great importance. In this research work, a proposed compact broadband meander antenna for Radio Frequency Identification Applications is presented. In the proposed model of the antenna, the inductive strips are bent to generate capacitive effects between them. To achieve an acceptable impedance matching at a frequency of 876MHz between the antenna and the receiving microchip of model “NXP UCODE G2XL”, shorting lines created along the antenna structure together with a T-shaped matching circuit are used. This proposed design of the antenna results in a compact size antenna (75×25×1.6mm3) with a resonance frequency that lies in theEuropean band of 867MHz, and it has an input impedance of Z = 16 - j156 Ω. The antenna is made from copper strip with a thickness of 35 μm and fabricated on an FR4 epoxy substrate with a thickness of 1.6 mm. This paper presents the proposed antenna simulation results performed in various situations and conditions. The antenna performance is investigated in terms of various aspects such as gain, radiation pattern, return loss, and input impedance.
{"title":"A Proposed Compact Broadband Meander Antenna for RFID Applications","authors":"A. Al-Ka'bi","doi":"10.12720/jcm.18.3.140-146","DOIUrl":"https://doi.org/10.12720/jcm.18.3.140-146","url":null,"abstract":"Radio Frequency Identification technology aims at identifying and tracking objects labeled with tags. To achieve this goal, the need for antennas with certain characteristics and specifications becomes of great importance. In this research work, a proposed compact broadband meander antenna for Radio Frequency Identification Applications is presented. In the proposed model of the antenna, the inductive strips are bent to generate capacitive effects between them. To achieve an acceptable impedance matching at a frequency of 876MHz between the antenna and the receiving microchip of model “NXP UCODE G2XL”, shorting lines created along the antenna structure together with a T-shaped matching circuit are used. This proposed design of the antenna results in a compact size antenna (75×25×1.6mm3) with a resonance frequency that lies in theEuropean band of 867MHz, and it has an input impedance of Z = 16 - j156 Ω. The antenna is made from copper strip with a thickness of 35 μm and fabricated on an FR4 epoxy substrate with a thickness of 1.6 mm. This paper presents the proposed antenna simulation results performed in various situations and conditions. The antenna performance is investigated in terms of various aspects such as gain, radiation pattern, return loss, and input impedance.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"61 1","pages":"140-146"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89957623","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}
Mohammed Abdulzahra Ahmed Al-Dulaimi, Husam A. Wahhab, Ahmed Abdulhussein Amer
Digital Signal Processing (DSP) in telecommunications is widely used for its outstanding performance. Hence, optimal results would be obtained with the sophisticated design and implementation of the digital Finite Impulse Response (FIR) filter. In this paper, the design and implementation of the FIR filter for processing the audio signal are obtained through the Field-Programmable Gate Array (FPGA) platform -Altera DE1 board. The design is divided into three primary blocks, which are the S2P Adapter block, Codec initialization block, as well as FIR filter block, which were then interfaced together; then, every block was compiled and simulated in order to obtain accurate results. The whole system was built to be functional, and finally, the frequency response was obtained. 100% significant accuracy and high quality are examined for implementing the filter in FPGA platform chip board programmed in (VHDL).
{"title":"Design and Implementation of Communication Digital FIR Filter for Audio Signals on the FPGA Platform","authors":"Mohammed Abdulzahra Ahmed Al-Dulaimi, Husam A. Wahhab, Ahmed Abdulhussein Amer","doi":"10.12720/jcm.18.2.89-96","DOIUrl":"https://doi.org/10.12720/jcm.18.2.89-96","url":null,"abstract":"Digital Signal Processing (DSP) in telecommunications is widely used for its outstanding performance. Hence, optimal results would be obtained with the sophisticated design and implementation of the digital Finite Impulse Response (FIR) filter. In this paper, the design and implementation of the FIR filter for processing the audio signal are obtained through the Field-Programmable Gate Array (FPGA) platform -Altera DE1 board. The design is divided into three primary blocks, which are the S2P Adapter block, Codec initialization block, as well as FIR filter block, which were then interfaced together; then, every block was compiled and simulated in order to obtain accurate results. The whole system was built to be functional, and finally, the frequency response was obtained. 100% significant accuracy and high quality are examined for implementing the filter in FPGA platform chip board programmed in (VHDL).","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"29 1","pages":"89-96"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85552030","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}
Pub Date : 2023-01-01DOI: 10.12720/jcm.18.2.135-139
Antipas T. Teologo, Lawrence Materum
Over the past decade, several studies have been conducted to discover a better-performing multipath clustering technique. Developing a multipath clustering technique with better accuracy performance is a big challenge considering the varying properties of the multipath propagations that change over time. In this study, several clustering techniques have been investigated and compared to the newly-developed technique for performance analysis. Using the Jaccard score as a metric for the accuracy of grouping correctly the wireless multipaths, the performance of the different clustering techniques has been determined and compared to the newly-developed technique. The proposed clustering algorithm shows improved performance in the indoor channel scenarios but needs further investigation in the semi-urban environment.
{"title":"Accuracy and Cluster Analysis of 5.3 GHz Indoor and 285 MHz Semi-urban MIMO LOS and NLOS Propagation Multipaths","authors":"Antipas T. Teologo, Lawrence Materum","doi":"10.12720/jcm.18.2.135-139","DOIUrl":"https://doi.org/10.12720/jcm.18.2.135-139","url":null,"abstract":"Over the past decade, several studies have been conducted to discover a better-performing multipath clustering technique. Developing a multipath clustering technique with better accuracy performance is a big challenge considering the varying properties of the multipath propagations that change over time. In this study, several clustering techniques have been investigated and compared to the newly-developed technique for performance analysis. Using the Jaccard score as a metric for the accuracy of grouping correctly the wireless multipaths, the performance of the different clustering techniques has been determined and compared to the newly-developed technique. The proposed clustering algorithm shows improved performance in the indoor channel scenarios but needs further investigation in the semi-urban environment.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"14 1","pages":"135-139"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88333346","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}
Pub Date : 2023-01-01DOI: 10.12720/jcm.18.2.97-108
S. Ahmad, Sadia Khalid
Compared to commonly used loss-based congestion control algorithms predominantly used in Transmission Control Protocol (TCP) implementations, congestion-based congestion control called BBR has shown much better performance in resource-abundant modern communication links. However, for a high influx of TCP sessions on the bottleneck switch, clusters in High-Performance Compute (HPC) nodes and data centers face resource constraints because of the immense workload during orchestration and relocation of workflows across the resource pool. This article discusses how to resolve this problem, commonly known as TCP incast, through efficient queue management of the bottleneck link and adding a shaper function in the standard BBR algorithm. We analyzed TCP incast issue for two efficient versions of congestion control i.e., BBR and CUBIC (named after the cubic function used instead of linear function), in a highly overloaded convergent switch of the cluster. It is noticeable that the queuing delay and buffer build-up are two essential parameters in causing TCP Incast. Hence, we used the M/G/1/B queuing model when multiple TCP sessions generate the network traffic and different buffer build-up scenarios are analyzed in the bottleneck node of HPC clusters. Based on the findings of our queuing analysis, we propose an incast recovery BBR algorithm that introduces additional controls like Incast shaping to deal with queue build-up during TCP incast. The effects of these modifications in BBR implementation are studied in terms of performance parameters like flow completion time, throughput, RTT variations, and fairness to other competing flows are significant compared with standard BBR and CUBIC implementations.
{"title":"Optimizing Data Transport Efficiency in Datacenters through Traffic Shaping of BBR Congestion Control","authors":"S. Ahmad, Sadia Khalid","doi":"10.12720/jcm.18.2.97-108","DOIUrl":"https://doi.org/10.12720/jcm.18.2.97-108","url":null,"abstract":"Compared to commonly used loss-based congestion control algorithms predominantly used in Transmission Control Protocol (TCP) implementations, congestion-based congestion control called BBR has shown much better performance in resource-abundant modern communication links. However, for a high influx of TCP sessions on the bottleneck switch, clusters in High-Performance Compute (HPC) nodes and data centers face resource constraints because of the immense workload during orchestration and relocation of workflows across the resource pool. This article discusses how to resolve this problem, commonly known as TCP incast, through efficient queue management of the bottleneck link and adding a shaper function in the standard BBR algorithm. We analyzed TCP incast issue for two efficient versions of congestion control i.e., BBR and CUBIC (named after the cubic function used instead of linear function), in a highly overloaded convergent switch of the cluster. It is noticeable that the queuing delay and buffer build-up are two essential parameters in causing TCP Incast. Hence, we used the M/G/1/B queuing model when multiple TCP sessions generate the network traffic and different buffer build-up scenarios are analyzed in the bottleneck node of HPC clusters. Based on the findings of our queuing analysis, we propose an incast recovery BBR algorithm that introduces additional controls like Incast shaping to deal with queue build-up during TCP incast. The effects of these modifications in BBR implementation are studied in terms of performance parameters like flow completion time, throughput, RTT variations, and fairness to other competing flows are significant compared with standard BBR and CUBIC implementations.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"11 1","pages":"97-108"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87212112","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}
Pub Date : 2023-01-01DOI: 10.12720/jcm.18.3.198-206
M. Asvial, Awangga Febian Surya Admaja, Muh Asnoer Laagu
A wireless sensor network (WSN) is a group of sensor nodes that take data with specific measurement parameters and then send the data wirelessly to a central node or server for data processing. WSN nodes are designed to be compact; therefore, the energy of sensor nodes usually depends on the integrated battery. The sensor node must work as efficiently as possible so that energy use can be more efficient and WSN life can be prolonged. The longer the lifespan of the WSN, the higher the throughput. One of the many ways to extend the life of the WSN is to use the concept of grouping nodes or the so-called cluster method. This study proposes the The Division Non-Cooperative Game LEACH (DivNCGL) routing method, a modified method based on Low Energy Adaptive Clustering Hierarchy (LEACH) by distributing cluster heads (CHs). The distribution process is performed by dividing the distribution area of the nodes into subregions. The subregion division process uses the probability value obtained by the non-cooperative game method based on the remaining active nodes, the total remaining energy, and the energy required for transmission. The simulation results, the lifespan of WSN using the DivNCGL method increases up to 30% with stable energy dissipation compared to the LEACH protocol. The increasing lifespan of the WSN also increases the amount of data transmitted, thereby increasing the received throughput. Received data increases up to 70% using the DivNCGL method compared to LEACH.
{"title":"Non-cooperative Game Leach for Cluster Distribution Routing Method on Wireless Sensor Network (WSN)","authors":"M. Asvial, Awangga Febian Surya Admaja, Muh Asnoer Laagu","doi":"10.12720/jcm.18.3.198-206","DOIUrl":"https://doi.org/10.12720/jcm.18.3.198-206","url":null,"abstract":"A wireless sensor network (WSN) is a group of sensor nodes that take data with specific measurement parameters and then send the data wirelessly to a central node or server for data processing. WSN nodes are designed to be compact; therefore, the energy of sensor nodes usually depends on the integrated battery. The sensor node must work as efficiently as possible so that energy use can be more efficient and WSN life can be prolonged. The longer the lifespan of the WSN, the higher the throughput. One of the many ways to extend the life of the WSN is to use the concept of grouping nodes or the so-called cluster method. This study proposes the The Division Non-Cooperative Game LEACH (DivNCGL) routing method, a modified method based on Low Energy Adaptive Clustering Hierarchy (LEACH) by distributing cluster heads (CHs). The distribution process is performed by dividing the distribution area of the nodes into subregions. The subregion division process uses the probability value obtained by the non-cooperative game method based on the remaining active nodes, the total remaining energy, and the energy required for transmission. The simulation results, the lifespan of WSN using the DivNCGL method increases up to 30% with stable energy dissipation compared to the LEACH protocol. The increasing lifespan of the WSN also increases the amount of data transmitted, thereby increasing the received throughput. Received data increases up to 70% using the DivNCGL method compared to LEACH.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"20 1","pages":"198-206"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77137780","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}
Pub Date : 2023-01-01DOI: 10.12720/jcm.18.3.172-179
Dr. Pushpender Sarao
Wireless networks are the networks in which data communication is done through the wireless channels and wireless nodes. In such type of the networks, cooperation of the all nodes is required. Due to which, chances of security attacks is possible and network performance and security is badly affected. Black hole attack is a security attack comes under the active, internal as well as external attacks. In black hole attack, malicious node presents a suitable, shortest and low cost path. If the above path is selected for data transmission, malicious node drops the received packets and as a result performance of the network is degraded. In this paper, impact of Random Direction (RD) and Reference Point Group Mobility (RPGM) models have been analyzed for wireless mesh network in the presence of multiple black hole attacks. By varying the number of network connections and node density, (Ad hoc on demand distance vector) AODV routing protocol is evaluated. Normalized routing load, average end to end delay, average throughput, and total number of packets received are considered as performance metrics. Bonn-motion tool has been used to create the scenario of mobility models. In the presence of black hole attack, and under RPGM mobility model, AODV routing protocol presents better results in respect of average throughput, normalized routing load. Simulation work has been carried out on network simulator version NS-2.35.
无线网络是通过无线信道和无线节点进行数据通信的网络。在这种类型的网络中，需要所有节点的合作。因此，有可能受到安全攻击，严重影响网络性能和安全性。黑洞攻击是一种安全攻击下的主动攻击，既有内部攻击，也有外部攻击。在黑洞攻击中，恶意节点提供了一条合适的、最短的、低代价的路径。如果选择上述路径进行数据传输，恶意节点会丢弃接收到的数据包，导致网络性能下降。本文分析了随机方向(RD)和参考点群移动(RPGM)模型对存在多重黑洞攻击的无线网状网络的影响。通过改变网络连接数和节点密度，评估(Ad hoc on demand distance vector) AODV路由协议。标准化路由负载、平均端到端延迟、平均吞吐量和接收的数据包总数被视为性能指标。波恩运动工具已被用于创建移动模型的场景。在黑洞攻击存在的情况下，在RPGM迁移模型下，AODV路由协议在平均吞吐量、归一化路由负载方面表现出较好的性能。在NS-2.35网络模拟器上进行了仿真工作。
{"title":"Evaluation of Traffic Models under Multiple Black hole Attack in Wireless Mesh Network","authors":"Dr. Pushpender Sarao","doi":"10.12720/jcm.18.3.172-179","DOIUrl":"https://doi.org/10.12720/jcm.18.3.172-179","url":null,"abstract":"Wireless networks are the networks in which data communication is done through the wireless channels and wireless nodes. In such type of the networks, cooperation of the all nodes is required. Due to which, chances of security attacks is possible and network performance and security is badly affected. Black hole attack is a security attack comes under the active, internal as well as external attacks. In black hole attack, malicious node presents a suitable, shortest and low cost path. If the above path is selected for data transmission, malicious node drops the received packets and as a result performance of the network is degraded. In this paper, impact of Random Direction (RD) and Reference Point Group Mobility (RPGM) models have been analyzed for wireless mesh network in the presence of multiple black hole attacks. By varying the number of network connections and node density, (Ad hoc on demand distance vector) AODV routing protocol is evaluated. Normalized routing load, average end to end delay, average throughput, and total number of packets received are considered as performance metrics. Bonn-motion tool has been used to create the scenario of mobility models. In the presence of black hole attack, and under RPGM mobility model, AODV routing protocol presents better results in respect of average throughput, normalized routing load. Simulation work has been carried out on network simulator version NS-2.35.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"10 2 1","pages":"172-179"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78316760","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}
Pub Date : 2023-01-01DOI: 10.12720/jcm.18.2.109-115
R. Negara, Ratna Mayasari, Nana R. Syambas
Indonesia is an archipelagic country separated by the sea, so it has unique characteristics. Building a telecommunications network that optimally connects Indonesia's islands is essential. Currently, telecommunications networks in Indonesia are connected using the Palapa Ring Indonesia network. Several adjacent islands must specify the closest point to choose a neighbouring route. This paper uses a travelling salesman problem (TSP) that uses the Self-Organizing Map (SOM) and Ant-Colony Optimization (ACO) algorithms to determine the shortest route and optimal computation time. Paper modification has several parameters: number of iterations, neuron size, and space. The measurement results show that SOM is better at measuring the shortest route length and computational time than ACO. By setting the number of iterations below 500 and the M value as much as the number of neurons, the route obtained by SOM will be shorter with a shorter time.
印度尼西亚是一个被海隔开的群岛国家，因此具有独特的特点。建立一个最佳连接印尼岛屿的电信网络至关重要。目前，印度尼西亚的电信网络是使用Palapa Ring Indonesia网络连接的。几个相邻的岛屿必须指定最近的点来选择相邻的路线。本文采用自组织映射(SOM)和蚁群优化(ACO)算法求解旅行商问题(TSP)来确定最短路线和最优计算时间。论文修改有几个参数:迭代次数、神经元大小和空间。测量结果表明，SOM在测量最短路径长度和计算时间方面优于蚁群算法。将迭代次数设置为500次以下，M值与神经元数量相同，SOM获得的路由会随着时间的缩短而缩短。
{"title":"Performance Comparison of SOM and ACO for Travelling Salesman Problem-Case Study on the Indonesia Palapa Ring Network","authors":"R. Negara, Ratna Mayasari, Nana R. Syambas","doi":"10.12720/jcm.18.2.109-115","DOIUrl":"https://doi.org/10.12720/jcm.18.2.109-115","url":null,"abstract":"Indonesia is an archipelagic country separated by the sea, so it has unique characteristics. Building a telecommunications network that optimally connects Indonesia's islands is essential. Currently, telecommunications networks in Indonesia are connected using the Palapa Ring Indonesia network. Several adjacent islands must specify the closest point to choose a neighbouring route. This paper uses a travelling salesman problem (TSP) that uses the Self-Organizing Map (SOM) and Ant-Colony Optimization (ACO) algorithms to determine the shortest route and optimal computation time. Paper modification has several parameters: number of iterations, neuron size, and space. The measurement results show that SOM is better at measuring the shortest route length and computational time than ACO. By setting the number of iterations below 500 and the M value as much as the number of neurons, the route obtained by SOM will be shorter with a shorter time.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"31 1","pages":"109-115"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90913755","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}
Ntebatseng Mahlake, Topside E. Mathonsi, D. D. Plessis, Tonderai Muchenje
The Internet of Things (IoT) is an anticipated future technology that promises to connect a massive number of devices over the internet. Wireless Sensor Networks (WSNs) are regarded as one of the most essential subnetworks of the IoT. Sensor networks are being utilized by IoT to gather, monitor, and send sensitive data across wireless networks. Because the information transferred through WSNs is easily exposed to cyber-attacks, data security is critical. In WSNs, the attacker's adversary aims are to deteriorate and halt the network's effective use, as well as to interrupt network services, rendering them unreachable to the users or providing a user with false feedback. Since the users don’t have control over their data transmitted on the wireless medium or stored in the middleware, anyone with internet access can access it. This puts data confidentiality, authenticity, and integrity at risk since users with unauthorized access can easily access, alter, and manipulate data in transit. The proposed Lightweight Security Algorithm (LSA) is a hybrid algorithm created by combining the Security Protocol for Sensor Networks (SPINS) with the Secure IoT (SIT) encryption technique to improve WSN’s data security while lowering the threshold of attacks and minimize power consumption in WSNs without impacting network performance. Furthermore, the proposed LSA reduces the key generation time by 102mS thus improving the security by 99%. During data transmission, the power consumption is reduced by an average of 411.2uJ and the Packet Drop Ratio (PDR) is between 90 and 99% when comparing it with SPN and Feistel techniques.
物联网(IoT)是一项有望通过互联网连接大量设备的未来技术。无线传感器网络(wsn)被认为是物联网中最重要的子网之一。物联网正利用传感器网络在无线网络上收集、监控和发送敏感数据。由于通过无线传感器网络传输的信息容易受到网络攻击，因此数据安全至关重要。在无线传感器网络中，攻击者的攻击目标是破坏和停止网络的有效使用，以及中断网络服务，使用户无法访问网络或向用户提供错误的反馈。由于用户无法控制他们在无线媒体上传输的数据或存储在中间件中的数据，任何有互联网接入的人都可以访问它。这将使数据的机密性、真实性和完整性面临风险，因为未经授权访问的用户可以轻松访问、更改和操纵传输中的数据。本文提出的轻量级安全算法(LSA)是一种将传感器网络安全协议(SPINS)与安全物联网(SIT)加密技术相结合的混合算法，旨在提高WSN的数据安全性，同时降低攻击阈值，并在不影响网络性能的情况下将WSN的功耗降至最低。此外，该LSA的密钥生成时间缩短了102mS，安全性提高了99%。在数据传输过程中，与SPN和Feistel技术相比，平均降低功耗411.2uJ, PDR (Packet Drop Ratio)在90% ~ 99%之间。
{"title":"A Lightweight Encryption Algorithm to Enhance Wireless Sensor Network Security on the Internet of Things","authors":"Ntebatseng Mahlake, Topside E. Mathonsi, D. D. Plessis, Tonderai Muchenje","doi":"10.12720/jcm.18.1.47-57","DOIUrl":"https://doi.org/10.12720/jcm.18.1.47-57","url":null,"abstract":"The Internet of Things (IoT) is an anticipated future technology that promises to connect a massive number of devices over the internet. Wireless Sensor Networks (WSNs) are regarded as one of the most essential subnetworks of the IoT. Sensor networks are being utilized by IoT to gather, monitor, and send sensitive data across wireless networks. Because the information transferred through WSNs is easily exposed to cyber-attacks, data security is critical. In WSNs, the attacker's adversary aims are to deteriorate and halt the network's effective use, as well as to interrupt network services, rendering them unreachable to the users or providing a user with false feedback. Since the users don’t have control over their data transmitted on the wireless medium or stored in the middleware, anyone with internet access can access it. This puts data confidentiality, authenticity, and integrity at risk since users with unauthorized access can easily access, alter, and manipulate data in transit. The proposed Lightweight Security Algorithm (LSA) is a hybrid algorithm created by combining the Security Protocol for Sensor Networks (SPINS) with the Secure IoT (SIT) encryption technique to improve WSN’s data security while lowering the threshold of attacks and minimize power consumption in WSNs without impacting network performance. Furthermore, the proposed LSA reduces the key generation time by 102mS thus improving the security by 99%. During data transmission, the power consumption is reduced by an average of 411.2uJ and the Packet Drop Ratio (PDR) is between 90 and 99% when comparing it with SPN and Feistel techniques.","PeriodicalId":14832,"journal":{"name":"J. Comput. Mediat. Commun.","volume":"262 1","pages":"47-57"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75770730","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
扫码关注我们
求助内容：
应助结果提醒方式：