Computer Communications最新文献_第6页

Assessing the Impact of the Burst Size in the FTM Ranging Procedure in COTS Wi-Fi Devices 评估 COTS Wi-Fi 设备 FTM 测距程序中突发大小的影响

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107980

Enrica Zola, Israel Martin-Escalona

{"title":"Assessing the Impact of the Burst Size in the FTM Ranging Procedure in COTS Wi-Fi Devices","authors":"Enrica Zola, Israel Martin-Escalona","doi":"10.1016/j.comcom.2024.107980","DOIUrl":"10.1016/j.comcom.2024.107980","url":null,"abstract":"<div><div>The wide availability of the Wi-Fi infrastructure together with the recent integration of the IEEE 802.11mc capability in common-off-the-shelf (COTS) devices, have contributed to increasing the interest of the research community in the fine time measurement (FTM) technique, which allows two Wi-Fi devices to estimate distances between each other. However, one of the main issues yet to be solved is how it scales with an increasing number of Wi-Fi devices injecting location-specific traffic in the shared medium. While the recently released IEEE 802.11az standard will still take time before being integrated in COTS devices, this paper aims at assessing the impact of the burst size on the ranging performance of COTS Wi-Fi Android devices running release 12. While increasing the burst size is expected to bring higher stability in the observed distance, on the other hand a longer transmission period for location-only purposes may jeopardize the transmission of data traffic among Wi-Fi users. Several models of smartphones and APs, and different frequency bands, have been considered in order to evaluate the behavior of the FTM procedure in real devices, showing that not always the newest or most expensive ones perform better. Also, it is shown that using the minimum burst size significantly decreases the performance and it is thus not recommended. While bursts longer than 8 may no be always supported by all the models and/or frequency bands, the small improvements in ranging estimations obtained when they are used do not always justify the increased location traffic injected in the network.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107980"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142571857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Communication-efficient heterogeneous multi-UAV task allocation based on clustering 基于聚类的通信高效异构多无人机任务分配

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107986

Na Dong, Shuai Liu, Xiaoming Mai

{"title":"Communication-efficient heterogeneous multi-UAV task allocation based on clustering","authors":"Na Dong, Shuai Liu, Xiaoming Mai","doi":"10.1016/j.comcom.2024.107986","DOIUrl":"10.1016/j.comcom.2024.107986","url":null,"abstract":"<div><div>The heterogeneous unmanned aerial vehicle (UAV) system aims to achieve higher-level task coordination and execution by integrating UAVs of different types, functionalities, and scales. Addressing the diverse and complex requirements of tasks, the allocation algorithm for decentralized multi-UAV systems often encounters communication redundancy, leading to the issue of excessive communication overhead. This paper proposes a clustering-based Consensus-Based Bundle Algorithm (Clustering-CBBA), which introduces a novel bundle construction, an improved consensus strategy, and a distance-based UAV grouping approach. Specifically, utilizing the k-means++ method based on distance factors, UAVs are initially partitioned into different clusters, breaking down the large-scale problem into smaller ones. Subsequently, the first UAV in each cluster is designated as the leader UAV. The proposed algorithm can handle multi-UAV tasks by improving the task bundle construction method and consensus algorithm. Additionally, intra-cluster UAVs employ an internal conflict resolution method to gather the latest information, while inter-cluster UAVs use an external conflict resolution method to ensure conflict-free task allocation, continuing until the algorithm converges. Experimental results demonstrate that the proposed method, compared to DMCHBA, G-CBBA, and baseline CBBA, significantly reduces communication overhead across different task scales and UAV quantities. Moreover, it maintains ideal performance regarding task completion and global task reward, showcasing higher efficiency and practicality.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107986"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142593858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Achieving manet protection without the use of superfluous fictitious nodes 在不使用多余虚构节点的情况下实现 manet 保护

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-28 DOI: 10.1016/j.comcom.2024.107978

Nadav Schweitzer , Liad Cohen , Tirza Hirst , Amit Dvir , Ariel Stulman

{"title":"Achieving manet protection without the use of superfluous fictitious nodes","authors":"Nadav Schweitzer , Liad Cohen , Tirza Hirst , Amit Dvir , Ariel Stulman","doi":"10.1016/j.comcom.2024.107978","DOIUrl":"10.1016/j.comcom.2024.107978","url":null,"abstract":"<div><div>Mobile ad-hoc networks (<span>manet</span>s) are everywhere. They are the basis for many current technologies (including <span>vanet</span>s, <span>i</span>o<span>t</span>, etc.), and used in multiple domains (including military, disaster zones, etc.). For them to function, routing protocols have been defined, taking into account the high mobility of network nodes. These protocols, however, are vulnerable to devastating attacks. Many solutions have been proposed for various attacks, including <span>dcfm</span> (Denial Contradictions with Fictitious nodes Mechanism) for the node isolation and gray-hole variants. In this work we present a refinement for <span>dcfm</span>, calculate its cost, and compare alternative algorithms. It will be shown that the entire fictitious mechanism is superfluous for some required security level. Examination of the results when under attack show that using <span>dcfm</span>’s contradiction rules alone achieves the best cost-benefit ratio for networks with and without movement. In terms of packet delivery ratio (<span>pdr</span>), however, the proposed algorithm achieves 93% for a 50-node static network, stabilizing on 100% for 90 nodes and above. When movement is present, the success drops to 67%, which is slightly better than the alternatives examined.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"229 ","pages":"Article 107978"},"PeriodicalIF":4.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Supporting critical downlink traffic in LoRaWAN 支持 LoRaWAN 中的关键下行链路流量

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107981

Dimitrios Zorbas, Aruzhan Sabyrbek

引用次数: 0

Editorial special issue: Extended papers from the 18th wireless on-demand Network Systems and Services “WONS 2023” conference 编辑特刊：第 18 届无线按需网络系统与服务 "WONS 2023 "会议的扩展论文

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107988

Renato Lo Cigno, Stefano Basagni, Paolo Casari

引用次数: 0

Special issue of IFIP Networking 2023 IFIP Networking 2023》特刊

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-23 DOI: 10.1016/j.comcom.2024.107987

Mun Choon Chan, Xavier Gelabert, Violet R. Syrotiuk

引用次数: 0

HMLB: Holonic multi-agent approach for preventive controllers load-balancing in SDN-enabled smart grid HMLB：用于 SDN 智能电网中预防性控制器负载平衡的整体多代理方法

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-22 DOI: 10.1016/j.comcom.2024.107984

Marjan Keramati, Sauleh Etemedi, Nasser Mozayani

{"title":"HMLB: Holonic multi-agent approach for preventive controllers load-balancing in SDN-enabled smart grid","authors":"Marjan Keramati, Sauleh Etemedi, Nasser Mozayani","doi":"10.1016/j.comcom.2024.107984","DOIUrl":"10.1016/j.comcom.2024.107984","url":null,"abstract":"<div><div>Smart grid networks present advantages like improving reliability, security, scalability, etc. However, designing an efficient communication infrastructure for smart grid networks is a great challenge. This is because of its dependency on proprietary protocols and specific vendors. Software-defined-enabled smart grid (SDN-SG) tackles this problem by incorporating diverse protocols and standards including open source platforms. One of the most important questions in Software-defined Networking (SDN) is the controller placement problem being NP-Hard in nature. Therefore, the predominant goal of this paper is to diminish the time complexity by modeling the controller placement problem based on the holonic multi-agent system. The hierarchical structure of a holonic organization improves the computational complexity through the divide and conquer mechanism. Such an idea also decreases the distributed controllers' synchronization overhead which is an issue in the realm of SDN. On the other hand, the proper functioning of the smart grid has a strict dependency on time-critical services. Accordingly, the controller placement is supposed to be a Quality of Service-aware (QoS-aware) one. Also, intermittent topology changes in the smart grid and the occasional joining and leaving of members result in an unsteady traffic pattern and dynamicity of controller load. This research is a pioneer in providing a QoS-aware and dynamic controller placement mechanism for SDN-SG. Experimental results certify the preponderance of the approach over similar ones concerning computational complexity, packet loss, controllers’ synchronization overhead, and also load-balancing overhead.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107984"},"PeriodicalIF":4.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142551834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

DAR-DRL: A dynamic adaptive routing method based on deep reinforcement learning DAR-DRL：基于深度强化学习的动态自适应路由方法

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-22 DOI: 10.1016/j.comcom.2024.107983

Zheheng Rao , Yanyan Xu , Ye Yao , Weizhi Meng

{"title":"DAR-DRL: A dynamic adaptive routing method based on deep reinforcement learning","authors":"Zheheng Rao , Yanyan Xu , Ye Yao , Weizhi Meng","doi":"10.1016/j.comcom.2024.107983","DOIUrl":"10.1016/j.comcom.2024.107983","url":null,"abstract":"<div><div>Mobile-centric wireless networks offer users a diverse range of services and experiences. However, existing intelligent routing methods often struggle to make suitable routing decisions during dynamic network changes, significantly limiting transmission performance. This paper proposes a dynamic adaptive routing method based on Deep Reinforcement Learning (DAR-DRL) to effectively address these challenges. First, to accurately model network state information in complex and dynamically changing routing tasks, we introduce a link-aware graph learning model (LA-GNN) that efficiently senses network information of varying structures through a hierarchical aggregated message-passing neural network. Second, to ensure routing reliability in dynamic environments, we design a hop-by-hop routing strategy featuring a large acceptance domain and a reliability guarantee reward function. This mechanism adaptively avoids routing holes and loops across various network scenarios while enhancing the robustness of routing under dynamic conditions. Experimental results demonstrate that the proposed DAR-DRL method achieves the network routing task with shorter end-to-end delays, lower packet loss rates, and higher throughput compared to existing mainstream methods across common dynamic network scenarios, including cases with dynamic traffic variations, random link failures (small topology changes), and significant topology alterations.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107983"},"PeriodicalIF":4.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A machine learning approach to forecast 5G metrics in a commercial and operational 5G platform: 5G and mobility 预测商用和运营 5G 平台中 5G 指标的机器学习方法：5G 和移动性

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-21 DOI: 10.1016/j.comcom.2024.107974

Ana Almeida , Pedro Rito , Susana Brás , Filipe Cabral Pinto , Susana Sargento

{"title":"A machine learning approach to forecast 5G metrics in a commercial and operational 5G platform: 5G and mobility","authors":"Ana Almeida , Pedro Rito , Susana Brás , Filipe Cabral Pinto , Susana Sargento","doi":"10.1016/j.comcom.2024.107974","DOIUrl":"10.1016/j.comcom.2024.107974","url":null,"abstract":"<div><div>The demand for more secure, available, reliable, and fast networks emerges in a more interconnected society. In this context, 5G networks aim to transform how we communicate and interact. However, studies using 5G data are sparse since there are only a few number of publicly available 5G datasets (especially about commercial 5G network metrics with real users).</div><div>In this work, we analyze the data of a commercial 5G deployment with real users, and propose forecasting techniques to help understand the trends and to manage 5G networks. We propose the creation of a metric to measure the traffic load. We forecast the metric using several machine learning models, and we choose LightGBM as the best approach. We observe that this approach obtains results with a good accuracy, and better than other machine learning approaches, but its performance decreases if the patterns contain unexpected events. Taking advantage of the lower accuracy in the performance, this is used to detect changes in the patterns and manage the network in real-time, supporting network resource elasticity by generating alarms and automating the scaling during these unpredictable fluctuations.</div><div>Moreover, we introduce mobility data and integrate it with the previously traffic load metric, understanding its correlation and the prediction of 5G metrics through the use of the mobility data. We show again that LightGBM is the best model in predicting both types of 5G handovers, intra- and inter-gNB handovers, using the mobility information through Radars in the several roads, and lanes, near the 5G cells.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107974"},"PeriodicalIF":4.5,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142526129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Proactive Scheduling for mmWave Wireless LANs 毫米波无线局域网的主动调度

IF 4.5 3区计算机科学

Computer Communications Pub Date : 2024-10-20 DOI: 10.1016/j.comcom.2024.107979

Ang Deng , Douglas M. Blough

{"title":"Proactive Scheduling for mmWave Wireless LANs","authors":"Ang Deng , Douglas M. Blough","doi":"10.1016/j.comcom.2024.107979","DOIUrl":"10.1016/j.comcom.2024.107979","url":null,"abstract":"<div><div>To cope with growing wireless bandwidth demand, millimeter wave (mmWave) communication has been identified as a promising technology to deliver Gbps throughput. However, due to the susceptibility of mmWave signals to blockage, applications can experience significant performance variability as users move around due to rapid and significant variation in channel conditions. In this context, proactive schedulers that make use of future data rate prediction have potential to bring a significant performance improvement as compared to traditional schedulers. In this work, we explore the possibility of proactive scheduling that uses mobility prediction and some knowledge of the environment to predict future channel conditions. We present both an optimal proactive scheduler, which is based on an integer linear programming formulation and provides an upper bound on proactive scheduling performance, and a greedy heuristic proactive scheduler that is suitable for practical implementation. Extensive simulation results show that proactive scheduling has the potential to increase average user data rate by up to 35% over the classic proportional fair scheduler without any loss of fairness and incurring only a small increase in jitter. The results also show that the efficient proactive heuristic scheduler achieves from 60% to 75% of the performance gains of the optimal proactive scheduler. Finally, the results show that proactive scheduling performance is sensitive to the quality of mobility prediction and, thus, use of state-of-the-art mobility prediction techniques will be necessary to realize its full potential.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107979"},"PeriodicalIF":4.5,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142552126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0