Carrying out high efficient and rapid analysis of big data is essential to big data application. Due to the poor scalability of DRAM, the performance of big data analysis and related applications is difficult to improve. DRAM/NVM hybrid storage architecture has the advantages of non-volatile and high storage density, which brings an opportunity to optimize big data analysis. Because the task itself depends on the data and does not modify the data, it is possible to solve the problem of operation delay if the data is deployed well on the storage system under the background of hybrid storage architecture. In order to optimize the problem of high latency, this paper discusses the data migration between disk and NVM and proposes a data deployment algorithm based on data label. The validity of labeling is verified by calculating the total time of reading data by tasks in the experiment and the efficiency of task execution is improved.
{"title":"Data Scheduling Based on Data Label in Hybrid Storage Architecture","authors":"Liangyuan Wang, Xuan Chen, X. Li","doi":"10.1109/MASS.2018.00083","DOIUrl":"https://doi.org/10.1109/MASS.2018.00083","url":null,"abstract":"Carrying out high efficient and rapid analysis of big data is essential to big data application. Due to the poor scalability of DRAM, the performance of big data analysis and related applications is difficult to improve. DRAM/NVM hybrid storage architecture has the advantages of non-volatile and high storage density, which brings an opportunity to optimize big data analysis. Because the task itself depends on the data and does not modify the data, it is possible to solve the problem of operation delay if the data is deployed well on the storage system under the background of hybrid storage architecture. In order to optimize the problem of high latency, this paper discusses the data migration between disk and NVM and proposes a data deployment algorithm based on data label. The validity of labeling is verified by calculating the total time of reading data by tasks in the experiment and the efficiency of task execution is improved.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123929956","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}
Guolin Sun, Hisham Al-Ward, Gordon Owusu Boateng, W. Jiang
In this paper, we propose a content-aware cache resource slicing framework in software-defined information-centric virtualized wireless device-to-device (D2D) networks. In incorporating D2D communications, we attain the benefits of reuse and proximity gains, and by using the software defined network as a platform, we simplify the computational overhead. In this framework, we devise a cache allocation solution aimed at the latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we evaluate four algorithms until we arrive at the most optimal solution. The heuristic solutions we provide are intuitive, yet efficient, and offer very low computational complexity.
{"title":"Content-Aware Caching in SDN-Enabled Virtualized Wireless D2D Networks to Reduce Visiting Latency","authors":"Guolin Sun, Hisham Al-Ward, Gordon Owusu Boateng, W. Jiang","doi":"10.1109/MASS.2018.00032","DOIUrl":"https://doi.org/10.1109/MASS.2018.00032","url":null,"abstract":"In this paper, we propose a content-aware cache resource slicing framework in software-defined information-centric virtualized wireless device-to-device (D2D) networks. In incorporating D2D communications, we attain the benefits of reuse and proximity gains, and by using the software defined network as a platform, we simplify the computational overhead. In this framework, we devise a cache allocation solution aimed at the latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we evaluate four algorithms until we arrive at the most optimal solution. The heuristic solutions we provide are intuitive, yet efficient, and offer very low computational complexity.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124949586","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}
Qingyuan Xie, Qiuyun Wang, N. Yu, Hejiao Huang, X. Jia
Caching application services at the edge of mobile networks can both reduce the traffic load in core networks and improve the quality of services. Since the capacity of a single BS is constrained, only a small number of service can be executed simultaneously by each BS. However, when the BSs are densely deployed in the network, the BSs that are close to each other can cooperatively cache the services to improve the performance of the system. Moreover, we should avoid frequent service switching when the users' service requests always change. In this paper, we study the dynamic service caching (DSC) problem in mobile edge networks. Our objective is to minimize the traffic load that needs to be forwarded to the cloud, as well as considering service switching cost of BSs. This DSC problem involves two important issues, which include cooperative service caching of adjacent BSs and service switching in adjacent time slots. To solve the DSC problem, we propose a dynamic service caching algorithm for the BSs to cooperatively cache the services in an online manner. The simulation results show that our algorithm can greatly reduce the forwarded traffic load without frequently changing the service caching of BSs.
{"title":"Dynamic Service Caching in Mobile Edge Networks","authors":"Qingyuan Xie, Qiuyun Wang, N. Yu, Hejiao Huang, X. Jia","doi":"10.1109/MASS.2018.00021","DOIUrl":"https://doi.org/10.1109/MASS.2018.00021","url":null,"abstract":"Caching application services at the edge of mobile networks can both reduce the traffic load in core networks and improve the quality of services. Since the capacity of a single BS is constrained, only a small number of service can be executed simultaneously by each BS. However, when the BSs are densely deployed in the network, the BSs that are close to each other can cooperatively cache the services to improve the performance of the system. Moreover, we should avoid frequent service switching when the users' service requests always change. In this paper, we study the dynamic service caching (DSC) problem in mobile edge networks. Our objective is to minimize the traffic load that needs to be forwarded to the cloud, as well as considering service switching cost of BSs. This DSC problem involves two important issues, which include cooperative service caching of adjacent BSs and service switching in adjacent time slots. To solve the DSC problem, we propose a dynamic service caching algorithm for the BSs to cooperatively cache the services in an online manner. The simulation results show that our algorithm can greatly reduce the forwarded traffic load without frequently changing the service caching of BSs.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124476226","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}
Internet of Things (IoT) has already been in the period of rapid development and widespread deployment, while it is still vulnerable to various malicious attacks. Security detection before system installation is not enough to ensure that IoT devices are always secure, because newly emerging vulnerabilities can still be exploited to launch attacks. To address this issue, retrospective detection is often required to trace the security status of IoT systems. Unfortunately, existing centralized detection mechanisms cannot easily provide a comprehensive security analysis. In particular, consumers cannot automatically receive security notification whenever a new vulnerability is uncovered. In this paper, we propose a novel blockchain-powered incentive platform, called SmartRetro, that can incentivize and attract more distributed detectors to participate in retrospective vulnerability detection and contribute their detection results. Leveraging smart contracts, consumers in SmartRetro receive automatic security feedback about their installed IoT systems. We perform the security and theoretical analysis to demonstrate that SmartRetro achieves our desirable security goals.We further implement SmartRetro prototype on Ethereum to evaluate its performance. Our experimental results show SmartRetro is technically feasible and economically beneficial.
物联网(Internet of Things, IoT)已经处于快速发展和广泛部署的时期，但它仍然容易受到各种恶意攻击。系统安装前的安全检测不足以确保物联网设备始终安全，因为新出现的漏洞仍然可以被利用来发动攻击。为了解决这个问题，通常需要回顾性检测来跟踪物联网系统的安全状态。不幸的是，现有的集中式检测机制不能轻易地提供全面的安全分析。特别是，消费者无法在发现新漏洞时自动收到安全通知。在本文中，我们提出了一个新的区块链驱动的激励平台，称为SmartRetro，可以激励和吸引更多的分布式检测器参与回顾性漏洞检测并贡献其检测结果。利用智能合约，SmartRetro的消费者可以收到有关其安装的物联网系统的自动安全反馈。我们执行安全性和理论分析，以证明SmartRetro实现了我们期望的安全目标。我们进一步在以太坊上实现SmartRetro原型，以评估其性能。实验结果表明，SmartRetro在技术上是可行的，经济上是有益的。
{"title":"SmartRetro: Blockchain-Based Incentives for Distributed IoT Retrospective Detection","authors":"Bo Wu, Qi Li, Ke Xu, Ruoyu Li, Zhuotao Liu","doi":"10.1109/MASS.2018.00053","DOIUrl":"https://doi.org/10.1109/MASS.2018.00053","url":null,"abstract":"Internet of Things (IoT) has already been in the period of rapid development and widespread deployment, while it is still vulnerable to various malicious attacks. Security detection before system installation is not enough to ensure that IoT devices are always secure, because newly emerging vulnerabilities can still be exploited to launch attacks. To address this issue, retrospective detection is often required to trace the security status of IoT systems. Unfortunately, existing centralized detection mechanisms cannot easily provide a comprehensive security analysis. In particular, consumers cannot automatically receive security notification whenever a new vulnerability is uncovered. In this paper, we propose a novel blockchain-powered incentive platform, called SmartRetro, that can incentivize and attract more distributed detectors to participate in retrospective vulnerability detection and contribute their detection results. Leveraging smart contracts, consumers in SmartRetro receive automatic security feedback about their installed IoT systems. We perform the security and theoretical analysis to demonstrate that SmartRetro achieves our desirable security goals.We further implement SmartRetro prototype on Ethereum to evaluate its performance. Our experimental results show SmartRetro is technically feasible and economically beneficial.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"555 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130284","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}
Visible light communication by light-emitting diodes (LEDs) has become one of the promising technologies to boost the capacity of mobile networks, due to the low cost and high energy efficiency of LED lamps and the vast unregulated visible light bandwidth. However, VLC is only suitable for downlink data transmissions from LED illumination infrastructures to mobile users. Moreover, due to the line-of-sight (LOS) transmission feature of visible light, the VLC downlink can be easily interrupted by blockage of obstacles or rotation of receivers, which leads to unreliable coverage of mobile users. To overcome the above two drawbacks of VLC, an integrated VLC and WiFi system is designed in this paper. In our proposed system, a 2.5 sublayer called link convergence (LC) layer between the IP layer and the data link layer is designed to integrate WiFi radio and VLC radio. The following key mechanisms are designed in the LC layer to support efficient communications of the integrated system: (a) VLC radio access; (b) VLC ARP table; (c) VLC selective ARQ; (d) VLC link maintenance; (e) handover between WiFi and VLC. Since the integration is above date link layer, no MAC driver or protocol modifications are needed for WiFi in our system. A prototype of our designed integrated system is implemented. Experiment results validate the feasibility and effectiveness of our proposed system.
{"title":"Design and Implementation of an Integrated Visible Light Communication and WiFi System","authors":"Aimin Tang, Chao Xu, Bangzhao Zhai, Xudong Wang","doi":"10.1109/MASS.2018.00036","DOIUrl":"https://doi.org/10.1109/MASS.2018.00036","url":null,"abstract":"Visible light communication by light-emitting diodes (LEDs) has become one of the promising technologies to boost the capacity of mobile networks, due to the low cost and high energy efficiency of LED lamps and the vast unregulated visible light bandwidth. However, VLC is only suitable for downlink data transmissions from LED illumination infrastructures to mobile users. Moreover, due to the line-of-sight (LOS) transmission feature of visible light, the VLC downlink can be easily interrupted by blockage of obstacles or rotation of receivers, which leads to unreliable coverage of mobile users. To overcome the above two drawbacks of VLC, an integrated VLC and WiFi system is designed in this paper. In our proposed system, a 2.5 sublayer called link convergence (LC) layer between the IP layer and the data link layer is designed to integrate WiFi radio and VLC radio. The following key mechanisms are designed in the LC layer to support efficient communications of the integrated system: (a) VLC radio access; (b) VLC ARP table; (c) VLC selective ARQ; (d) VLC link maintenance; (e) handover between WiFi and VLC. Since the integration is above date link layer, no MAC driver or protocol modifications are needed for WiFi in our system. A prototype of our designed integrated system is implemented. Experiment results validate the feasibility and effectiveness of our proposed system.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"76 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116564330","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}
This paper introduces inLaneCom - a framework to facilitate message exchange between vehicles on the same lane. Given the GPS infeasibility for a lane-level accuracy, inLaneCom utilizes smartphone's inertial sensors to generate a unique lane signature used as lane ID in the exchanged messages. Lane signature consists of combined features extracted from phone's inertial sensors. Two main features types were exploited: physical features and traffic features. Physical features capture the characteristics of the lane surface such as bumps, potholes, and energy. Traffic features capture traffic characteristics such as speed, number of stops, waiting time per stop, acceleration, and deceleration. inLaneCom was evaluated under various road conditions, on highways and urban roads, using different types of vehicles. To the best of our knowledge, inLaneCom is the first framework to enable communication between vehicles on the same lane. This framework would enable several safety and navigation applications that require data exchange between vehicles on the same lane.
{"title":"inLaneCom: Enabling In-lane Vehicular Communication Using on-Board Smartphones","authors":"Abdulla Alasaadi, T. Nadeem, Ahmed Salem","doi":"10.1109/MASS.2018.00028","DOIUrl":"https://doi.org/10.1109/MASS.2018.00028","url":null,"abstract":"This paper introduces inLaneCom - a framework to facilitate message exchange between vehicles on the same lane. Given the GPS infeasibility for a lane-level accuracy, inLaneCom utilizes smartphone's inertial sensors to generate a unique lane signature used as lane ID in the exchanged messages. Lane signature consists of combined features extracted from phone's inertial sensors. Two main features types were exploited: physical features and traffic features. Physical features capture the characteristics of the lane surface such as bumps, potholes, and energy. Traffic features capture traffic characteristics such as speed, number of stops, waiting time per stop, acceleration, and deceleration. inLaneCom was evaluated under various road conditions, on highways and urban roads, using different types of vehicles. To the best of our knowledge, inLaneCom is the first framework to enable communication between vehicles on the same lane. This framework would enable several safety and navigation applications that require data exchange between vehicles on the same lane.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115964222","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}
The recognition technology of characters is one of the important technologies of intelligent transportation. At present, one of the problems that the technology needs to solve is that the recognition speed needs to be improved. The fast determinant recursion method is originally used for adaptive and fast processing of radar signals. In this paper, FDR (Fast Determinant Recursion) is used to speed up identifying characters. The advantage of this method is that it does not need to construct the estimation of the covariance matrix of the sample, and does not need to inverse the matrix. In the case of ensuring the constant accuracy of the recognition, the algorithm can improve the recognition speed of the characters. Some measured data are used to verify the effectiveness of the method.
{"title":"An Improved Characters Recognition Approach Using Fast Determinant Recursion","authors":"Xiaoxia Zheng, Haomiao Yang, Bin Tang","doi":"10.1109/MASS.2018.00075","DOIUrl":"https://doi.org/10.1109/MASS.2018.00075","url":null,"abstract":"The recognition technology of characters is one of the important technologies of intelligent transportation. At present, one of the problems that the technology needs to solve is that the recognition speed needs to be improved. The fast determinant recursion method is originally used for adaptive and fast processing of radar signals. In this paper, FDR (Fast Determinant Recursion) is used to speed up identifying characters. The advantage of this method is that it does not need to construct the estimation of the covariance matrix of the sample, and does not need to inverse the matrix. In the case of ensuring the constant accuracy of the recognition, the algorithm can improve the recognition speed of the characters. Some measured data are used to verify the effectiveness of the method.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125169523","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}
With the development of urban intelligent transport system, new challenges are posed for the exchange of information during vehicle movement in the Vehicle Ad Hoc Network (VANET). One critical challenge of today's VANET is how to provide high quality network services with lower packet loss rate and delay in the scenario of frequent movement and handover. Previous work most either focused the mobile management on selecting a fixed point or dynamically select different forwarding points. Unfortunately, most of these solutions cause triangle routing problems or generate a lot of signaling overhead. They overlooked the balance of dynamic routing and signaling overhead. In this paper, we propose a scheme that uses a dynamic repeat point selection algorithm in the VANET architecture, reusing part of the switch's flow tables as much as possible to save signaling cost and reducing handover delay. Extensive experimental results show that this scheme saves signaling overhead during handover, reduces handover delay and the loss rate of data packets.
随着城市智能交通系统的发展，车辆自组织网络(vehicle Ad Hoc Network, VANET)对车辆运动过程中的信息交换提出了新的挑战。如何在频繁移动和切换的情况下，以更低的丢包率和延迟提供高质量的网络服务，是当前VANET面临的一个关键挑战。以往的工作主要集中在移动管理中选择固定的转发点或动态选择不同的转发点。不幸的是，这些解决方案中的大多数都会导致三角形路由问题或产生大量的信令开销。他们忽略了动态路由和信令开销的平衡。本文提出了一种在VANET架构中使用动态重复点选择算法的方案，尽可能地重用部分交换机流表，以节省信令成本并降低切换延迟。大量的实验结果表明，该方案节省了切换过程中的信令开销，降低了切换延迟和数据包丢包率。
{"title":"A Solution for Mobility Management in Software Defined VANET","authors":"Z. He, Bin Fu, Ao Cao, Jian Yu","doi":"10.1109/MASS.2018.00086","DOIUrl":"https://doi.org/10.1109/MASS.2018.00086","url":null,"abstract":"With the development of urban intelligent transport system, new challenges are posed for the exchange of information during vehicle movement in the Vehicle Ad Hoc Network (VANET). One critical challenge of today's VANET is how to provide high quality network services with lower packet loss rate and delay in the scenario of frequent movement and handover. Previous work most either focused the mobile management on selecting a fixed point or dynamically select different forwarding points. Unfortunately, most of these solutions cause triangle routing problems or generate a lot of signaling overhead. They overlooked the balance of dynamic routing and signaling overhead. In this paper, we propose a scheme that uses a dynamic repeat point selection algorithm in the VANET architecture, reusing part of the switch's flow tables as much as possible to save signaling cost and reducing handover delay. Extensive experimental results show that this scheme saves signaling overhead during handover, reduces handover delay and the loss rate of data packets.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134211411","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}
Mobility-assisted opportunistic routing in mobile social network is an interesting research topic with real world applications. It allows users to exchange large chunks of data without relying on stationary network infrastructures. This paper proposes a scalability and privacy preserving routing algorithm. The core of a multi-hop routing scheme is the prediction of the next relay router, which ideally is the next hop on the shortest path to the destination of the message. The proposed routing algorithm contains a machine learning based prediction model that is trained on a trace of nodes connection events collected during a warm up period in a network where the mobility is assumed to exhibit a certain degree of regularity as in general human social networks. The algorithm is scalable since the prediction model, i.e. the control plane of the algorithm, only needs to maintain and broadcast the trained model that implicitly encodes the possible mobility locations and patterns within the mobility area, which is a constant to the number of nodes in the network. The algorithm is privacy preserving because that it does not require the nodes to disclose to other nodes any explicit information about its previous mobility or its personal preferences. Privacy preserving is achieved by using distributed node representations that jointly encode the mobility pattern of the node together with the prediction model, instead of using explicit statistical information to represent previous connectivity patterns as in prior work. This on one hand make attacker hard to find out any exact information about any particular node, and on the other hand enables the routing algorithm to extrapolate to the prediction of nodes of unseen mobility pattern, which is difficult if hand designed statistical mobility information is used. To perform large scale experiments, we collect very large synthetic mobility trace from university course registration information, this trace contain a total of about 35,000 nodes and 300 million message forwarding links. Experiments are conduct to examine several prediction accuracies of our algorithm.
{"title":"Scalable and Privacy Preserving Routing in Mobile Social Networks","authors":"Cong Liu, Mingjun Xiao, Yaxiong Zhao","doi":"10.1109/MASS.2018.00087","DOIUrl":"https://doi.org/10.1109/MASS.2018.00087","url":null,"abstract":"Mobility-assisted opportunistic routing in mobile social network is an interesting research topic with real world applications. It allows users to exchange large chunks of data without relying on stationary network infrastructures. This paper proposes a scalability and privacy preserving routing algorithm. The core of a multi-hop routing scheme is the prediction of the next relay router, which ideally is the next hop on the shortest path to the destination of the message. The proposed routing algorithm contains a machine learning based prediction model that is trained on a trace of nodes connection events collected during a warm up period in a network where the mobility is assumed to exhibit a certain degree of regularity as in general human social networks. The algorithm is scalable since the prediction model, i.e. the control plane of the algorithm, only needs to maintain and broadcast the trained model that implicitly encodes the possible mobility locations and patterns within the mobility area, which is a constant to the number of nodes in the network. The algorithm is privacy preserving because that it does not require the nodes to disclose to other nodes any explicit information about its previous mobility or its personal preferences. Privacy preserving is achieved by using distributed node representations that jointly encode the mobility pattern of the node together with the prediction model, instead of using explicit statistical information to represent previous connectivity patterns as in prior work. This on one hand make attacker hard to find out any exact information about any particular node, and on the other hand enables the routing algorithm to extrapolate to the prediction of nodes of unseen mobility pattern, which is difficult if hand designed statistical mobility information is used. To perform large scale experiments, we collect very large synthetic mobility trace from university course registration information, this trace contain a total of about 35,000 nodes and 300 million message forwarding links. Experiments are conduct to examine several prediction accuracies of our algorithm.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"32 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132938585","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. Zhang, Yang Zhang, Qi Li, Nathan Vance, Dong Wang
Collaborative sensing has emerged as a new sensing paradigm where sensors collaboratively report measurements about the phenomena or events in the physical world. This paper focuses on a robust state prediction problem in collaborative sensing where the goal is to provide an accurate prediction on the dynamic status of the physical environment (e.g., air quality index, temperature, traffic) based on the incomplete and noisy data contributed by collaborative sensors. While significant progress has been made to study the state prediction problem, we identify two fundamental challenges that have not been well addressed by the current literature. The first challenge is "latent spatial dynamics": the spatial correlations among measured variables are highly dynamic and the features that affect such dynamics may not be directly observable from the sensing data. The second challenge is "incomplete and noisy data": a significant amount of measurements are missing in collaborative sensing due to the prohibitively high cost of deploying sensors for full spatial-temporal coverage. The collaborative sensors are also known to be unreliable in many applications and can easily contribute to noisy measurements. To address these challenges, this paper develops a Context-Aware Collaborative Sensing Prediction (CACSP) scheme inspired by techniques from latent semantic analysis and statistics. We evaluate our scheme through two real-world collaborative sensing applications and the results show that CACSP significantly outperforms the state-of-the-art baselines.
{"title":"Robust State Prediction with Incomplete and Noisy Measurements in Collaborative Sensing","authors":"D. Zhang, Yang Zhang, Qi Li, Nathan Vance, Dong Wang","doi":"10.1109/MASS.2018.00070","DOIUrl":"https://doi.org/10.1109/MASS.2018.00070","url":null,"abstract":"Collaborative sensing has emerged as a new sensing paradigm where sensors collaboratively report measurements about the phenomena or events in the physical world. This paper focuses on a robust state prediction problem in collaborative sensing where the goal is to provide an accurate prediction on the dynamic status of the physical environment (e.g., air quality index, temperature, traffic) based on the incomplete and noisy data contributed by collaborative sensors. While significant progress has been made to study the state prediction problem, we identify two fundamental challenges that have not been well addressed by the current literature. The first challenge is \"latent spatial dynamics\": the spatial correlations among measured variables are highly dynamic and the features that affect such dynamics may not be directly observable from the sensing data. The second challenge is \"incomplete and noisy data\": a significant amount of measurements are missing in collaborative sensing due to the prohibitively high cost of deploying sensors for full spatial-temporal coverage. The collaborative sensors are also known to be unreliable in many applications and can easily contribute to noisy measurements. To address these challenges, this paper develops a Context-Aware Collaborative Sensing Prediction (CACSP) scheme inspired by techniques from latent semantic analysis and statistics. We evaluate our scheme through two real-world collaborative sensing applications and the results show that CACSP significantly outperforms the state-of-the-art baselines.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"542 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116254253","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：