2022 18th International Conference on Mobility, Sensing and Networking (MSN)最新文献_第5页

Joint Task Partition and Computation Offloading for Latency-Sensitive Services in Mobile Edge Networks 移动边缘网络中延迟敏感业务的联合任务划分与计算卸载

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00042

Yujie Peng, Xiaoqin Song, F. Liu, Guoliang Xing, Tiecheng Song

{"title":"Joint Task Partition and Computation Offloading for Latency-Sensitive Services in Mobile Edge Networks","authors":"Yujie Peng, Xiaoqin Song, F. Liu, Guoliang Xing, Tiecheng Song","doi":"10.1109/MSN57253.2022.00042","DOIUrl":"https://doi.org/10.1109/MSN57253.2022.00042","url":null,"abstract":"With the development of Internet of Things (IoT), wireless communication networks and Artificial Intelligence (AI), more and more real-time applications such as online games and autonomous driving have emerged. However, due to limited computing power and battery capacity, it has become increasingly difficult for local user devices to take on the full range of computing tasks under tight timing constraints. The emerging Mobile Edge Computing (MEC) technology is widely considered to be an important technology for achieving ultra-low latency. However, most of the existing work is focused on non-splittable computation tasks. In fact, data partitioning-oriented applications can be split into multiple subtasks for parallel processing. In this paper, we study the partial computation offloading of multiple detachable tasks in MEC networks, focusing on minimizing the total user device latency in the multi-MEC multi-user scenarios. Considering the dynamic partitioning of tasks, we adopt the barrel theory to construct a linear system of equations to find the optimal solutions and propose an approach for distributed computation offloading based on numerical methods. The simulation results show that the proposed algorithm can reduce the average user device latency by 31 % compared with the binary offloading method.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129011699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Alz-Sense+: An Auto Time-synchronized Multi-class Algorithm for Dementia Detection Alz-Sense+:一种自动时间同步的多类痴呆检测算法

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00108

S. M. Shovan, Sajal Kumar Das

{"title":"Alz-Sense+: An Auto Time-synchronized Multi-class Algorithm for Dementia Detection","authors":"S. M. Shovan, Sajal Kumar Das","doi":"10.1109/MSN57253.2022.00108","DOIUrl":"https://doi.org/10.1109/MSN57253.2022.00108","url":null,"abstract":"Dementia, a cognitive disease that affects more than 50 million people, causes some degree of disability in remembering simple things and following basic instructions with unusual delays. Researchers proposed different pre-clinical methods with mediocre performance leaving the door open for further improvement. One of the most successful pre-clinical tests, SLUMS (Saint Louis University Mental Status), incorpo-rates verbal responses in the form of standardized questionnaires. It involves expert judgment to label patients such as dementia, MCI (Mild Cognitive Impairment), or healthy based on an overall score. However, a nonverbal stress response is also taken into account in the Alz-Sense algorithm, which has a few underlying false assumptions, i) uniformity of answering duration, ii) equity of questions stress level, and iii) unfair stress penalty while discarding healthy patient detection. Moreover, the stress data of the corresponding question is manually synchronized using the examiner's hand-shaken data of the wearable device. As a goal to improve the original Alz-Sense algorithm, Alz-Sense+ is proposed to handle these three assumptions by incorporating the windowing process, statistical and visual approach. Be-sides, it also automated the synchronization between questions and corresponding sensor data by estimating time slots while proposing an optimal ordering of questions that mitigates the unintended consequences. Alz-Sense+ achieved 81.39%, 80.76%, and 82.35 % accuracy, sensitivity, and specificity, respectively, which is 7.39%, 0.01 %, and 15.75% improvement over the original Alz-Sense algorithm. In a nutshell, the new Alz-Sense+ algorithm outperformed the existing algorithm by addressing a few underlying assumptions while eliminating a few limitations of the original algorithm.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128784632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

K-Means Based Grouping of Stations with Dynamic AID Assignment in IEEE 802.11ah Networks IEEE 802.11ah网络中基于k均值的动态AID分组

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00034

Eduardo C. Oliveira, Stephanie M. Soares, Marcelo M. Carvalho

{"title":"K-Means Based Grouping of Stations with Dynamic AID Assignment in IEEE 802.11ah Networks","authors":"Eduardo C. Oliveira, Stephanie M. Soares, Marcelo M. Carvalho","doi":"10.1109/MSN57253.2022.00034","DOIUrl":"https://doi.org/10.1109/MSN57253.2022.00034","url":null,"abstract":"The IEEE 802.11ah amendment extends the success of traditional IEEE 802.11 networks to sub-GHz frequency bands by allowing higher signal coverage and introducing new capabilities to handle a massive number of stations in applications for the Internet of Things. The restricted access window (RAW) mechanism is the key technique to limit contention by dividing stations into RAW groups and RAW time slots according to AID numbers that can be changed dynamically via AID Switch Response frames. To date, however, such feature has not been investigated, especially in cooperation with some grouping scheme. This paper presents the first investigation on the use of AID Switch Response frames to implement dynamic grouping. The goal is to improve throughput fairness among stations that are geographically distributed over some area. The grouping scheme is based on the K-Means algorithm, which takes as input the length and signal strength of data frames received by the AP, and the modulation and coding schemes (MCS) adopted by stations. Simulation results show significant gains in throughput fairness obtained with the proposed grouping scheme compared to random grouping over different network scenarios.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"430 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116001581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

User-Perceived QoE Adaptation for Accelerated Playback in Mobile Video Streaming 用户感知QoE适应移动视频流加速播放

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00033

Xiongfeng Hu, Yibo Jin, Kefeng Wu, Zhuzhong Qian, Sanglu Lu

{"title":"User-Perceived QoE Adaptation for Accelerated Playback in Mobile Video Streaming","authors":"Xiongfeng Hu, Yibo Jin, Kefeng Wu, Zhuzhong Qian, Sanglu Lu","doi":"10.1109/MSN57253.2022.00033","DOIUrl":"https://doi.org/10.1109/MSN57253.2022.00033","url":null,"abstract":"User-perceived quality of experience (QoE) is critical as mobile video streaming experiences a substantial growth. User's demands are becoming diversified where accelerated play-back is the preference of a considerable part of users. However, the limited and fluctuate mobile bandwidth is often not capable of satisfying user's demand of watching video at 2x or higher speed because of consequential frequent rebuffering. Previous adaptive bitrate (ABR) algorithms hardly consider the variety of user playback rates. In this work, we fully exploit the relation between user-perceived, i.e., subjective video quality and the characteristic of video content. The result of our motivational experiments shows that viewers are less sensitive to the bitrate variation and playback rate alternation if there is higher degree of motion in the video. With above guidelines, we adaptively adjust the quality configuration and playback rate to significantly reduce the rebuffering while achieving similar or even higher subjective quality. Then we formulate subjective quality and playback rate adaption as a QoE maximization problem and propose the content based subjective quality and playback rate adaptation algorithm (CSP) utilizing Lyapunov optimization technique. Via rigorous proof, the time-average QoE achieved by CSP is in $O(1/V)$ gap compared to optimal value, where $V$ is the control parameter. Extensive evaluations confirm the superiority of our proposed algorithm over other state-of-the-art algorithms under both normal and accelerated playback rate.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114383184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An atomic member addition mechanism for permissioned blockchain based on autonomous rollback 一种基于自治回滚的许可区块链原子成员添加机制

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00068

Qihui Zhou, Xianglin Dang, Yazhe Wang, Zhen Xu, Penghui Lv

{"title":"An atomic member addition mechanism for permissioned blockchain based on autonomous rollback","authors":"Qihui Zhou, Xianglin Dang, Yazhe Wang, Zhen Xu, Penghui Lv","doi":"10.1109/MSN57253.2022.00068","DOIUrl":"https://doi.org/10.1109/MSN57253.2022.00068","url":null,"abstract":"As a distributed ledger technology, the addition of new members in permissioned blockchain is usually composed of several steps among distributed nodes. The addition can not be considered successful until all of the steps are completed. In other words, these steps are an atomic operation. However, there is no solution for the atomic operation in existing permissioned blockchain, leading to an inconsistent state when the addition of new members is partially completed. To implement the atomic member addition in permissioned blockchain, we propose a method targeting at the atomic addition of new members based on distributed and autonomous rollback. After member addition starts, distributed nodes of existing members detect the new node and decide whether to rollback or not, instead of getting commands from the coordinator. After deciding to rollback, a new configuration block is added to achieve rollback of the uncompleted member addition. In order for the new configuration block to pass the policy validation of orderers, we set a rollback mode for orderers. The evaluation results show that our method can actually implement atomic member addition and has little impact on performance.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"364 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

PPFM: An Adaptive and Hierarchical Peer-to-Peer Federated Meta-Learning Framework PPFM:自适应分层点对点联邦元学习框架

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00086

Zhengxin Yu, Yang Lu, P. Angelov, N. Suri

引用次数: 1

Crowdsourcing Mobile Data for A Passive Indoor Positioning System - The MAA Case Study 被动室内定位系统的众包移动数据——MAA案例研究

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00024

R. Guan, R. Harle

引用次数: 0

Space-Air-Ground-Aqua Integrated Intelligent Network: Vision, and Potential Techniques 天-空-地-水综合智能网络:远景与潜力技术

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00164

Jinhui Huang, Junsong Yin, Shuangshuang Wang

引用次数: 0

Three-dimensional Key Distribution Scheme in Wireless Sensor Networks 无线传感器网络中的三维密钥分配方案

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00138

Wanqing Wu, Ziyang Zhang, Yahua Dong, Caixia Ma

{"title":"Three-dimensional Key Distribution Scheme in Wireless Sensor Networks","authors":"Wanqing Wu, Ziyang Zhang, Yahua Dong, Caixia Ma","doi":"10.1109/MSN57253.2022.00138","DOIUrl":"https://doi.org/10.1109/MSN57253.2022.00138","url":null,"abstract":"One of the major security challenges faced by wireless sensor networks(WSNs) is establishing a secure link for communication between neighboring sensor nodes. Finding a balance between connection, overhead, and resilience against node capture attacks is difficult due to the resource limits of sensor nodes. We propose a new three-dimensional key distribution scheme for wireless sensor networks based on polynomial and random key distribution schemes. The key pool is divided into two sections in the proposed scheme: key pool 1 is generated by the polynomial pool, and key pool 2 is generated by key pool 1. A three-dimensional key distribution model is constructed using the key pool and the coefficients of the polynomials. It can enhance network resilience while maintaining good connectivity by dynamically adjusting the degree of polynomials and the size of the polynomial pool. This paper analyzes the performance of the proposed scheme and compares it with other schemes. The results show that the proposed scheme has better local connectivity and resilience against node capture attacks when compared with the previous schemes.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130605981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Web Attack Payload Identification and Interpretability Analysis Based on Graph Convolutional Network 基于图卷积网络的Web攻击有效载荷识别与可解释性分析

2022 18th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2022-12-01 DOI: 10.1109/MSN57253.2022.00071

Yijia Xu, Yong Fang, Zhonglin Liu

{"title":"Web Attack Payload Identification and Interpretability Analysis Based on Graph Convolutional Network","authors":"Yijia Xu, Yong Fang, Zhonglin Liu","doi":"10.1109/MSN57253.2022.00071","DOIUrl":"https://doi.org/10.1109/MSN57253.2022.00071","url":null,"abstract":"Web attack payload identification is a significant part of the Web defense system. The current Web attack payload identification usually combines natural language processing and deep learning to automatically build a detection model to intercept malicious payloads. However, these detection methods ignore the bidirectional association between fields and is prone to the payload dilution problem for long strings. In addition, the weak interpretability of deep learning models makes it difficult for researchers to solve the problem of model pollution and adjust the model according to the prediction logic. Therefore, this paper proposes a new Web attack payload identification method based on Graph Convolutional Network (GCN), which can effectively extract Web payload features and help model interpretability analysis. The core of this method is to transform the text feature problem into a graph feature extraction problem and to understand the structure and content of the Web payload from the graph perspective. The method performs node embedding on the Web payload graph through GCN, then converts the embedding vector into a graph feature vector through a feature fusion method. The node ablation method is used to analyze malicious payloads' interpretability and calculate the predicted impact rate of nodes inside the graph structure. The experiments on the CSIC 2010 v2 HTTP dataset show that the method proposed in this paper has high accuracy for identifying Web attack payloads, and the node embedding of the Relational Graph Convolutional Network (RGCN) method is more suitable for identifying Web attack payloads than other GCN methods. The research results of the paper show that the model interpretability analysis based on the Web payload graph is reasonable and can effectively assist researchers in adjusting the model and preventing the problem of model pollution.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121105524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0