{"title":"An Anomaly Detection Model Based on One-Class SVM to Detect Network Intrusions","authors":"Ming Zhang, Boyi Xu, Jie Gong","doi":"10.1109/MSN.2015.40","DOIUrl":"https://doi.org/10.1109/MSN.2015.40","url":null,"abstract":"Intrusion detection occupies a decision position in solving the network security problems. Support Vector Machines (SVMs) are one of the widely used intrusion detection techniques. However, the commonly used two-class SVM algorithms are facing difficulties of constructing the training dataset. That is because in many real application scenarios, normal connection records are easy to be obtained, but attack records are not so. We propose an anomaly detection model based on One-class SVM to detect network intrusions. The one-class SVM adopts only normal network connection records as the training dataset. But after being trained, it is able to recognize normal from various attacks. This just meets the requirements of the anomaly detection. Experimental results on KDDCUP99 dataset show that compared to Probabilistic Neural Network (PNN) and C-SVM, our anomaly detection model based on One-class SVM achieves higher detection rates and yields average better performance in terms of precision, recall and F-value.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128795644","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":"Penalty Function Based Anchor-Free Positioning","authors":"Ran Wang, Jie He, Liyuan Xu, Qin Wang","doi":"10.1109/MSN.2015.10","DOIUrl":"https://doi.org/10.1109/MSN.2015.10","url":null,"abstract":"Typically, anchor-free localization is considered as a nonlinear programming problem in the existing literatures. However, the nonlinear programming algorithms can only achieve constrained optimization and the localization accuracy of such algorithms depends on the precision of initial coordinators, which are the inputs of the algorithm and usually obtained based on GPS. Due to this defect, the algorithm is invalid in GPS-denied area, such as indoor area, dense urban area and forest. In our research, we combined nonlinear programming algorithm with penalty function to solve this problem. Our simulation results show that the localization accuracy of proposed algorithm is not affected by the precision of the initial coordinators, even when the initial coordinators is set randomly. Performance comparisons are also presented to show the improvement of this algorithm.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121446237","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":"Priority-Based Greedy Scheduling for Confident Information Coverage in Energy Harvesting Wireless Sensor Networks","authors":"Zehui Xiong, Bang Wang, Zhongsi Wang","doi":"10.1109/MSN.2015.20","DOIUrl":"https://doi.org/10.1109/MSN.2015.20","url":null,"abstract":"An important issue in Wireless Sensor Networks (WSNs) is to maximize the network lifetime while guaranteeing the desired coverage requirement. Recent studies have demonstrated that using rechargeable sensor nodes with energy harvesting capability has a great potential to extend the network lifetime. However, due to the high cost of rechargeable nodes, equipping every node with an energy harvesting unit is not practical in a large scale WSN. In this paper, we study the problem of maximizing the network lifetime of a hybrid WSN consisting of both common nodes and rechargeable nodes. Furthermore, we consider a new confident information coverage model which is more efficient for environment monitoring applications. We propose a novel priority-based greedy scheduling (PGS) algorithm to schedule the sensor nodes into a series of set covers that are activated sequentially, each satisfying the required coverage. Also, it can effectively exploit the advantages of using collaboration among sensors for the coverage requirement. Our simulations validate that the PGS algorithm can provide substantial performance improvement as compared to other peer algorithms.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115933565","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":"Joint Node Scheduling and Radio Switching for Energy Efficiency in Multi-radio WLAN Mesh Networks","authors":"Wenjia Wu, Junzhou Luo, Ming Yang, Xiaolin Fang","doi":"10.1109/MSN.2015.39","DOIUrl":"https://doi.org/10.1109/MSN.2015.39","url":null,"abstract":"Multi-radio WLAN mesh networks (WMNs) are intended to provide a wireless access infrastructure with high throughput and reliable transmission. With the increasing demand for ubiquitous Internet access, access networks tend to be large-scale, complex and dense, and energy consumption has become a critical concern. Since the networks are designed to support peak traffic demand but does not serve peak traffic demand all the time, which leads to significant energy wastage in off-peak conditions. This means that energy consumption can be effectively reduced through scheduling nodes on/off according to the current traffic demand. In multi-radio WMNs, each node is equipped with multiple radios, and radios can also be switched on/off for further energy saving. Therefore, we investigate the problem of joint node scheduling and radio switching for energy efficiency in this paper, which is proven to be NP-hard. We first formulate the problem as an integer linear programming model, which aims to minimize the power consumption of the network while satisfying node-radio-link, traffic demand and routing constraints. Then, we propose an efficient heuristic algorithm, which iteratively finds routing paths for all mesh access points (MAPs) while satisfying their traffic demand. In each iteration, exact one MAP is selected, and the nodes on its routing path are scheduled on and the corresponding radios are switched on. Finally, extensive simulations are conducted to evaluate the performance of the proposed algorithm in terms of the number of active nodes and radios. The results not only show that the algorithm can achieve energy saving efficiently and effectively, but also demonstrate that the joint optimization of node scheduling and radio switching can obtain better performance on energy efficiency.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126880568","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}
Rasheed Hussain, Donghyun Kim, M. N. Lima, Junggab Son, A. Tokuta, Heekuck Oh
{"title":"A New Privacy-Aware Mutual Authentication Mechanism for Charging-on-the-Move in Online Electric Vehicles","authors":"Rasheed Hussain, Donghyun Kim, M. N. Lima, Junggab Son, A. Tokuta, Heekuck Oh","doi":"10.1109/MSN.2015.31","DOIUrl":"https://doi.org/10.1109/MSN.2015.31","url":null,"abstract":"Recently a new concept of online electric vehicle (OLEV) has been introduced in South Korea, where vehicles are propelled through the transmitted energy from the infrastructure installed underneath the road. However, for billing and audit reasons only authentic vehicles with necessary credentials are allowed to charge their batteries and pay the designated amount to the service provider. Moreover, due to the massive budget requirements for such infrastructure, only designated road segments will offer the charging service. As a result, a tradeoff solution to the charging of electric vehicles is needed to both fulfill the charging requirements of the electric vehicles and reduce the upfront costs for the service providers. To obtain electric charge from the charging plates beneath the road, vehicles need to authenticate themselves beforehand for twofold purposes: to bill the vehicles accordingly and to let the revocation authorities revoke the vehicle in case of a dispute. In this paper, we use the core concept of the OLEV and introduce extreme lightweight privacy-aware authentication schemes for charging-on-the-move through the charging plates installed under the road. More precisely we propose two mutual authentication mechanisms between charging plates and the vehicles, a direct authentication and a hash chain-based authentication. In the direct authentication scheme, we leverage multiple pseudonyms for conditional privacy. Vehicles use different pseudonyms every time they use the charging-on-the-move service. Whereas in case of hash chain-based authentication mechanism, the vehicles mutually authenticate with charging plates through service provider. Our proposed authentication mechanisms preserve conditional privacy throughout the protocol and is computationally lightweight than the existing mechanisms.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126813982","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}
Qiongqiong Jiang, Yi Zhou, Jun Wang, Yi Wang, Xianyu Wang
{"title":"A Lightweight Cross-Layer Cooperative Testbed for Evaluation of Connected Vehicles","authors":"Qiongqiong Jiang, Yi Zhou, Jun Wang, Yi Wang, Xianyu Wang","doi":"10.1109/MSN.2015.16","DOIUrl":"https://doi.org/10.1109/MSN.2015.16","url":null,"abstract":"The system of connected vehicles can be considered as a complicated cyber-physical system, which will be fully provided with the ability of cooperative awareness, adaptive communication and collaborative control in future intelligent transportation systems. It is now imminent to consider how to construct a set of comprehensive evaluation system so that the key technology of connected vehicles can be effectively tested and verified. In this contribution a lightweight testbed framework for connected vehicles was proposed based on the cyber-physical fusion and hardware-in-loop simulation technology. Miniature vehicles were developed as the physical prototype equipped with Arduino microprocessor, ZigBee radio module and other sensing elements. Some typical cooperative scenarios can be evaluated using the miniature vehicles under indoor laboratory environments. Through collaborative information interaction between physical layer and top layer, the synchronized simulation measurement can be realized in a virtual scenario of connected vehicles. Owing to the coordination between physical nodes and simulated ones, the testbed will be possessed of flexibility, scalability and practicability. Some experimental results presented in this contribution indicate the proposed testbed is feasible and reasonable. This research is beneficial to develop more intelligent connected vehicles in the near future.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131569015","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":"Towards Secure and Practical Targeted Mobile Advertising","authors":"Jinghua Jiang, Zhenkui Shi, Xingliang Yuan, Cong Wang, Xiaolin Gui","doi":"10.1109/INFCOMW.2015.7179352","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179352","url":null,"abstract":"Mobile advertising has become a key economic force with the growing mobile app markets. Targeted advertising has been attracting the attention of business and research communities because of its high return on investment. However, the fact that it requires continuous collection of user profiles raises severe privacy concerns. In this paper, we propose a secure and practical mobile advertising architecture, which aims to enable targeted advertising over encrypted mobile user profiles. The proposed idea is based upon a cryptographic primitive, i.e., private stream searching (PSS). We first propose a basic construction of secure targeted mobile advertising. Thorough analysis shows that our basic design achieves semantic security. After that, we introduce a number of techniques to make our design more efficient for mobile devices. Experimental results demonstrate the practicality of our proposed architecture.","PeriodicalId":363465,"journal":{"name":"2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134100255","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}