Telecommunication Systems最新文献

{"title":"A new cache replacement policy in named data network based on FIB table information","authors":"Mehran Hosseinzadeh, Neda Moghim, Samira Taheri, Nasrin Gholami","doi":"10.1007/s11235-024-01140-7","DOIUrl":"https://doi.org/10.1007/s11235-024-01140-7","url":null,"abstract":"<p>Named Data Network (NDN) is proposed for the Internet as an information-centric architecture. Content storing in the router’s cache plays a significant role in NDN. When a router’s cache becomes full, a cache replacement policy determines which content should be discarded for the new content storage. This paper proposes a new cache replacement policy called Discard of Fast Retrievable Content (DFRC). In DFRC, the retrieval time of the content is evaluated using the FIB table information, and the content with less retrieval time receives more discard priority. An impact weight is also used to involve both the grade of retrieval and stale parameters in the discard priority calculation. This weight adjusts the relative impact of these two parameters on the discard priority. The grade of retrieval reflects the content’s retrieval time, and the stale parameter indicates its popularity. The reinforcement Learning method is used to calculate the suitable weight dynamically and based on the network condition. Simulation results show that DFRC improves hit rate and round-trip time compared to Least Recently Used, Optimized Cache Replacement algorithm for Information-Centric Networks, Efficient Popularity-aware Probabilistic Caching, and Shortest Round-Trip Time.</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140616829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Design of four-element MIMO antenna system for Intelligent Internet of Everything (IIoE)","authors":"Aziz Dkiouak, Mohssine El Ouahabi, Alia Zakriti, Saad Chakkor, Mostafa Baghouri","doi":"10.1007/s11235-024-01143-4","DOIUrl":"https://doi.org/10.1007/s11235-024-01143-4","url":null,"abstract":"<p>In this paper, four-element Multiple-Input Multiple-Output (MIMO) antenna system has been proposed for Intelligent Internet of Everything (IIoE) and high-speed data applications. The presented antenna design operates at 4.9 GHz (5G millimeter wave applications) with high isolation in a small size. Defected Microstrip Structure (DMS), slot modification and orthogonal polarization are used to generate the desired frequency band, improve the impedance bandwidth, and enhance the isolation between antenna elements at 4.9 GHz, respectively. Furthermore, the usefulness of the proposed MIMO antenna has been verified by comparing the simulated and the measured results using a fabricated version of the considered 4 × 4 MIMO antenna. In addition, the results indicate a high diversity performance in terms of: Envelope Correlation Coefficient (ECC), Diversity Gain (DG), Efficiency, Gain, Total Active Reflection Coefficient (TARC) and Total Channel Capacity Loss (CCL_Total).</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140559891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimization of WSN localization algorithm based on improved multi-strategy seagull algorithm","authors":"Xiuwu Yu, Yinhao Liu, Yong Liu","doi":"10.1007/s11235-024-01137-2","DOIUrl":"https://doi.org/10.1007/s11235-024-01137-2","url":null,"abstract":"<p>This paper proposes a multi-strategy modified seagull algorithm to optimize DV-Hop localization algorithm (DISO) to improve the precision of non-range-ranging localization algorithm in wireless sensor networks. Firstly, the algorithm analyzes the causes of errors in the positioning of the traditional non-ranging location algorithm DV-Hop, and improves these steps. Among them, the communication area of anchor nodes is divided by different radii, so as to reduce the influence of distance on hop number. The node distribution is stochastic, so the mean square error is used instead of the unbiased estimation, and the weight is introduced to calculate the average jump distance, which reduces the error caused by the random distribution of nodes. Secondly, the objective function optimization method is used to replace the trilateral measurement, and the improved seagull optimization algorithm is used for iterative optimization. Finally, the seagull optimization algorithm is modified in view of its shortcomings. The chaotic mapping was used to initialize the seagull population and increase its diversity. The flight parameters of seagull and the position update methods of the worst and best seagull are improved, and the optimization ability of the algorithm is improved by combining levy flight mechanism and <i>T</i> distribution variation strategy. The simulation results show that the initial population distribution of DISO algorithm is more uniform, which establishes a basic advantage for the subsequent optimization. Keeping the other parameters consistent, DISO algorithm has higher positioning accuracy than other comparison algorithms, no matter changing the number of anchor nodes or the total number of nodes or changing the communication radius. The positioning errors of DISO algorithm are reduced by 45.63%, 17.17%, 22.61% and 11.68% compared with DV-Hop algorithm and other comparison algorithms under different number of anchor nodes. Under different total number of nodes, the positioning error is reduced by 49.91%, 20.81%, 35.80% and 9.20%. Under different communication radius, the positioning error is reduced by 55.47%, 21.07%, 24.84% and 13.11%. It is proved that DISO algorithm has more accurate localization results.</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adaptive thresholds for improved load balancing in mobile edge computing using K-means clustering","authors":"Tahir Maqsood, Sardar Khaliq uz Zaman, Arslan Qayyum, Faisal Rehman, Saad Mustafa, Junaid Shuja","doi":"10.1007/s11235-024-01134-5","DOIUrl":"https://doi.org/10.1007/s11235-024-01134-5","url":null,"abstract":"<p>Mobile edge computing (MEC) has emerged as a promising technology that can revolutionize the future of mobile networks. MEC brings compute and storage capabilities to the edge of the network closer to end-users. This enables faster data processing and improved user experience by reducing latency. MEC has the potential to decrease the burden on the core network by transferring computational and storage responsibilities to the edge, thereby reducing overall network congestion. Load balancing is critical for effectively utilizing the resources of the MEC. This ensures that the workload is distributed uniformly across all of the available resources. Load balancing is a complex task and there are various algorithms that can be used to achieve it, such as round-robin, least connection, and IP hash. To differentiate between heavily loaded and lightly loaded servers, current load balancing methods use an average response time to gauge the load on the edge server. Nevertheless, this approach has lower precision and may result in an unequal distribution of the workload. Our study introduces a dynamic threshold calculation technique that relies on a response-time threshold of the edge servers using K-means clustering. K-means based proposed algorithm classifies the servers in two sets (here K = 2), i.e., overloaded and lightly loaded edge servers. Consequently, workload is migrated from overloaded to lightly loaded servers to evenly distribute the workload. Experimental results show that the proposed technique reduces latency and improves resource utilization.</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140559895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Subchannel selection methods for 3GPP C-V2X networks by considering vehicular mobility","authors":"Meng-Shiuan Pan, Shao-Wei Kao","doi":"10.1007/s11235-024-01138-1","DOIUrl":"https://doi.org/10.1007/s11235-024-01138-1","url":null,"abstract":"<p>The 3GPP vehicle-to-everything (C-V2X) technology is a key solution to provide communication services for applications of intelligent transportation systems (ITS). According to the C-V2X specification, vehicles are allowed to communicate with each other without the help of cellular networks and can select subchannels (i.e. radio resources) by themselves. However, this design will induce subchannel collisions because of the mobility of vehicles. This work aims to relieve the aforementioned problem. We propose a cooperative subchannel selection (CoSS) scheme and a localized subchannel selection (LoSS) scheme, which consider vehicular mobility to prevent subchannel collisions. Based on the collected information, CoSS predicts possible subchannel collisions due to vehicles’ location changes. On the other hand, LoSS avoids subchannel collisions by organizing the usage of subchannels based on vehicles’ relative moving speeds. The simulation results indicate that the proposed schemes can effectively reduce subchannel collision ratio and increase packet delivery ratio for the network.</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Energy-efficient design for green indoor OWC-IoT systems using passive reflective filters and machine learning-assisted quality prediction","authors":"C. Jenila, R. K. Jeyachitra","doi":"10.1007/s11235-024-01139-0","DOIUrl":"https://doi.org/10.1007/s11235-024-01139-0","url":null,"abstract":"<p>This paper presents an energy-efficient design of optical wireless communication (OWC) system for the indoor Internet of Things (IoT) with the assistance of machine learning (ML). A central coordinator (CC) has been proposed to interrogate the IoT devices and control the uplink formations with the prediction of transmission quality using ML classifiers. The passive reflective reflectors (PRF) are utilized in the IoT devices, which replaced the power-consuming active transmitters, formulate the zero-power consuming transmission links. The communication performance of the passive link establishments from the IoT devices have been investigated in terms of quality factor (Q-factor), bit error rate (BER), and signal-to-noise ratio (SNR) under different optical wireless channel conditions and link lengths. The ML classifiers have been evaluated on the prediction of transmission quality, and the results suggested the Euclidean K-nearest neighbor (KNN) with ten number of neighbors for the implementation. The IoT devices located within 1.2 m from the CC require a transmission power of 0.5 mW for links carrying 10 Gbps data, which increases the energy efficiency to 20 Gbps/mW with transmission energy consumption of 0.05 pJ/bit. This significant improvement in energy efficiency and passive communication ensures reliable, and green IoT links suitable for data-intensive indoor applications.\u0000</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"VMRF: revolutionizing military border surveillance with extensive coverage and connectivity","authors":"S. P. Subotha, L. Femila","doi":"10.1007/s11235-024-01125-6","DOIUrl":"https://doi.org/10.1007/s11235-024-01125-6","url":null,"abstract":"<p>Nowadays, wireless sensor networks (WSNs) are utilised in military-based applications like border surveillance. However, existing border surveillance methods have difficulties with energy efficiency, latency, security, connectivity, optimal path selection and coverage. In this paper, a Voronoi Modified Red Fox (VMRF) algorithm is proposed as a solution to these problems. Initially, secure cluster head (CH) selection and clustering is performed using Secure Spatial Intelligence-Enhanced Voronoi Clustering (SIEVC) to boost energy efficiency, security, and extend network coverage and connectivity. The SIEVC algorithm dynamically selects CHs based on past and present trust, identity trust, and energy trust to identify malicious nodes and form optimal clusters for improved network coverage and connectivity. It also employs dynamic cluster size adjustment to maintain proximity between CHs and cluster members and utilizes node alternation to ensure equitable cluster sizes. This approach minimizes energy depletion, enhances network longevity, and improves load balancing. The algorithm introduces a node alternation mechanism to balance cluster sizes and prevent energy holes. This approach ensures secure and efficient CH selection and promotes even energy distribution. Then the proposed modified red fox (MRF) optimization method, based on the fitness metric, computes the energy-efficient and safe path for data transmission. Trust, energy, distance, link quality and traffic intensity are the factors that the fitness function takes into account. Finally, the data is transmitted to the base station (BS) through CH along the path with the highest fitness value. Then the proposed VMRF algorithm is evaluated using the NS-2 platform, and the outcomes are compared with existing protocols. Based on the evaluations, the VMRF algorithm performs better than existing ones in terms of delay, energy consumption, throughput, packet delivery ratio (PDR), malicious node detection ratio, and residual energy.</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"GTIACO: energy efficient clustering algorithm based on game theory and improved ant colony optimization","authors":"Hang Wan, Zhizhuo Qiu, Rui Quan, Michael David, William Derigent","doi":"10.1007/s11235-024-01132-7","DOIUrl":"https://doi.org/10.1007/s11235-024-01132-7","url":null,"abstract":"<p>Recently, wireless sensor networks have been widely used for environmental and structural safety monitoring. However, node batteries cannot be replaced or easily recharged in harsh environments. Maximizing network lifetime remains a challenging issue in designing WSN routing. This paper introduces GTIACO, a novel metaheuristic clustering protocol. It employs an optimal cluster head function to determine cluster number and utilizes game theory for selecting optimal cluster heads. To optimize inter-cluster routing, improved ant colony optimization (ACO) is introduced to construct gathering paths from clusters to the base station. Both blind pathways, pheromone concentration, and angle factors are considered to improve path exploration and transmission efficiency in ant colonies. To assess network performance, various scenarios involving different base station placements and network densities are examined. Experimental results demonstrate GTIACO's superiority over LEACH, ACO, SEP, and PRESPE protocols in network lifetime, stability, energy, and throughput. The proposed GTIACO shows an improvement of at least 4.3% in network lifetime and 32.8% in network throughout. It exhibits superior stability and transmission efficiency across diverse network densities.</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Reduction of the received signal strength variation with distance using averaging over multiple heights and frequencies","authors":"Huthaifa Obeidat, Mohammed Al-Sadoon, Chemseddine Zebiri, Omar Obeidat, Issa Elfergani, Raed Abd-Alhameed","doi":"10.1007/s11235-024-01120-x","DOIUrl":"https://doi.org/10.1007/s11235-024-01120-x","url":null,"abstract":"<p>As a simple and inexpensive channel characteristic, received signal strength (RSS) finds extensive usage in localization applications. However, the quick changes in signal strength impact the localization precision. By averaging over access points (APs) with multiple frequencies and/or heights, this article suggests a novel approach to lowering RSS fluctuation. Initially focused on the plane-earth loss model, the study was later extended to include a multipath indoor propagation scenario that was simulated. We used ray-tracing software to model the indoor propagation situation. This research takes into account the results of three distinct methods for averaging RSS: height averaging, frequency averaging, and hybrid frequency and height (FH) averaging, which combines the two. We discovered that the Height-only strategy considerably decreased the RSS variation with distance for both settings we looked at. Using the frequency-only method even further reduced the variation. Using the Hybrid FH technique greatly enhances the results. Root mean square error values of 4.427 dB, 3.70 dB, and 3.5 dB, respectively, are provided for the averaging approaches and the ideal scenario in which no variance occurs. Another finding is that averaging with APs that have double the height or frequency will not improve the RSS distance variation.</p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Sparsity-aware distributed adaptive filtering with robustness against impulsive noise and low SNR","authors":"","doi":"10.1007/s11235-024-01124-7","DOIUrl":"https://doi.org/10.1007/s11235-024-01124-7","url":null,"abstract":"<h3>Abstract</h3> <p>Distributed inference tasks could be performed by adaptive filtering techniques. Several enhancement strategies for such techniques were proposed, such as sparsity-aware algorithms, coefficients reuse and correntropy-based cost functions in the case of impulsive noise. In this paper, a general framework based on Lagrange multipliers for the derivation of sophisticated algorithms that incorporate most of these improvements is described. A new general identification algorithm is derived as an example of the proposed approach and its performance is assessed in a distributed setting. </p>","PeriodicalId":51194,"journal":{"name":"Telecommunication Systems","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140599508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}