首页 > 最新文献

Ad Hoc Networks最新文献

英文 中文
Multi-stage deep learning-based intrusion detection system for automotive Ethernet networks 基于多级深度学习的汽车以太网入侵检测系统
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-16 DOI: 10.1016/j.adhoc.2024.103548
Luigi F. Marques da Luz , Paulo Freitas de Araujo-Filho , Divanilson R. Campelo

Modern automobiles are increasing the demand for automotive Ethernet as a high-bandwidth and flexible in-vehicle network technology. However, since Ethernet does not have native support for authentication or encryption, intrusion detection systems (IDSs) are becoming an attractive security mechanism to detect malicious activities that may affect Ethernet-based communication in cars. This paper proposes a novel multi-stage deep learning-based intrusion detection system to detect and classify cyberattacks in automotive Ethernet networks. The first stage uses a Random Forest classifier to detect cyberattacks quickly. The second stage, on the other hand, uses a Pruned Convolutional Neural Network that minimizes false positive rates while classifying different types of cyberattacks. We evaluate our proposed IDS using two publicly available automotive Ethernet intrusion datasets. The experimental results show that our proposed solution detects cyberattacks with a similar detection rate and a faster detection time compared to other state-of-the-art baseline automotive Ethernet IDSs.

作为一种高带宽、灵活的车载网络技术,现代汽车对车载以太网的需求与日俱增。然而,由于以太网不支持本机认证或加密,入侵检测系统(IDS)正成为一种有吸引力的安全机制,用于检测可能影响基于以太网的汽车通信的恶意活动。本文提出了一种基于深度学习的新型多阶段入侵检测系统,用于检测和分类汽车以太网网络中的网络攻击。第一阶段使用随机森林分类器快速检测网络攻击。第二阶段则使用剪枝卷积神经网络,在对不同类型的网络攻击进行分类的同时将误报率降至最低。我们使用两个公开的汽车以太网入侵数据集对我们提出的 IDS 进行了评估。实验结果表明,与其他最先进的基线汽车以太网 IDS 相比,我们提出的解决方案能以相似的检测率和更快的检测时间检测到网络攻击。
{"title":"Multi-stage deep learning-based intrusion detection system for automotive Ethernet networks","authors":"Luigi F. Marques da Luz ,&nbsp;Paulo Freitas de Araujo-Filho ,&nbsp;Divanilson R. Campelo","doi":"10.1016/j.adhoc.2024.103548","DOIUrl":"10.1016/j.adhoc.2024.103548","url":null,"abstract":"<div><p>Modern automobiles are increasing the demand for automotive Ethernet as a high-bandwidth and flexible in-vehicle network technology. However, since Ethernet does not have native support for authentication or encryption, intrusion detection systems (IDSs) are becoming an attractive security mechanism to detect malicious activities that may affect Ethernet-based communication in cars. This paper proposes a novel multi-stage deep learning-based intrusion detection system to detect and classify cyberattacks in automotive Ethernet networks. The first stage uses a Random Forest classifier to detect cyberattacks quickly. The second stage, on the other hand, uses a Pruned Convolutional Neural Network that minimizes false positive rates while classifying different types of cyberattacks. We evaluate our proposed IDS using two publicly available automotive Ethernet intrusion datasets. The experimental results show that our proposed solution detects cyberattacks with a similar detection rate and a faster detection time compared to other state-of-the-art baseline automotive Ethernet IDSs.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141025751","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
Factor graph-based deep reinforcement learning for path selection scheme in full-duplex wireless multihop networks 基于因子图的全双工无线多跳网络路径选择方案深度强化学习
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-09 DOI: 10.1016/j.adhoc.2024.103542
Zhihan Cui, Yuto Lim, Yasuo Tan

A wireless multihop network (WMN) is set of wirelessly connected nodes without an aid of centralized infrastructure that can forward any packets via intermediate nodes by a multihop fashion. In the WMN, there are still some issues that need to be resolved, like due to any source node may choose an uncertainty path to send their packets through the multihop fashion and this leads to the performance of network capacity can degrade drastically. To solve this problem, in this research, we propose two novel path selection algorithms called SNR-based learning path selection (NLPS) algorithm and SINR-based learning path selection (INLPS) algorithm, which are incorporated with the deep reinforcement learning (DRL) to select the best multihop path from any source node to a destination node with highest end-to-end (E2E) throughput. Besides that, a factor graph (FG) approach and a nested lattice code (NLC) representation are used to reduce the computation time. According to the numerical studies with the NLC is applied, our simulation results reveal that the proposed NLPS and INLPS algorithms can improve the overall average network capacity up to 3.1 times and 10.5 times compared to FG, respectively. However, the overall average computation time are highly increased for NLPS and INLPS, i.e., about 0.627 s and 1.221 s, respectively compared to FG, which is about 0.006 s. In other words, both NLPS and INLPS algorithms can achieve high network capacity and moderate computation time.

无线多跳网络(WMN)是一组无线连接的节点,无需借助集中式基础设施,可以通过中间节点以多跳方式转发任何数据包。在 WMN 中,仍有一些问题需要解决,如由于任何源节点都可能选择不确定的路径通过多跳方式发送数据包,从而导致网络容量性能急剧下降。为解决这一问题,本研究提出了两种新型路径选择算法,即基于信噪比的学习路径选择(NLPS)算法和基于信噪比的学习路径选择(INLPS)算法,这两种算法与深度强化学习(DRL)相结合,可选择从任意源节点到目的节点的最佳多跳路径,并获得最高的端到端(E2E)吞吐量。此外,还使用了因子图(FG)方法和嵌套网格代码(NLC)表示法来减少计算时间。根据应用 NLC 的数值研究,我们的仿真结果表明,与 FG 算法相比,所提出的 NLPS 和 INLPS 算法可将整体平均网络容量分别提高 3.1 倍和 10.5 倍。但是,NLPS 和 INLPS 算法的整体平均计算时间却大幅增加,与 FG 算法相比分别增加了约 0.627 秒和 1.221 秒,而 FG 算法的整体平均计算时间约为 0.006 秒。
{"title":"Factor graph-based deep reinforcement learning for path selection scheme in full-duplex wireless multihop networks","authors":"Zhihan Cui,&nbsp;Yuto Lim,&nbsp;Yasuo Tan","doi":"10.1016/j.adhoc.2024.103542","DOIUrl":"https://doi.org/10.1016/j.adhoc.2024.103542","url":null,"abstract":"<div><p>A wireless multihop network (WMN) is set of wirelessly connected nodes without an aid of centralized infrastructure that can forward any packets via intermediate nodes by a multihop fashion. In the WMN, there are still some issues that need to be resolved, like due to any source node may choose an uncertainty path to send their packets through the multihop fashion and this leads to the performance of network capacity can degrade drastically. To solve this problem, in this research, we propose two novel path selection algorithms called SNR-based learning path selection (NLPS) algorithm and SINR-based learning path selection (INLPS) algorithm, which are incorporated with the deep reinforcement learning (DRL) to select the best multihop path from any source node to a destination node with highest end-to-end (E2E) throughput. Besides that, a factor graph (FG) approach and a nested lattice code (NLC) representation are used to reduce the computation time. According to the numerical studies with the NLC is applied, our simulation results reveal that the proposed NLPS and INLPS algorithms can improve the overall average network capacity up to 3.1 times and 10.5 times compared to FG, respectively. However, the overall average computation time are highly increased for NLPS and INLPS, i.e., about 0.627 s and 1.221 s, respectively compared to FG, which is about 0.006 s. In other words, both NLPS and INLPS algorithms can achieve high network capacity and moderate computation time.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1570870524001537/pdfft?md5=9b9830eb5843b9e00111ce0e43e3db17&pid=1-s2.0-S1570870524001537-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140951968","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
A federated learning-based zero trust intrusion detection system for Internet of Things 基于联合学习的物联网零信任入侵检测系统
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-09 DOI: 10.1016/j.adhoc.2024.103540
Danish Javeed , Muhammad Shahid Saeed , Muhammad Adil , Prabhat Kumar , Alireza Jolfaei

The rapid expansion of Internet of Things (IoT) devices presents unique challenges in ensuring the security and privacy of interconnected systems. As cyberattacks become more frequent, developing an effective and scalable Intrusion Detection System (IDS) based on Federated Learning (FL) for IoT becomes increasingly complex. Current methodologies struggle to balance spatial and temporal feature extraction, especially when dealing with dynamic and evolving cyber threats. The lack of diversity in datasets used for FL-based IDS evaluations further impedes progress. There is also a noticeable tradeoff between performance and scalability, particularly as the number of edge devices in communication increases. To address these challenges, this article introduces a horizontal FL model that combines Convolutional Neural Networks (CNN) and Bidirectional Long-Term Short Memory (BiLSTM) for effective intrusion detection. This hybrid approach aims to overcome the limitations of existing methods and enhance the effectiveness of intrusion detection in the context of FL for IoT. Specifically, CNN is used for spatial feature extraction, enabling the model to identify local patterns indicative of potential intrusions, while the BiLSTM component captures temporal dependencies and learns sequential patterns within the data. The proposed IDS follows a zero-trust model by keeping the data on local edge devices and sharing only the learned weights with the centralized FL server. The FL server then aggregates updates from various sources to optimize the accuracy of the global learning model. Experimental results using CICIDS2017 and Edge-IIoTset demonstrate the effectiveness of the proposed approach over centralized and federated deep learning-based IDS.

物联网(IoT)设备的快速发展为确保互联系统的安全和隐私带来了独特的挑战。随着网络攻击日益频繁,为物联网开发基于联合学习(FL)的有效且可扩展的入侵检测系统(IDS)变得越来越复杂。当前的方法很难在空间和时间特征提取之间取得平衡,尤其是在应对动态和不断变化的网络威胁时。用于基于 FL 的 IDS 评估的数据集缺乏多样性,这进一步阻碍了进展。此外,性能和可扩展性之间也存在明显的权衡,尤其是当通信中的边缘设备数量增加时。为了应对这些挑战,本文介绍了一种水平 FL 模型,该模型结合了卷积神经网络(CNN)和双向长期短时记忆(BiLSTM),可用于有效的入侵检测。这种混合方法旨在克服现有方法的局限性,提高物联网 FL 背景下入侵检测的有效性。具体来说,CNN 用于空间特征提取,使模型能够识别表明潜在入侵的局部模式,而 BiLSTM 组件则捕捉时间依赖性并学习数据中的顺序模式。拟议的 IDS 采用零信任模式,将数据保存在本地边缘设备上,只与集中式 FL 服务器共享学习到的权重。然后,FL 服务器汇总来自不同来源的更新,以优化全局学习模型的准确性。使用 CICIDS2017 和 Edge-IIoTset 的实验结果表明,建议的方法比集中式和联合式基于深度学习的 IDS 更有效。
{"title":"A federated learning-based zero trust intrusion detection system for Internet of Things","authors":"Danish Javeed ,&nbsp;Muhammad Shahid Saeed ,&nbsp;Muhammad Adil ,&nbsp;Prabhat Kumar ,&nbsp;Alireza Jolfaei","doi":"10.1016/j.adhoc.2024.103540","DOIUrl":"10.1016/j.adhoc.2024.103540","url":null,"abstract":"<div><p>The rapid expansion of Internet of Things (IoT) devices presents unique challenges in ensuring the security and privacy of interconnected systems. As cyberattacks become more frequent, developing an effective and scalable Intrusion Detection System (IDS) based on Federated Learning (FL) for IoT becomes increasingly complex. Current methodologies struggle to balance spatial and temporal feature extraction, especially when dealing with dynamic and evolving cyber threats. The lack of diversity in datasets used for FL-based IDS evaluations further impedes progress. There is also a noticeable tradeoff between performance and scalability, particularly as the number of edge devices in communication increases. To address these challenges, this article introduces a horizontal FL model that combines Convolutional Neural Networks (CNN) and Bidirectional Long-Term Short Memory (BiLSTM) for effective intrusion detection. This hybrid approach aims to overcome the limitations of existing methods and enhance the effectiveness of intrusion detection in the context of FL for IoT. Specifically, CNN is used for spatial feature extraction, enabling the model to identify local patterns indicative of potential intrusions, while the BiLSTM component captures temporal dependencies and learns sequential patterns within the data. The proposed IDS follows a zero-trust model by keeping the data on local edge devices and sharing only the learned weights with the centralized FL server. The FL server then aggregates updates from various sources to optimize the accuracy of the global learning model. Experimental results using CICIDS2017 and Edge-IIoTset demonstrate the effectiveness of the proposed approach over centralized and federated deep learning-based IDS.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1570870524001513/pdfft?md5=ce7346cd6f957b06bddd591858574f96&pid=1-s2.0-S1570870524001513-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141041402","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
A dynamic pricing scheme for secure offloading and resource allocation based on the internet of vehicles 基于车联网的安全卸载和资源分配动态定价方案
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-09 DOI: 10.1016/j.adhoc.2024.103545
Jianbin Xue, Jia Yao, Jiahao Wang

With the development of sixth-generation (6G) wireless communication technology, billions of vehicles will access the network in the future, and the number of vehicle applications and user data will also increase dramatically. Traditional cloud computing faces serious problems of latency and energy consumption in handling massive data. Mobile edge computing (MEC) has emerged to dramatically improve computing efficiency and reduce energy consumption by placing computing servers at network edge locations close to vehicles. However, the service range of MEC servers is limited and cannot fully satisfy user requirements. In addition, the task offloading process has security risks. The current research focuses on how to reduce the energy consumption and latency overhead of task offloading and neglects the economic cost or data transmission security of vehicles. To solve the above problems, we propose a cooperative security offloading (CSO) scheme for auxiliary vehicles and MEC servers. Firstly, we propose a dynamic pricing mechanism for computing resources by considering the credibility of MEC servers and auxiliary vehicles, the urgency of the task, and the number of users competing for auxiliary vehicles. Secondly, to prevent malicious MEC servers and eavesdroppers from attacking, we employ homomorphic encryption to protect user privacy. Meanwhile, efficient and secure computing services are achieved by optimizing user selection decisions, offloading decisions, and resource allocation decisions. Finally, the optimal decisions are obtained by the dueling DQN-based resource allocation and pricing strategy (DDRP) and the cost-minimizing security offloading (CMSO) algorithm, which minimizes the economic cost of users while maximizing security. Simulation results show that, compared with some existing schemes, the CSO scheme effectively reduces the economic cost of users while ensuring the security of data transmission.

随着第六代(6G)无线通信技术的发展,未来将有数十亿辆汽车接入网络,汽车应用和用户数据的数量也将急剧增加。传统云计算在处理海量数据时面临严重的延迟和能耗问题。移动边缘计算(MEC)的出现,通过将计算服务器放置在靠近车辆的网络边缘位置,大大提高了计算效率并降低了能耗。然而,MEC 服务器的服务范围有限,无法完全满足用户需求。此外,任务卸载过程还存在安全风险。目前的研究主要集中在如何降低任务卸载的能耗和延迟开销,而忽略了车辆的经济成本或数据传输安全。为解决上述问题,我们提出了一种辅助车辆与 MEC 服务器协同安全卸载(CSO)方案。首先,考虑到 MEC 服务器和辅助车辆的信誉、任务的紧迫性以及竞争辅助车辆的用户数量,我们提出了计算资源动态定价机制。其次,为了防止恶意 MEC 服务器和窃听者的攻击,我们采用了同态加密技术来保护用户隐私。同时,通过优化用户选择决策、卸载决策和资源分配决策,实现高效安全的计算服务。最后,通过基于决斗 DQN 的资源分配和定价策略(DDRP)以及成本最小化安全卸载算法(CMSO)获得最优决策,从而在最大限度提高安全性的同时,使用户的经济成本最小化。仿真结果表明,与现有的一些方案相比,CSO 方案在确保数据传输安全的同时,有效降低了用户的经济成本。
{"title":"A dynamic pricing scheme for secure offloading and resource allocation based on the internet of vehicles","authors":"Jianbin Xue,&nbsp;Jia Yao,&nbsp;Jiahao Wang","doi":"10.1016/j.adhoc.2024.103545","DOIUrl":"https://doi.org/10.1016/j.adhoc.2024.103545","url":null,"abstract":"<div><p>With the development of sixth-generation (6G) wireless communication technology, billions of vehicles will access the network in the future, and the number of vehicle applications and user data will also increase dramatically. Traditional cloud computing faces serious problems of latency and energy consumption in handling massive data. Mobile edge computing (MEC) has emerged to dramatically improve computing efficiency and reduce energy consumption by placing computing servers at network edge locations close to vehicles. However, the service range of MEC servers is limited and cannot fully satisfy user requirements. In addition, the task offloading process has security risks. The current research focuses on how to reduce the energy consumption and latency overhead of task offloading and neglects the economic cost or data transmission security of vehicles. To solve the above problems, we propose a cooperative security offloading (CSO) scheme for auxiliary vehicles and MEC servers. Firstly, we propose a dynamic pricing mechanism for computing resources by considering the credibility of MEC servers and auxiliary vehicles, the urgency of the task, and the number of users competing for auxiliary vehicles. Secondly, to prevent malicious MEC servers and eavesdroppers from attacking, we employ homomorphic encryption to protect user privacy. Meanwhile, efficient and secure computing services are achieved by optimizing user selection decisions, offloading decisions, and resource allocation decisions. Finally, the optimal decisions are obtained by the dueling DQN-based resource allocation and pricing strategy (DDRP) and the cost-minimizing security offloading (CMSO) algorithm, which minimizes the economic cost of users while maximizing security. Simulation results show that, compared with some existing schemes, the CSO scheme effectively reduces the economic cost of users while ensuring the security of data transmission.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140918699","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
Hierarchical multistep approach for intrusion detection and identification in IoT and Fog computing-based environments 物联网和基于雾计算环境中入侵检测和识别的分层多步骤方法
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-08 DOI: 10.1016/j.adhoc.2024.103541
Cristiano Antonio de Souza , Carlos Becker Westphall , Jean Douglas Gomes Valencio , Renato Bobsin Machado , Wesley dos R. Bezerra

Special security techniques, such as intrusion detection mechanisms, are indispensable in modern computer systems. With the emergence of the Internet of Things they have become even more important. It is important to detect and identify the attack in a category so that countermeasures specific to the threat category can be resolved. However, most existing multiclass detection approaches have some weaknesses, mainly related to detecting specific categories of attacks and problems with false positives. This article addresses this research problem and advances state-of-the-art, bringing contributions to a two-stage detection architecture called DNNET-Ensemble, combining binary and multiclass detection. While the benign traffic can be quickly released on the first detection, the intrusive traffic can be subjected to a robust analysis approach without causing delay issues. Additionally, we propose the DNNET binary approach for the binary detection level, which can provide more accurate and faster binary detection. We present the proposal of a federated strategy to train the neural model of the DNNET method without sending data to the cloud, thus preserving the privacy of local data. The proposed Hybrid Attribute Selection strategy can find an optimal subset of attributes through a wrapper method with a lower training cost due to pre-selection using a filter method. Furthermore, the proposed Soft-SMOTE improvement allows operating with a balanced dataset with a minor training time increase, even in scenarios where there are a large number of classes with a large imbalance among them. Results obtained from experiments on renowned intrusion datasets and laboratory experiments demonstrate that the approach can achieve superior detection rates and false positive performance compared to other state-of-the-art approaches.

入侵检测机制等特殊安全技术在现代计算机系统中不可或缺。随着物联网的出现,它们变得更加重要。重要的是,要检测和识别类别中的攻击,以便针对威胁类别采取特定的应对措施。然而,大多数现有的多类别检测方法都存在一些弱点,主要涉及检测特定类别的攻击和误报问题。本文解决了这一研究问题,并推动了最新技术的发展,为一种名为 DNNET-Ensemble 的两阶段检测架构做出了贡献,该架构结合了二元检测和多类检测。良性流量可在首次检测时快速释放,而入侵流量则可采用稳健的分析方法,不会造成延迟问题。此外,我们还针对二进制检测级别提出了 DNNET 二进制方法,可提供更准确、更快速的二进制检测。我们提出了一种联合策略,在不向云端发送数据的情况下训练 DNNET 方法的神经模型,从而保护本地数据的隐私。我们提出的混合属性选择策略可以通过包装方法找到最佳属性子集,由于使用了滤波器方法进行预选,因此训练成本更低。此外,所提出的软-SMOTE 改进方法允许在训练时间略有增加的情况下使用平衡数据集,即使在存在大量类别且这些类别之间存在严重不平衡的情况下也是如此。在知名入侵数据集和实验室实验中获得的结果表明,与其他最先进的方法相比,该方法可以获得更高的检测率和误报率。
{"title":"Hierarchical multistep approach for intrusion detection and identification in IoT and Fog computing-based environments","authors":"Cristiano Antonio de Souza ,&nbsp;Carlos Becker Westphall ,&nbsp;Jean Douglas Gomes Valencio ,&nbsp;Renato Bobsin Machado ,&nbsp;Wesley dos R. Bezerra","doi":"10.1016/j.adhoc.2024.103541","DOIUrl":"https://doi.org/10.1016/j.adhoc.2024.103541","url":null,"abstract":"<div><p>Special security techniques, such as intrusion detection mechanisms, are indispensable in modern computer systems. With the emergence of the Internet of Things they have become even more important. It is important to detect and identify the attack in a category so that countermeasures specific to the threat category can be resolved. However, most existing multiclass detection approaches have some weaknesses, mainly related to detecting specific categories of attacks and problems with false positives. This article addresses this research problem and advances state-of-the-art, bringing contributions to a two-stage detection architecture called DNNET-Ensemble, combining binary and multiclass detection. While the benign traffic can be quickly released on the first detection, the intrusive traffic can be subjected to a robust analysis approach without causing delay issues. Additionally, we propose the DNNET binary approach for the binary detection level, which can provide more accurate and faster binary detection. We present the proposal of a federated strategy to train the neural model of the DNNET method without sending data to the cloud, thus preserving the privacy of local data. The proposed Hybrid Attribute Selection strategy can find an optimal subset of attributes through a wrapper method with a lower training cost due to pre-selection using a filter method. Furthermore, the proposed Soft-SMOTE improvement allows operating with a balanced dataset with a minor training time increase, even in scenarios where there are a large number of classes with a large imbalance among them. Results obtained from experiments on renowned intrusion datasets and laboratory experiments demonstrate that the approach can achieve superior detection rates and false positive performance compared to other state-of-the-art approaches.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140947347","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
Asymmetric wake-up scheduling based on block designs for Internet of Things 基于块设计的非对称唤醒调度,适用于物联网
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-07 DOI: 10.1016/j.adhoc.2024.103530
Woosik Lee , Jong-Hoon Youn , Teuk-Seob Song

In general, wireless sensors operate with a limited energy source, and energy efficiency is a critical design issue. In order to extend the operation time of wireless sensors, there have been many energy efficiency neighbor discovery protocols designed for wireless sensor networks (WSNs) such as Quorum-based, prime-number-based, and block-design-based protocols. Among them, the block-design-based approach was known to be more effective solutions for neighbor discovery in terms of the worst-case discovery latency for a given duty cycle. However, the original block- design-based approach is only applicable to a sensor network where all sensors have the same duty cycle. In order to expand a block-design-based neighbor discovery solution to asymmetric WSNs, we introduce a new neighbor discovery protocol (NDP) that combines two block-design-based schedules to produce a new set of discovery schedules for asymmetric WSNs. Furthermore, by using the Kronecker product method, we prove that any pair of neighboring sensors in the proposed protocol has at least one common active slot within a length of their discovery cycle. Furthermore, the results of the simulation study show that the proposed method is better than representative NDPs (such as Quorum, U-Connect, Disco, SearchLight, Hedis, and Todis) in terms of discovery latency and energy efficiency.

一般来说,无线传感器的工作能源有限,因此能效是一个关键的设计问题。为了延长无线传感器的运行时间,人们为无线传感器网络(WSN)设计了许多节能邻居发现协议,如基于法定人数的协议、基于质数的协议和基于块设计的协议。其中,在给定占空比的最坏情况下,基于块设计的方法被认为是更有效的邻居发现解决方案。然而,最初的基于块设计的方法只适用于所有传感器具有相同占空比的传感器网络。为了将基于块设计的邻居发现解决方案扩展到非对称 WSN,我们引入了一种新的邻居发现协议(NDP),它结合了两种基于块设计的时间表,为非对称 WSN 生成了一组新的发现时间表。此外,通过使用克朗内克积方法,我们证明了在所提出的协议中,任何一对相邻的传感器在其发现周期的一定长度内至少有一个共同的活动时隙。此外,仿真研究结果表明,就发现延迟和能效而言,建议的方法优于具有代表性的 NDP(如 Quorum、U-Connect、Disco、SearchLight、Hedis 和 Todis)。
{"title":"Asymmetric wake-up scheduling based on block designs for Internet of Things","authors":"Woosik Lee ,&nbsp;Jong-Hoon Youn ,&nbsp;Teuk-Seob Song","doi":"10.1016/j.adhoc.2024.103530","DOIUrl":"10.1016/j.adhoc.2024.103530","url":null,"abstract":"<div><p>In general, wireless sensors operate with a limited energy source, and energy efficiency is a critical design issue. In order to extend the operation time of wireless sensors, there have been many energy efficiency neighbor discovery protocols designed for wireless sensor networks (WSNs) such as Quorum-based, prime-number-based, and block-design-based protocols. Among them, the block-design-based approach was known to be more effective solutions for neighbor discovery in terms of the worst-case discovery latency for a given duty cycle. However, the original block- design-based approach is only applicable to a sensor network where all sensors have the same duty cycle. In order to expand a block-design-based neighbor discovery solution to asymmetric WSNs, we introduce a new neighbor discovery protocol (NDP) that combines two block-design-based schedules to produce a new set of discovery schedules for asymmetric WSNs. Furthermore, by using the Kronecker product method, we prove that any pair of neighboring sensors in the proposed protocol has at least one common active slot within a length of their discovery cycle. Furthermore, the results of the simulation study show that the proposed method is better than representative NDPs (such as Quorum, U-Connect, Disco, SearchLight, Hedis, and Todis) in terms of discovery latency and energy efficiency.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141058206","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 privacy-preserving location data collection framework for intelligent systems in edge computing 边缘计算智能系统的隐私保护位置数据收集框架
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-07 DOI: 10.1016/j.adhoc.2024.103532
Aiting Yao , Shantanu Pal , Xuejun Li , Zheng Zhang , Chengzu Dong , Frank Jiang , Xiao Liu

With the rise of smart city applications, the accessibility of users’ location data by smart devices has increased significantly. However, this poses a privacy concern as attackers can deduce personal information from the raw location data. In this paper, we propose a framework to collect user location data while ensuring local differential privacy (LDP) in the last-mile delivery system of Unmanned Aerial Vehicles (UAVs) within an edge computing environment. Firstly, we obtain the user location distribution Quad-tree by employing a region partitioning method based on Quad-tree retrieval in the specified data collection area. Next, the user location matrix is retrieved from the obtained Quad-tree, and we perturb the user location data using an LDP perturbation scheme on the location matrix. Finally, the collected data is aggregated using blockchain to evaluate the utility of the dataset from various regions. Furthermore, to validate the effectiveness of our framework in a real-world scenario, we conduct extensive simulations using datasets from multiple cities with varying urban densities and mobility patterns. These simulations not only demonstrate the scalability of our approach but also showcase its adaptability to different urban environments and delivery demands. Finally, our research opens new avenues for future work, including the exploration of more sophisticated LDP mechanisms that can offer higher levels of privacy without significantly compromising the quality of service. Additionally, the integration of emerging technologies such as 5G and beyond in the edge computing environment could further enhance the efficiency and reliability of UAV-based delivery systems, while also offering new challenges and opportunities for privacy-preserving data collection and analysis.

随着智能城市应用的兴起,智能设备对用户位置数据的可访问性大幅提高。然而,这也带来了隐私问题,因为攻击者可以从原始位置数据中推断出个人信息。在本文中,我们提出了一种在边缘计算环境下的无人机(UAV)最后一英里配送系统中收集用户位置数据并确保本地差异隐私(LDP)的框架。首先,我们在指定的数据收集区域内采用基于四叉树检索的区域划分方法获得用户位置分布四叉树。然后,从获得的四叉树中检索用户位置矩阵,并在位置矩阵上使用 LDP 扰动方案对用户位置数据进行扰动。最后,利用区块链对收集到的数据进行汇总,以评估来自不同地区的数据集的实用性。此外,为了验证我们的框架在现实世界场景中的有效性,我们使用来自多个城市的数据集进行了大量模拟,这些数据集具有不同的城市密度和移动模式。这些模拟不仅证明了我们方法的可扩展性,还展示了它对不同城市环境和交付需求的适应性。最后,我们的研究为今后的工作开辟了新的途径,包括探索更复杂的 LDP 机制,在不明显影响服务质量的情况下提供更高水平的隐私。此外,在边缘计算环境中整合 5G 等新兴技术,可以进一步提高基于无人机的传输系统的效率和可靠性,同时也为保护隐私的数据收集和分析提供了新的挑战和机遇。
{"title":"A privacy-preserving location data collection framework for intelligent systems in edge computing","authors":"Aiting Yao ,&nbsp;Shantanu Pal ,&nbsp;Xuejun Li ,&nbsp;Zheng Zhang ,&nbsp;Chengzu Dong ,&nbsp;Frank Jiang ,&nbsp;Xiao Liu","doi":"10.1016/j.adhoc.2024.103532","DOIUrl":"https://doi.org/10.1016/j.adhoc.2024.103532","url":null,"abstract":"<div><p>With the rise of smart city applications, the accessibility of users’ location data by smart devices has increased significantly. However, this poses a privacy concern as attackers can deduce personal information from the raw location data. In this paper, we propose a framework to collect user location data while ensuring local differential privacy (LDP) in the last-mile delivery system of Unmanned Aerial Vehicles (UAVs) within an edge computing environment. Firstly, we obtain the user location distribution Quad-tree by employing a region partitioning method based on Quad-tree retrieval in the specified data collection area. Next, the user location matrix is retrieved from the obtained Quad-tree, and we perturb the user location data using an LDP perturbation scheme on the location matrix. Finally, the collected data is aggregated using blockchain to evaluate the utility of the dataset from various regions. Furthermore, to validate the effectiveness of our framework in a real-world scenario, we conduct extensive simulations using datasets from multiple cities with varying urban densities and mobility patterns. These simulations not only demonstrate the scalability of our approach but also showcase its adaptability to different urban environments and delivery demands. Finally, our research opens new avenues for future work, including the exploration of more sophisticated LDP mechanisms that can offer higher levels of privacy without significantly compromising the quality of service. Additionally, the integration of emerging technologies such as 5G and beyond in the edge computing environment could further enhance the efficiency and reliability of UAV-based delivery systems, while also offering new challenges and opportunities for privacy-preserving data collection and analysis.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1570870524001434/pdfft?md5=c6aa1e641a8186bdb8d3722893cdda2a&pid=1-s2.0-S1570870524001434-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140951969","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
A Lightweight_PAEKS-based energy scheduling model considering priority in MicroGrid 微电网中考虑优先级的基于轻量级_PAEKS 的能源调度模型
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-06 DOI: 10.1016/j.adhoc.2024.103531
Xialei Zhang, Yaoyang Wang, Tianjun Ma, Lifeng Guo, Zhiguo Hu

Priority-based energy scheduling is proposed, whereby the data utility of measured user information in smart meters, including the priority and power demand of power consumers and the maximum power supply of power suppliers, is leveraged to ensure that in the case of limited power resources within islanded microgrids, energy is allocated to power consumers in the order of high to low priority. Nonetheless, in terms of data utility, most existing strategies only consider high-priority power consumers, neglecting the priority of power suppliers and low-priority power consumers, thus damaging the fairness of low-priority consumers and the interests of power suppliers, to the detriment of these groups. Moreover, smart meters are vulnerable to data integrity attacks, which may result in the manipulation of measured user information during the forwarding process, thereby disrupting normal priority-based energy scheduling. Therefore, focusing on data utility without considering data security is insufficient. Researchers have extensively investigated how to secure smart meters within advanced metering infrastructure (AMI), primarily employing cryptography-based methods to encrypt user information in measured meters and decrypt it at the microgrid central controller (MGCC), thereby protecting the data confidentiality of user information during the forwarding process and preventing data tampering. However, the prevailing cryptographic methods used to secure smart meters are extremely complex, and make smart meters and local controllers on the forwarding path unable to obtain any user information in which embedded consumers’ priority and cannot leverage the data utility of priority to forward information accordingly. In other words, existing models cannot simultaneously achieve data confidentiality and data utility during the forwarding process. To solve these issues, this study investigates a Lightweight_PAEKS-based energy scheduling model considering priority in microgrid (LPESCP). As a lightweight solution, the LPESCP comprehensively considers data confidentiality and data utility, as well as the priority and fairness of all users, to ensure the security of smart meters and optimize energy scheduling. In particular, the data utility problem is solved by using an optimization model that aims to maximize the global satisfaction degree of all users in terms of priority and fairness. The Lightweight_PAEKS and Paillier encryption scheme are used so that nodes on the forwarding path can successfully match priority-related keyword and forward information in order of the keyword corresponding emergency coefficient indicating the urgency levels of information, ensuring data utility, while do not know the specific keyword, emergency coefficient and other information, ensuring data confidentiality. To verify the effectiveness of the LPESCP, experiments are conducted for three cases generated based on random numbers. The results sh

提出了基于优先级的能源调度,即利用智能电表中测量到的用户信息(包括用电户的优先级和电力需求以及供电商的最大电力供应)的数据效用,确保在孤岛微电网内电力资源有限的情况下,按照从高到低的优先级顺序为用电户分配能源。然而,就数据效用而言,现有的大多数策略只考虑了高优先级电力用户,忽视了供电商和低优先级电力用户的优先级,从而损害了低优先级用户的公平性和供电商的利益,不利于这些群体。此外,智能电表容易受到数据完整性攻击,在转发过程中可能导致测量的用户信息被篡改,从而破坏正常的基于优先级的能源调度。因此,只关注数据实用性而不考虑数据安全性是不够的。研究人员广泛研究了如何确保高级计量基础设施(AMI)中智能电表的安全,主要采用基于密码学的方法对测量电表中的用户信息进行加密,并在微电网中央控制器(MGCC)上进行解密,从而在转发过程中保护用户信息的数据机密性,防止数据被篡改。然而,目前用于确保智能电表安全的加密方法极其复杂,使得转发路径上的智能电表和本地控制器无法获取任何嵌入消费者优先级的用户信息,也无法利用优先级的数据效用进行相应的信息转发。换言之,现有模型无法在转发过程中同时实现数据保密性和数据效用。为了解决这些问题,本研究探讨了一种基于轻量级_PAEKS 的微电网能源调度模型(LPESCP)。作为一种轻量级解决方案,LPESCP 全面考虑了数据保密性和数据效用,以及所有用户的优先级和公平性,以确保智能电表的安全性并优化能源调度。其中,数据效用问题是通过使用优化模型来解决的,该模型旨在最大化所有用户在优先级和公平性方面的全局满意度。采用轻量级_PAEKS和Paillier加密方案,使转发路径上的节点能够成功匹配优先级相关的关键字,并按照关键字对应的紧急系数表示信息的紧急程度依次转发信息,保证数据的实用性,同时不知道具体的关键字、紧急系数等信息,保证数据的保密性。为了验证 LPESCP 的有效性,我们对基于随机数生成的三个案例进行了实验。实验结果表明,LPESCP 模型能有效保证消费者的能源供应,全面考虑了数据的保密性和实用性,以及所有用户的优先级和公平性。此外,还引入了全局满意度和时间开销作为衡量指标,以验证 LPESCP 策略与现有的基于优先级的能源调度模型相比,能更有效地提供更高的全局满意度和更低的时间开销。
{"title":"A Lightweight_PAEKS-based energy scheduling model considering priority in MicroGrid","authors":"Xialei Zhang,&nbsp;Yaoyang Wang,&nbsp;Tianjun Ma,&nbsp;Lifeng Guo,&nbsp;Zhiguo Hu","doi":"10.1016/j.adhoc.2024.103531","DOIUrl":"10.1016/j.adhoc.2024.103531","url":null,"abstract":"<div><p>Priority-based energy scheduling is proposed, whereby the data utility of measured user information in smart meters, including the priority and power demand of power consumers and the maximum power supply of power suppliers, is leveraged to ensure that in the case of limited power resources within islanded microgrids, energy is allocated to power consumers in the order of high to low priority. Nonetheless, in terms of data utility, most existing strategies only consider high-priority power consumers, neglecting the priority of power suppliers and low-priority power consumers, thus damaging the fairness of low-priority consumers and the interests of power suppliers, to the detriment of these groups. Moreover, smart meters are vulnerable to data integrity attacks, which may result in the manipulation of measured user information during the forwarding process, thereby disrupting normal priority-based energy scheduling. Therefore, focusing on data utility without considering data security is insufficient. Researchers have extensively investigated how to secure smart meters within advanced metering infrastructure (AMI), primarily employing cryptography-based methods to encrypt user information in measured meters and decrypt it at the microgrid central controller (MGCC), thereby protecting the data confidentiality of user information during the forwarding process and preventing data tampering. However, the prevailing cryptographic methods used to secure smart meters are extremely complex, and make smart meters and local controllers on the forwarding path unable to obtain any user information in which embedded consumers’ priority and cannot leverage the data utility of priority to forward information accordingly. In other words, existing models cannot simultaneously achieve data confidentiality and data utility during the forwarding process. To solve these issues, this study investigates a Lightweight_PAEKS-based energy scheduling model considering priority in microgrid (<em>LPESCP</em>). As a lightweight solution, the <em>LPESCP</em> comprehensively considers data confidentiality and data utility, as well as the priority and fairness of all users, to ensure the security of smart meters and optimize energy scheduling. In particular, the data utility problem is solved by using an optimization model that aims to maximize the global satisfaction degree of all users in terms of priority and fairness. The Lightweight_PAEKS and Paillier encryption scheme are used so that nodes on the forwarding path can successfully match priority-related keyword and forward information in order of the keyword corresponding emergency coefficient indicating the urgency levels of information, ensuring data utility, while do not know the specific keyword, emergency coefficient and other information, ensuring data confidentiality. To verify the effectiveness of the <em>LPESCP</em>, experiments are conducted for three cases generated based on random numbers. The results sh","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141049933","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
Delay-guaranteed Mobile Augmented Reality Task Offloading in Edge-assisted Environment 边缘辅助环境中的延迟保证移动增强现实任务卸载
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-05 DOI: 10.1016/j.adhoc.2024.103539
Jia Hao , Yang Chen , Jianhou Gan

With the introduction of Augmented Reality (AR) into mobile devices, it becomes a trend to develop mobile AR applications in various fields. However, the execution of AR task demands the extensive resources of computation, memory and storage, which makes it difficult for mobile terminals with constrained hardware resources to carry out AR applications within the limited delay. In response to this challenge, we propose a mobile AR offloading method under the edge-assisted environment. Firstly, we divide an AR task into consecutive subtasks, and then collect the features of hardware, software, configuration, and runtime environments from the edge servers to be offloaded. With the features, we construct an AR subtask Execution delay Prediction Bayesian Network (EPBN) to predict the execution delay of different subtasks on each edge platform. Based on the prediction, we model the task offloading as the NP-hard Traveling Salesman Problem (TSP), and then propose a PSO-GA based solution by adopting the heuristic algorithm of Particle Swarm Optimization (PSO) to encode the offloading strategy and using Genetic Algorithm (GA) for particle update. The extensive experiments prove that the average performances of EPBN outperform the others with 17.23%, 23.97%, and 20.67% on micro-P, micro-R, and micro-F1 respectively, and the PSO-GA ensures that the offloading latency is reduced by nearly 5% compared to the suboptimal algorithm.

随着增强现实(Augmented Reality,简称 AR)技术被引入移动设备,在各个领域开发移动 AR 应用已成为一种趋势。然而,AR 任务的执行需要大量的计算、内存和存储资源,这使得硬件资源有限的移动终端很难在有限的延迟内完成 AR 应用。针对这一难题,我们提出了边缘辅助环境下的移动 AR 卸载方法。首先,我们将一个AR任务划分为连续的子任务,然后从需要卸载的边缘服务器收集硬件、软件、配置和运行环境的特征。根据这些特征,我们构建了一个 AR 子任务执行延迟预测贝叶斯网络(EPBN),以预测不同子任务在每个边缘平台上的执行延迟。根据预测结果,我们将任务卸载建模为 NP 难的旅行推销员问题(TSP),然后提出了基于 PSO-GA 的解决方案,即采用启发式算法粒子群优化(PSO)来编码卸载策略,并使用遗传算法(GA)进行粒子更新。大量实验证明,在 micro-P、micro-R 和 micro-F1 上,EPBN 的平均性能分别比其他算法高出 17.23%、23.97% 和 20.67%,PSO-GA 确保卸载延迟比次优算法减少近 5%。
{"title":"Delay-guaranteed Mobile Augmented Reality Task Offloading in Edge-assisted Environment","authors":"Jia Hao ,&nbsp;Yang Chen ,&nbsp;Jianhou Gan","doi":"10.1016/j.adhoc.2024.103539","DOIUrl":"https://doi.org/10.1016/j.adhoc.2024.103539","url":null,"abstract":"<div><p>With the introduction of Augmented Reality (AR) into mobile devices, it becomes a trend to develop mobile AR applications in various fields. However, the execution of AR task demands the extensive resources of computation, memory and storage, which makes it difficult for mobile terminals with constrained hardware resources to carry out AR applications within the limited delay. In response to this challenge, we propose a mobile AR offloading method under the edge-assisted environment. Firstly, we divide an AR task into consecutive subtasks, and then collect the features of hardware, software, configuration, and runtime environments from the edge servers to be offloaded. With the features, we construct an AR subtask Execution delay Prediction Bayesian Network (EPBN) to predict the execution delay of different subtasks on each edge platform. Based on the prediction, we model the task offloading as the NP-hard Traveling Salesman Problem (TSP), and then propose a PSO-GA based solution by adopting the heuristic algorithm of Particle Swarm Optimization (PSO) to encode the offloading strategy and using Genetic Algorithm (GA) for particle update. The extensive experiments prove that the average performances of EPBN outperform the others with 17.23%, 23.97%, and 20.67% on micro-P, micro-R, and micro-F1 respectively, and the PSO-GA ensures that the offloading latency is reduced by nearly 5% compared to the suboptimal algorithm.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140879129","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
Context-aware multi-modal route selection service for urban computing scenarios 面向城市计算场景的情境感知多模式路线选择服务
IF 4.8 3区 计算机科学 Q1 Computer Science Pub Date : 2024-05-03 DOI: 10.1016/j.adhoc.2024.103525
Matheus Brito , Camilo Santos , Bruno S. Martins , Iago Medeiros , Marcos Seruffo , Eduardo Cerqueira , Denis Rosário

The rapid urban population growth introduces novel challenges to urban mobility scenarios, requiring innovative and connected solutions to relieve traffic congestion and enhance transportation efficiency, using unusual roads and public transportation modals. For instance, multi-modal routes allow more flexible modal combinations to offer smart multi-modal mobility. In this context, the route selection service must rely on different context information, such as criminality, accidents, air quality, and others, where Internet of Things technologies introduce active and ubiquitous sensing of many contexts along the urban scenario, providing data for statistical analysis to offer a safer and healthier urban reality. However, designing an efficient multi-modal route selection service that considers different context information to offer personalized routes is important. In this article, we describe a context-aware route selection service that considers adequate contextual information to provide routes according to the user’s preference. The multi-modal route selection service applies a multi-criteria method to give different degrees of importance to each criterion based on the user profile (i.e., Worker, Green, Safe, and Tourist). We present extensive evaluation results from applying our multi-modal route selection approach to a London dataset. The approach successfully enables user-preferred transportation choices using four balanced selection profiles and ten route features. The proposed multi-modal route selection service demonstrates better performance in terms of economic, ecological, and time-saving metrics for each user profile compared to a greedy selection manner.

城市人口的快速增长给城市交通方案带来了新的挑战,需要创新的互联解决方案,利用非同寻常的道路和公共交通模式来缓解交通拥堵,提高交通效率。例如,多模式路线允许更灵活的模式组合,以提供智能多模式交通。在这种情况下,路线选择服务必须依靠不同的环境信息,如犯罪、事故、空气质量等,物联网技术引入了对城市场景中许多环境的主动和无处不在的感知,为统计分析提供数据,以提供更安全、更健康的城市现实。然而,设计一种高效的多模式路线选择服务非常重要,这种服务应考虑不同的环境信息,以提供个性化路线。在本文中,我们介绍了一种情境感知路线选择服务,它能考虑充分的情境信息,根据用户的偏好提供路线。这种多模式路线选择服务采用多标准方法,根据用户特征(即工人、绿色、安全和游客)对每个标准赋予不同的重要程度。我们在伦敦的一个数据集上应用了我们的多模式路线选择方法,并展示了广泛的评估结果。该方法利用四种平衡选择配置文件和十种路线特征,成功实现了用户首选的交通选择。与贪婪选择方式相比,所提出的多模式路线选择服务在每个用户配置文件的经济、生态和省时指标方面都表现出了更好的性能。
{"title":"Context-aware multi-modal route selection service for urban computing scenarios","authors":"Matheus Brito ,&nbsp;Camilo Santos ,&nbsp;Bruno S. Martins ,&nbsp;Iago Medeiros ,&nbsp;Marcos Seruffo ,&nbsp;Eduardo Cerqueira ,&nbsp;Denis Rosário","doi":"10.1016/j.adhoc.2024.103525","DOIUrl":"https://doi.org/10.1016/j.adhoc.2024.103525","url":null,"abstract":"<div><p>The rapid urban population growth introduces novel challenges to urban mobility scenarios, requiring innovative and connected solutions to relieve traffic congestion and enhance transportation efficiency, using unusual roads and public transportation modals. For instance, multi-modal routes allow more flexible modal combinations to offer smart multi-modal mobility. In this context, the route selection service must rely on different context information, such as criminality, accidents, air quality, and others, where Internet of Things technologies introduce active and ubiquitous sensing of many contexts along the urban scenario, providing data for statistical analysis to offer a safer and healthier urban reality. However, designing an efficient multi-modal route selection service that considers different context information to offer personalized routes is important. In this article, we describe a context-aware route selection service that considers adequate contextual information to provide routes according to the user’s preference. The multi-modal route selection service applies a multi-criteria method to give different degrees of importance to each criterion based on the user profile (<em>i.e.,</em> Worker, Green, Safe, and Tourist). We present extensive evaluation results from applying our multi-modal route selection approach to a London dataset. The approach successfully enables user-preferred transportation choices using four balanced selection profiles and ten route features. The proposed multi-modal route selection service demonstrates better performance in terms of economic, ecological, and time-saving metrics for each user profile compared to a greedy selection manner.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.8,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140902093","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
期刊
Ad Hoc Networks
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1