Computer NetworksPub Date : 2024-09-23DOI: 10.1016/j.comnet.2024.110820
{"title":"Jamming avoidance trajectory planning and load balancing user association in mmWave UAV-assisted HetECN","authors":"","doi":"10.1016/j.comnet.2024.110820","DOIUrl":"10.1016/j.comnet.2024.110820","url":null,"abstract":"<div><div>Emergency communication network (ECN) can provide fast, efficient and high-capacity communication services for specific areas by using mmWave transmission and unmanned aerial vehicles (UAVs) serving as aerial base stations (ABSs) or relay nodes. Now, in order to satisfy diverse demands, ECN should support different types of nodes, access methods, and traffic distributions, which is referred to as heterogeneous ECN (HetECN). Therefore, inappropriate trajectory planning and unbalanced traffic loading can lead to UAV flight collisions and network congestion. In this article, we jointly optimize UAV jamming avoidance trajectory and user association strategy aimed to load balancing, to maximize the utilization of HetECN. Specifically, an improved artificial potential field (APF) method along with mmWave beam forming technology is used to obtain the jamming avoidance trajectory of UAVs, and the optimal deployment location of UAVs are determined based on the distribution of ground users (GUs). Subsequently, the matching game and alliance game are comprehensively used to determine the load balancing based GU-UAV associated strategy under various GU demands, thereby ensuring traffic load balancing and resource optimization allocation. In addition, altitude fine-tuning have been made to further power consumption, thereby improving overall network efficiency. Simulation results demonstrate that the proposed method can achieve the expected performance in network utilities such as coverage rate, network capacity, load balancing effect of mmWave UAV-assisted HetECNs.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-23DOI: 10.1016/j.comnet.2024.110827
{"title":"Towards coordinating self-healing instances: Policy-based and non-cooperative game theory-based approaches with location awareness","authors":"","doi":"10.1016/j.comnet.2024.110827","DOIUrl":"10.1016/j.comnet.2024.110827","url":null,"abstract":"<div><div>Self-healing is an essential functionality in Self-Organizing cellular Network (SON). It aims to ensure service continuity by detecting, diagnosing, and compensating network outage after triggering appropriate Cell Outage Compensation (COC) functions according to the outage case. The role of self-healing is increasingly become indispensable, especially in high density network as in 5 G and beyond, in order to maintain the availability and retainability of mobile service and save revenues. However, the essence of COC entails modifications of different Network Control Parameters (NCP) which are under control of SON Functions (SONF) that are related to other self-x functionalities. In addition, it can request different types of compensation functions according to the outage case. Moreover, it requires to harmonize the objectives of the requested stand-alone SONFs over the involved Candidate Cells (CC) in order to re-build a consistent coverage model. Thus, the need for self-coordination is mandatory to guarantee conflict-free outage compensation procedure. In this paper, we propose a novel integrated coordination scheme in order to coordinate Antenna Tilt (AT)-based and Transmission Power (TXP)-based COC functions. Beside their primary targets of conflict avoidance and resolution, we prove that our location-aware coordination mechanisms, which are based on policies and Non-Cooperative Zero-Sum Game (NCZSG) theory, can collaboratively guide greedy stand-alone single-objective COC functions to reach a stable coverage model. The coordination is done even when there is no prior knowledge of the environment or the compensatory algorithms themselves. The choice of optimal Network Control Parameters Values (NCV) is determined according to the function after the coordinator's verification.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142419310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-20DOI: 10.1016/j.comnet.2024.110817
{"title":"Fault-tolerant topology construction and down-link rate maximization in air-ground integrated networks","authors":"","doi":"10.1016/j.comnet.2024.110817","DOIUrl":"10.1016/j.comnet.2024.110817","url":null,"abstract":"<div><div>Due to the advantages in flexible deployment, fast communication recovery and high quality of service (QoS), unmanned aerial vehicles (UAVs) have been widely used in wireless communications and networking. However, existing works have not sufficiently solved the problem of reliable and survivable connectivity of UAV networks. In this paper, we investigate the deployment of multiple UAVs, cooperating with a ground mobile station (GMS), to provide wireless coverage for ground users. Under the constraints of satisfying different QoS of users and the resource limitation of UAVs, our aim is to minimize the number of deployed UAVs and maximize the sum down-link rate of all users. In order to ensure the survivability of the deployed UAV networks, we also constraint that each UAV has at least two disjoint paths to GMS to form a fault-tolerant topology. Unfortunately, the formulate problem is intractable and cannot be solved directly. To solve this problem, we decouple the original problem into two subproblems: (1) minimized fault-tolerant topology construction concerning user demands; (2) maximized down-link rate with access policy optimization. Then, we propose a heuristic link-cost minimization method and a potential-game-based user rate maximization method to solve the two subproblems, respectively. The effectiveness of the solution is validated through simulations. Meanwhile, ours also outperforms some baselines in minimized UAVs, down-link transmission rate as well as running time.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-20DOI: 10.1016/j.comnet.2024.110809
{"title":"Line rate botnet detection with SmartNIC-embedded feature extraction","authors":"","doi":"10.1016/j.comnet.2024.110809","DOIUrl":"10.1016/j.comnet.2024.110809","url":null,"abstract":"<div><div>Botnets pose a significant threat in network security, exacerbated by the massive adoption of vulnerable Internet-of-Things (IoT) devices. In response to that, great research effort has taken place to propose intrusion detection solutions to the botnet menace. As most techniques focus on either packet or flow granularity, port-based analysis can help detecting newly developed botnets, especially during their early propagation phase. In this paper, we introduce a line rate distributed anomaly detection system that employs NetFPGA Smart-Network Interface Cards (SmartNIC) as programmable switches. Per-port feature extraction modules are deployed directly on the data plane, enabling a centralized controller to periodically retrieve collected metrics, and feed them to a botnet detection algorithm we refine from the state of the art. We evaluate our system using real world traces spanning several months from 2016 and 2023. We show how our solutions allow keeping low the number of anomalies detected, retaining only the most relevant ones, thanks to the distributed monitoring approach that helps discriminating systemic changes from local phenomena. Furthermore, we provide an analysis of the most significant alerts, accounting for the limited ground-truth on the dataset.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142319861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-19DOI: 10.1016/j.comnet.2024.110814
{"title":"Protecting unauthenticated messages in LTE/5G mobile networks: A two-level Hierarchical Identity-Based Signature (HIBS) solution","authors":"","doi":"10.1016/j.comnet.2024.110814","DOIUrl":"10.1016/j.comnet.2024.110814","url":null,"abstract":"<div><div>As an essential public infrastructure, the security and reliability of mobile networks have a profound impact on people’s production and life. Although the security of LTE/5G networks has been improved a lot with the evolution of standards, there are still some unprotected messages being transmitted between the cellular network and device due to the symmetric key-based security architecture and the trade-off between security and other criteria like network availability. By exploiting these messages, various security attacks have been proposed and demonstrated against commercial mobile networks and devices in existing literature, such as user location tracking, bidding-down, and DoS attacks. To address this security issue, in this paper, we aim to protect these unauthenticated messages in mobile networks using digital signatures. Based on the idea of Hierarchical Identity-Based Signature (HIBS) in existing work, we analyse and design a two-level HIBS solution in detail in terms of different aspects such as keys generation and provisioning procedures, replay mitigation, and cell selection. Unlike previous work, our proposed solution also supports the protection of individual vulnerable RRC and NAS layer signalling in addition to authenticating the base station. We evaluated the efficiency and feasibility of several existing HIBS schemes and implemented the most efficient one in the 5G standalone network setup using open-source software. The implementation results further proved the feasibility of the solution in practice.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142312481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-19DOI: 10.1016/j.comnet.2024.110794
{"title":"On the aggregation of FIBs at ICN routers using routing strategy","authors":"","doi":"10.1016/j.comnet.2024.110794","DOIUrl":"10.1016/j.comnet.2024.110794","url":null,"abstract":"<div><p>Utilizing in-network caching is essential for the current communication network. In the last decade, ICN (Information-Centric Networking) has been under the spotlight as a network that mainly focuses on transmitted and received data rather than on hosts that transmit and receive data. In ICNs, to appropriately forward request packets, a router maintains a routing table called FIB (Forwarding Information Base). However, it is unsuitable for us to assume that FIB can store entries of all contents within a network. This is mainly because the FIB memory is not large enough to store the prefix of all contents. Thus, for realizing global-scale ICNs, it is crucial to develop an effective technique to reduce the size of FIB. In this paper, to tackle the reduction in the FIB size with the aggregation, we propose a routing strategy called <em>constrained shortest-path tree (CSPT) routing</em>. The fundamental idea of our CSPT routing is to combine shortest-paths on the network and that on a shortest-path tree of the network, which is intended to enhance the effect of FIB aggregation. Furthermore, we extensively investigate the relationship, i.e., trade-off, between the FIB aggregation and the communication performance of ICN using CSPT routing. Consequently, we reveal that our CSPT routing can dramatically reduce the number of FIB entries while suppressing the increase in the number of hops required to deliver request packets.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142274082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-19DOI: 10.1016/j.comnet.2024.110793
{"title":"SD-MDN-TM: A traceback and mitigation integrated mechanism against DDoS attacks with IP spoofing","authors":"","doi":"10.1016/j.comnet.2024.110793","DOIUrl":"10.1016/j.comnet.2024.110793","url":null,"abstract":"<div><p>Traceback has been very attractive against DDoS attacks with IP spoofing instead of traditional mitigation methods because attacks require removal near attackers, resulting in affecting legitimate traffic as little as possible. There have been some approaches dedicated to achieving effective traceback. However, existing approaches often modify protocols to apply to multi-domain scenarios, and the implemented mitigation usually lags behind traceback. Therefore, this paper proposes the Software-Defined Multi-Domain Network Tracer and Mitigator (SD-MDN-TM) to traceback and mitigate DDoS attacks with IP spoofing in multi-domain SDN scenarios. We apply systematic sampling and flow feature extraction based on the Count-Min Sketch data structure for the lightweight statistics collection of massive DDoS attack traffic. We also design the TracebackTree data structure to construct the traceback paths of attackers of distributed attack sources. The Border Switch Trigger Mechanism is proposed to overcome the drawbacks of the commonly-used packet marking in cross-domain traceback information transfer, achieving no modification of existing network protocols and independent traceback among multiple domains. Mitigation is integrated with traceback for faster removal of attacks from the network. The proposed scheme can traceback DDoS attack sources both inside and outside domains accurately and effectively by constructing traceback path. It can be implemented without modifying the existing protocols, therefore achieving direct application to the existing network architecture. Furthermore, the traceback of attack sources outside domains can maintain independence in multi-domain scenarios. Mitigation integrated with traceback can achieve less impact on legitimate traffic and faster removal of attacks from the network.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142274081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-19DOI: 10.1016/j.comnet.2024.110811
{"title":"An efficient beam sweeping scheme with backup paging occasions in NR-Unlicensed Spectrum","authors":"","doi":"10.1016/j.comnet.2024.110811","DOIUrl":"10.1016/j.comnet.2024.110811","url":null,"abstract":"<div><div>With the increasing demand of user applications and the shortage of cellular spectrum, New Radio (NR) access to Unlicensed Spectrum (NR-U) is getting significant attention. Listen Before Talk (LBT) procedure is used to sense unlicensed channel availability prior to transmission. The transmissions are subjected to LBT procedure failure, which brings extra delay as they are postponed to the next available transmission opportunity. This excess delay also affects time-critical procedures, such as paging. The directional communication in NR requires beamforming, which further complicates paging procedure as additional paging message transmissions are needed to cover all the beams. In this work, we propose an NR-U paging mechanism (called <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span>) consisting of Full and Fast Paging Cycles with Backup Paging Occasions (POs). Full Paging uses a normal NR-U paging cycle and broadcasts a paging message on all the beams. On the other hand, Fast Paging, which targets delay-sensitive mobile users, uses a shorter paging cycle and broadcasts a paging message on selected beams only. The Backup POs deal with LBT procedure failure impairments while paging broadcast on selective beams reduces paging resource usage. We analyze <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span> using a discrete-time semi-Markov chain model and validate the model by extensive simulations. The simulation results show that <span><math><mrow><mi>F</mi><mi>F</mi><mtext>_</mtext><mi>B</mi><mi>P</mi></mrow></math></span> outperforms several baseline mechanisms in terms of average paging delay and paging resource usage.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142319860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-19DOI: 10.1016/j.comnet.2024.110815
{"title":"NDN multicast over wireless networks: A survey on fundamentals, challenges, and open issues","authors":"","doi":"10.1016/j.comnet.2024.110815","DOIUrl":"10.1016/j.comnet.2024.110815","url":null,"abstract":"<div><div>Wireless devices have shown remarkable growth in data demand in the last decade due to the proliferation of smart devices and the emergence of bandwidth-hungry applications. This increasing data traffic demand is overcrowding the radio frequency spectrum, leading wireless multicast schemes to become a popular research topic again, as they provide efficient data dissemination. NDN supports multicast communication by design. It is a networked system formed by named entities that adopt a communication model focusing on the content rather than its location. The architecture follows a receiver-driven communication model through which content consumers retrieve data through semantically meaningful names instead of specific destinations. Its properties are essential for multicast communication on ad hoc networks, as its features provide enhanced support for dynamic topologies, decentralized control, and the self-organization of participant nodes that communicate without needing a pre-existing network infrastructure. However, despite the wireless medium being broadcast by nature, NDN multicast is still challenging in wireless scenarios, especially in ad hoc environments, due to the node’s high mobility, link instability, constant handovers, and data transmission over a shared medium. Hence, this survey discusses the benefits of NDN for mobile scenarios through an in-depth analysis of NDN multicast features, focusing on fundamentals, challenges, and open issues when applied to wireless networking.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142315330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computer NetworksPub Date : 2024-09-19DOI: 10.1016/j.comnet.2024.110813
{"title":"Leveraging tabular GANs for malicious address classification in ethereum network","authors":"","doi":"10.1016/j.comnet.2024.110813","DOIUrl":"10.1016/j.comnet.2024.110813","url":null,"abstract":"<div><div>The popularity of ethereum for cryptocurrency transactions attracts malicious actors to engage in illegal activities like phishing, ponzi, and gambling. Previous studies have focused mainly on phishing due to the large number of phishing addresses. However, there is no work done on ponzi or gambling classification due to the limited availability of these addresses, which makes their classification more challenging. In this paper, we propose a machine learning (ML) based method for classifying malicious addresses in ethereum, with a specific focus on phishing, ponzi, and gambling addresses. We use a selective upsampling technique through the tabular generative adversarial network (GAN) to solve limited data problems. We perform not only binary but also multiclass classification on various feature extraction methods, including Trans2Vec and Node2Vec, using Ethereum transactional data. We evaluate our method on <span><math><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> score, precision, recall, and accuracy. Our results show that the proposed method is effective in ponzi and gambling detection when compared with the state-of-the-art.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142419360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}