{"title":"Examination of Indoor Localization Techniques and Their Model Parameters","authors":"W. Dargie, Jianjun Wen","doi":"10.1109/MASS52906.2021.00053","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00053","url":null,"abstract":"The future, in which mobile robots and human beings intermingle in industrial complexes, shopping malls, airports, and similar areas, is not far. The condition, however, requires the realization of several features, including self-localization, self-navigation, identification and avoidance of obstacles, and dynamic route discovery. Indoor localization has been the subject of interest for over two decades, most recent advances attempting to take advantage of freely available signals from a plethora of indoor sources. As far as the estimation task is concerned, most of the models employ extended kalman filters and particle filters. Each technique has its own merits and demerits, as well as a set of assumptions. The purpose of this paper to identify the most significant components of these techniques and to closely examine the prevailing assumptions underlying the selection process of indoor localization techniques. Moreover, the paper experimentally demonstrates the error modeling process in kalman and particle filters.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"34 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120821352","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":"Workshop - SLICE 2021 Chair Message","authors":"","doi":"10.1109/mass52906.2021.00008","DOIUrl":"https://doi.org/10.1109/mass52906.2021.00008","url":null,"abstract":"","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125910467","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":"Mesh Network Reliability Analysis for Ultra-Reliable Low-Latency Services","authors":"Junhao Hu, Lin X. Cai, Jianping Pan","doi":"10.1109/MASS52906.2021.00035","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00035","url":null,"abstract":"In a mesh network, to ensure high reliability and low latency, we can explore path diversity. In other words, a packet can be transmitted using all active links in a network to reach the destination. Here, a critical, difficult issue is to calculate the end-to-end reliability of a mesh network, given the reliability of each active link. In this paper, we derive the mesh network reliability with a new approach, which is of lower computational cost and more scalable than the state-of-the-art. Based on a Markov model, the closed-form network reliability as a polynomial expression of link reliability is obtained using the Hop-State Algorithm (HSA). Furthermore, we propose two metrics to assist in selecting the links in a network for routing to ensure performance while reducing link cost. From the analysis and simulation evaluations, exploring path diversity can effectively support Ultra-Reliable Low-Latency (URLL) services.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125354315","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":"Entropy Change Rate for Traffic Anomaly Detection","authors":"Xiaowei Li, Changda Wang, A. Tang","doi":"10.1109/MASS52906.2021.00079","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00079","url":null,"abstract":"Traffic anomaly detection is a key research topic for large scale communication networks. Traditional network entropy has been proved to be an effective metric on network traffic anomaly detection. However, such a method also shows limitations in large scale networks with constantly changing packet flows, which makes the traditional entropy based method inefficient for traffic anomaly detection. To address this problem, we propose a novel indicator named Entropy Change Rate to improve the effectiveness of the traditional entropy based network traffic anomaly detection.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129157294","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":"Wi-Fi Based Indoor Location With Multi-parameter AP Selection and Device Heterogeneity Weakening","authors":"Xian Zhao, Changda Wang","doi":"10.1109/MASS52906.2021.00077","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00077","url":null,"abstract":"A new indoor location method based on multi-parameter access point selection and device heterogeneity weakening is proposed. The Dixon Criterion is applied to filter and select AP through the three parameters such as the Wi-Fi signals stability, the signals relevance, and the reference point discrimination ability. The Wasserstein distance is applied as a weight in our positioning algorithm to mitigate the positioning errors caused by device heterogeneity. The experimental results show that with the proposed method the average positioning error is reduced by 10% and the positioning stability is improved by 94.9% compared with the known WKNN method.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125628379","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}
Arindam Khanda, Federico Coró, Francesco Betti Sorbelli, M. C. Pinotti, Sajal K. Das
{"title":"Efficient Route Selection for Drone-based Delivery Under Time-varying Dynamics","authors":"Arindam Khanda, Federico Coró, Francesco Betti Sorbelli, M. C. Pinotti, Sajal K. Das","doi":"10.1109/MASS52906.2021.00061","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00061","url":null,"abstract":"The use of drones can be a valuable solution for the problem of delivering goods for many reasons. In fact, they can be efficiently employed in time-critical situations when there is a traffic jam on the roads, to serve customers in hard-to-reach places, or simply to expand the business. However, due to limited battery capacities and the fact that drones can serve a single customer at a time, a drone-based delivery system (DBDS) aims to minimize the drones’ energy usage for completing a route from the depot to the customer and go back to the depot for new deliveries. In general, the shortest delivery route could not be the optimal choice since external factors like the wind (which varies with time) can affect energy consumption. Previous work has mainly considered simplified DBDSs assuming architectures with a single drone and with static costs on paths. Moreover, in these non-centralized architectures, the drones themselves compute the routes on the fly employing their onboard processing resources, making this choice costly. In this paper we develop a centralized system for computing energy-efficient time-varying routes for drones in a multi-depot multi-drone delivery system. Specifically, we propose a novel centralized parallel algorithm called Parallel Shortest Route Update (PSRU) that, over time, updates the drones’ delivery routes avoiding the whole recomputation from scratch. A comprehensive evaluation proves that PSRU is up to 4. 5x faster than the state-of-the-art algorithms.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639754","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":"Malice-Aware Transaction Forwarding in Payment Channel Networks","authors":"Yi Qin, Qin Hu, Dongxiao Yu, Xiuzhen Cheng","doi":"10.1109/MASS52906.2021.00046","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00046","url":null,"abstract":"Scalability has long been a major challenge of cryptocurrency systems, which is mainly caused by the delay in reaching consensus when processing transactions on-chain. As an effective mitigation approach, the payment channel networks (PCN) enable private channels among blockchain nodes to process transactions off-chain, relieving long-time waiting for the online transaction confirmation. The state-of-the-art studies of PCN focus on improving the efficiency and availability via optimizing routing, scheduling, and initial deposits, as well as preventing the system from security and privacy attacks. However, the behavioral decision dynamics of blockchain nodes under potential malicious attacks is largely neglected. To fill this gap, we employ game theory to study the characteristics of channel interactions from both the micro and macro perspectives under the situation of channel depletion attacks. Our study is progressive, as we conduct the game-theoretic analysis of node behavioral characteristics from individuals to the whole population of PCN. Our analysis is complementary, since we utilize not only the classic game theory with the complete rationality assumption, but also the evolutionary game theory considering the limited rationality of players to portray the evolution of the PCN. The results of numerous simulation experiments verify the effectiveness of our analysis.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124528503","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}
Lan Zhang, Daren Zheng, Zhengtao Wu, Mengjing Liu, Mu Yuan, Feng Han, Xiangyang Li
{"title":"MultiSense: Cross Labelling and Learning Human Activities Using Multimodal Sensing Data","authors":"Lan Zhang, Daren Zheng, Zhengtao Wu, Mengjing Liu, Mu Yuan, Feng Han, Xiangyang Li","doi":"10.1145/3578267","DOIUrl":"https://doi.org/10.1145/3578267","url":null,"abstract":"One of the major challenges for fully enjoying the power of machine learning is the need for the high-quality labelled data. To tap-in the gold-mine of data generated by IoT devices with unprecedented volume and value, we discover and leverage the hidden connections among the multimodal data collected by various sensing devices. Different modal data can complement and learn from each other, but it is challenging to fuse multimodal data without knowing their perception (and thus the correct labels). In this work, we propose MultiSense, a paradigm for automatically mining potential perception, cross labelling each modal data, and then improving the learning models for recognizing human activity accurately. We design innovative solutions for segmenting, aligning, and fusing multimodal data from different sensors. We implement our framework and conduct comprehensive evaluations on a rich set of data. Our results demonstrate that MultiSense significantly improves the data usability and the power of the learning models. With 9 diverse activities performed by users, our framework automatically labels multimodal sensing data generated by five different sensing mechanisms (video, smart watch, smartphone, audio, and wireless-channel) with an average accuracy 98.5%, while for each single-modal data model, the accuracy is 95.2%, 92.1%, 71.1%, 91.5%, and 34.8% respectively. Furthermore, it enables the existing models to learn unknown activities from other modalities and thus greatly improves the activity recognition accuracy.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114525946","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":"ST-CFSFDP algorithm based on Euclidean distance constraint","authors":"JunQiao Jiang, Yuan Cheng, Ao Li","doi":"10.1109/MASS52906.2021.00029","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00029","url":null,"abstract":"The spatial-temporal clustering by fast search and find of density peaks (ST-CFSFDP) has a better clustering effect on the spatiotemporal data set in a small space. However, there are some deficiencies in the spatiotemporal dataset with large data volume and far interval between sample points, the clustering results showed great differences, too many interference points during visualization. Given the above deficiencies, this paper proposes a spatial-temporal clustering by fast search and find of density peak algorithm based on Euclidean distance constraint, by increasing the partition constraint of some sample points, the problems existing in the spatiotemporal clustering algorithm of ST-CFSFDP are improved. Experimental results show that the improved algorithm has a better clustering effect than the original algorithm.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127839680","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}
Yang Gao, Jun Tao, Zuyan Wang, Wenbin Li, Guang Cheng
{"title":"Analytical Optimal Solution of Selfish Node Detection with 2-hop Constraints in OppNets","authors":"Yang Gao, Jun Tao, Zuyan Wang, Wenbin Li, Guang Cheng","doi":"10.1109/MASS52906.2021.00016","DOIUrl":"https://doi.org/10.1109/MASS52906.2021.00016","url":null,"abstract":"Selfish node detection offers an effective means to mitigate the routing performance degradation caused by selfish behaviors in opportunistic Networks (OppNets), but leads to the extra network overload and computation cost. Most existing effort in the literature focuses on exploring the detection methods based on the traffic analysis or the cooperation among nodes. In this paper, we investigate the state transition of nodes in the message dissemination without detection. Specifically, the Ordinary Differential Equation (ODE) is constructed to approximatively model the periodic detection with complete detection requirements. Then we obtain the optimal solution of the selfish node detection by the Pontryagin’s maximum principle, and mathematically deduce the right detection time during the message lifetime. The model soundness is verified statistically and the analysis accuracy is evaluated via extensive simulations. The experiments also show that our solution can achieve the tradeoff between the reward and the detection cost.","PeriodicalId":438802,"journal":{"name":"2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856374","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}