{"title":"Real-time Emotion Recognition for Sales","authors":"Si-Ahmed Naas, S. Sigg","doi":"10.1109/MSN50589.2020.00096","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00096","url":null,"abstract":"Positive emotion is a pre-condition to any sales contract. Likewise, the ability to perceive the emotions of a customer impacts sales performance.To support emotional perception in buyer-seller interactions, we propose an audio-visual emotion recognition system that can recognize eight emotions: neutral, calm, sad, happy, angry, fearful, surprised, and disgusted. We reduced noise in audio samples and we applied transfer learning for image feature extraction based on a pre-trained deep neural network VGG16. For emotion recognition, we successfully obtained an audio emotion-recognition accuracy of 62.51% and 68% and video emotion-recognition accuracy of 97.13% and 97.77% on the Ryerson Audio-Visual Database of Emotional Speech and Song (RAVDESS) and Surrey Audio-Visual Expressed Emotion (SAVEE) datasets respectively. For the combination of the two models, our proposed merging mechanism without re-training achieved an accuracy of close to 100% on both datasets. Finally, we demonstrated our system for a customer satisfaction use case in a real customer-to-salesperson interaction using audio and video models, achieving an average accuracy of 78%.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124685124","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}
{"title":"A Traffic Engineering Technology Based on Segment Routing in SDN","authors":"Yu-Zheng Teng, Zhengyou Xia","doi":"10.1109/MSN50589.2020.00106","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00106","url":null,"abstract":"In recent years, the network urgently needs a lot of bandwidth resources to meet the explosive growth of traffic demands. Network operators are also constantly speeding up the routing ports and expanding the link bandwidth, but the network resource utilization rate is still very low, so through traffic engineering technology to optimize the utilization of network resources is of great significance. Therefore, focusing on the traffic engineering technology based on segment routing in Software-Defined Networking, we propose the SRTE-L model, and a traffic scheduling scheme. We propose to set a path decision variable L and a path constraint to limit the length of SR path and the number of intermediate nodes, thereby minimizing the maximum link utilization and reducing computation time, and we investigate the trade-off between link utilization and computation time. Finally, the difference between the proposed method and the existing methods in terms of computation time and maximum link utilization is compared. Through extensive simulations,we indeed experimentally show that our method can reduce the computation time while retaining comparable maximum link utilization.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"369 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114862324","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}
{"title":"Dynamic Spectrum Allocation Enabled Multi-user Latency Minimization in Mobile Edge Computing","authors":"Yang Li, Yuan Wu, Weijia Jia","doi":"10.1109/MSN50589.2020.00039","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00039","url":null,"abstract":"Mobile edge computing (MEC) has been envisioned as an efficient solution to provide computation-intensive yet latency-sensitive services for terminal devices. In this paper, we investigate multi-user computation offloading in MEC and propose a joint optimization of offloading decisions, bandwidth and computation-resource allocations, with the objective of minimizing the total latency for completing all users’ tasks. Due to the non-convexity of the formulated joint optimization problem, we identify its layer structure and decompose it into two problems, i.e·, a sub-problem and a top-problem. For the sub-problem, we propose a bisection-search based algorithm to efficiently find the optimal offloading solutions under a given feasible top-problem solution. Then, we use a linear-search based algorithm to obtain the optimal solution of the top-problem. Numerical results are provided to validate our proposed algorithm for minimizing the total latency in MEC-based multi-user computation offloading. We also demonstrate the advantage of our proposed algorithm in comparison with the conventional multi-user computation offloading schemes.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124472983","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}
D. Wu, Jin Yang, Honggang Wang, Boran Yang, Ruyang Wang
{"title":"Terminal-Edge-Cloud Collaboration: An Enabling Technology for Robust Multimedia Streaming","authors":"D. Wu, Jin Yang, Honggang Wang, Boran Yang, Ruyang Wang","doi":"10.1109/MSN50589.2020.00075","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00075","url":null,"abstract":"To reconcile the conflict between ceaselessly growing mobile data demands and the network capacity bottleneck, we exploit the terminal-edge-cloud collaboration to design a streaming distribution framework, SD-TEC, with the major objective to avoid streaming interruptions caused by inter-cluster handovers and corresponding user defections. First, the merge-and-split rule in the coalition game is employed for virtualized passive optical network clustering to structurally reduce the inter-cluster handover frequency. Second, the terminal-edge collaboration leverages device-to-device communications to sustain streaming services when inter-cluster handovers inevitably occur, reducing the time of possible streaming interruptions and improving the quality of experience of multimedia services. Lastly, the edge-cloud collaboration proactively caches streaming contents to alleviate the traffic congestion of peak hours and considers user priorities and buffer queue underflow/overflow to manage both fronthaul and backhaul resources. Simulation results validate the efficiency of our proposed SD-TEC in reducing the traffic congestion and streaming interruptions caused by inter-cluster handovers.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115870165","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}
{"title":"Markov Probability Fingerprints: A Method for Identifying Encrypted Video Traffic","authors":"L. Yang, Shaojing Fu, Yuchuan Luo, Jiangyong Shi","doi":"10.1109/MSN50589.2020.00055","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00055","url":null,"abstract":"Detecting illegal video plays an important role in preventing and countering crime in daily life. It is effective for supervisors to monitor the network by analyzing traffic from devices. In this way, illegal video can be detected when it is played on the network. Most Internet traffic is encrypted, which brings difficulties to traffic analysis. However, many researches suggest that even if the video traffic is encrypted, the segmentation prescribed by Dynamic Adaptive Streaming over HTTP (DASH) causes content-dependent fragments, which can be used to identify the encrypted video traffic without decryption. This paper presents Markov probability fingerprint for video, and then designs an algorithm for encrypted video streaming title identification. We demonstrate that an external attacker can identify the video title by analyzing the fragment sequence of encrypted video traffic. Based on the m-order Markov chain, we use the transition tensor of the fragment sequence generated by the video traffic as the video fingerprint, and prove its effectiveness. Then we explore approaches that can further improve the performance of methods in terms of discrimination accuracy. We make promising observations that the higher-order Markov chain, larger training set, and more detailed binning of fragments contribute to encrypted video traffic discrimination. We run a thorough set of experiments that illustrate that our method can achieve an outstanding accuracy rate up to 97.5%, which is superior to previous work.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130427663","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}
Shan Wang, Zengyu Song, Haojun Zhou, Xing Guo, Jun Xu, Zhi Liu
{"title":"Towards mmWave Localization with Controllable Reflectors in NLoS Scenarios","authors":"Shan Wang, Zengyu Song, Haojun Zhou, Xing Guo, Jun Xu, Zhi Liu","doi":"10.1109/MSN50589.2020.00079","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00079","url":null,"abstract":"Millimeter wave (mmWave) signal-based localization is a promising scheme due to high precision in the lineof-sight (LoS) scenarios. However, even small obstacles would hinder mmWave localization by blocking the LoS paths, and environment reflection-based schemes under non-LoS (NLoS) scenarios couldn’t guarantee the precision. In this paper, we investigate mmWave NLoS localization scheme based on recent fast-growing research for specialized mmWave reflectors. Our system uses multiple reflectors in the environment to act as anchors for target localization. Firstly, we propose a two-phase reflector discovery mechanism to let transmitter identify the reflectors and estimate their positions as well. Secondly, we introduce a hashing-based beam alignment method with logarithmic complexity to obtain the relative relationship among reflectors and the target. Lastly, we put forward a triangulation-based method for target localization, along with credit-based fusing mechanism to handle the possible imprecise estimated reflector positions. Extensive experiments are carried out to evaluate the proposed scheme. The results demonstrate the effectiveness of the proposed system, which achieves 50% average improvement over environment reflection-based methods. Furthermore, the proposed hashing-based beam alignment process dramatically reduces the time-consumption as compared with baseline using exhaustive search, e.g., 18x, 37x and 40x reductions are observed with 1, 4 and 7 reflectors, respectively.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131209176","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}
{"title":"UAV-empowered Protocol for Information Sharing in VDTN","authors":"Zhaoyang Du, Celimuge Wu, T. Yoshinaga","doi":"10.1109/MSN50589.2020.00103","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00103","url":null,"abstract":"The Delay Tolerant Network (DTN) is a network architecture that plays an important role in intermittently connected networks. DTNs can support transmissions between clients even there are no end-to-end connections by using “store-carry-forward” mechanism, where some nodes called ferry nodes could be employed into DTN to enhance the network performance. In this paper, we use Unmanned Aerial Vehicles (UAVs) to act as ferry nodes, and a probabilistic routing protocol based on the encounter connection time between nodes is proposed. The proposed protocol not only considers the efficiency of message transmission but also the reliability between connected nodes. The proposed protocol and some existing protocols are compared and analyzed using ONE simulator. The simulation results show that the proposed protocol increases the delivery probability and reduces the average latency.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130913686","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}
Weidu Ye, Wenjia Wu, Feng Shan, Ming Yang, Junzhou Luo
{"title":"Energy-efficient Trajectory Planning and Speed Scheduling for UAV-assisted Data Collection","authors":"Weidu Ye, Wenjia Wu, Feng Shan, Ming Yang, Junzhou Luo","doi":"10.1109/MSN50589.2020.00043","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00043","url":null,"abstract":"Unmanned aerial vehicle (UAV) assisted data collection is a promising technology, where a base station (BS) is mounted on a UAV to collect data from ground sensors (GSs). However, it is very challenging to save the energy of UAV while completing the tasks of data collection. In this work, a novel energy consumption model of UAV is adopted, where the UAV flies at a proper speed is the most energy efficient, i.e., the UAV will cost more energy when it flies faster or slower. According to this model, we investigate the Energy-efficient Trajectory Planning and Speed Scheduling (ETPSS) problem, aiming at minimizing the total energy consumption of UAV by determining flight trajectory and speed of UAV while completing the task of data collection for each GS. To solve this problem, we decompose it into two sub-problems, i.e., trajectory design and speed scheduling, and propose a three-step scheme named Energy-efficient Trajectory and Speed optimization (ETSO). Moreover, the second step of ETSO optimally solves the speed scheduling sub-problem. Finally, we conduct simulation experiments, and the results demonstrate that the ETSO performs well on energy efficiency.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132150720","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}
{"title":"Verifiable Blockchain-Based Searchable Encryption with forward and backward privacy","authors":"Ruizhong Du, Yi Wang","doi":"10.1109/MSN50589.2020.00105","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00105","url":null,"abstract":"Symmetric Searchable Encryption (SSE) is an ideal technology to secure searches. SSE is dedicated to improving data confidentiality without sacrificing the searchability of data. Currently, most SSE schemes work using a semihonest or curious cloud server model in which the search results are not absolutely trustworthy. Therefore, a verifiable SSE (VSSE) scheme is proposed to achieve data integrity verification. Although there are some solutions to the result verification problem, most of the schemes concentrate on a static environment and do not consider the issue of result verification in a dynamic environment. Therefore, this paper proposes a Verifiable Blockchain-Based Searchable Encryption with forward and backward privacy scheme (VBSEFB). First, VBSEFB supports local verification of the data returned by the cloud server in a dynamic environment. Second, our solution perfectly realizes forward and backward privacy and better guarantees data security than other methods. Finally, under the one-to-many model, the data owner's access control to data users is realized. A large number of experiments and evaluations prove the practicality of dynamically updating encrypted data.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114581930","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}
{"title":"Fine-grained Device and Data Access Control of Community Medical Internet of Things","authors":"Cheng Huang, Ziyang Zhang, Jing Huang, Fulong Chen","doi":"10.1109/MSN50589.2020.00049","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00049","url":null,"abstract":"In the community medical Internet of things, a large number of IoT devices are applied to the medical field to generate massive personal health information including personal key privacy information, which was transferred and stored in medical IoT systems. However, it is constantly facing a large number of cybercriminal node attack threats in a public network environment, which causes leakage of patient privacy information. To resist the threat of node attacks and ensure the security of patients’ privacy, a secure access control model based on the layered structure of the Internet of Things is proposed in the system. In the model, for the personal health data, under the condition of fine dividing patient health information, users with different roles can access the cloud patient health data according to the health data access permissions. And for the health devices, the health devices node are mapped into virtual object stored in the cloud whose status are remotely controlled by users using right permissions. Theoretical analysis and experimental results show that the scheme is effective, secure and efficient.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124062363","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}