Sunho Lim , Ingyu Lee , Gyu Sang Choi , Jinseok Chae , Ellora Ashish , Eric Ward , Cong Pu
{"title":"FastPlan: A three-step framework for accelerating drone-centric search operations in post-disaster relief","authors":"Sunho Lim , Ingyu Lee , Gyu Sang Choi , Jinseok Chae , Ellora Ashish , Eric Ward , Cong Pu","doi":"10.1016/j.pmcj.2025.102017","DOIUrl":"10.1016/j.pmcj.2025.102017","url":null,"abstract":"<div><div>Commercially well-known drones are increasingly popular and have been deployed in post-disaster relief to support traditional search and rescue operations. However, there are still barriers to conducting a drone-centric search operation, including but not limited to operational difficulty for non-professional drone pilots, inefficient pre-planned path, and more importantly initial setup delay. In this paper, we propose a small-scale prototype of a mobile framework, called <em>FastPlan</em>, to facilitate the development for expediting drone-centric search decisions and operations. The basic idea is to automate the required search operations with no or minimized user intervention. The framework consists of three major operations: map extraction, clustering, and path planning. We extract a set of target POIs and metadata from a public map (i.e., Google Maps) integrated with a customized local database to decide where and what to search. Then we deploy simple density-based clustering and search priority-based path planning strategies to efficiently group and cover the POIs. The framework can be extended flexibly by replacing individual operations with an alternative depending on the search priority, like a Lego block. We implement the framework as an Android-based mobile software (App) for a proof-of-the-concept and conduct extensive simulation experiments for performance evaluation. We analyze the different performance behavior and their implication and applicability. The results indicate that the proposed framework can be a viable approach to post-disaster relief.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"107 ","pages":"Article 102017"},"PeriodicalIF":3.0,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155593","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}
Acquila Santos Rocha , Billy Anderson Pinheiro , Weverton Cordeiro , Vinicius C.M. Borges
{"title":"TrustMD — A multi-layer framework for domain, edge and D2D caching based on trust dissemination and blockchain","authors":"Acquila Santos Rocha , Billy Anderson Pinheiro , Weverton Cordeiro , Vinicius C.M. Borges","doi":"10.1016/j.pmcj.2025.102015","DOIUrl":"10.1016/j.pmcj.2025.102015","url":null,"abstract":"<div><div>Device-to-Device communication (D2D), combined with edge caching and distinct domains, is a promising approach for offloading data from wireless mobile networks. However, user security is still an open issue in D2D communication. Security vulnerabilities remain possible as a side effect of enabling straightforward, direct, and spontaneous interactions between untrustworthy users. To address this issue, this work involves designing TrustMD (Trust Multiple Domain), a multi-layer framework combining diverse technologies inspired by blockchain and trust management to develop a secure and scalable framework for multi-domain, edge, and D2D caching layers. Specifically, TrustMD combines edge trust storage with blockchain for distributed storage management in a multi-layer architecture designed to store trust control data in edge efficiently and D2D networks across different domains. Our experiments with TrustMD showed a significant improvement in data goodput, reaching as high as 95% of the total network throughput. In contrast, state-of-the-art approaches without trust control dissemination achieved at most 80%. Even though we observed a 7% increase in D2D overhead, TrustMD can effectively control latency levels. TrustMD managed security effectively without compromising network performance, reducing false negative rates up to 31% in the best-case scenario. TrustMD offers a scalable and effective security solution that boosts network performance and ensures robust protection.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"107 ","pages":"Article 102015"},"PeriodicalIF":3.0,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143376981","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}
{"title":"Enhancing crowdsourcing through skill and willingness-aligned task assignment with workforce composition balance","authors":"Riya Samanta , Soumya K. Ghosh , Sajal K. Das","doi":"10.1016/j.pmcj.2025.102012","DOIUrl":"10.1016/j.pmcj.2025.102012","url":null,"abstract":"<div><div>Crowdsourcing platforms face critical challenges in task assignment and workforce retention, particularly in aligning complex, skill-intensive tasks with crowd-worker willingness and potential while ensuring workforce diversity and balanced composition. This study introduces the Skill-Aligned Task Assignment and Potential-Aware Workforce Composition (SATA-PAW) framework to address these challenges. The proposed framework formulates the Task Assignment with Workforce Composition Balance (TACOMB) problem as a multi-constraint optimization task, aiming to maximize net utility under task budget constraints while promoting balanced workforce composition. SATA-PAW integrates two novel algorithms, Skill-Aligned Task Assignment (SATA), which optimizes task-worker matching by considering skills, willingness, and budget constraints, and Potential-Aware Workforce Composition (PAW), which leverages satisfaction score and latent potential to retain skilled workers and improve workforce diversity. Experimental evaluations on real-world (UpWork) and synthetic datasets demonstrate SATA-PAW’s superiority over five state-of-the-art methods. The results highlight SATA-PAW’s ability to integrate human-centric factors with efficient optimization, setting a new benchmark for skill-oriented task assignment and balanced workforce composition in crowdsourcing systems.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"107 ","pages":"Article 102012"},"PeriodicalIF":3.0,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143155954","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}
Youwang Sun , Chunhua Jin , Xinying Liu , Lingwen Kong , Changhui Yu , Guanhua Chen , Liqing Chen
{"title":"Vspp: Verifiable, shareable, and privacy-preserving access control scheme for IoV","authors":"Youwang Sun , Chunhua Jin , Xinying Liu , Lingwen Kong , Changhui Yu , Guanhua Chen , Liqing Chen","doi":"10.1016/j.pmcj.2025.102014","DOIUrl":"10.1016/j.pmcj.2025.102014","url":null,"abstract":"<div><div>Internet of Vehicles (IoV) is a specialized application of Internet of Things (IoT), which interconnects vehicles and cloud platforms by using various communication devices and computing technologies to realize the transmission and sharing of vehicle information and enhance the driving experience. However, vehicle users face challenges in identity, data, and inside security when using IoV. In order to solve these problems, we propose a verifiable, shareable, and privacy-preserving access control scheme for IoV. In our scheme, we use zero-knowledge proof (ZKP) to ensure the security of user identity. More specifically, it can enable user anonymity and authenticity without revealing any additional information associated with the user. Meanwhile, we employ proxy re-encryption (PRE) to provide confidential sharing and secure the operation of data. In addition, we use the cryptographic reverse firewall (CRF) to ensure users’ internal security. It can prevent algorithm substitution attacks while ensuring chosen plaintext attack security. Finally, compared to other schemes, our scheme not only enables anonymity, traceability, unlinkability, and confidentiality but is also resistant to insider attacks. Performance evaluation shows that our scheme surpasses the other schemes in terms of time and storage costs.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"107 ","pages":"Article 102014"},"PeriodicalIF":3.0,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387009","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}
Giacomo Longo , Alessandro Cantelli-Forti , Enrico Russo , Francesco Lupia , Martin Strohmeier , Andrea Pugliese
{"title":"Collective victim counting in post-disaster response: A distributed, power-efficient algorithm via BLE spontaneous networks","authors":"Giacomo Longo , Alessandro Cantelli-Forti , Enrico Russo , Francesco Lupia , Martin Strohmeier , Andrea Pugliese","doi":"10.1016/j.pmcj.2024.101997","DOIUrl":"10.1016/j.pmcj.2024.101997","url":null,"abstract":"<div><div>Accurately determining the number of people affected by emergencies is essential for deploying effective response measures during disasters. Traditional solutions like cellular and Wi-Fi networks are often rendered ineffective during such emergencies due to widespread infrastructure damage or non-functional connectivity, prompting the exploration of more resilient methods. This paper proposes a novel solution utilizing Bluetooth Low Energy (BLE) technology and decentralized networks composed entirely of mobile and wearable devices to count individuals autonomously without reliance on external communication equipment or specialized personnel. This count leverages uncoordinated relayed communication among devices within these networks, enabling us to extend our counting capabilities well beyond the direct range of rescuers. A formally evaluated, experimentally validated, and privacy-preserving counting algorithm that demonstrates rapid convergence and high accuracy even in large-scale scenarios is employed.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"106 ","pages":"Article 101997"},"PeriodicalIF":3.0,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142757430","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}
Ahmed Fahim Mostafa , Mohamed Abdel-Kader , Yasser Gadallah
{"title":"Three-dimensional spectrum coverage gap map construction in cellular networks: A non-linear estimation approach","authors":"Ahmed Fahim Mostafa , Mohamed Abdel-Kader , Yasser Gadallah","doi":"10.1016/j.pmcj.2024.101998","DOIUrl":"10.1016/j.pmcj.2024.101998","url":null,"abstract":"<div><div>Data collection techniques can be used to determine the coverage conditions of a cellular communication network within a given area. In such tasks, the data acquisition process faces significant challenges for larger or inaccessible locations. Such challenges can be alleviated through the use of unmanned aerial vehicles (UAVs). This way, data acquisition obstacles can be overcome to acquire and process the necessary data points with relative ease to estimate a full area coverage map for the concerned network. In this study, we formulate the problem of deploying a UAV to acquire the minimum possible measurement data points in a geographical region for the purpose of constructing a full communication coverage gap map for this region. We then devise an estimation model that utilizes the measured data samples and determines the noise/loss levels of the communication links at the other unvisited spots of the region accordingly. The proposed estimation model is based on a cascade-forward neural network to allow for both nonlinear and direct linear relationships between the input data and the output estimations. We further investigate the conventional method of using linear regression estimators to decide on the received power levels at the different locations of the examined area. Our simulation evaluations show that the proposed nonlinear estimator outperforms the conventional linear regression technique in terms of the communication coverage error level while using the minimum possible collected data points. These minimum data points are then used in constructing a complete coverage gap map visualization that demonstrates the overall network service conditions within the surveyed region.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"106 ","pages":"Article 101998"},"PeriodicalIF":3.0,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142758973","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}
{"title":"Blockchain-Inspired Trust Management in Cognitive Radio Networks with Cooperative Spectrum Sensing","authors":"Mahsa Mahvash , Neda Moghim , Mojtaba Mahdavi , Mahdieh Amiri , Sachin Shetty","doi":"10.1016/j.pmcj.2024.101999","DOIUrl":"10.1016/j.pmcj.2024.101999","url":null,"abstract":"<div><div>Cooperative spectrum sensing (CSS) in cognitive radio networks (CRNs) enhances spectral decision-making precision but introduces vulnerabilities to malicious secondary user (SU) attacks. This paper proposes a decentralized trust and reputation management (TRM) framework to address these vulnerabilities, emphasizing the need to mitigate risks associated with centralized systems. Inspired by blockchain technology, we present a distributed TRM method for CSS in CRNs, significantly reducing the impact of malicious attacks. Our approach leverages a Proof of Trust (PoT) system to enhance the integrity of CSS, thereby improving the accuracy of spectral decision-making while reducing false positives and false negatives. In this system, SUs’ trust scores are dynamically updated based on their sensing reports, and they will collaboratively participate in new blocks' formation using the trust scores. Simulation results validate the effectiveness of the proposed method, indicating its potential to enhance security and reliability in CRNs.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"106 ","pages":"Article 101999"},"PeriodicalIF":3.0,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142722139","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}
{"title":"Delay-aware resource allocation for partial computation offloading in mobile edge cloud computing","authors":"Lingfei Yu , Hongliu Xu , Yunhao Zeng , Jiali Deng","doi":"10.1016/j.pmcj.2024.101996","DOIUrl":"10.1016/j.pmcj.2024.101996","url":null,"abstract":"<div><div>Mobile Edge Cloud Computing (MECC), as a promising partial computing offloading solution, has provided new possibilities for compute-intensive and delay-sensitive mobile applications, which can simultaneously leverage edge computing and cloud services. However, designing resource allocation strategies for MECC faces an extremely challenging problem of simultaneously satisfying the end-to-end latency requirements and minimum resource allocation of multiple mobile applications. To address this issue, we comprehensively consider the randomness of computing request arrivals, service time, and dynamic computing resources. We model the MECC network as a two-level tandem queue consisting of two sequential computing processing queues, each with multiple servers. We apply a deep reinforcement learning algorithm called Deep Deterministic Policy Gradient (DDPG) to learn the computing speed adjustment strategy for the tandem queue. This strategy ensures the end-to-end latency requirements of multiple mobile applications while preventing overuse of the total computing resources of edge servers and cloud servers. Numerous simulation experiments demonstrate that our approach is significantly superior to other methods in dynamic network environments.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"105 ","pages":"Article 101996"},"PeriodicalIF":3.0,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142661544","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}
{"title":"Minimum data sampling requirements for accurate detection of terrain-induced gait alterations change with mobile sensor position","authors":"Arshad Sher , Otar Akanyeti","doi":"10.1016/j.pmcj.2024.101994","DOIUrl":"10.1016/j.pmcj.2024.101994","url":null,"abstract":"<div><div>Human gait is a key biomarker for health, independence and quality of life. Advances in wearable inertial sensor technologies have paved the way for out-of-the-lab human gait analysis, which is important for the assessment of mobility and balance in natural environments and has applications in multiple fields from healthcare to urban planning. Automatic recognition of the environment where walking takes place is a prerequisite for successful characterisation of terrain-induced gait alterations. A key question which remains unexplored in the field is how minimum data requirements for high terrain classification accuracy change depending on the sensor placement on the body. To address this question, we evaluate the changes in performance of five canonical machine learning classifiers by varying several data sampling parameters including sampling rate, segment length, and sensor configuration. Our analysis on two independent datasets clearly demonstrate that a single inertial measurement unit is sufficient to recognise terrain-induced gait alterations, accuracy and minimum data requirements vary with the device position on the body, and choosing correct data sampling parameters for each position can improve classification accuracy up to 40% or reduce data size by 16 times. Our findings highlight the need for adaptive data collection and processing algorithms for resource-efficient computing on mobile devices.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"105 ","pages":"Article 101994"},"PeriodicalIF":3.0,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142531089","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}
Tingxuan Fu , Sijia Hao , Qiming Chen , Zihan Yan , Huawei Liu , Amin Rezaeipanah
{"title":"An energy-aware secure routing scheme in internet of things networks via two-way trust evaluation","authors":"Tingxuan Fu , Sijia Hao , Qiming Chen , Zihan Yan , Huawei Liu , Amin Rezaeipanah","doi":"10.1016/j.pmcj.2024.101995","DOIUrl":"10.1016/j.pmcj.2024.101995","url":null,"abstract":"<div><div>The rapid advancement of technology has led to the proliferation of devices connected to the Internet of Things (IoT) networks, bringing forth challenges in both energy management and secure data communication. In addition to energy constraints, IoT networks face threats from malicious nodes, which jeopardize the security of communications. To address these challenges, we propose an Energy-aware secure Routing scheme via Two-Way Trust evaluation (ERTWT) for IoT networks. This scheme enhances network protection against various attacks by calculating trust values based on energy trust, direct trust, and indirect trust. The scheme aims to enhance the efficiency of data transmission by dynamically selecting routes based on both energy availability and trustworthiness metrics of fog nodes. Since trust management can guarantee privacy and security, ERTWT allows the service requester and the service provider to check each other's safety and reliability at the same time. In addition, we implement Generative Flow Networks (GFlowNets) to predict the energy levels available in nodes in order to use them optimally. The proposed scheme has been compared with several advanced energy-aware and trust-based routing protocols. Evaluation results show that ERTWT more effectively detects malicious nodes while achieving better energy efficiency and data transmission rates.</div></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"105 ","pages":"Article 101995"},"PeriodicalIF":3.0,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142531088","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}