Computer Networks最新文献_第4页

+Tour: Recommending personalized itineraries for smart tourism +Tour：为智慧旅游推荐个性化路线

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-13 DOI: 10.1016/j.comnet.2025.111118

João Paulo Esper , Luciano de S. Fraga , Aline C. Viana , Kleber Vieira Cardoso , Sand Luz Correa

{"title":"+Tour: Recommending personalized itineraries for smart tourism","authors":"João Paulo Esper , Luciano de S. Fraga , Aline C. Viana , Kleber Vieira Cardoso , Sand Luz Correa","doi":"10.1016/j.comnet.2025.111118","DOIUrl":"10.1016/j.comnet.2025.111118","url":null,"abstract":"<div><div>Next-generation touristic services will rely on the advanced mobile networks’ high bandwidth and low latency and the Multi-access Edge Computing (MEC) paradigm to provide fully immersive mobile experiences. As an integral part of travel planning systems, recommendation algorithms devise personalized tour itineraries for individual users considering the popularity of a city’s Points of Interest (POIs) as well as the tourist preferences and constraints. However, in the context of next-generation touristic services, recommendation algorithms should also consider the applications (e.g., social network, mobile video streaming, mobile augmented reality) the tourist will consume in the POIs and the quality in which the MEC infrastructure will deliver such applications. In this paper, we address the joint problem of recommending personalized tour itineraries for tourists and efficiently allocating MEC resources for advanced touristic applications. We formulate an optimization problem that maximizes the itinerary of individual tourists while optimizing the resource allocation at the network edge. We then propose an exact algorithm that quickly solves the problem optimally, considering instances of realistic size. Using a real-world location-based photo-sharing database, we conduct and present an exploratory analysis to understand preferences and users’ visiting patterns. Using this understanding, we propose a methodology to identify user interest in applications. Finally, we evaluate our algorithm using this dataset. Results show that our algorithm outperforms a modified version of a state-of-the-art solution for personalized tour itinerary recommendation, demonstrating gains up to 11<span><math><mtext>%</mtext></math></span> for resource allocation efficiency and 40<span><math><mtext>%</mtext></math></span> for user experience. In addition, our algorithm performs similarly to the modified state-of-the-art solution regarding traditional itinerary recommendation metrics.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111118"},"PeriodicalIF":4.4,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143421138","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}

引用次数: 0

Enhanced energy-aware routing protocol with mobile sink optimization for wireless sensor networks

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-13 DOI: 10.1016/j.comnet.2025.111100

Parvinder Singh, Rajinder Vir

{"title":"Enhanced energy-aware routing protocol with mobile sink optimization for wireless sensor networks","authors":"Parvinder Singh, Rajinder Vir","doi":"10.1016/j.comnet.2025.111100","DOIUrl":"10.1016/j.comnet.2025.111100","url":null,"abstract":"<div><div>Wireless sensor networks (WSNs), one of the emerging technologies in the Internet of Things (IoT) field, have a wide range of applications, including healthcare, environmental biology, facility monitoring, and many more. These networks collect, process, and transmit environmental data by connecting a wireless network of small, resource-constrained sensors to other sensors. One of the main challenges in running wireless sensor networks is controlling the movement of mobile sinks. Mobile sinks are movable and can be used as data gathering sites in a network. Nevertheless, this movement has some problems, including a lot of route and energy changes. The history of the network shows that inadequate routing control, inconsistent energy use, and poor service quality have all been made worse by sink migration. These extra features need the use of more sophisticated and clever techniques for routing data to mobile sinks. Therefore, this study proposes an upgraded intelligent routing protocol for a mobile wireless sensor network based on intelligent monitoring for mobile sinks (MSs). Compared to previous mobile sparse techniques, the simulations show a 38% increase in network throughput and a 42% improvement in end-to-end latency. Moreover, the energy consumption and control overhead dictate the network's lifespan.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"261 ","pages":"Article 111100"},"PeriodicalIF":4.4,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143474649","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}

引用次数: 0

A Spectral and Energy Efficient Transmission Scheme for OFDM-based Communication Systems

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-13 DOI: 10.1016/j.comnet.2025.111101

Aymen Omri , Javier Hernandez Fernandez , Roberto Di Pietro

{"title":"A Spectral and Energy Efficient Transmission Scheme for OFDM-based Communication Systems","authors":"Aymen Omri , Javier Hernandez Fernandez , Roberto Di Pietro","doi":"10.1016/j.comnet.2025.111101","DOIUrl":"10.1016/j.comnet.2025.111101","url":null,"abstract":"<div><div>This paper introduces a new frequency domain index modulation (FD-IM) technique for a general orthogonal frequency-division multiplexing (OFDM)-based communication system. The proposed technique has been designed to enhance both the spectral and the energy efficiencies of OFDM-based communication systems. In particular, we propose a novel coding scheme for the symbols to be transmitted that leverages the absence of transmission itself to encode a symbol. To the best of our knowledge, this is the first usage of such a coding scheme in the FD-IM OFDM domain. The expected benefits of the proposed solution are as follows: (i) It enhances the spectral efficiency, by increasing the total number of transmit bits for a given set of subcarriers; and, (ii) It improves the energy efficiency. To evaluate and compare the advantages of the proposed FD-IM technique with a baseline subcarrier-index modulated (SIM)-OFDM method, we first have derived the closed-form expressions of the energy gain and the transmit bit gain for both techniques, with respect to the equivalent standard modulation. The theoretical results show a significant enhancement in terms of improving both the spectral and the energy efficiencies of a general OFDM-based communication system. Moreover, we run an extensive experimental campaign to support our findings. Results are striking. For instance, with a binary phase-shift keying (BPSK) modulation, an energy gain of 57% and a transmit bit gain of 58% are experimentally observed. These promising results pave the way to improve the different extension versions of the SIM-OFDM technique that have been presented in the literature. Finally, we also pointed out some further applications of our proposed encoding to the general field of information processing.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111101"},"PeriodicalIF":4.4,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143437151","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}

引用次数: 0

Efficient and secure cross-domain data sharing scheme with traceability for Industrial Internet

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-13 DOI: 10.1016/j.comnet.2025.111117

Wei Luo, Ziyi Lv, Chengzhe Lai, Tengfei Yang

{"title":"Efficient and secure cross-domain data sharing scheme with traceability for Industrial Internet","authors":"Wei Luo, Ziyi Lv, Chengzhe Lai, Tengfei Yang","doi":"10.1016/j.comnet.2025.111117","DOIUrl":"10.1016/j.comnet.2025.111117","url":null,"abstract":"<div><div>As the Industrial Internet undergoes swift growth, secure data sharing has become a crucial issue. However, currently most schemes are mainly applied to single-domain environments, and with the increasing demand for data sharing among various parties, the need for cross-domain data interaction becomes increasingly urgent. To solve the problem, we propose an efficient and secure industrial data cross-domain sharing scheme based on traceable CP-ABE in this paper. Firstly, a traceable and efficient CP-ABE is proposed, called TE-CP-ABE, which utilizes key conversion and key sanity check to reduce the computational complexity of the client and enable the tracking of malicious users, respectively. Secondly, based on TE-CP-ABE and proxy re-encryption technology, we design a traceable and secure cross-domain data sharing scheme for Industrial Internet. This scheme introduces domain proxies for cross-domain authentication and employs proxy re-encryption technology to facilitate policy transformation, breaking down attribute differences between different domains. TE-CP-ABE has been proven to achieve IND-CPA security under the decisional q-BDHE problem, and it efficiently prevents malicious users from abusing their keys. Finally, the proposed scheme is compared with the existing schemes in terms of theoretical analysis and experimental simulation. The results show that the proposed scheme has certain advantages in terms of computing and storage overhead.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111117"},"PeriodicalIF":4.4,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143421139","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}

引用次数: 0

Game theory-based vehicle selection and channel scheduling for federated learning in vehicular edge networks

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-12 DOI: 10.1016/j.comnet.2025.111111

Tianqi Gao , Yuanzhi Ni , Hongfeng Tao , Zhuocheng Du , Zhenshu Zhu

{"title":"Game theory-based vehicle selection and channel scheduling for federated learning in vehicular edge networks","authors":"Tianqi Gao , Yuanzhi Ni , Hongfeng Tao , Zhuocheng Du , Zhenshu Zhu","doi":"10.1016/j.comnet.2025.111111","DOIUrl":"10.1016/j.comnet.2025.111111","url":null,"abstract":"<div><div>In the last decade, Intelligent Transportation System (ITS) has benefited from the rapid development of advanced computing and communication technology. From the perspective of the service operator, connected-vehicles are encouraged to participate in model training to improve the intelligence of vehicular edge networks. However, the data exchanges without proper management will raise the users’ privacy concern. In addition, multi-users participating in the model training require an efficient and distributed mechanism to avoid the waste of operation resources. Therefore, it is valuable to study how to select appropriate vehicles to facilitate the model training and data transmission while protecting users’ privacy. In this paper, the vehicular edge network is built with RSU as the task publishers and users as participants. We contextualize Federated Learning in vehicular edge networks with multi-channel transmission. Therefore, it is valuable to study how to select appropriate vehicles to facilitate the model training and data transmission while maintaining the operation efficiency. In this paper, we contextualize Federated Learning in vehicular edge networks with multi-channel transmission. A vehicle selection strategy based on Stackelberg game is designed to identify the vehicles participating in the model training. Furthermore, a sub-channel scheduling strategy is proposed based on Chaos Game Optimization (CGO) for efficient data transmission. Finally, the simulation verifies the service efficiency and operation effectiveness of the proposed strategies in terms of the operating costs, model accuracy and loss.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111111"},"PeriodicalIF":4.4,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143437152","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}

引用次数: 0

A secure and dynamic fusion addressing scheme for Internet of Vehicles scenarios

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-11 DOI: 10.1016/j.comnet.2025.111112

Chao Liu, Fulong Chen, Taochun Wang, Chuanxin Zhao, Dong Xie, Peng Hu

{"title":"A secure and dynamic fusion addressing scheme for Internet of Vehicles scenarios","authors":"Chao Liu, Fulong Chen, Taochun Wang, Chuanxin Zhao, Dong Xie, Peng Hu","doi":"10.1016/j.comnet.2025.111112","DOIUrl":"10.1016/j.comnet.2025.111112","url":null,"abstract":"<div><div>The extensive deployment of Internet of Things (IoT) nodes has led to the emergence of various novel application scenarios, one of which is the Internet of Vehicles (IoV). Prior to efficacious data communication, IoT nodes must initially be equipped with a globally distinctive IPv6 address. Nevertheless, resource constraints and security vulnerabilities impose significant challenges to the addressing process. Existing addressing paradigms have been incapable of simultaneously meeting the requirements for security, scalability of the routing communication network, and address privacy protection of the terminal node. Consequently, they are not appropriate for utilization in IoV scenarios. To address these issues, this paper formulates a network model combining a static backbone network and a dynamic mobile network based on the characteristics of the IoV scenarios and designs a secure and dynamic fusion addressing scheme (SD-FAC). In SD-FAC, the backbone nodes utilize a lightweight security-enhanced neighbor discovery protocol based on location information to effectuate address registration, resisting message forgery, modification, and replay attacks, enhancing the security of the routing communication network, while supporting network scalability and automatic route establishment. The mobile nodes employ the congruence class approach to pre-construct independent address spaces and promptly complete association addressing upon entering the backbone network area. We analyze the addressing performance of the overall network model from eight indicators. Experimental simulation results demonstrate that the addressing latency, resource overhead, and energy consumption of the mobile network are all superior to those of the relevant addressing schemes.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111112"},"PeriodicalIF":4.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143402673","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}

引用次数: 0

Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-11 DOI: 10.1016/j.comnet.2025.111102

Yurong Lai , Xinhui Han , Xueer Wang , Tse-Tin Chan , Haoyuan Pan

{"title":"Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study","authors":"Yurong Lai , Xinhui Han , Xueer Wang , Tse-Tin Chan , Haoyuan Pan","doi":"10.1016/j.comnet.2025.111102","DOIUrl":"10.1016/j.comnet.2025.111102","url":null,"abstract":"<div><div>This paper examines the concept of information freshness in a collaborative surveillance scenario utilizing non-orthogonal multiple access (NOMA). In this scenario, each monitoring device observes a portion of a common target and reports the latest status to a common access point (AP), which then recovers the complete observations. We use the age of collection (AoC) as a metric for information freshness. Unlike the conventional age of information (AoI) metric, the instantaneous AoC decreases only when the AP receives all partial updates from different devices (i.e., successfully receives a “joint” update). Consequently, existing AoI-oriented analyses on NOMA cannot be easily generalized to AoC due to the different update rules between AoC and AoI. Conventional NOMA schemes typically employ multiuser decoding (MUD) techniques to decode update messages from different devices, referred to here as the MUD-only NOMA system. However, MUD techniques are less effective when the signal-to-noise ratios (SNRs) of different NOMA users are nearly balanced. Therefore, we consider network-coded multiple access (NCMA), an advanced NOMA scheme that integrates MUD with physical-layer network coding (PNC). PNC is a technique that transforms wireless mutual interference into useful network-coded information, working well even when the SNRs of different users are similar. Experimental results using software-defined radios indicate that NCMA is a practical solution for achieving low average AoC under varying channel conditions. The combination of MUD and PNC enables the AP to receive joint update messages much faster, significantly reducing the average AoC of the system.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111102"},"PeriodicalIF":4.4,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143402674","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}

引用次数: 0

An incentive mechanism for joint sensing and communication Vehicular Crowdsensing by Deep Reinforcement Learning 通过深度强化学习实现联合感知和通信的激励机制车载人群感知

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-10 DOI: 10.1016/j.comnet.2025.111099

Gaoyu Luo , Shanhao Zhan , Chenyi Liang , Zhibin Gao , Yifeng Zhao , Lianfen Huang

{"title":"An incentive mechanism for joint sensing and communication Vehicular Crowdsensing by Deep Reinforcement Learning","authors":"Gaoyu Luo , Shanhao Zhan , Chenyi Liang , Zhibin Gao , Yifeng Zhao , Lianfen Huang","doi":"10.1016/j.comnet.2025.111099","DOIUrl":"10.1016/j.comnet.2025.111099","url":null,"abstract":"<div><div>Vehicular Crowdsensing (VCS) is a pivotal component in advancing Intelligent Transportation Systems (ITS), facilitating the collection and synthesis of extensive data from distributed vehicular networks. Despite its potential, optimizing participation and data acquisition in VCS is challenged by the self-interested nature of individual participants. In this paper, we propose a novel incentive mechanism for VCS, specifically designed to integrate social benefits within a Vehicle Social Network (VSN). A Small-World (SW) network is introduced to model the VSN, providing a more realistic representation of vehicle interactions and enhancing information propagation. VSN enriches the data utility by sharing data within these networks and acts as a non-monetary incentive that is determined by the strength of connections among participants within the constructed SW networks, sustaining participant engagement even with relatively low monetary rewards. We model the VCS campaign as a Markov Decision Process (MDP) that enables vehicles to independently determine their optimal sensing and communication strategies under the SW networks clustering coefficient <span><math><mi>K</mi></math></span> and the rewiring probability <span><math><mi>p</mi></math></span>. To maximize individual utility under incomplete information, we introduce a multi-agent Deep Reinforcement Learning (DRL) approach called IM-SJSC that utilizes Variational Autoencoder (VAE) and Proximal Policy Optimization (PPO) for accurate decision-making processes. Simulation results in the T-Drive real-world dataset validate the efficacy of the proposed approach, showing that the average utility outperforms other baseline algorithms by 25.00%, 54.07%, 145.25%, and 181.82% under varying numbers of vehicles. The proposed algorithm also achieves significant performance improvements in other scenarios, such as different numbers of tasks and varying task basic prices.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111099"},"PeriodicalIF":4.4,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143421137","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}

引用次数: 0

Range-free localization algorithm based on modified distance and improved black-winged kite algorithm

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-10 DOI: 10.1016/j.comnet.2025.111091

Haibin Sun, Shuai Yang

引用次数: 0

Exploring coverage and security challenges in wireless sensor networks: A survey

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-08 DOI: 10.1016/j.comnet.2025.111096

Mari M. Moslehi

{"title":"Exploring coverage and security challenges in wireless sensor networks: A survey","authors":"Mari M. Moslehi","doi":"10.1016/j.comnet.2025.111096","DOIUrl":"10.1016/j.comnet.2025.111096","url":null,"abstract":"<div><div>This survey paper addresses critical issues related to area coverage and security in wireless sensor networks (WSNs). It highlights the essential challenges and corresponding solutions necessary for achieving effective and secure network deployments. The paper underscores the significance of integrating both coverage and security considerations in practical applications, such as environmental monitoring, precision agriculture, and surveillance. Various strategic methods for sensor deployment are discussed, including two-dimensional and three-dimensional approaches, as well as deterministic and stochastic methods. The impact of these strategies on coverage, connectivity, energy efficiency, and scalability is thoroughly analyzed. Additionally, the deployment of both homogeneous and heterogeneous sensors are explored, investigating how differing design criteria influence network deployment, operation, and security.</div><div>Key security challenges examined include encryption, authentication mechanisms, intrusion detection, resource depletion, and countermeasures for node compromise attacks. The insights gained from this analysis contribute to enhancing the reliability, energy efficiency, and overall resilience of WSNs, thereby establishing a foundation for future research on secure and efficient network deployment.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"260 ","pages":"Article 111096"},"PeriodicalIF":4.4,"publicationDate":"2025-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143394578","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}

引用次数: 0