2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)最新文献

筛选
英文 中文
Optimal Content Caching Policy Considering Mode Selection and User Preference under Overlay D2D Communications 覆盖D2D通信下考虑模式选择和用户偏好的最优内容缓存策略
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.00035
Yue Wang, Guangsheng Feng, Junyu Lin, Haibin Lv, Jiayu Sun, Huiqiang Wang, Zihan Gao
{"title":"Optimal Content Caching Policy Considering Mode Selection and User Preference under Overlay D2D Communications","authors":"Yue Wang, Guangsheng Feng, Junyu Lin, Haibin Lv, Jiayu Sun, Huiqiang Wang, Zihan Gao","doi":"10.1109/MSN.2018.00035","DOIUrl":"https://doi.org/10.1109/MSN.2018.00035","url":null,"abstract":"The rapid growth of user demand for mobile data traffic, especially video streaming, places a serious burden on base stations. Cache-enabled D2D communication has emerged as a promising paradigm to offload cellular traffic, in which contents are cached at user devices and then shared among neighbors via D2D communications. It is a key step to optimize the content caching policy in the cache-enabled D2D-assisted offloading. To maximize D2D offloading probability, we propose an optimal content caching policy to cache valuable contents by considering both the mode selection and user preference of neighbors. Then we use a dual simplex method to solve the maximum D2D offloading probability problem. Comparing with existing schemes, the simulation results prove the advantage of our proposed scheme in the improvement of D2D offloading performance.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740286","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}
引用次数: 3
Configuration of the C-V2X Mode 4 Sidelink PC5 Interface for Vehicular Communication 车载通信C-V2X Mode 4副链路PC5接口的配置
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.00014
Rafael Molina-Masegosa, J. Gozálvez, M. Sepulcre
{"title":"Configuration of the C-V2X Mode 4 Sidelink PC5 Interface for Vehicular Communication","authors":"Rafael Molina-Masegosa, J. Gozálvez, M. Sepulcre","doi":"10.1109/MSN.2018.00014","DOIUrl":"https://doi.org/10.1109/MSN.2018.00014","url":null,"abstract":"The 3GPP has released the C-V2X standard to support V2X (Vehicle-to-Everything) communications using the LTE sidelink PC5 interface. This standard includes two modes of operation, and this study focuses on the Mode 4. This mode does not require the support of the cellular infrastructure, and vehicles can autonomously select their sub-channels for their V2V transmissions. The adequate operation of C-V2X Mode 4 requires a careful configuration of its main parameters. This study analyzes the optimum configuration of the parameters that mostly influence the operation and performance of C-V2X or LTE-V Mode 4. This analysis is conducted for different channel loads and traffic conditions. The conclusions obtained are compared with existing studies taking into account the importance of using accurate models for adequately configuring the C-V2X Mode 4 interface.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131598948","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}
引用次数: 64
Energy-Aware Service Composition of Configurable IoT Smart Things 可配置物联网智能事物的能源感知服务组成
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.00013
Mengyu Sun, Zhangbing Zhou, Yucong Duan
{"title":"Energy-Aware Service Composition of Configurable IoT Smart Things","authors":"Mengyu Sun, Zhangbing Zhou, Yucong Duan","doi":"10.1109/MSN.2018.00013","DOIUrl":"https://doi.org/10.1109/MSN.2018.00013","url":null,"abstract":"This paper presents a three-tier framework to facilitate the composition of Internet-of-Things (IoT) services, where these IoT services represent functionalities provided by heterogenous smart things. Various IoT services are categorized into service classes through the categorization of their functionalities. A service network is constructed by considering the invocation relationship between service classes, and service class chains are generated using traditional Web service composition techniques to satisfy the requirement from the functional perspective only. Considering the factors, including spatial and temporal constraints, energy efficiency, and the functional configurability, IoT service composition can be reduced to a multi-objective optimization problem. Heuristic algorithms, such as genetic algorithm (GA), ant colony optimization (ACO), and particle swarm optimization (PSO), are adopted to search for optimal IoT service compositions. Experimental results show that PSO performs better than GA and ACO in searching for approximately optimal IoT service compositions and reducing the energy consumption of smart things in the network.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133318191","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}
引用次数: 4
Smartphone-Assisted Over-Air Reprogramming Based on Visible Light Communication 基于可见光通信的智能手机辅助空中重编程
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.00025
J. Qiu, Sai Li, Pan Zheng, Jing Fan
{"title":"Smartphone-Assisted Over-Air Reprogramming Based on Visible Light Communication","authors":"J. Qiu, Sai Li, Pan Zheng, Jing Fan","doi":"10.1109/MSN.2018.00025","DOIUrl":"https://doi.org/10.1109/MSN.2018.00025","url":null,"abstract":"Reprogramming is one of the key issues for long-term living wireless sensor networks. Most of current research focuses on optimizing the upper software in order to save energy or improve security. In this paper, we replace the electromagnetic communication with visible light communication applied in reprogramming, and then leverage general sensor node and smartphones for lowering the barrier of VLC applied in reprogramming. However, the unstable light source and low-cost light sensor make the reprogramming procedure difficult. For this, we present a novel incremental reprogramming approach named EasiVLC. This approach refers our previous research and optimizes visible light signal modulation based on VLC for reducing transmission time. The experiment results illustrate effectiveness of EasiVLC at the cost of increasing 52.5% energy overhead by comparison with EC-based reprogramming approach.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123089658","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}
引用次数: 0
[Publisher's information] (发布者的信息)
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/msn.2018.00044
{"title":"[Publisher's information]","authors":"","doi":"10.1109/msn.2018.00044","DOIUrl":"https://doi.org/10.1109/msn.2018.00044","url":null,"abstract":"","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123152102","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}
引用次数: 0
MSN 2018 Technical Program Committee MSN 2018技术计划委员会
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/msn.2018.00006
{"title":"MSN 2018 Technical Program Committee","authors":"","doi":"10.1109/msn.2018.00006","DOIUrl":"https://doi.org/10.1109/msn.2018.00006","url":null,"abstract":"","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124997568","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}
引用次数: 0
GTC Forest: An Ensemble Method for Network Structured Data Classification GTC森林:网络结构化数据分类的集成方法
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.00020
Jinxi Wang, Bo Hu, Xiang Li, Zhen Yang
{"title":"GTC Forest: An Ensemble Method for Network Structured Data Classification","authors":"Jinxi Wang, Bo Hu, Xiang Li, Zhen Yang","doi":"10.1109/MSN.2018.00020","DOIUrl":"https://doi.org/10.1109/MSN.2018.00020","url":null,"abstract":"In recent years, deep neural networks have achieved great success in various applications, particularly in visual tasks such as image classification. However, deep neural networks cannot reach their full potential when dealing with classification problems in networks. Because the network-related dataset is usually in a structured format rather than an image format, and in some cases the data scale is small to train a deep model. Therefore, we aim at another choice, which can abandon the structure of deep neural networks, but remain the powerful representation learning ability. In this paper, we propose GTC Forest, a tree-based ensemble method for network structured data classification. GTC Forest consists of two parts: the first part Multi-Grained Traversing to do representation learning in network structured data; and the second part Cascade Forest to train on small-scale dataset, as well as reducing model complexity. Experiments are conducted on user broadband dataset, which is built to guarantee users a better Internet experience. And the results prove that our model is effective, and has higher accuracy than other machine learning methods in network structured data classification.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127147222","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}
引用次数: 2
Influence Maximization with Trust Relationship in Social Networks 基于信任关系的社会网络影响最大化
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.00017
Nan Wang, Jiansong Da, Jinbao Li, Yong Liu
{"title":"Influence Maximization with Trust Relationship in Social Networks","authors":"Nan Wang, Jiansong Da, Jinbao Li, Yong Liu","doi":"10.1109/MSN.2018.00017","DOIUrl":"https://doi.org/10.1109/MSN.2018.00017","url":null,"abstract":"With the wide usage of many electronic devices such as the mobile telephones, the social activities in the mobile terminal have increased greatly. The influence maximization problem is to find a small set of nodes in a mobile social network such that they can make to maximize the spread of influence under the certain models. Existing methods of influence maximization only consider information dissemination, without considering the effectiveness of the transmission probabilities between nodes. We need to ensure the effectiveness of the transmission probabilities to achieve the maximal influence in real applications. We design a new propagation model and propose an effective greedy algorithm for this model. On this basis, we further improve the algorithmic efficiency with dynamic pruning strategy and propose a new estimation technique to accelerate influence evaluation. We demonstrate the effectiveness and efficiency of our algorithms on the two real social networks.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131919812","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}
引用次数: 3
A Deployment Model of Charging Pile Based on Random Forest for Shared Electric Vehicle in Smart Cities 基于随机森林的智慧城市共享电动汽车充电桩部署模型
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.00015
Tiantian Xu, Huazhi Sun, Guangjie Han, Chunmei Ma, Lifen Jiang
{"title":"A Deployment Model of Charging Pile Based on Random Forest for Shared Electric Vehicle in Smart Cities","authors":"Tiantian Xu, Huazhi Sun, Guangjie Han, Chunmei Ma, Lifen Jiang","doi":"10.1109/MSN.2018.00015","DOIUrl":"https://doi.org/10.1109/MSN.2018.00015","url":null,"abstract":"In the smart cities, sharing electric vehicles have many advantages such as environmental protection, low carbon emission, and high efficiency, which will greatly facilitate human life. However, whether the shared electric vehicle can be charged in time directly affects the users' experience. Based on this fact, we study that how to deploy the charging piles in the parking station of the shared electric vehicle, and propose a charging pile deployment model. First, the number of shared electric vehicles that check out from parking stations is predicted based on the random forest algorithm. Then, a mobile model of the shared electric vehicle is established. Based on the mobile model, the number of shared electric vehicles that check in within the target period is calculated and whether they reach the starvation state are determined. After that, the number of charging piles to be deployed is determined. Finally, the effects of hunger rate, battery capacity and the distance between parking stations on the number of charging piles were simulated by experiments. The experimental results verify the validity and feasibility of the proposed model. The prediction model proposed in this paper can provide a certain decision basis for the sharing of electric vehicle charging pile planning.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"41 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120838678","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}
引用次数: 3
Reputation and Incentive Mechanism for SDN Applications SDN应用的声誉和激励机制
2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Pub Date : 2018-12-01 DOI: 10.1109/MSN.2018.000-3
Yufu Wang, Yuan Liu, Jinzong Hu, Mingwei Zhang, Xingwei Wang
{"title":"Reputation and Incentive Mechanism for SDN Applications","authors":"Yufu Wang, Yuan Liu, Jinzong Hu, Mingwei Zhang, Xingwei Wang","doi":"10.1109/MSN.2018.000-3","DOIUrl":"https://doi.org/10.1109/MSN.2018.000-3","url":null,"abstract":"Software Defined Networking (SDN) decouples the control plane from the data plane, which increases network scalability and flexibility. But malicious applications on SDN controller can cause the entire network to crash. So, we design a reputation and incentive mechanism on SDN to reduce application's malicious access. In the proposed module, first of all, the application behavior is analyzed and the malicious accesses are identified, which are used to build the reputation and incentive mechanism. Second, the analysis results of the application behavior are combined through beta probability density to obtain the reputation rating. The reward or punishment will be given based on the behavior and reputation of the application under the selected social strategy. Simulation results show that the system can accurately identify malicious behavior and reduce malicious requests, with an acceptable runtime overhead about 300 microseconds.","PeriodicalId":264541,"journal":{"name":"2018 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115875304","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信