Welcome to the IKCEST
Journal
IEEE Transactions on Mobile Computing

IEEE Transactions on Mobile Computing

Archives Papers: 827
IEEE Xplore
Please choose volume & issue:
Generative Diffusion-Based Contract Design for Efficient AI Twin Migration in Vehicular Embodied AI Networks
Yue ZhongJiawen KangJinbo WenDongdong YeJiangtian NieDusit NiyatoXiaozheng GaoShengli Xie
Keywords:Artificial intelligenceContractsReal-time systemsDecision makingVehicle dynamicsSolid modelingComputational modelingAdaptation modelsNavigationDiffusion modelsContract DesignTwin MigrationComputational ResourcesPhysical SpaceInformation AsymmetryDiffusion ModelAutonomous VehiclesPhysical WorldDeep Reinforcement LearningMultidimensional ModelArtificial Intelligence ModelsProspect TheoryRoadside UnitsExpected Utility TheoryOptimal ContractVirtuallyDenoisingDiffusion ProcessDynamic EnvironmentForward ProcessReversible ProcessProximal Policy OptimizationUncertain EnvironmentContract ModelContract TheoryNetwork LayerLoss AversionDeep Reinforcement Learning AlgorithmMechanisms Of MigrationVehicular embodied AImulti-dimensional contract theorygenerative diffusion modelprospect theory
Abstracts:Embodied Artificial Intelligence (AI) bridges the cyberspace and the physical space, driving advancements in autonomous systems like the Vehicular Embodied AI NETwork (VEANET). VEANET integrates advanced AI capabilities into vehicular systems to enhance autonomous operations and decision-making. Embodied agents, such as Autonomous Vehicles (AVs), are autonomous entities that can perceive their environment and take actions to achieve specific goals, actively interacting with the physical world. Embodied Agent Twins (EATs) are digital models of these embodied agents, with various Embodied Agent AI Twins (EAATs) for intelligent applications in cyberspace. In VEANETs, EAATs act as in-vehicle AI assistants to perform diverse tasks supporting autonomous driving using generative AI models. Due to limited onboard computational resources, AVs offload EAATs to nearby RoadSide Units (RSUs). However, the mobility of AVs and limited RSU coverage necessitates dynamic migrations of EAATs, posing challenges in selecting suitable RSUs under information asymmetry. To address this, we construct a multi-dimensional contract theoretical model between AVs and alternative RSUs. Considering that AVs may exhibit irrational behavior, we utilize prospect theory instead of expected utility theory to model the actual utilities of AVs. Finally, we employ a Generative Diffusion Model (GDM)-based algorithm to identify the optimal contract designs, thus enhancing the efficiency of EAAT migrations. Numerical results demonstrate the superior efficiency of the proposed GDM-based scheme in facilitating EAAT migrations compared with traditional deep reinforcement learning methods.
PCSE: Privacy-Preserving Collaborative Searchable Encryption for Group Data Sharing in Cloud Computing
Yongliang XuHang ChengXimeng LiuChangsong JiangXinpeng ZhangMeiqing Wang
Keywords:EncryptionServersCryptographySecurityCollaborationCloud computingMobile computingPublic keyProtectionProtocolsCloud ComputingData SharingSearchable EncryptionSearch ResultsSecurity AnalysisEncryption SchemeSingle Point Of FailureComputational CostData IntegrationAccess ControlComputational OverheadOutput Of AlgorithmSecret KeyCommunication CostStorage CostPublic KeyBrute ForceSymmetric EncryptionCommunication OverheadSecret SharingBrute-force AttacksPublic Key InfrastructureKey GenerationProbabilistic Polynomial TimeBilinear PairingBilinear MapSecurity ParameterNumber Of KeywordsList Of KeywordsLagrange InterpolationThreshold access controlsearchable encryptionkeyword guessing attackcryptographic reverse firewallcloud computing
Abstracts:Collaborative searchable encryption for group data sharing enables a consortium of authorized users to collectively generate trapdoors and decrypt search results. However, existing countermeasures may be vulnerable to a keyword guessing attack (KGA) initiated by malicious insiders, compromising the confidentiality of keywords. Simultaneously, these solutions often fail to guard against hostile manufacturers embedding backdoors, leading to potential information leakage. To address these challenges, we propose a novel privacy-preserving collaborative searchable encryption (PCSE) scheme tailored for group data sharing. This scheme introduces a dedicated keyword server to export server-derived keywords, thereby withstanding KGA attempts. Based on this, PCSE deploys cryptographic reverse firewalls to thwart subversion attacks. To overcome the single point of failure inherent in a single keyword server, the export of server-derived keywords is collaboratively performed by multiple keyword servers. Furthermore, PCSE extends its capabilities to support efficient multi-keyword searches and result verification and incorporates a rate-limiting mechanism to effectively slow down adversaries’ online KGA attempts. Security analysis demonstrates that our scheme can resist KGA and subversion attack. Theoretical analyses and experimental results show that PCSE is significantly more practical for group data sharing systems compared with state-of-the-art works.
An Improved Ultra-Lightweight Anonymous Authenticated Key Agreement Protocol for Wearable Devices
Xin AiAkhtar BadshahShanshan TuMuhammad WaqasIftekhar Ahmad
Keywords:ProtocolsAuthenticationSecurityWearable devicesServersCloud computingComputational modelingReviewsMedical servicesInternet of ThingsWearable DevicesKey AgreementAuthenticated Key Agreement ProtocolComputational ResourcesCommunication ChannelsData TransmissionHash FunctionSecurity AnalysisDesign FlawsRobust MechanismMalicious AttacksOne-way HashSession KeyNetwork ModelCloud ComputingInternet Of ThingsComputational OverheadUser IdentificationCommunication OverheadThreat ModelAuthentication ProtocolMutual AuthenticationMobile TerminalsImpersonation AttackReplay AttacksSecure ChannelAuthentication ProcessCryptographic PrimitivesKey ExchangeRegistration PhaseWearable devicessecurityprivacyanonymous authenticationkey agreementhash functions
Abstracts:For wearable devices with constrained computational resources, it is typically required to offload processing tasks to more capable servers. However, this practice introduces vulnerabilities to data confidentiality and integrity due to potential malicious network attacks, unreliable servers, and insecure communication channels. A robust mechanism that ensures anonymous authentication and key agreement is therefore imperative for safeguarding the authenticity of computing entities and securing data during transmission. Recently, Guo et al. proposed an anonymous authentication key agreement and group proof protocol specifically designed for wearable devices. This protocol, benefiting from the strengths of previous research, is designed to thwart a variety of cyber threats. However, inaccuracies in their protocol lead to issues with authenticity verification, ultimately preventing the establishment of secure session keys between communication entities. To address these design flaws, an improved ultra-lightweight protocol was proposed, employing cryptographic hash functions to ensure authentication and privacy during data transmission in wearable devices. Supported by rigorous security validations and analyses, the proposed protocol significantly boosts both security and efficiency, marking a substantial advancement over prior methodologies.
A Security-Enhanced Ultra-Lightweight and Anonymous User Authentication Protocol for Telehealthcare Information Systems
Dake ZengAkhtar BadshahShanshan TuMuhammad WaqasZhu Han
Keywords:ProtocolsSecurityAuthenticationMedical servicesPasswordsServersTelemedicineInternet of ThingsHash functionsThreat modelingTelemedicineUser AuthenticationAuthentication ProtocolUser Authentication ProtocolInternet Of ThingsData PrivacyHash FunctionSecurity ThreatsInternet Of Things DevicesSecurity AnalysisSession KeyPublic InternetFormal AnalysisComputational OverheadSmart DevicesSecret KeyPublic KeyCommunication OverheadBiometric DataThreat ModelSmart CardKey ExchangeImpersonation AttackSecure ChannelMutual AuthenticationPhysical Unclonable FunctionsMessage Authentication CodeEncryption ProcessAuthentication ProcessReplay AttacksAuthenticationInternet of Thingssecurityauthenticated encryptionAsconsecure communication
Abstracts:The surge in smartphone and wearable device usage has propelled the advancement of the Internet of Things (IoT) applications. Among these, e-healthcare stands out as a fundamental service, enabling the remote access and storage of patient-related data on a centralized medical server (MS), and facilitating connections between authorized individuals such as doctors, patients, and nurses over the public Internet. However, the inherent vulnerability of the public Internet to diverse security threats underscores the critical need for a robust and secure user authentication protocol to safeguard these essential services. This research presents a novel, resource-efficient user authentication protocol specifically designed for healthcare systems. Our proposed protocol leverages the lightweight authenticated encryption with associated data (AEAD) primitive Ascon combined with hash functions and XoR, specifically tailored for encrypted communication in resource-constrained IoT devices, emphasizing resource efficiency. Additionally, the proposed protocol establishes secure session keys between users and MS, facilitating future encrypted communications and preventing unauthorized attackers from illegally obtaining users’ private data. Furthermore, comprehensive security validation, including informal security analyses, demonstrates the protocol's resilience against a spectrum of security threats. Extensive analysis reveals that our proposed protocol significantly reduces computational and communication resource requirements during the authentication phase in comparison to similar authentication protocols, underscoring its efficiency and suitability for deployment in healthcare systems.
AgileDART: An Agile and Scalable Edge Stream Processing Engine
Cheng-Wei ChingXin ChenChaeeun KimTongze WangDong ChenDilma Da SilvaLiting Hu
Keywords:Peer-to-peer computingCloud computingEnginesVehicle dynamicsTime factorsComputer scienceAutomobilesTopologyDistributed databasesActuatorsScalableStream ProcessingEdge StreamStream Processing EnginesProcessing SystemComputational ResourcesSensor DataData StreamsPath PlanningData Processing SystemWorkload VariablesParallelizationWireless NetworksFlow DataOptimal PathDirected Acyclic GraphVirtual MachinesSource NodeRecovery StatusEdge NodesSink NodeEdge Of ZoneFailure RecoveryRouting TableEdge DevicesSubsequent PathPath DelayMulti-armed BanditBitcoinUse Case ScenariosEdge stream processingdistributed hash tableedge networksbandit algorithm
Abstracts:Edge applications generate a large influx of sensor data on massive scales, and these massive data streams must be processed shortly to derive actionable intelligence. However, traditional data processing systems are not well-suited for these edge applications as they often do not scale well with a large number of concurrent stream queries, do not support low-latency processing under limited edge computing resources, and do not adapt to the level of heterogeneity and dynamicity commonly present in edge computing environments. As such, we present AgileDart, an agile and scalable edge stream processing engine that enables fast stream processing of many concurrently running low-latency edge applications’ queries at scale in dynamic, heterogeneous edge environments. The novelty of our work lies in a dynamic dataflow abstraction that leverages distributed hash table-based peer-to-peer overlay networks to autonomously place, chain, and scale stream operators to reduce query latencies, adapt to workload variations, and recover from failures and a bandit-based path planning model that re-plans the data shuffling paths to adapt to unreliable and heterogeneous edge networks. We show that AgileDart outperforms Storm and EdgeWise on query latency and significantly improves scalability and adaptability when processing many real-world edge stream applications’ queries.
Enhancing Remote Sensing Image Scene Classification With Satellite-Terrestrial Collaboration and Attention-Aware Transmission Policy
Anqi LuYoubing HuZhiqiang CaoJie LiuLingzhi LiZhijun Li
Keywords:SatellitesRemote sensingLow earth orbit satellitesSpace-air-ground integrated networksScene classificationDelaysAccuracyCollaborationReal-time systemsMobile computingRemote SensingRemote Sensing ImagesScene ClassificationClassification ModelSampling RateClassification AccuracyTransmission RateData TransmissionTransmission DelayLow Earth OrbitModulation Of TransmissionImage BlockData Transmission RateReal-time TransmissionConvolutional Neural NetworkHyperparametersStage 2Power ConsumptionRandom SelectionAdaptive MethodAdaptive SelectionGround StationAttention ScoresAdaptive SamplingFree-space LossLinear LayerTransformer ModelReceived Signal PowerChannel GainAdamW OptimizerLow Earth orbit (LEO) satelliteremote sensing image scene classification (RSISC)satellite-terrestrial collaborationsatellite edge computingattention-aware policy
Abstracts:Advancements in Earth observation sensors on low Earth orbit (LEO) satellites have significantly increased the volume of remote sensing images. This growth has led to challenges such as higher storage demands, downlink bandwidth stress, and transmission delays, particularly for real-time remote sensing image scene classification (RSISC). To address this, we propose a novel Satellite-Terrestrial Collaborative Scene Classification (STCSC) framework that integrates transmission and computation. The framework employs an attention-aware policy on the satellite, which adaptively determines the sequence of images and selection of image blocks for transmission, as well as these blocks’ sampling rates. This policy is based on image complexity and the real-time data transmission rate, prioritizing blocks crucial for downstream tasks. On the ground, a classification model processes the received image blocks, balancing classification accuracy and transmission delay. Moreover, we have developed a comprehensive simulation system to validate the performance of our framework, including simulations of the satellite, transmission, and ground modules. Simulation results demonstrate that our STCSC framework can reduce transmission delay by 76.6% while enhancing classification accuracy on the ground by 0.6%. Additionally, our attention-aware policy is compatible with any ground classification model.
Graph-Based Indoor 3D Pedestrian Location Tracking With Inertial-Only Perception
Shiyu BaiWeisong WenDongzhe SuLi-Ta Hsu
Keywords:Simultaneous localization and mappingPedestriansAccuracyThree-dimensional displaysOptimizationStairsReliabilityMobile handsetsLocation awarenessDead reckoningLocation TrackingPedestrian PositioningPedestrian TrackingIndoor 3DMobile DevicesLearning-based MethodsInertial Measurement UnitPosition EstimationSimultaneous Localization And MappingLoop ClosureGraph OptimizationFactor GraphDead ReckoningEntry PointLight Detection And RangingVertical PositionPosition ErrorHorizontal PositionVertical DisplacementAccelerometer DataInertial Measurement Unit DataVertical AccelerationPast ConditionsWorld FrameBody FrameParticle FilterBluetooth Low EnergyProbability Of HypothesisOffice BuildingsInertial DataIndoor localizationpedestriansinertial perceptionSLAMfactor graph optimization
Abstracts:Pedestrian location tracking in emergency responses and environmental surveys of indoor scenarios tend to rely only on their own mobile devices, reducing the usage of external services. Low-cost and small-sized inertial measurement units (IMU) have been widely distributed in mobile devices. However, they suffer from high-level noises, leading to drift in position estimation over time. In this work, we present a graph-based indoor 3D pedestrian location tracking with inertial-only perception. The proposed method uses onboard inertial sensors in mobile devices alone for pedestrian state estimation in a simultaneous localization and mapping (SLAM) mode. It starts with a deep vertical odometry-aided 3D pedestrian dead reckoning (PDR) to predict the position in 3D space. Environment-induced behaviors, such as corner-turning and stair-taking, are regarded as landmarks. Multi-hypothesis loop closures are formed using statistical methods to handle ambiguous data association. A factor graph optimization fuses 3D PDR and behavior loop closures for state estimation. Experiments in different scenarios are performed using a smartphone to evaluate the performance of the proposed method, which can achieve better location tracking than current learning-based and filtering-based methods. Moreover, the proposed method is also discussed in different aspects, including the accuracy of offline optimization and proposed height regression, and the reliability of the multi-hypothesis behavior loop closures. The video (YouTube) or (BiliBili) is also shared to display our research.
Lightweight Configuration Adaptation With Multi-Teacher Reinforcement Learning for Live Video Analytics
Yuanhong ZhangWeizhan ZhangMuyao YuanLiang XuCaixia YanTieliang GongHaipeng Du
Keywords:Streaming mediaVisual analyticsAccuracyRobustnessQuantization (signal)Mobile computingComputational modelingBandwidthReinforcement learningPose estimationVideo AnalysisNeural NetworkDeep Neural NetworkDynamic NetworkComparable AccuracySemantic SegmentationVision TasksPose EstimationVideo ContentInference AccuracyVideo CaptureCompetitive DynamicsReinforcement Learning AgentTransmission LatencyDynamic VideoAdvances In Deep Neural NetworksArtificial Neural NetworkFrame RateMulti-coreLearning-based MethodsOptical FlowLatency ReductionVideo SegmentsRule-based AlgorithmStudent ModelLive StreamingRule-based MethodsStudent NetworkRule-based ApproachImitation LearningMobile and edge intelligencemachine-centric video streamingconfiguration adaptationmulti-teacher knowledge distillation
Abstracts:The proliferation of video data and advancements in Deep Neural Networks (DNNs) have greatly boosted live video analytics, driven by the growing video capture capabilities of mobile devices. However, resource limitations necessitate the transmission of endpoint-collected videos to servers for inference. To meet real-time requirements and ensure accurate inference, it is essential to adjust video configurations at the endpoint. Traditional methods rely on deterministic strategies, posing difficulties in adapting to dynamic networks and video content. Meanwhile, emerging learning-based schemes suffer from trial-and-error exploration mechanisms, resulting in a concerning long-tail effect on upload latency. In this paper, we propose a novel lightweight and robust configuration adaptation policy (LCA), which fuses heuristic and RL-based agents using multi-teacher knowledge distillation (MKD) theory. First, we propose a content-sensitive and bandwidth-adaptive RL agent and introduce a Lyapunov-based optimization agent for ensuring latency robustness. To leverage both agents’ strengths, we design a feature-guided multi-teacher distillation network to transfer their advantages to the student. The experimental results across two vision tasks (pose estimation and semantic segmentation) demonstrate that LCA significantly reduces transmission latency compared to prior work (average reduction of 47.11%-89.55%, 95-percentile reduction of 27.63%-88.78%) and computational overhead while maintaining comparable inference accuracy.
Can We Enhance the Quality of Mobile Crowdsensing Data Without Ground Truth?
Jiajie LiBo GuShimin GongZhou SuMohsen Guizani
Keywords:SensorsMobile computingData integrityCorrelationAccuracyData aggregationCrowdsensingSparse matricesTransformersNoiseMobile CrowdsensingData QualityHigh-quality DataMobile UsersLow-quality DataInaccurate PredictionsSpatiotemporal NetworkRoot Mean Square ErrorCharacteristics Of DataLevel Of QualityAttention MechanismSparse DataTime SlotTemporal CorrelationProportion Of DataTraffic FlowSpatial DependencePerformance Of Different MethodsTraffic DataExperimental ScenariosIncorrect DataData Quality EvaluationSpatiotemporal CorrelationFake DataAutoregressive Integrated Moving AverageFeature ModulePoint LevelSpatiotemporal ModulationConvolutional Neural NetworkError DataData qualitymobile crowdsensingreputationdata predictiontruth discovery
Abstracts:Mobile crowdsensing (MCS) has emerged as a prominent trend across various domains. However, ensuring the quality of the sensing data submitted by mobile users (MUs) remains a complex and challenging problem. To address this challenge, an advanced method is needed to detect low-quality sensing data and identify malicious MUs that may disrupt the normal operations of an MCS system. Therefore, this article proposes a prediction- and reputation-based truth discovery (PRBTD) framework, which can separate low-quality data from high-quality data in sensing tasks. First, we apply a correlation-focused spatio-temporal Transformer network that learns from the historical sensing data and predicts the ground truth of the data submitted by MUs. However, due to the noise in historical data for training and the bursty values within sensing data, the prediction results can be inaccurate. To address this issue, we use the implications among the sensing data, which are learned from the prediction results but are stable and less affected by inaccurate predictions, to evaluate the quality of the data. Finally, we design a reputation-based truth discovery (TD) module for identifying low-quality data with their implications. Given the sensing data submitted by MUs, PRBTD can eliminate the data with heavy noise and identify malicious MUs with high accuracy. Extensive experimental results demonstrate that the PRBTD method outperforms existing methods in terms of identification accuracy and data quality enhancement.
A High Reliable Routing Protocol Based on Spatial-Temporal Graph Model for Multiple Unmanned Underwater Vehicles Network
Cangzhu XuShanshan SongXiujuan WuGuangjie HanMiao PanGaochao XuJun-Hong Cui
Keywords:RoutingRouting protocolsReliabilityUnderwater acousticsEnergy consumptionHeuristic algorithmsQ-learningMobile computingEnergy efficiencyVehicle dynamicsHigh ReliabilityUnmanned Underwater VehiclesSpatial-temporal ModelEnergy ConsumptionEnergy BalanceForward SelectionReward FunctionInterval PeriodNeighborhood RelationshipReliable TransmissionPacket TransmissionSpatial-temporal VariationPacket DeliveryNeighborhood ConnectivityDynamic NetworkNeighboring NodesDoppler ShiftAverage DelayPacket LossAutonomous Underwater VehiclesMode Of MobilityActual RewardEnergy Of NodesPeriod T1Autonomous Surface VehiclesMobility ScenariosResidual EnergyPacket CollisionsHold TimeUnderwater acoustic sensor networks (UASNs)multiple unmanned underwater vehiclesrouting protocolspatial-temporal graph modelQ-learning
Abstracts:Increasing demands for versatile applications have spurred the rapid development of Unmanned Underwater Vehicle (UUV) networks. Nevertheless, multi-UUV movements exacerbates the spatial-temporal variability, leading to serious intermittent connectivity of underwater acoustic channel. Such phenomena challenge the identification of reliable paths for high-dynamic network routing. Existing routing protocols overlook the effects of UUV movements on forwarding path, typically selecting forwarders based solely on the current network state, which lead to instability in packet transmission. To address these challenges, we propose a Routing protocol based on Spatial-Temporal Graph model with Q-learning for multi-UUV networks (STGR), achieving high reliable and energy effective transmission. Specifically, a distributed Spatial-Temporal Graph model (STG) is proposed to depict the evolving variation characteristics (neighbor relationships, link quality, and connectivity duration) among underwater nodes over periodic intervals. Then we design a Q-learning-based forwarder selection algorithm integrated with STG to calculate reward function, ensuring adaptability to the ever-changing conditions. We have performed extensive simulations of STGR on the Aqua-Sim-tg platform and compared with the state-of-the-art routing protocols in terms of Packet Delivery Rate (PDR), latency, energy consumption and energy balance with different network settings. The results show that STGR yields 24.32 percent higher PDR on average than them in multi-UUV networks.
Hot Journals