To see the other types of publications on this topic, follow the link: Throughput Evaluation Algorithms.
Journal articles on the topic 'Throughput Evaluation Algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Throughput Evaluation Algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Adebayo, Ademola Riliwan, Samuel Gbenga Oluokun, Rotimi Samuel Ogunode, and Osunade Seyi. "Performance Evaluation of Non-Latin Characters Based (Arabic) Symmetric Encryption Algorithm." Performance Evaluation of Non-Latin Characters Based (Arabic) Symmetric Encryption Algorithm 9, no. 1 (2024): 9. https://doi.org/10.5281/zenodo.10539171.
Full textAbstract:
Cryptography is the art of keeping information secure by transforming it into form that unintended recipients cannot understand. Encryption is a form of data security in which information is converted to cipher text to ensure confidentiality, authentication and integrity of user data. Issue relating to the choice of encryption algorithm among the Arabian IT community is another challenge. This research evaluated the performance of three symmetric non-Latin character- based encryption algorithms for Arabic text: First- Order-Equation-of-Three-Variables, Modulo-37-cipher, and Atbash-Substitution. The algorithms were assessed based on the following performance metrics namely: encryption time, decryption time, execution time, throughput, memory usage, and avalanche effect. The results revealed that the Atbash-Substitution algorithm had the highest throughput at 35.63 B/ms and the lowest memory usage at 197.90 MB. It also exhibited a weak avalanche effect. In contrast, the Modulo-37-cipher algorithm showed poor performance in terms of throughput. Therefore, the Atbash-Substitution algorithm demonstrated superior performance for Arabic text, being the fastest and most memory-efficient among the evaluated algorithms. Keyword:- Cipher, non-latin, throughput, encryption, algorithms, modulo-37-cipher.
2
Bt Ismail, Shafinaz, Darmawaty Bt Mohd Ali, and Norsuzila Ya’acob. "Performance Analysis of Uplink Scheduling Algorithms in LTE Networks." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 2 (2018): 373. http://dx.doi.org/10.11591/ijeecs.v9.i2.pp373-379.
Full textAbstract:
Scheduling is referring to the process of allocating resources to User Equipment based on scheduling algorithms that is located at the LTE base station. Various algorithms have been proposed as the execution of scheduling algorithm, which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of three well-known uplink schedulers namely, Maximum Throughput (MT), First Maximum Expansion (FME), and Round Robin (RR). The evaluation is considered for a single cell with interference for three flows such as Best effort, Video and VoIP in a pedestrian environment using the LTE-SIM network simulator. The performance evaluation is conducted in terms of system throughput, fairness index, delay and packet loss ratio (PLR). The simulations results show that RR algorithm always reaches the lowest PLR, delivering highest throughput for video and VoIP flows among all those strategies. Thus, RR is the most suitable scheduling algorithm for VoIP and video flows while MT and FME is appropriate for BE flows in LTE networks.
3
Shafinaz, Bt Ismail, Bt Mohd Ali Darmawaty, and Ya'acob Norsuzila. "Performance Analysis of Uplink Scheduling Algorithms in LTE Networks." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 2 (2018): 373–79. https://doi.org/10.11591/ijeecs.v9.i2.pp373-379.
Full textAbstract:
Scheduling is referring to the process of allocating resources to User Equipment based on scheduling algorithms that is located at the LTE base station. Various algorithms have been proposed as the execution of scheduling algorithm, which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of three well-known uplink schedulers namely, Maximum Throughput (MT), First Maximum Expansion (FME), and Round Robin (RR). The evaluation is considered for a single cell with interference for three flows such as Best effort, Video and VoIP in a pedestrian environment using the LTE-SIM network simulator. The performance evaluation is conducted in terms of system throughput, fairness index, delay and packet loss ratio (PLR). The simulations results show that RR algorithm always reaches the lowest PLR, delivering highest throughput for video and VoIP flows among all those strategies. Thus, RR is the most suitable scheduling algorithm for VoIP and video flows while MT and FME is appropriate for BE flows in LTE networks.
4
Mahdi, Hussain, Baidaa Al-Bander, Mohammed Hasan Alwan, Mohammed Salah Abood, and Mustafa Maad Hamdi. "Vehicular Networks Performance Evaluation Based on Downlink Scheduling Algorithms for High-Speed Long Term Evolution – Vehicle." International Journal of Interactive Mobile Technologies (iJIM) 15, no. 21 (2021): 52. http://dx.doi.org/10.3991/ijim.v15i21.22475.
Full textAbstract:
<p class="Abstract"><span lang="EN-US">Moving is the key to modern life. Most things are in moving such as vehicles and user mobiles, so the need for high-speed wireless networks to serve the high demand of the wireless application becomes essential for any wireless network design. The use of web browsing, online gaming, and on-time data exchange like video calls as an example means that users need a high data rate and fewer error communication links. To satisfy this, increasing the bandwidth available for each network will enhance the throughput of the communication, but the bandwidth available is a limited resource which means that thinking about techniques to be used to increase the throughput of the network is very important. One of the techniques used is the spectrum sharing between the available networks, but the problem here is when there is no available channel to connect with. This encourages researchers to think about using scheduling as a technique to serve the high capacity on the network. Studying scheduling techniques depends on the Quality-of-Service (QoS) of the network, so the throughput performance is the metric of this paper. In this paper, an improved Best-CQI scheduling algorithm is proposed to enhance the throughput of the network. The proposed algorithm was compared with three </span><span lang="MS">user scheduling algorithms to evaluate the throughput performance which are Round Robin (RR), Proportional Fair (PF), and Best-CQI algorithms. The study is performed under Line-of-Sight (LoS) link at carrier frequency 2.6 GHz to satisfy the Vehicular Long Term Evolution (LTE-V) with the high-speed scenario. The simulation results show that the proposed algorithm outperforms the throughput performance of the other algorithms.</span></p>
5
Garg, Akanksha, Navdeep S.Sethi, Nidhi Arora, and Amit Makkar. "BNP TASK SCHEDULING ALGORITHMS FOR PERFORMANCE EVALUATION IN PARALLEL SYSTEM." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 12, no. 8 (2014): 3768–77. http://dx.doi.org/10.24297/ijct.v12i8.3014.
Full textAbstract:
Scheduling is the process to minimize the schedule length by proper allocation of the tasks to the processors and arrangement of execution sequencing of the tasks. Multiprocessor Scheduling using Directed Acyclic Graph (DAG) is used in this research. Â An important implication of minimization of schedule length is that the system throughput is maximized. The objective of this survey is to describe various scheduling algorithms and their functionalities in a contrasting fashion as well as examine their relative merits in terms of performance and time-complexity. In this research, three BNP Scheduling Algorithms are considered namely HLFET Algorithm, MCP Algorithm and ETF Algorithm to calculate effective output by comparing the algorithms with eight test case scenarios with varying number of nodes and processors.
6
Kirat, Pal Singh, and Kumar Dilip. "Performance Evaluation of Low Power MIPS Crypto Processor based on Cryptography Algorithms." International Journal of Engineering Research and Applications 2, no. 3 (2012): 1625–34. https://doi.org/10.5281/zenodo.33251.
Full textAbstract:
This paper presents the design and implementation of low power 32-bit encrypted and decrypted MIPS processor for Data Encryption Standard (DES), Triple DES, Advanced Encryption Standard (AES) based on MIPS pipeline architecture. The organization of pipeline stages has been done in such a way that pipeline can be clocked at high frequency. Encryption and Decryption blocks of three standard cryptography algorithms on MIPS processor and dependency among themselves are explained in detail with the help of a block diagram. Clock gating technique is used to reduce the power consumption in MIPS crypto processor. This approach results in processor that meets power consumption and performance specification for security applications. Proposed Implementation approach concludes higher system performance while reducing operating power consumption. Testing results shows that the MIPS crypto processor operates successfully at a working frequency of 218MHz and a bandwidth of 664Mbits/s.
7
Shrikant Upadhyay. "Machine Learning-Based Beamforming Algorithm for Massive MIMO Systems in 5G Networks." Journal of Electrical Systems 20, no. 3s (2024): 971–79. http://dx.doi.org/10.52783/jes.1411.
Full textAbstract:
The following research focuses on the use of machine learning-based beamforming algorithms to improve Massive Multiple Input Multiple Output (MIMO) systems in 5G networks. Four unique algorithms namely, the Deep Learning Beamforming Algorithm (DLBA), Reinforcement Learning-Based Doa Estimation Algorithm (RLBEA), Clustering based beam forming algorithm(CBA) and GeneticAlgorithm Based Beam Forming Algoeithm were developed after which each of them was undertook evaluation. Widespread trials, in a simulated 5G environment, have revealed that the DLBA and RLBA considerably outperform other technologies by means of system throughput SINR as well Both the DLBA and RLBA achieved high system throughput, increased SINR levels and low BER. CBA and GABA, using clustering and genetic algorithms as their approaches, displayed moderate values on all assessed composite measures. This research offers important insights on the adaptability and learning potential of machine-learning based beamforming algorithms highlighting their ability to improve efficiency in wireless communication networks during the 5G revolution
8
Adane, Kibreab, Kedamo Mohammed, and Keyre Kemal. "Enhancing Cloud Computing Performance for Fast Online Services Delivery Using a Novel Hybrid Task Scheduling Algorithm." International Journal of Computer Information Systems and Industrial Management Applications 17 (May 29, 2025): 466–85. https://doi.org/10.70917/ijcisim-2025-0030.
Full textAbstract:
Forwarding many tasks to the cloud server simultaneously degrades cloud computing performance in this regard, time-dependent sectors like banks, healthcare, airlines, online shopping, and more suffer from slow delivery of cloud computing services unless a suitable task scheduling technique is implemented. The existing literature-based evidence reveals that effective task scheduling in cloud computing optimizes resource usage, boosts fault tolerance, facilitates scalability, lowers costs, and reduces energy consumption. However, identifying task-scheduling algorithms that fulfill the stated benefits is a hot research topic. To address these concerns, the study explored the type of task scheduling algorithms utilized, the dataset source, the number of tasks given, the number of cloud hosts, the simulation toolkits, the kind of evaluation metrics used, the number of virtual machines, and the scheduling techniques that performed best overall from 36 recent, relevant and reliable research works; applied one of the top performing task scheduling algorithms in most reviewed studies i.e., Genetic Algorithm(GA) along with task scheduling algorithm used in none of the reviewed research works i.e., Earliest Deadline First (EDF) as novel contributions, Compares the results of the proposed approach with another study, which employed the same datasets and evaluation metrics. The overall experiment results show that the proposed approach outperforms GA and GWO algorithms in terms of minimizing Makespan across all workloads and optimizing resource utilization on all workloads, except on workloads 300 and 500, where it performs less than GWO algorithms. GWO algorithm is slightly performing better than the proposed approach on workloads 500, 600, 700, 800, 900, and 1000 in maximizing throughput while performing less than the proposed approach on workloads 100, 200, and 300 in maximizing throughput. Compared to the proposed approach (GA-EDF combination) and GWO algorithm, the GA task scheduling algorithms demonstrate poor performance based on Makespan, average resource utilization, and throughput.
9
ABIODUN, Ahmida, Olanrewaju LAWAL, Oyediran OYEBIYI, Odiete JOSEPH, and Adeyemi ADETORO. "Performance Evaluation of Selected Encryption Algorithms." International Journal of Information Security and Cybercrime 10, no. 2 (2021): 21–30. http://dx.doi.org/10.19107/ijisc.2021.02.03.
Full textAbstract:
Data security is a key aspect of today’s communication trend and growth. Various mechanisms have been developed to achieve this security. One is cryptography, which represents a most effective method of enhancing security and confidentiality of data. In this work, a hybrid based 136bit key algorithm involving a sequential combination of XOR (Exclusive –Or) encryption and AES (Advanced Encryption Standard) algorithm to enhance the security strength is developed. The hybrid algorithm performance is matched with XOR encryption and AES algorithm using encryption and decryption time, throughput of encryption, space complexity and CPU process time.
10
Vanhatupa, Timo, Marko Hännikäinen, and Timo D. Hämäläinen. "Evaluation of throughput estimation models and algorithms for WLAN frequency planning." Computer Networks 51, no. 11 (2007): 3110–24. http://dx.doi.org/10.1016/j.comnet.2007.01.005.
Full text
11
Li, Qiong, Dan Le, Haokun Mao, Xiamu Niu, Tian Liu, and Hong Guo. "Study on error reconciliation in quantum key distribution." Quantum Information and Computation 14, no. 13&14 (2014): 1117–35. http://dx.doi.org/10.26421/qic14.13-14-5.
Full textAbstract:
As one of the most important procedure in quantum key distribution system, the error reconciliation algorithm has drew many attentions. However, studies on the error reconciliation algorithm mainly focuses on the reconciliation efficiency. Since the ultimate goal of study on the error reconciliation is to find the most suitable algorithm for a quantum key distribution system and maximize the throughput rate of the whole system, the indicator of reconciliation efficiency is not full-scale enough to evaluate an error reconciliation algorithm. In this paper we propose a new evaluation scheme, including four direct indicators and one composite indicator to solve the problem. Following the new scheme, seven representative error reconciliation algorithms are simulated and compared thoroughly, i.e. BBBSS, the original Cascade and two improved Cascade algorithms, Winnow, and two LDPC based algorithms. Our works are very beneficial to the evaluation, comparison, selection and optimization of error reconciliation algorithms for a practical quantum key distribution system.
12
B A Sujatha Kumari, Abhijna S, Nisha A G, Syeda Noorain, and Vandana Desai. "Evaluation of Performance of different routing Algorithm using Noxim." international journal of engineering technology and management sciences 6, no. 6 (2022): 442–47. http://dx.doi.org/10.46647/ijetms.2022.v06i06.078.
Full textAbstract:
One of the primary methods for examining and testing novel ideas in the Network-on-Chip space is simulation. Noxim simulator enables the analysis of performance for both established wired NoC and new WiNoC architectures. User can modify the size of the network, size of the packet, routing algorithm, various strategy selection and packet injection rate. The simulator evaluates NoCs in terms of various parameters of Network throughput, delay etc. In particular, the user can obtain various assessment metrics such as overall number of received packets/flits, global average throughput, max/min global delay, consumption of total energy. and so on. In comparison to traditional mesh NoC, this paper examines how different routing methods and WiNoC sizes affect network traffic distributions. We analyze PIR, Network throughput parameters of 8*8 mesh networks for various routing algorithms and its impacts are investigated. Simulation of Mesh wireless NOC architecture is validated.
13
Arif, Teuku Yuliar, Munandar Munandar, Ramzi Adriman, and Rizal Munadi. "CARA-OHT: Collision-Aware Rate Adaptation for Optimal High-Throughput in IEEE 802.11s Wireless Mesh Networks." International Journal of Interactive Mobile Technologies (iJIM) 14, no. 13 (2020): 172. http://dx.doi.org/10.3991/ijim.v14i13.13245.
Full textAbstract:
The wireless mesh network (WMN) is a future network technology that develops single-hop wireless local area networks (WLANs) into multi-hop wireless mesh networks, based on the IEEE 802.11s standard. However, this development still presents many challenges, such as determining the best route between sources and destinations, especially taking into account the use of the medium access control (MAC) and physical (PHY) layers of IEEE 802.11n/ac. Some papers have proposed rate adaptation algorithms particularly for single-hop networks; however, these only focused on mechanisms to find data rates suitable for channel conditions. In IEEE 802.11s WMNs, the design of the rate adaptation algorithm is more challenging. Besides considering the problem of channel quality and optimal throughput, it is necessary to also consider the problem of collision and the best route. It is important to take collision into account because the collision probability in multi-hop mesh networks is higher than that in single-hop networks and can lead to a lower throughput. Rate adaptation algorithms for IEEE 802.11s WMNs have been proposed in other papers, but they also do not consider the use of the MAC and PHY layers of IEEE 802.11n/ac. In this paper, we propose the collision-aware rate adaptation for optimal high-throughput (CARA-OHT) algorithm for WMN IEEE 802.11s. An evaluation through the extensive use of a network NS-3 simulator shows that the proposed algorithm exhibits a higher throughput than previously developed algorithms.
14
Ghimire, Roshani, and Ram Kumar Basnet. "Shortest Path Routing Performance Evaluation over SDN Environment." December 2023 5, no. 4 (2023): 405–22. http://dx.doi.org/10.36548/jei.2023.4.004.
Full textAbstract:
Static routing has a manual configuration setup system, and the scope of static routing in an SDN network is just for small networks. The solution to this problem rises up with the new technology defined as software-defined networking (SDN) based on shortest path first dynamic routing. SDN has the facility of a centralized controller that smooth the controls and routes computation over a data packet. The performance analysis of SDN networks that have SDN switches connected to the network based on the shortest path first protocol are simulated on Mininet. The POX controller with Mininet programming feature for creating smart topologies was chosen. In this research, the SDN network using Dijkstra’s algorithm, Bellman-Ford algorithm, extended Dijkstra’s algorithm and Floyd Warshall Algorithm were implemented. The quality factors of SDN created by using four algorithms are measured in terms of delay, jitter, latency, packet loss, transmit, received, throughput, and bandwidth based on experimental results and European Telecommunications Standards Institute (ETSI) data. The performance parameters of SDN network topology created using Dijkstra’s, bellman ford, extended Dijkstra’s, and Floyd Warshall algorithms were compared and the experimental results showed that Bellman-Ford algorithm is better in terms of performance parameters than the other three algorithms.
15
Li, Wenjie, Yiping Gong, and Bin Liu. "Performance Evaluation of Crossbar Switch Fabrics in Core Routers." Journal of Interconnection Networks 04, no. 02 (2003): 163–77. http://dx.doi.org/10.1142/s0219265903000805.
Full textAbstract:
Many researchers have pointed out that using complex scheduling algorithms in input queuing switches with virtual output queuing (VOQ) scheme can achieve 100% throughput. But these algorithms are too complex to be implemented in hardware. In this paper, based on combined input/output queuing (CIOQ) switch fabrics, we propose a simple scheduling algorithm named outlet priority round robin (OPRR). For synthetic workloads we consider, including uniform and bursty traffic models, the performance of OPRR in VOQ mode and single queue mode is evaluated respectively. Through the simulation results we show that 1) OPRR algorithm, coupled with the speedup of 2, can lead to performance very close to output queuing switches, and 2) under the same condition, OPRR algorithm in single queue mode behaves almost identically to VOQ mode. These results are very useful to direct the design and implementation of switch fabrics in core routers.
16
Armando Giral Ramirez, Diego, Cesar Hernandez, and Fredy Martinez. "Throughput in cooperative wireless networks." Bulletin of Electrical Engineering and Informatics 9, no. 2 (2020): 698–706. http://dx.doi.org/10.11591/eei.v9i2.2025.
Full textAbstract:
Cognitive radio networks emerge as a solution to fixed allocation issues and spectrum scarcity through the dynamic access to spectrum. In cognitive networks, users must make intelligent decisions based on spectrum variation and actions taken by other users. Under this dynamic, cooperative systems can significantly improve quality of service parameters. This article presents the comparative study of the multi-criteria decision-making algorithms SAW and FFAHP through four levels of cooperation (10%, 20%, 50%, 80% y 100%) established between secondary users. The results show the performance evaluation obtained through of simulations and experimental measurements. The analysis is carried out based on throughput, depending on the class of service and the type of traffic.
17
Buhari, Bello Alhaji, Hajara Abdulkadir, Sadiq Aliyu Ahmad, et al. "Performance and Security Analysis of Symmetric Data Encryption Algorithms: AES, 3DES and Blowfish." International Journal of Advanced Networking and Applications 16, no. 04 (2025): 6473–86. https://doi.org/10.35444/ijana.2025.16404.
Full textAbstract:
In the competitive business world of today, effective use of information technologies is essential to a world's success. As a result, sharing data and information over the Internet in an information system could be risky. A comparative analysis of these algorithms is required due to the ever-changing nature of security threats and the continuous advancements in computer technology. Therefore, we evaluate the performance and security strength of AES, 3DES and Blowfish algorithms. Security strength, throughput, memory usage, and execution time are the evaluation measures. Data from text files, audio files, videos, and images were used in our research. The security study was conducted using CrypTool 2, and the performance trials were created using the Java programming language. From the experimental findings, Blowfish performed better in terms of throughput and performance for both large and small files than AES and 3DES. AES ranked second in terms of speed and throughput while maintaining a balance between security and performance. 3DES did the worst in throughput and speed. Blowfish and AES were the two algorithms with the highest memory usage. Furthermore, 3DES is a wise option in resource-constrained scenarios. AES is the most secure algorithm because it offers robust protection against numerous attacks.
18
Perdana, Doan, Aji Nur Sanyoto, and Yoseph Gustommy Bisono. "Performance Evaluation and Comparison of Scheduling Algorithms on 5G Networks using Network Simulator." International Journal of Computers Communications & Control 14, no. 4 (2019): 530–39. http://dx.doi.org/10.15837/ijccc.2019.4.3570.
Full textAbstract:
In this research, we compared the Round Robin (RR) and the Proportional Fair (PF) algorithms for different user equipment density scenarios using voice and video traffic, to evaluate the key impact on performance of 5G mmwave network. This research simulated on NS3.27 with an integrated mmwave module. Based on the result, we found that the RR is a good choice for voice traffic. It has a throughput of 3.65% better than PF with similar fairness index. On the other hand, we found that the PF is the right choice for video traffic due to has better result for throughput. It has a throughput of 1.24% better than RR. For fairness index round robin has better result for voice and video traffic.
19
Karunarathne, J. R. M. D. B., Tharindu Wijethilake, and C. Keppitiyagama. "An Evaluation of Multipath TCP with Highly Asymmetric Subflows." International Journal on Advances in ICT for Emerging Regions (ICTer) 17, no. 1 (2024): 56–65. http://dx.doi.org/10.4038/icter.v17i1.7278.
Full textAbstract:
Multipath TCP (MPTCP) is an extension of the Transmission Control Protocol (TCP) that allows the simultaneous use of multiple available network interfaces to transmit and receive data. MPTCP can improve the throughput, lower the latency, and provide higher resilience to network failures. MPTCP creates a number of network connections (subflows) between the destination and presents a single endpoint to the application. MPTCP schedulers multiplexe data over subflows based on their end-to-end path metrics. In this study, we found that the presence of asymmetric links within an MPTCP connection can lead to suboptimal performance. We explored the architecture of the Linux implementation of MPTCP and identified the design choices that lead MPTCP to underperform in the presence of highly asymmetric links. To test the behaviour of MPTCP an emulation testbed was built using the Mininet emulator. We conducted comprehensive experiments in this controlled environment to analyze MPTCP behavior under asymmetric subflows in terms of bandwidth and latency. We designed a novel scheduling algorithm tailored to mitigate the impact of asymmetric subflows and implemented it in the Linux kernel. Building a scheduling algorithm for MPTCP in the Linux kernel is not a straightforward task. Several iterations of the algorithm had to be investigated in order to develop a practically deployable algorithm. The proposed algorithms were implemented in the Linux Kernel and were tested in the testbed. These algorithms were tested for their suitability to be used over highly asymmetric links under several test scenarios. Finally, we proposed the “Extended Dynamic Scheduler Algorithm” which observes the MPTCP connection and adjusts its subflows to limit the effect of asymmetric subflows in the MPTCP connection. The algorithm also has its own kickback policy where the throughput of the connection starts to improve when the asymmetry of the subflows decreases.
20
Kiefer, Martin, Ilias Poulakis, Sebastian Breß, and Volker Markl. "Scotch." Proceedings of the VLDB Endowment 14, no. 3 (2020): 281–93. http://dx.doi.org/10.14778/3430915.3430919.
Full textAbstract:
Sketching algorithms are a powerful tool for single-pass data summarization. Their numerous applications include approximate query processing, machine learning, and large-scale network monitoring. In the presence of high-bandwidth interconnects or in-memory data, the throughput of summary maintenance over input data becomes the bottleneck. While FPGAs have shown admirable throughput and energy-efficiency for data processing tasks, developing FPGA accelerators requires a sophisticated hardware design and expensive manual tuning by an expert. We propose Scotch, a novel system for accelerating sketch maintenance using FPGAs. Scotch provides a domain-specific language for the user-friendly, high-level definition of a broad class of sketching algorithms. A code generator performs the heavy-lifting of hardware description, while an auto-tuning algorithm optimizes the summary size. Our evaluation shows that FPGA accelerators generated by Scotch outperform CPU- and GPU-based sketching by up to two orders of magnitude in terms of throughput and up to a factor of five in terms of energy efficiency.
21
Mounika, M., Md Sharmila, M. Prasanna Gowri, K. Tejasvi, and M. Siva Ganga Prasad. "Analysis of channel allocation and management using tlbo, ga & de algorithms in cellular networks." International Journal of Engineering & Technology 7, no. 2.17 (2018): 40. http://dx.doi.org/10.14419/ijet.v7i2.17.11555.
Full textAbstract:
Accuracy of spectrum sensing in cellular mobile networks can be increased by reducing the sensing error probability, call blocking probability & by increasing network throughput. In our Project work, an advanced algorithms like Teaching Learning Based Optimization (TLBO), Genetic (GA) and Differential Evaluation (DE) Algorithms are used to analyze the sensing error probability, call blocking probability and network throughput. We will propose a channel allocation and management scheme with the above mentioned algorithms for supporting mobile users. With the help of these algorithms, sensing error and call blocking probabilities are analyzed to find out an optimal value for reducing the errors to some extent and improving network throughput. Channel Allocation in cellular networks is a key aspect with channel impairments and non-ideal antenna patterns. Finally, performance analysis is done through comparison of simulation results.
22
Rahaman, Md Mohibur, Mohammad Khairul Islam, Kazi Ashrafuzzaman, and Mohammad Sanaullah Chowdhury. "Performance Evaluation of Different Backoff Algorithms in IEEE 802.15.4 using Double Sensing." Indonesian Journal of Electrical Engineering and Computer Science 5, no. 2 (2017): 376. http://dx.doi.org/10.11591/ijeecs.v5.i2.pp376-382.
Full textAbstract:
<p>The IEEE 802.15.4 is the standard for Low Rate Wireless Personal Area network (LR-WPAN). It is widely used in many application areas. The standard uses Slotted CSMA/CA mechanism in its contention access period (CAP) for the beacon enabled mode. The protocol has two modes - single sensing (SS) and double sensing (DS). The protocol also adopts a binary exponential backoff (BEB) algorithm. In this paper, we explore the saturation throughput, delay and energy consumption of this standard with double sensing (DS) using the existing BEB algorithm. We also investigate three other backoff schemes - exponential increase exponential decrease (EIED), exponential increase linear decrease (EILD) and exponential increase multiplicative decrease (EIMD). From simulation results, it is found that the EIED, EILD, EIMD perform better than the BEB for higher loads. It shows that the EIED, EILD, EIMD have better throughput and lower delay than the BEB. The EIED outperforms the other schemes in terms of throughput, delay and energy for the higher loads.</p>
23
Dida, Firaol, and Gangman Yi. "Empirical evaluation of methods for de novo genome assembly." PeerJ Computer Science 7 (July 9, 2021): e636. http://dx.doi.org/10.7717/peerj-cs.636.
Full textAbstract:
Technologies for next-generation sequencing (NGS) have stimulated an exponential rise in high-throughput sequencing projects and resulted in the development of new read-assembly algorithms. A drastic reduction in the costs of generating short reads on the genomes of new organisms is attributable to recent advances in NGS technologies such as Ion Torrent, Illumina, and PacBio. Genome research has led to the creation of high-quality reference genomes for several organisms, and de novo assembly is a key initiative that has facilitated gene discovery and other studies. More powerful analytical algorithms are needed to work on the increasing amount of sequence data. We make a thorough comparison of the de novo assembly algorithms to allow new users to clearly understand the assembly algorithms: overlap-layout-consensus and de-Bruijn-graph, string-graph based assembly, and hybrid approach. We also address the computational efficacy of each algorithm’s performance, challenges faced by the assem- bly tools used, and the impact of repeats. Our results compare the relative performance of the different assemblers and other related assembly differences with and without the reference genome. We hope that this analysis will contribute to further the application of de novo sequences and help the future growth of assembly algorithms.
24
Ali, I., U. Wasenmüller, and N. Wehn. "A high throughput architecture for a low complexity soft-output demapping algorithm." Advances in Radio Science 13 (November 3, 2015): 73–80. http://dx.doi.org/10.5194/ars-13-73-2015.
Full textAbstract:
Abstract. Iterative channel decoders such as Turbo-Code and LDPC decoders show exceptional performance and therefore they are a part of many wireless communication receivers nowadays. These decoders require a soft input, i.e., the logarithmic likelihood ratio (LLR) of the received bits with a typical quantization of 4 to 6 bits. For computing the LLR values from a received complex symbol, a soft demapper is employed in the receiver. The implementation cost of traditional soft-output demapping methods is relatively large in high order modulation systems, and therefore low complexity demapping algorithms are indispensable in low power receivers. In the presence of multiple wireless communication standards where each standard defines multiple modulation schemes, there is a need to have an efficient demapper architecture covering all the flexibility requirements of these standards. Another challenge associated with hardware implementation of the demapper is to achieve a very high throughput in double iterative systems, for instance, MIMO and Code-Aided Synchronization. In this paper, we present a comprehensive communication and hardware performance evaluation of low complexity soft-output demapping algorithms to select the best algorithm for implementation. The main goal of this work is to design a high throughput, flexible, and area efficient architecture. We describe architectures to execute the investigated algorithms. We implement these architectures on a FPGA device to evaluate their hardware performance. The work has resulted in a hardware architecture based on the figured out best low complexity algorithm delivering a high throughput of 166 Msymbols/second for Gray mapped 16-QAM modulation on Virtex-5. This efficient architecture occupies only 127 slice registers, 248 slice LUTs and 2 DSP48Es.
25
Deng, Xiaohong, Kangting Li, Zhiqiang Wang, and Huiwen Liu. "A Novel Consensus Algorithm Based on Segmented DAG and BP Neural Network for Consortium Blockchain." Security and Communication Networks 2022 (April 8, 2022): 1–16. http://dx.doi.org/10.1155/2022/1060765.
Full textAbstract:
Currently, because of the excellent properties of decentralization, hard tamperability, and traceability, blockchain is widely used in WSN and IoT applications. In particular, consortium blockchain plays a fundamental role in the practical application environment, but consensus algorithm is always a key constraint. Over the past decade, we have been witnessing the obvious growth in blockchain consensus algorithms. However, in the existing consortium blockchain consensus algorithms, there is a limited characteristic of scalability, concurrency, and security. To address this problem, this work introduces a new consensus algorithm that is derived from a directed acyclic graph and backpropagation neural network. First, we propose a partitioned structure and segmented directed acyclic graph as data storage structure, which allows us to improve scalability, throughput, and fine-grained granularity of transaction data. Furthermore, in order to provide the accuracy of node credit evaluation and reduce the possibility of Byzantine nodes, we introduce a novel credit evaluation mechanism based on a backpropagation neural network. Finally, we design a resistant double-spending mechanism based on MapReduce, which ensures the transaction data are globally unique and ordered. Experimental results and security analysis demonstrate that the proposed algorithm has advantages in throughput. Compared with the existing methods, it has higher security and scalability.
26
Jittawiriyanukoon, Chanintorn. "Performance evaluation of proposed load balancing algorithm with unstable concurrent programs." Indonesian Journal of Electrical Engineering and Computer Science 14, no. 3 (2019): 1452. http://dx.doi.org/10.11591/ijeecs.v14.i3.pp1452-1459.
Full textAbstract:
<span>IoT is the succeeding cohort of the digital computing environment. A swift progression in the IoT deployment and its applications are on the rise. Improving load balancing mechanisms induces healthier performance of the internet based computing as higher number of users can be comfortable. Implementing full services for tasks with unstable concurrency is an uphill process. One of the encounters allied with this administration is the task partition among the applications, regularly referred as concurrent programs. Through load balancing not only resources are equally utilized but also concurrent job’s response time can be promoted. Therefore, in this paper the widely used load balancing algorithms are investigated and yet the proposed algorithm is introduced. Simulation is employed in order to compare the performance metrics such as mean queue length, utilization and throughput between the recommended and existing algorithms. The proposed algorithm confirms the load balancing and outperforms when processing unstable concurrent programs.</span>
27
Hui, Rong. "Application of Blockchain Technology in Teaching Evaluation in Applied Technology Universities." Journal of Combinatorial Mathematics and Combinatorial Computing 123, no. 1 (2024): 501–20. https://doi.org/10.61091/jcmcc123-36.
Full textAbstract:
This paper explores the integration of blockchain technology into the teaching quality evaluation system of universities. A practical teaching quality evaluation index system for applied technology universities is developed, ensuring data authenticity through blockchain’s de-trusting mechanism. To enhance data storage efficiency, the PBFT consensus algorithm is improved and incorporated into a technical architecture adopting an “off-chain storage + on-chain sharing” model. The algorithm scoring formula and improved PBFT consensus algorithm are analyzed to demonstrate their effectiveness. Practical applications in applied technology universities highlight the benefits of blockchain in higher education evaluation. The CBFT-based consensus algorithm achieves average CPU utilization of 13.4% compared to 18.5% in traditional algorithms, while ensuring data transparency and tamper-proofing. Additionally, the algorithm improves transaction throughput and reduces resource consumption, enabling efficient operation of the teaching evaluation system in applied sciences universities.
28
Rashmi, Jha, Ali Sk Asraful, Manonmani V, et al. "High-throughput Screening and Trait Dissection for Seed Quality Enhancement." Journal of Civil Engineering and Environmental Sciences 11, no. 1 (2025): 017–25. https://doi.org/10.17352/2455-488x.000091.
Full textAbstract:
High-throughput phenotyping (HTP) has transformed seed testing, quality evaluation, storage, and stress response assessment by enabling rapid, non-destructive, and high-resolution analysis of seed traits. Traditional seed evaluation methods are labour-intensive and time-consuming, whereas HTP employs advanced imaging, sensor technologies, and machine learning algorithms to assess seed morphology, physiological traits, and biochemical properties efficiently. In seed testing, HTP accelerates germination studies, vigour assessments, and stress tolerance evaluations, facilitating the identification of high-quality and resilient seed varieties. It also enhances seed storage practices by providing real-time monitoring of seed viability, detecting deterioration factors, and optimizing storage conditions. Furthermore, HTP significantly contributes to understanding seed responses to biotic and abiotic stresses. By characterizing genetic and physiological factors associated with disease resistance and environmental stress tolerance, HTP aids in breeding stress-resilient crops and optimizing seed treatments. The integration of HTP with artificial intelligence further refines predictive modelling and precision agriculture strategies, supporting climate-resilient farming and sustainable agricultural practices. This paper highlights the multifaceted role of HTP in advancing seed science, from quality assurance to stress management, underscoring its impact on agricultural productivity and genetic resource conservation.
29
Zhang, Yang, Xin Yu, Dongwen Zhang, Mengmeng Wei, and Yanan Liang. "Lock-Free Binary Search Tree Based on Leaf Search." International Journal of Open Source Software and Processes 8, no. 2 (2017): 44–58. http://dx.doi.org/10.4018/ijossp.2017040103.
Full textAbstract:
Binary search tree is one of the most important data structures in program design. This article proposes a novel lock-free algorithm, which can implement the lock-free operations, such as search, insert and delete, using compare and swap (CAS). Unlike the previous studies of handling the inside node in a tree, the authors' algorithm handles the insert and delete operations by considering of the subtree. This article presents the details of the lock-free algorithm, which can effectively reduce the contention between the update operations. The experiment compares the algorithm with other two lock-free algorithms by throughput. Evaluation results show that the throughput of the algorithm outperforms that of the other two concurrent BSTs when the number of threads is more than 4. The authors' algorithm will be competitive when the concurrency is high.
30
Radhakrishnan, Indu, Shruti Jadon, and Prasad B. Honnavalli. "Efficiency and Security Evaluation of Lightweight Cryptographic Algorithms for Resource-Constrained IoT Devices." Sensors 24, no. 12 (2024): 4008. http://dx.doi.org/10.3390/s24124008.
Full textAbstract:
The IoT has become an integral part of the technological ecosystem that we all depend on. The increase in the number of IoT devices has also brought with it security concerns. Lightweight cryptography (LWC) has evolved to be a promising solution to improve the privacy and confidentiality aspect of IoT devices. The challenge is to choose the right algorithm from a plethora of choices. This work aims to compare three different LWC algorithms: AES-128, SPECK, and ASCON. The comparison is made by measuring various criteria such as execution time, memory utilization, latency, throughput, and security robustness of the algorithms in IoT boards with constrained computational capabilities and power. These metrics are crucial to determine the suitability and help in making informed decisions on choosing the right cryptographic algorithms to strike a balance between security and performance. Through the evaluation it is observed that SPECK exhibits better performance in resource-constrained IoT devices.
31
Schmid, Josef, Alfred Höss, and Björn W. Schuller. "A Survey on Client Throughput Prediction Algorithms in Wired and Wireless Networks." ACM Computing Surveys 54, no. 9 (2022): 1–33. http://dx.doi.org/10.1145/3477204.
Full textAbstract:
Network communication has become a part of everyday life, and the interconnection among devices and people will increase even more in the future. Nevertheless, prediction of Quality of Service parameters, particularly throughput, is quite a challenging task. In this survey, we provide an extensive insight into the literature on Transmission Control Protocol throughput prediction. The goal is to provide an overview of the used techniques and to elaborate on open aspects and white spots in this area. We assessed more than 35 approaches spanning from equation-based over various time smoothing to modern learning and location smoothing methods. In addition, different error functions for the evaluation of the approaches as well as publicly available recording tools and datasets are discussed. To conclude, we point out open challenges especially looking in the area of moving mobile network clients. The use of throughput prediction not only enables a more efficient use of the available bandwidth, the techniques shown in this work also result in more robust and stable communication.
32
Low, Andre K. Y., Eleonore Vissol-Gaudin, Yee-Fun Lim, and Kedar Hippalgaonkar. "Mapping pareto fronts for efficient multi-objective materials discovery." Journal of Materials Informatics 3, no. 2 (2023): 11. http://dx.doi.org/10.20517/jmi.2023.02.
Full textAbstract:
With advancements in automation and high-throughput techniques, we can tackle more complex multi-objective materials discovery problems requiring a higher evaluation budget. Given that experimentation is greatly limited by evaluation budget, maximizing sample efficiency of optimization becomes crucial. We discuss the limitations of using hypervolume as a performance indicator and propose new metrics relevant to materials experimentation: such as the ability to perform well for complex high-dimensional problems, minimizing wastage of evaluations, consistency/robustness of optimization, and ability to scale well to high throughputs. With these metrics, we perform an empirical study of two conceptually different and state-of-the-art algorithms (Bayesian and Evolutionary) on synthetic and real-world datasets. We discuss the merits of both approaches with respect to exploration and exploitation, where fully resolving the Pareto Front provides more knowledge of the best material.
33
Sideris, Argyrios, Theodora Sanida, and Minas Dasygenis. "A Novel Hardware Architecture for Enhancing the Keccak Hash Function in FPGA Devices." Information 14, no. 9 (2023): 475. http://dx.doi.org/10.3390/info14090475.
Full textAbstract:
Hash functions are an essential mechanism in today’s world of information security. It is common practice to utilize them for storing and verifying passwords, developing pseudo-random sequences, and deriving keys for various applications, including military, online commerce, banking, healthcare management, and the Internet of Things (IoT). Among the cryptographic hash algorithms, the Keccak hash function (also known as SHA-3) stands out for its excellent hardware performance and resistance to current cryptanalysis approaches compared to algorithms such as SHA-1 and SHA-2. However, there is always a need for hardware enhancements to increase the throughput rate and decrease area consumption. This study specifically focuses on enhancing the throughput rate of the Keccak hash algorithm by presenting a novel architecture that supplies efficient outcomes. This novel architecture achieved impressive throughput rates on Field-Programmable Gate Array (FPGA) devices with the Virtex-5, Virtex-6, and Virtex-7 models. The highest throughput rates obtained were 26.151 Gbps, 33.084 Gbps, and 38.043 Gbps, respectively. Additionally, the research paper includes a comparative analysis of the proposed approach with recently published methods and shows a throughput rate above 11.37% Gbps in Virtex-5, 10.49% Gbps in Virtex-6 and 11.47% Gbps in Virtex-7. This comparison allows for a comprehensive evaluation of the novel architecture’s performance and effectiveness in relation to existing methodologies.
34
Mamane, Asmae, M. Fattah, M. El Ghazi, Y. Balboul, M. El Bekkali, and S. Mazer. "Proportional fair buffer scheduling algorithm for 5G enhanced mobile broadband." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 5 (2021): 4165. http://dx.doi.org/10.11591/ijece.v11i5.pp4165-4173.
Full textAbstract:
The impending next generation of mobile communications denoted 5G intends to interconnect user equipment, things, vehicles, and cities. It will provide an order of magnitude improvement in performance and network efficiency, and different combinations of use cases enhanced mobile broadband (eMBB), ultra reliable low latency communications (URLLC), massive internet of things (mIoT) with new capabilities and diverse requirements. Adoption of advanced radio resource management procedures such as packet scheduling algorithms is necessary to distribute radio resources among different users efficiently. The proportional fair (PF) scheduling algorithm and its modified versions have proved to be the commonly used scheduling algorithms for their ability to provide a tradeoff between throughput and fairness. In this article, the buffer status is combined with the PF metric to suggest a new scheduling algorithm for efficient support for eMBB. The effectiveness of the proposed scheduling strategy is proved through à comprehensive experimental analysis based on the evaluation of different quality of service key performance indicators (QoS KPIs) such as throughput, fairness, and buffer status.
35
Asmae, Mamane, Fattah M., El Ghazi M., Balboul Y., El Bekkali M., and Mazer S. "Proportional fair buffer scheduling algorithm for 5G enhanced mobile broadband." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 5 (2021): 4165–73. https://doi.org/10.11591/ijece.v11i5.pp4165-4173.
Full textAbstract:
The impending next generation of mobile communications denoted 5G intends to interconnect user equipment, things, vehicles, and cities. It will provide an order of magnitude improvement in performance and network efficiency, and different combinations of use cases enhanced mobile broadband (eMBB), ultra reliable low latency communications (URLLC), massive internet of things (mIoT) with new capabilities and diverse requirements. Adoption of advanced radio resource management procedures such as packet scheduling algorithms is necessary to distribute radio resources among different users efficiently. The proportional fair (PF) scheduling algorithm and its modified versions have proved to be the commonly used scheduling algorithms for their ability to provide a tradeoff between throughput and fairness. In this article, the buffer status is combined with the PF metric to suggest a new scheduling algorithm for efficient support for eMBB. The effectiveness of the proposed scheduling strategy is proved through à comprehensive experimental analysis based on the evaluation of different quality of service key performance indicators (QoS KPIs) such as throughput, fairness, and buffer status.
36
Zhao, Qing Qi, Hong Hao Zhao, Fan Bo Meng, and Zhen Jiang Lei. "Performance Evaluation of ZigBee Routing Algorithms in Smart Grid." Applied Mechanics and Materials 336-338 (July 2013): 2428–32. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.2428.
Full textAbstract:
In order to meet the requirements of Smart Grid in data acquisition, transmission reliability, stability, robustness and low power consumption of devices, ZigBee with its significant advantages of low power, low cost, low rate and easy to use, can play an important role in Smart Grid. As one of the key technologies of ZigBee, routing technology plays an important role in the performance optimization of network. Thus, in this paper, we focus on cluster-tree routing algorithm and hybrid routing algorithm in ZigBee network. Simulation and results show that, hybrid routing algorithm has better performance than cluster-tree routing algorithm in network throughput, average traffic received, average number of hops, network delay and network load.
37
Adebiyi, Marion Olubunmi, Egbe Egbe Adeka, Florence A. Oladeji, Roseline Oluwaseun Ogundokun, Micheal Olaolu Arowolo, and Ayodele Ariyo Adebiyi. "Evaluation of load balancing algorithms on overlapping wireless accesspoints." Indonesian Journal of Electrical Engineering and Computer Science 21, no. 2 (2021): 895–902. https://doi.org/10.11591/ijeecs.v21.i2.pp895-902.
Full textAbstract:
Wireless networks came into the computing world replacing the costlier and more complex wired method of connecting numerous equipment in the same or different location via the use of cables. It provides the user devices a connection to one another and the greater internet via connections to access points. Generally, 802.11 access point products follow a default strongest signal first approach in selecting user devices or nodes to connect to the access point or overlapping access points. This standard does not make provisions for even distribution of load and hence the quality of service and the throughput in areas of congestion would be reduced. This article brings forward two algorithms used in load balancing and they include round-robin technique and the weighted round-robin technique to be used in the simulation of the distribution of the load amongst the access points with the results collated and compared to clearly show which algorithm is best suited to be used as a standard for access point load distribution.
38
Meng, Fan Bo, Tai Yi Fu, Jun Nan Wang, Jing Tao Yu, and Chan Nan Zhu. "Performance Evaluation of Ethernet Passive Optical Network for Smart Grid." Applied Mechanics and Materials 667 (October 2014): 149–52. http://dx.doi.org/10.4028/www.scientific.net/amm.667.149.
Full textAbstract:
As a mature access technology for the communication in smart grid, Ethernet Passive Optical Network (EPON) is widely considered as a promising solution due to high bandwidth capacity and stability. In recent years, EPON technology has received much attention and introduced into smart grid. The particularity of smart grid largely depends on bandwidth allocation. In this paper, we evaluate the performances of smart grid with three bandwidth allocation algorithms, i.e., Poll with Stop (PS), Max and Min Bandwidth Bounds (MMBB) and Cyclic Strategy (CS), respectively. The simulation results in this paper show the advantages of CS algorithm in terms of packet delay and throughput.
39
Ji, Ruiwen, Yuanlong Cao, Xiaotian Fan, Yirui Jiang, Gang Lei, and Yong Ma. "Multipath TCP-Based IoT Communication Evaluation: From the Perspective of Multipath Management with Machine Learning." Sensors 20, no. 22 (2020): 6573. http://dx.doi.org/10.3390/s20226573.
Full textAbstract:
With the development of wireless networking technology, current Internet-of-Things (IoT) devices are equipped with multiple network access interfaces. Multipath TCP (MPTCP) technology can improve the throughput of data transmission. However, traditional MPTCP path management may cause problems such as data confusion and even buffer blockage, which severely reduces transmission performance. This research introduces machine learning algorithms into MPTCP path management, and proposes an automatic learning selection path mechanism based on MPTCP (ALPS-MPTCP), which can adaptively select some high-quality paths and transmit data at the same time. This paper designs a simulation experiment that compares the performance of four machine learning algorithms in judging path quality. The experimental results show that, considering the running time and accuracy, the random forest algorithm has the best performance in judging path quality.
40
Lange, Tomer, Joseph (Seffi) Naor, and Gala Yadgar. "Offline and Online Algorithms for SSD Management." Communications of the ACM 66, no. 7 (2023): 129–37. http://dx.doi.org/10.1145/3596205.
Full textAbstract:
Flash-based solid-state drives (SSDs) are a key component in most computer systems, thanks to their ability to support parallel I/O at sub-millisecond latency and consistently high throughput. At the same time, due to the limitations of the flash media, they perform writes out-of-place, often incurring a high internal overhead which is referred to as write amplification. Minimizing this overhead has been the focus of numerous studies by the systems research community for more than two decades. The abundance of system-level optimizations for reducing SSD write amplification, which is typically based on experimental evaluation, stands in stark contrast to the lack of theoretical algorithmic results in this problem domain. To bridge this gap, we explore the problem of reducing write amplification from an algorithmic perspective, considering it in both offline and online settings. In the offline setting, we present a near-optimal algorithm. In the online setting, we first consider algorithms that have no prior knowledge about the input and show that in this case, the greedy algorithm is optimal. Then, we design an online algorithm that uses predictions about the input. We show that when predictions are relatively accurate, our algorithm significantly improves over the greedy algorithm. We complement our theoretical findings with an empirical evaluation of our algorithms, comparing them with the state-of-the-art scheme. The results confirm that our algorithms exhibit an improved performance for a wide range of input traces.
41
Ramalho, Mayksuel, Gabriel Sampaio, Nicholas Neves, et al. "A Comparative Evaluation of Symmetric Cryptography Algorithms for Resource-Constrained Devices." Journal of Internet Services and Applications 16, no. 1 (2025): 153–62. https://doi.org/10.5753/jisa.2025.4903.
Full textAbstract:
Data security in the Internet of Things (IoT) is crucial for protecting both the devices and the data they transmit over the network. Nevertheless, security is often overlooked in this context, leaving systems vulnerable to cyberattacks that can compromise information confidentiality and integrity. This work focuses on a use case of an environment remote monitoring system for disaster prevention, in which information must be confidential and intact. The AES (Advanced Encryption Standard) and Speck cryptographic algorithm families are evaluated in both traditional and memory-optimized implementations, targeting data confidentiality. The algorithms are assessed through practical experiments on two resource-constrained hardware platforms. Transmission throughput, estimated energy consumption, execution time, and memory usage are evaluated. Results show that the Speck family executes more quickly, has lower estimated energy consumption, and occupies less memory space than AES in both platforms.
42
Baili, Jamel. "Simulation and Evaluation of Distributed consensus Network for Multi-Agent Systems for Sybil Attacks." Wasit Journal of Computer and Mathematics Science 2, no. 4 (2023): 13–26. http://dx.doi.org/10.31185/wjcms.215.
Full textAbstract:
Distributed average consensus represents the amount of computing of inputs held by multiple agents that communicate through peer-to-peer networks. Collaboration among operators is essential for any distributed standard consensus protocol as every specialist needs to contribute to different operators, typically the adjacent (neighbouring) operators. Internet-of-Things (IoT) implementation is challenging because of its heterogeneous, massively distributed nature. The challenges of this challenge can be addressed with blockchain-based platforms and technologies. Testing and evaluation platforms are required for Blockchain deployments in IoT. A realistic and configurable network environment is presented in this paper to evaluate consensus algorithms. Many blockchainevaluation platforms do not provide a configurable and realistic network environment or are tied to a specific consensus protocol. With our simulator, practitioners can evaluate how consensus algorithms affect network events in congested or contested scenarios to determine the best consensus algorithm. It is proposed to achieve this task by generalizing consensus methods. The Blockchain simulator employs Discrete event network simulations for increased fidelity and scalability. In addition to evaluating the time, state block rate (%), estimation error, average throughput, and simulation time, we evaluate the performance of the proposed techniques based on the number of peer nodes. A comparison of the average transaction delivery rate with a traditional protocol is shown. The proposed protocol has a higher throughput average than the traditional one.
43
Ajibola, Esther B., Joshua A. Ayeni, and Adeleye S. Falohun. "Development of An Enhanced Load Balancing Algorithm for Heterogeneous Distributed System Environment." International Journal of Research and Scientific Innovation X, no. XII (2024): 484–96. http://dx.doi.org/10.51244/ijrsi.2023.1012037.
Full textAbstract:
In a Heterogeneous Distributed System Environment (HDSE), a load balancing algorithm ensures even distribution of tasks between the various systems and the appropriate server for each of the different client request, based on server capacity, current connection time and IP address. This is to avoid uneven distribution of tasks and thereby overloading some servers to the detriment of others. An enhanced heterogeneous load balancing algorithm was developed to address the shortcomings observed in the conventional load balancers to improve on the performance of the job response time, throughput, and turnaround time. The developed load balancing algorithm was executed using scheduling techniques: the Weighted Round Robin (WRR) and Least Connection algorithms. The load balancing algorithm was coded in C-Language with in-built functions of the C-Library and the Performance Evaluation Test (PET) was carried out using Average Turnaround Time (ATAT}, Average Waiting Time (AWT) and Throughput (ThP) The results of the test demonstrated an improved performance on conventional load balancing algorithm in a HDSE.
44
Ding, Yahui, Jianli Guo, Xu Li, Xiujuan Shi, and Peng Yu. "Data Transmission Evaluation and Allocation Mechanism of the Optimal Routing Path: An Asynchronous Advantage Actor-Critic (A3C) Approach." Wireless Communications and Mobile Computing 2021 (September 2, 2021): 1–21. http://dx.doi.org/10.1155/2021/6685722.
Full textAbstract:
The delay tolerant networks (DTN), which have special features, differ from the traditional networks and always encounter frequent disruptions in the process of transmission. In order to transmit data in DTN, lots of routing algorithms have been proposed, like “Minimum Expected Delay,” “Earliest Delivery,” and “Epidemic,” but all the above algorithms have not taken into account the buffer management and memory usage. With the development of intelligent algorithms, Deep Reinforcement Learning (DRL) algorithm can better adapt to the above network transmission. In this paper, we firstly build optimal models based on different scenarios so as to jointly consider the behaviors and the buffer of the communication nodes, aiming to ameliorate the process of the data transmission; then, we applied the Deep Q-learning Network (DQN) and Advantage Actor-Critic (A3C) approaches in different scenarios, intending to obtain end-to-end optimal paths of services and improve the transmission performance. In the end, we compared algorithms over different parameters and find that the models build in different scenarios can achieve 30% end-to-end delay decline and 80% throughput improvement, which show that our algorithms applied in are effective and the results are reliable.
45
Adebiyi, Marion Olubunmi, Egbe Egbe Adeka, Florence A. Oladeji, Roseline Oluwaseun Ogundokun, Micheal Olaolu Arowolo, and Ayodele Ariyo Adebiyi. "Evaluation of load balancing algorithms on overlappiing wireless accesspoints." Indonesian Journal of Electrical Engineering and Computer Science 21, no. 2 (2021): 895. http://dx.doi.org/10.11591/ijeecs.v21.i2.pp895-902.
Full textAbstract:
<span>Wireless networks came into the computing world replacing the costlier and more complex wired method of connecting numerous equipment in the same or different location via the use of cables. It provides the user devices a connection to one another and the greater internet via connections to access points. Generally, 802.11 access point products follow a default strongest signal first approach in selecting user devices or nodes to connect to the access point or overlapping access points. This standard does not make provisions for even distribution of load and hence the quality of service and the throughput in areas of congestion would be reduced. This article brings forward two algorithms used in load balancing and they include round-robin technique and the weighted round-robin technique to be used in the simulation of the distribution of the load amongst the access points with the results collated and compared to clearly show which algorithm is best suited to be used as a standard for access point load distribution.</span>
46
M Dilli Babu, Et al. "A Novel Communication Pathway Metric Evaluation using Throughput and Energy Improvements over Wireless Sensor Networks." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 10 (2023): 699–704. http://dx.doi.org/10.17762/ijritcc.v11i10.8566.
Full textAbstract:
Lifetime connectivity and low power consumption are two requirements for WSNs. Additionally, increasing WSN commercialization, application monitoring for higher QoS. Maintaining the improvement of the wireless sensor networks effectiveness requires the establishment of the energy-efficient and consistent connection. In order to increase the efficiency of routing algorithms in latest technology assisted WSNs, a novel method is developed. The gadgets with the lowest power consumption are carefully selected for the appropriate use and carefully managed. The goal of this research is to develop low-power routing algorithms for use in WSNs. Numerous sectors, including the military, the medical profession, surveillance of observing, public transportation sectors etc., can benefit from wireless sensor networks deployed with a large number of mobile nodes in a communications system. To examine data from nodes that are freely moving about the zone, we developed and simulated a wireless network system based on the Distributed Internet of Things. The proposed method of Intelligent Route Metric Analyzer (IRMA) improves upon the efficiency of the standard algorithm with regards to energy consumption. In addition, the ground wireless sensing design's ideal trajectory is identified using a realistic tempering approach. In the end, this concept is compared to similar ones like AODV and the findings reveal that it performs better with regard to of energy consumption, delay and other important metrics. According to the paper we analyzed, the primary objective was to devise a routing method that would sustain network operation for as long as feasible by decreasing the energy needed for different operations at each individual sensor node while keeping the total energy consumption of the nodes constant over their lifetimes. Finally, the study makes a contribution to the ongoing discussion of the difficulties in developing a routing protocol for WSN, taking into account the interdependency of different network factors. Median throughput, median network latency, and standardized route load are only few of the efficiency metrics addressed in this article.
47
Kalpana, M., R. Dhanalakshmi, and P. Parthiban. "Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm." Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/158420.
Full textAbstract:
This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.
48
Zhang, Chongyuan, Chongyuan Zhang, Michael O. Pumphrey, et al. "Development of an Automated High- Throughput Phenotyping System for Wheat Evaluation in a Controlled Environment." Transactions of the ASABE 62, no. 1 (2019): 61–74. http://dx.doi.org/10.13031/trans.12856.
Full textAbstract:
Abstract. Plant breeding has significantly improved in recent years; however, phenotyping remains a bottleneck, as the process of evaluating and measuring plant traits is often expensive, subjective, and laborious. Although commercial phenotyping systems are available, factors like cost, space, and need for specific controlled-environment conditions limit the affordability of these products. An accurate, user-friendly, adaptive, and high-throughput phenotyping (HTP) system is highly desirable to plant breeders, physiologists, and agronomists. To solve this problem, an automated HTP system and image processing algorithms were developed and tested in this study. The automated platform was an integration of an aluminum framework (including movement and control components), three cameras, and a laptop computer. A control program was developed using LabVIEW to manage operation of the system frame and sensors as a single-unit automated HTP system. Image processing algorithms were developed in MATLAB for high-throughput analysis of images acquired by the system to estimate phenotypes and traits associated with tested plants. The phenotypes extracted were color/spectral, texture, temperature, morphology, and greenness features on a temporal scale. Using two wheat lines with known heat tolerance, the functions of the HTP system were validated. Heat stress tolerance experiments revealed that features such as green leaf area and green normalized difference vegetation index derived from our system showed differences between the control and heat stress treatments, as well as between heat-tolerant and susceptible wheat lines. In another experiment, stripe rust resistance in wheat was assessed. With the HTP system, some potential for detecting qualitative traits, such as disease resistance, was observed, although further validation is needed. In summary, successful development and implementation of an automated system with custom image processing algorithms for HTP in wheat was achieved. Improvement of such systems would further help plant breeders, physiologists, and agronomists to phenotype crops in an efficient, objective, and high-throughput manner. Keywords: Automation, Heat stress, Image processing, Plant breeding, Sensing, Stripe rust.
49
Stan, Roxana-Gabriela, Lidia Băjenaru, Cătălin Negru, and Florin Pop. "Evaluation of Task Scheduling Algorithms in Heterogeneous Computing Environments." Sensors 21, no. 17 (2021): 5906. http://dx.doi.org/10.3390/s21175906.
Full textAbstract:
This work establishes a set of methodologies to evaluate the performance of any task scheduling policy in heterogeneous computing contexts. We formally state a scheduling model for hybrid edge–cloud computing ecosystems and conduct simulation-based experiments on large workloads. In addition to the conventional cloud datacenters, we consider edge datacenters comprising smartphone and Raspberry Pi edge devices, which are battery powered. We define realistic capacities of the computational resources. Once a schedule is found, the various task demands can or cannot be fulfilled by the resource capacities. We build a scheduling and evaluation framework and measure typical scheduling metrics such as mean waiting time, mean turnaround time, makespan, throughput on the Round-Robin, Shortest Job First, Min-Min and Max-Min scheduling schemes. Our analysis and results show that the state-of-the-art independent task scheduling algorithms suffer from performance degradation in terms of significant task failures and nonoptimal resource utilization of datacenters in heterogeneous edge–cloud mediums in comparison to cloud-only mediums. In particular, for large sets of tasks, due to low battery or limited memory, more than 25% of tasks fail to execute for each scheduling scheme.
50
Shehada, Mohammad K. H., and Alexandra Kondyli. "Evaluation of Ramp Metering Impacts on Travel Time Reliability and Traffic Operations through Simulation." Journal of Advanced Transportation 2019 (January 20, 2019): 1–12. http://dx.doi.org/10.1155/2019/8740158.
Full textAbstract:
Ramp metering has been found to improve traffic conditions on the freeway mainline by breaking the platoons of ramp vehicles minimizing turbulence at the merge locations. The majority of the ramp metering evaluation studies have examined traffic performance under specific demand conditions, whereas travel time reliability and variability aspects have not been adequately addressed. This paper focuses on evaluating two well-known ramp metering algorithms in terms of travel time reliability as well as other performance measures such as queue lengths, throughput, and congestion duration, looking at a wide range of traffic demands throughout a calendar year. The evaluation was done through simulating an 8-mile corridor in Kansas City, KS. The results showed localized improvements due to ramp metering at the northern section of the facility, in terms of travel time reliability, throughput, and congestion duration. It was also shown that ramp metering may cause a new (possibly “hidden”) bottleneck to occur downstream, thus diluting its overall benefits when looking at an entire freeway facility. It is further noted that although ALINEA performed better than HERO on the mainline, traffic operations on the on-ramps significantly deteriorated using isolated control.