Bo Yan, Wenli Tang, J. Liu, Yiping Liu, Fanku Meng, H. Su
{"title":"Summarizing the Slices: Sample-Based Core-Periphery Classification on Complex Networks","authors":"Bo Yan, Wenli Tang, J. Liu, Yiping Liu, Fanku Meng, H. Su","doi":"10.1109/MSN48538.2019.00049","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00049","url":null,"abstract":"Core-periphery structure refers to a prevalent property exhibited by many real-world complex networks. The formulation and identification of a network core-periphery structure have been a challenging problem. A classical framework (BE) proposed by Borgatti and Everett defines a core-periphery partition of the network by aligning its nodes with a block model and has been a standard method for this task. This method, however, suffers from high computational costs which make it inapplicable to large networks. Realizing this limitation, we proposed a new framework, which aims to efficiently evaluate core-ness of nodes. Our framework builds a model for core-periphery classification by integrating small samples. The experimental results of six real-world networks shows that our methods can efficiently and effectively identify network core, achieving a running time of less than three hours for a network with about 220,000 nodes.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117173433","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 Lightweight Hash Function Based on Cellular Automata for Mobile Network","authors":"Xing Zhang, Qinbao Xu, Xiao Wei Li, Changda Wang","doi":"10.1109/MSN48538.2019.00055","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00055","url":null,"abstract":"Since the classical hash function widely used are costly for resource constrained devices, in this paper we propose a new lightweight hash function LNHASH through Cellular Automata(CA), in which sponge construction is applied as the mode of operation. Both linear and non-linear CA rules are employed to construct the internal permutation to achieve high diffusion and confusion. LNHASH allows making trade-offs among security, speed, energy consumption and implementation costs by adjusting the corresponding parameters. The hardware-friendly Sbox and linear layer bring low area implementation. Security analysis results show the resistance of the LNHASH scheme against the known attacks.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116439088","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":"Encoding Space to Count Multi-Targets with Multiplexed Binary Infrared Sensors","authors":"Longxiang Luo, Yang Xiao, W. Liang","doi":"10.1109/MSN48538.2019.00080","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00080","url":null,"abstract":"Recently, many researchers multiplex binary infrared sensors in object tracking, habitat monitoring, and atypical behavior detection. Due to the binary digit output of binary sensors, multiplex binary sensors may lead to count the wrong number of targets when three or more targets present in the field of interest (FOI). We call this as the invisible targets’ problem. To enhance the sensing results of sensors, a reference structure tomography technique is used to segment and code the FOI by modulating the sensing view of sensors. In this paper, we propose a subregion coding method to count targets moving in the FOI. Hexagon modulators are designed to make their projections segment the FOI into hexagon cells. We also propose a signature construct scheme to code cells and a encoder to count the number of targets in the FOI. Experiment results show that the accuracy to correctly count targets of our method is around 90% which is much better than 45% of a conventional method.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487585","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":"Mobility Pattern-Aware Task Recommendation for Taxi Crowdsourcing Delivery","authors":"Pengfei Wang, Ruiyun Yu","doi":"10.1109/MSN48538.2019.00043","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00043","url":null,"abstract":"With the emerging of sharing economy, taxi crowdsourcing delivery could be a feasible solution for logistics companies to deliver packages efficiently and securely with a lower cost in the urban area. In this paper, we propose LSTM2V, a novel mobility pattern-aware task recommendation algorithm for taxi crowdsourcing delivery leveraging the long short-term memory and Markov model. Taking the mobility pattern into consideration, LSTM2V leverages both deep learning and probabilistic model to recommend the most suitable tasks to taxis. It mainly consists of two components – the feature window based Long Short-Term Memory neural network (LSTM-w) and SpatioTemporal Markov (STM) model. The taxi mobility pattern is predicted by LSTM-w, and STM is utilized to predict locations which taxis can visit in the future. Extensive evaluations with real taxi trajectory dataset show LSTM2V can predict the mobility pattern precisely, improve the multi-location prediction accuracy, and recommend tasks efficiently.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114732246","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":"Addressing the Conflict of Negative Feedback and Sampling for Online Ad Recommendation in Mobile Social Networks","authors":"Yu Tao, Yuanxing Zhang, Jianing Lin, Kaigui Bian","doi":"10.1109/MSN48538.2019.00039","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00039","url":null,"abstract":"Online advertisement (ad) recommendation in the mobile social network (MSN) is an uprising interest of research. Compared to traditional recommendation systems, one of its major difference is the presence of explicit negative feedback from users (e.g., a user does not click an ad, or she/he does not like it). On the other hand, most methods utilize negative sampling (e.g., randomly sampling an item that a user never interacts with to avoid overfitting, that is, she/he is assumed to dislike it) while training conventional recommendation systems. This may lead to a conflict between negative feedback and sampling, as they should be treated differently, but they are considered as the same if traditional methods are directly applied for online ad recommendation. In this paper, we present AdRec, a novel framework of online ad recommendation in MSN to address this conflict. We introduce an auxiliary output and modify the loss function to assign different weights to negative samples and feedbacks. A theoretical analysis is applied to show the efficiency of our design, and experiments on real world datasets demonstrate that our proposed method outperforms several state-of-the-art approaches.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126555962","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":"RF Aerially Charging Scheduling for UAV Fleet : A Q-Learning Approach","authors":"Jinwei Xu, K. Zhu, Ran Wang","doi":"10.1109/MSN48538.2019.00046","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00046","url":null,"abstract":"In recent years, unmanned aerial vehicles (UAVs) have attracted extensive interests from both academia and industry due to the potential wide applications with universal applicable nature of the deployment. However, currently the bottleneck for UAVs is the limited carried energy resources (e.g. oil box, battery), especially for electric-driven UAVs. For a system consisting of multiple UAVs using batteries, its stability depends on each UAV. Therefore, the lifetime of each UAV is expected to be extended. In this paper, we propose the concept of RF charging aerially for the UAV fleet. Specifically, in order to ensure the stability of the system, wireless charging is considered for enhancing the lifetime of each UAV. However, it may be unbalanced. Accordingly, the issue of charging scheduling arises. The problem is formulated as a Q-Learning problem in this paper. Agent constantly explores and optimizes its scheduling policy. Finally, it can adapt to different UAV distribution situations. We take the energy levels of UAVs as input, which is easy for implementation. We have compared with two other algorithms (RSA and LESA) and compared with the case of no-charging. The results show that comparing with no-charging, the stability of the system can be improved by up to 78%. Compared with RSA and LESA, system stability is increased by up to 30%-40%. In addition, our method is more flexible and applicable to fleet than other ways (such as return to base station, landing to power line, ground laser, etc) to supplement energy.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134547539","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":"AMRnet: A Real-Time Automatic Modulation Recognition Network for Wireless Communication System","authors":"Xinyu Li, Pengrui Duan","doi":"10.1109/MSN48538.2019.00031","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00031","url":null,"abstract":"In recent years, deep learning has brought new opportunities and challenges to the wireless communication field, owing to its expressive capacity and convenient optimization capability. In this paper, we propose a real-time Automatic Modulation Recognition Network (AMRnet) for signal transmission process, which can be easily applied to mobile and embedded wireless communication applications (e.g., The GNU Radio system based on USRP platform). Our proposed AMRnet consists of a series of convolutional neural networks based on the design theory of lightweight networks. More specifically, depthwise separable convolution structure is used to reduce computational complexity of the whole network. Residual block is included to improve the robustness for the simple backbone network. In addition, channel attention mechanism is added to lay more emphasis on the channel-wise information due to the unique data futures of the I/Q signal. We present numerous experiments on resource and accuracy tradeoffs and show strong performance compared to a number of state-of-the-art methods. This work will have a great impact on the future communication systems.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134346042","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}
Tristan Braud, Teemu Kämäräinen, M. Siekkinen, P. Hui
{"title":"Multi-carrier Measurement Study of Mobile Network Latency: The Tale of Hong Kong and Helsinki","authors":"Tristan Braud, Teemu Kämäräinen, M. Siekkinen, P. Hui","doi":"10.1109/MSN48538.2019.00015","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00015","url":null,"abstract":"Real time interactive cloud-based mobile applications such as augmented reality and cloud gaming require low and stable latency, especially in urban areas. These conditions are difficult to meet with the traditional single carrier LTE network access and consolidated server deployment in a cloud. Yet, with multiple SIM/multiple radio devices, latency can be kept under a given threshold through dynamic selection among multiple carriers and server deployment at network edge. To this end, it is necessary to understand how mobile network latency changes over time during a session with different carriers and how the server placement affects the latencies. In this paper, we present results from a measurement study of mobile network latency and jitter in 4G networks of Hong Kong and Helsinki, two very different cities in terms of population density and mobile infrastructure. Based on the results, we introduce a lightweight carrier selection algorithm that displays latencies 10 to 20% lower than single carrier operation.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127373173","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":"Exploratory Community Detection: Finding Communities in Unknown Networks","authors":"Bo Yan, Fanku Meng, J. Liu, Yiping Liu, H. Su","doi":"10.1109/MSN48538.2019.00048","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00048","url":null,"abstract":"Community detection amounts to one of the key methods in handling social networks with the aim of capturing global patterns of a network. This paper focuses on a situation where the network is unknown, which would render existing algorithms unusable. We propose exploratory community detection which aims to detect communities by utilizing samples taken from diffusion process over the network. For this problem, we propose a neural-based algorithm that develops a matrix representation of the network structure. This matrix is then the input of a spectral clustering algorithm to reveal communities in the network. We perform experiments on real-world and synthetic data sets with simulated diffusion samples.The results reveal that our algorithm has strong empirical performance.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115714077","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":"An Optimization Deployment Scheme for Static Charging Piles Based on Dynamic of Shared E-Bikes","authors":"Ping Zhong, Aikun Xu, Yuanming Chen, Feng Gao, Guihua Duan","doi":"10.1109/MSN48538.2019.00071","DOIUrl":"https://doi.org/10.1109/MSN48538.2019.00071","url":null,"abstract":"Shared e-bikes are popular because of their green, eco-friendly and efficient features. Due to the limited battery capacity of the e-bikes, the energy problem has become one of the main factors limiting its further development. The energy problem can be solved by using static charging piles (SCP) to replenish the batteries of shared e-bike. The location of the shared e-bike is time-varying, resulting in the optimal deployment of SCP as a complex location problem. In this paper, we propose an optimal Deployment algorithm for Maximum Coverage combined the Dynamic Changes of nodes (max-DCDC) based on the known number of SCP. This method first quantitatively analyzes the dynamic change process of the shared e-bike to reduce the deployment scope of the SCP. Then, according to the geometric characteristics of the e-bike distribution within the deployment scope to optimizes the deployment location of the SCP. Simulation experiments show that max-DCDC has better performance in terms of deployment stability and e-bike coverage compared with the other algorithms.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115890301","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}