International Journal of Communication Systems最新文献

{"title":"Detection of Selfish Node in Mobile Ad Hoc Network by Adaptive Multi-Serial Cascaded Network","authors":"K. Sudhaakar,&nbsp;K. T. Meena Abarna,&nbsp;E. Mohan","doi":"10.1002/dac.70059","DOIUrl":"https://doi.org/10.1002/dac.70059","url":null,"abstract":"<div>\u0000 \u0000 <p>Nodes are communicated not including the requirement of centralized organization or permanent transportation in mobile ad hoc networks (MANETs). The network topology frequently changes in the network poses several scalability challenges. Hence, an efficient selfish node recognition utilizing deep learning is implemented to overcome these issues. In the MANET topology, the network comprises multiple nodes that are responsible for routing, communication, and data transmission. The selfish nodes refuse to relay information to neighboring nodes. The occurrence of selfish nodes can significantly decrease system performance. This paper investigates certain input node attributes like hop count, residual energy, cooperation history, and co-operation rate, where the system is taken as the target co-operation rate. These considered node attributes are subjected to the adaptive multi-serial cascaded network (AMSCNet) for finding the selfish node present in the system; this network is composed of conditional autoencoder (CAE), deep temporal convolution network (DTCN), and deep capsule network (Deep CapsNet). To evaluate the model's effectiveness, the hyper-parameters in AMSCNet are optimized using hybridized Ebola and gold rush optimizer (HE-GRO) as Ebola optimization strategy (EOS) and gold rush optimizer (GRO). From the result analysis, the investigated HE-GRO-AMSCNet-based selfish node detection model achieved greater precision of 44.59% than CAE, 10.01% than DTCN, 31.27% than Deep_CapNet, and 9.12% than CAE_DTCN_Deep_CapNet. The efficacy of the offered self-node detection organization is compared with several existing systems.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143689245","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":"LEGO-EATO: A Novel Energy-Aware Traffic Obfuscation System for Secure and Efficient Software-Defined Wireless Sensor Networks","authors":"Ummu Sabura Haja Shareef,&nbsp;Sabena Sheik Syed Kasim","doi":"10.1002/dac.70064","DOIUrl":"https://doi.org/10.1002/dac.70064","url":null,"abstract":"<div>\u0000 \u0000 <p>Software-defined networking is a network architecture that centralizes control, enabling more flexible, programmable, and adaptive network management. Various traditional methods struggle to adapt to dynamic network topologies and varying traffic patterns. This paper presents an enhanced traffic obfuscation system for software-defined wireless sensor networks that integrates a Lévy flight–enhanced golf energy-aware traffic obfuscation mechanism to achieve secure and energy-efficient routing. The prominent aim of the proposed methodology is to enhance the network security by obfuscating traffic flows, making it more challenging for attackers to analyze and predict data transmission patterns. Simultaneously, the approach optimizes energy consumption to extend the operational lifetime of sensor networks, which are often constrained by limited power resources. The system implements six strategies: node deployment and SDN management, traffic obfuscation with dummy packets, dynamic topology adjustment for efficient routing, optimized data transmission, energy-aware adaptive routing, and continuous reconfiguration for security against evolving threat. Finally, the experimental findings revealed the effectiveness of the proposed system. In a network with 200 nodes, total energy consumption was reduced by 18%, while traffic obfuscation increased by 27%, leading to a 14% improvement in network lifetime. For a network with 300 nodes, energy consumption was reduced by 22%, and obfuscation improved by 25%, significantly enhancing network security and operational efficiency.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143689576","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 Nonplanar Monopole Antennas With Enhanced Frequency Reduction for Short-Range Wireless Applications","authors":"Enamul Khan,&nbsp;S K. Moinul Haque,&nbsp;MD Ataur Safi Rahaman Laskar","doi":"10.1002/dac.70066","DOIUrl":"https://doi.org/10.1002/dac.70066","url":null,"abstract":"<div>\u0000 \u0000 <p>In this study, we explored three-dimensional configurations comprising a monopole-coupled copper wire S-hook, a cross metallic plate, an intersection cross metallic plate, and a spiral wire spring, with the aim of enhancing lower frequency resonance compared to quarter-wave resonance. The original resonance frequency of the quarter-wave monopole, initially at 2.05 GHz, was significantly reduced by 46.88% through effective coupling with a copper wire S-hook. Coupling the quarter-wave monopole with a cross metallic plate resulted in a noteworthy decrease of 54.59% in resonance frequency, while coupling it with an intersection cross metallic plate led to a substantial decrease of 64.24%. The primary objective of connecting a wired S-hook to metallic plates was to achieve a significantly lower resonance frequency. Additionally, efforts were made to reduce resonance frequency by employing a spiral wire spring, which exhibited a remarkable 84.63% reduction. The −10-dB bandwidth varied among the configurations, with values of 14.63% for the quarter-wave monopole, 24.93% for the monopole coupled with a wire S-hook, 27.96% for the monopole coupled with a cross metallic plate, 33.78% for the monopole coupled with an intersection cross metallic plate, and 4.69% for the monopole coupled with a spiral wire spring. The “Ka” values for the monopole coupled with the copper wire S-hook, cross metallic plate, intersection cross metallic plate, and spiral wire spring were 0.41, 0.35, 0.27, and 0.11, respectively, classifying these antennas as electrically small antennas. The achieved resonant frequencies hold potential applications in various wireless communication scenarios, with experimental results from fabricated prototypes showing good agreement with simulation results.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688972","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":"Multiobjective Fractional Transit Waterwheel Optimization for Energy Efficient CH Selection and Routing","authors":"P. Sachidhanandam,&nbsp;N. Ganesh Kumar,&nbsp;P. S. Baiju,&nbsp;Manoj Kumar Gurudas","doi":"10.1002/dac.70045","DOIUrl":"https://doi.org/10.1002/dac.70045","url":null,"abstract":"<div>\u0000 \u0000 <p>In this research, an effective approach named Fractional Transit Water Wheel Optimization (FTWWO) is introduced for cluster head (CH) selection and routing in wireless sensor networks (WSNs) with mobile sink. Initially, WSN simulation with mobile sink is carried out based on the energy model, mobility model, and link life time (LLT) model. Then, the cluster formation is done by deep embedding clustering (DEC). After that, the CH selection is carried out by using a novel Hybrid Transit Water Wheel Optimization (TWWO) method, based on factors like predicted energy, intracluster and intercluster distances, LLT, trust, and delay. Moreover, the TWWO algorithm is designed by integrating the Transit Search Algorithm (TSA) and the Water Wheel Plant Algorithm (WWPA). Following this, routing is carried out by using a proposed fractional TWWO, by considering the factors that include predicted energy, distance, delay, and trust, in which the energy prediction is performed by the radial basis function networks (RBFNs). The fractional TWWO is developed by combining fractional calculus (FC) with the proposed TWWO. Finally, to enhance network lifespan, energy-efficient data aggregation techniques are applied. Additionally, the proposed method gained a minimum distance of 39.332 m, energy of 0.001 J, latency of 0.547 s, maximum throughput of 35.106 Mbps, and packet delivery rates (PDR) of 81.637%.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688974","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":"Securing 5G Wireless Networks With Advanced Key Management and Authentication for Enhanced Data Protection","authors":"V. Thirunavukkarasu,&nbsp;A. Senthil Kumar,&nbsp;G. Suresh,&nbsp;K. Suganyadevi","doi":"10.1002/dac.70070","DOIUrl":"https://doi.org/10.1002/dac.70070","url":null,"abstract":"<div>\u0000 \u0000 <p>The deployment of 5G technology marks a significant milestone in wireless communication, offering unparalleled speed, low latency, and the capacity to connect billions of devices through the Internet of Things (IoT). However, these advancements introduce considerable security challenges due to the increased complexity and scale of 5G networks, as well as the growing threat landscape. This paper introduces a novel security framework for 5G networks, addressing these challenges with innovative cryptographic and authentication solutions. By integrating elliptic curve cryptography (ECC) with quantum-resistant algorithms, the framework ensures secure key management that is future-proof against emerging threats, including those posed by quantum computing. Furthermore, the hybrid multifactor authentication system, encompassing biometric verification, one-time passwords (OTPs), and mutual authentication, provides a robust defense mechanism against unauthorized access and identity spoofing. Simulation results using NS3 demonstrate the model's superior performance, achieving 99.5% accuracy and low latency of 200 ms, surpassing traditional methods in both security and efficiency. The framework is further designed to withstand common cyberattacks, including man-in-the-middle and replay attacks, ensuring robust protection for critical applications like IoT ecosystems, autonomous vehicles, and smart cities. This comprehensive approach not only enhances data protection and network security but also ensures scalability, adaptability, and energy efficiency, positioning the framework as a critical solution for next-generation communication systems and beyond.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688920","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":"Improved Grasshopper Optimization With Distance Vector Hop Relay Model for Effective NLOS Localization in VANETs","authors":"R. Kaviarasan,&nbsp;A. Ilavendhan,&nbsp;R. Rajakumar,&nbsp;Yu-Chen Hu,&nbsp;Chun-Chi Lo","doi":"10.1002/dac.70063","DOIUrl":"https://doi.org/10.1002/dac.70063","url":null,"abstract":"<div>\u0000 \u0000 <p>Dissemination of emergency messages in vehicular ad hoc networks (VANETs) assists vehicles in determining approaching vehicle speed dynamics and enables drivers to make sound decisions. Factors in the road scenario, such as static and dynamic obstacles, cause the vehicle to receive emergency messages late or to be in non–line of sight (NLOS). Drivers may make poor decisions because of NLOS conditions, resulting in fatal crashes and loss of life. Hop-based approaches, cooperative volunteer protocol, and hardware-based detection approaches have been proposed to avoid this situation. However, many approaches have flaws in terms of detection and cost. This paper presents a bioinspired improved grasshopper metaheuristic approach to detecting NLOS node positions. This method combines the advantages of the distance vector hop method and bioinspired grasshopper to provide better exploration and exploitation in detecting the position of the nodes. The proposed work is superior in terms of emergency message delivery rate, channel usage rate, neighborhood awareness, and mean square error and delay during broadcast. The localization rate is improved by 12%, 18%, and 23% compared to the chosen benchmark approaches.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688973","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":"Sine Cosine–Reptile Search–Based CH Selection and Optimized Routing in WSN-Assisted IoT to Mitigate Hotspot Problem","authors":"Jayabharathi Kannan,&nbsp;Bagirathan Kaliyamurthi,&nbsp;Vijayabhaskar Kannan,&nbsp;Sivasankar Chandrasekaran","doi":"10.1002/dac.70050","DOIUrl":"https://doi.org/10.1002/dac.70050","url":null,"abstract":"<div>\u0000 \u0000 <p>Because of technological advances in the Internet of Things (IoT), IoT surveillance applications powered by wireless sensor networks (WSN) play an important role in spreading dangerous and nonhazardous data. When using such an application, the sensor devices must connect using multihop (Multi-H) communication, which overloads the relay nodes (RNs). This tends to cause hotspot problems and becomes a major problem for network lifetime as the RNs use their power more extensively. To address this issue, the proposed study introduces a novel hybrid-optimized clustering–based routing protocol (HOC-RP) to address the hotspot issues in WSN-enabled IoT. The network is distributed into numerous clusters using the fuzzy K-medoid clustering model (Fuzz-KMC). A new hybrid optimization recognized as the sine cosine–reptile search optimization (SC-RSO) algorithm is employed for optimal CH selection to resolve the hotspot issues in the WSN. In addition, an enhanced gannet optimization algorithm (EGOA) is used to define the optimal route for effective data transmission. The simulation of the HOC-RP model is carried out using the Matlab platform, and the performance is evaluated using different evaluation metrics. As a result, the proposed HOC-RP model has obtained a better network lifetime of 44,768 rounds for scenario 1 and 44,721 rounds for scenario 2 than the existing protocols.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688971","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":"Star Topology–Aware CH Selection and Geographic Routing Using Group Search Chronological Optimizer in MANET","authors":"C. Nallusamy,&nbsp;Uma S.,&nbsp;Selvakumar T.,&nbsp;Kumaravel T.","doi":"10.1002/dac.70055","DOIUrl":"https://doi.org/10.1002/dac.70055","url":null,"abstract":"<div>\u0000 \u0000 <p>A mobile ad hoc network (MANET) is a self-organized network without any constant infrastructure. The topology in MANETs varies often because of the movement of nodes. The maintenance of topology develops an additional overhead, as information regarding the mobility of a single node is distributed with every node in a network. Currently, the researchers designed diverse cluster-enabled approaches to decrease overhead issues in MANET. Moreover, conventional geographic routing (GR) methods in MANET have routing errors owing to inexact position information or dynamic network states. In this research, the Group Search Chronological Optimizer (GSCO) is introduced for cluster head (CH) selection and GR in MANETs. Initially, MANET is simulated, and CH selection is performed considering fitness factors such as energy, trust, delay, distance, data rate, and geographic information. GSCO combines the Group Search Optimizer (GSO) with a chronological concept for effective CH selection. Subsequently, GR is executed using GSCO based on multiobjective parameters like energy, trust factors, data rate, delay, distance, and geographic information–based neighbor list. The performance of GSCO is compared with existing methods like Scalable Geographic Multicast Routing Protocol (SGMRP), adaptive beaconing strategy based on fuzzy logic scheme enabled Greedy Perimeter Stateless Routing (AFB-GPSR), Gray Wolf Optimizer with Firefly algorithm (GWO-FF), and Cluster Trust Adaptive Acknowledgement-MultiObjective Particle Swarm Optimization (CTAA-MPSO). GSCO achieves a maximal data rate of 0.891, energy of 0.704 J, minimal delay of 0.414 ms, and distance of 0.596 m. The proposed GSCO model shows significant energy improvements over SGMRP is 37.93%, AFB-GPSR is 18.75%, GWO-FF is 14.49%, and CTAA-MPSO is 4.26%.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143645934","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":"NOMA-Enabled Underlay Cognitive IoT Networks: Secrecy Energy Efficiency Optimization and Deep Learning-Based Assessment","authors":"P. P. Hema,&nbsp;Babu A V","doi":"10.1002/dac.70060","DOIUrl":"https://doi.org/10.1002/dac.70060","url":null,"abstract":"<div>\u0000 \u0000 <p>Physical layer security (PLS) is a novel approach that has surfaced as an additional security measure for wireless networks, enhancing the existing cryptography-based techniques. The notion of secrecy energy efficiency (SEE) effectively addresses the task of establishing secure and energy-efficient communication in wireless networks. Nonorthogonal multiple access (NOMA)-enabled cognitive Internet-of-Things (IoT) systems have been proposed to enhance spectrum utilization efficiency, connectivity, and quality of service for IoT applications, where IoT devices can function as secondary users (SUs) and take advantage of the spectrum used by primary users (PUs) for communication among themselves or with the Internet. The objective of this paper is to study the SEE performance of NOMA-enabled underlay cognitive radio networks (NOMA-UCRNs) with an external passive eavesdropper. Initially, analytical models are developed to assess the SEE and secrecy sum rate (SSR) of the secondary network in NOMA-UCRN, considering imperfect successive interference cancellation conditions and interference power constraints of the primary receiver. Next, we determine the optimal transmit power allocation (OTPA) for the SUs at the secondary base station that maximizes the SEE while adhering to the requirements of maintaining minimum data rates for the SUs and satisfying the interference constraint on the primary receiver. The OTPA is determined by employing an iterative algorithm based on the Dinkelbach method. It is demonstrated that the proposed OTPA strategy enhances the following: (i) the SEE of the secondary network by 190<i>%</i> and 360<i>%</i> and (ii) the secrecy sum rate by 30<i>%</i> and 95<i>%</i> compared to random transmit power allocation and equal transmit power allocation strategies, respectively. Lastly, a state-of-the-art deep neural network (DNN) framework is devised to achieve precise and rapid prediction of the OTPA, ultimately maximizing the SEE of the NOMA-UCRN under investigation.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143646292","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":"Enhanced Channel Estimation Using Dilated Convolutional LSTM in CRN-IoT Systems","authors":"K. Danesh,&nbsp;Dharani R","doi":"10.1002/dac.70068","DOIUrl":"https://doi.org/10.1002/dac.70068","url":null,"abstract":"<div>\u0000 \u0000 <p>Cognitive Radio Networks (CRN) inside the Internet of Things (IoT) provide dynamic spectrum management, improving communication efficiency through the utilization of underutilized frequency segments. Current deep learning models for channel estimation in cognitive radio networks encounter issues including elevated computing complexity, sluggish adaptability to swiftly changing settings, and limitations in managing the varied characteristics of IoT devices. The Adaptive Skip-based Convolutional Deep-Skip Long Short-Term Memory (AdSk-based ConvD-SkipLSTM) model effectively resolves these challenges by delivering expedited and precise spectrum sensing and channel estimation, hence enhancing overall network performance. The identification of unused spectrum bands is conducted by the energy detection method. Subsequently, channel estimation is executed utilizing the proposed AdSk-based ConvD-SkipLSTM model. The suggested model improves the precision and efficacy of channel estimation, guaranteeing dependable communication. The proposed channel estimation model is evaluated using metrics such as normalized mean square error (NMSE), outage probability, and bit error rate (BER), demonstrating superior performance compared to traditional channel estimation techniques. The proposed method achieved a minimal BER of 1.62E-06 in comparison to current channel estimating techniques.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"38 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688898","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}