2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)最新文献_第2页

Data Aggregation Scheduling in Wireless Sensor Networks under SINR 无线传感器网络SINR下的数据聚合调度

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.66

Xiaomin Sun, Jiguo Yu, Tianyi Song

{"title":"Data Aggregation Scheduling in Wireless Sensor Networks under SINR","authors":"Xiaomin Sun, Jiguo Yu, Tianyi Song","doi":"10.1109/IIKI.2016.66","DOIUrl":"https://doi.org/10.1109/IIKI.2016.66","url":null,"abstract":"Data aggregation is an essential operation in various applications of wireless sensor networks (WSNs), where sensor nodes sense information and forward the sensing data to a sink node via multi-hop wireless communications. Most existing data aggregation algorithms were based on protocol interference model, which were not practical in real schemes. In this paper, we propose efficient algorithms to decrease data aggregation delay under physical interference model, that is, the SINR (signal to interference plus noise ratio) model. Firstly, we apply previous distributed minimum spanning tree (MST) construction method to form a MST under SINR model. Secondly, we propose a link scheduling algorithm DALS by gird partition, and finally we combine MST and DALS into data aggregation algorithm DA with node states transition. We theoretically prove that the aggregation scheduling algorithm is θ-approximation with θ = K2Γ and obtain the latency of DA O(HΔ), where K is a positive integer depended on α, β and Γ = [Pmax(2√2+1)α/Nβ2(1—1/Kα)] is a constant. H is the height of MST and Δ is the maximum node degree in G(V, E).","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114369854","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

Optimization Design of Downsized Engine Structure Based on Dynamic Knock Excitation 基于动态爆震激励的小型化发动机结构优化设计

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.28

Yang Bo, Wang Wenrui

引用次数: 0

An Auction Approach to Spectrum Leasing in Two-Tier Femtocell Networks 两层移动蜂窝网络频谱租赁的拍卖方法

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.6

Lei Xing, Xin Chen, Tie Qiu, Zhuo Li

{"title":"An Auction Approach to Spectrum Leasing in Two-Tier Femtocell Networks","authors":"Lei Xing, Xin Chen, Tie Qiu, Zhuo Li","doi":"10.1109/IIKI.2016.6","DOIUrl":"https://doi.org/10.1109/IIKI.2016.6","url":null,"abstract":"In recent years, wireless industries have adopted femtocell networks for enhancing indoor coverage and quality of service. In the femtocell networks, it is an important issue to achieve much more revenue with the limited spectrum resource. The macrocell base station (MBS) owns all available resource, and femtocell base stations (FBSs) own no spectrum and want to rent spectrum from the MBS. This paper proposes an auction-based pricing scheme to investigate the spectrum leasing problem in the scenario with a central macrocell and multiple femtocells. We model the spectrum leasing procedure between MBS and FBSs as an auction that aims at motivating the MBS to lease its spectrum resource. All FBSs act as the bidders and the monopolist MBS acts as the auctioneer. In this auction, FBSs submit their bids to rent spectrum resources so that they can make profit by selling them to their subscribers, while the MBS determines the spectrum leasing amount and chooses the winner FBSs. In this paper, we focus on spectrum pricing scheme and revenue maximization of the MBS. Simulation results show that the proposed scheme provides effective motivation for the MBS to lease spectrum to FBSs and both the MBS and FBSs can benefit from spectrum leasing.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125801236","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

Primary and Secondary Social Activity Aware Routing for Cognitive Radio Networks 认知无线电网络的主要和次要社会活动感知路由

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.88

Junling Lu, Zhipeng Cai, Xiaoming Wang, Lichen Zhang, Peng Li, Zaobo He

{"title":"Primary and Secondary Social Activity Aware Routing for Cognitive Radio Networks","authors":"Junling Lu, Zhipeng Cai, Xiaoming Wang, Lichen Zhang, Peng Li, Zaobo He","doi":"10.1109/IIKI.2016.88","DOIUrl":"https://doi.org/10.1109/IIKI.2016.88","url":null,"abstract":"In cognitive radio networks(CRNs), efficient spectrum access is challenging and whitespace are necessary for communicating pairs, including Primary Users (PUs) and Secondary Users (SUs). In the existing works, available whitespace is determined by PUs' social activities, which has drawn much attention and been investigated. In reality, SUs need to compete with each other in obtaining accessible whitespace. To the best of our knowledge, the modeling and integration of SUs' social activities have not been considered in real whitespace analysis. Inspired by this motivation, we propose an solution aiming to attaining accessible whitespace, which considers the available whitespace determined by primary activities and the competitions based on secondary activities. Furthermore, we take a spectrum aware routing, including accessible whitespace and routing convergence, as an example to demonstrate the advantage of this proposed solution. The simulation experiments conducted on real world datasets verify the difference between available whitespace and accessible whitespace, and also show the adaptiveness of the proposed algorithm in terms of average delivery ratio and average delay.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129619019","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}

引用次数: 5

An Optimized Approach for Storing Small Files on HDFS-based on Dynamic Queue 基于动态队列的hdfs小文件存储优化方法

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.55

Weipeng Jing, Danyu Tong

{"title":"An Optimized Approach for Storing Small Files on HDFS-based on Dynamic Queue","authors":"Weipeng Jing, Danyu Tong","doi":"10.1109/IIKI.2016.55","DOIUrl":"https://doi.org/10.1109/IIKI.2016.55","url":null,"abstract":"Under the background of the rapid development of social network, massive small files data are urgently needed to be dealt effectively. Unfortunately, HDFS (Hadoop Distributed File System) does not perform well for massive small files since the heavy burden on NameNode, and poor reading performance. Therefore, in order to solve this problem, a method DQSF (Dynamic Queue of Small File) is proposed in this paper. It designs an appropriate queue for files of different sizes, which are as the basis for merge of small files. The method based on Analytic Hierarchy Process. It obtains the size of queue under the best performance when computing system's comprehensive index of the file reading, memory usage and merging efficiency. Which means the dynamic queue value under the corresponding range. Also using the text categorization algorithm based on period feature at the prior to the merger of small files. It improves the speed of file reading through the hierarchical index and index prefetching mechanism at the same time. Experimental results show that this strategy can reduce the usage of memory, improve the efficiency of accessing massive small files, resulting the great improvement of system's performance.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129114879","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

An Empirical Study on Big Video Data Processing: Architectural Styles, Issues, and Challenges 大视频数据处理的实证研究:架构风格、问题与挑战

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.7

Weishan Zhang, Zhichao Wang, Liang Xu, Dehai Zhao, Faming Gong, Q. Lu

引用次数: 2

Research on the Application of Data Driven Classification and Recognition Technology in the Health Diagnosis of Spacecraft 数据驱动分类识别技术在航天器健康诊断中的应用研究

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.94

Shimin Song, Xun He, Jie Gao, Huamao Wang

引用次数: 1

A Sequential Multi-type POI Recommendation Service Based on Location 基于位置的顺序多类型POI推荐服务

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.5

Xiangheng Meng, Shengling Wang, Waqas Ahmad, Yijun Chen

{"title":"A Sequential Multi-type POI Recommendation Service Based on Location","authors":"Xiangheng Meng, Shengling Wang, Waqas Ahmad, Yijun Chen","doi":"10.1109/IIKI.2016.5","DOIUrl":"https://doi.org/10.1109/IIKI.2016.5","url":null,"abstract":"Nowadays locaiton-based services (LBSs) are becoming more and more popular. However, all the existing service can only support the single POI recommendation, which is the typical LBS. A user sends his current location and the single type of POIs (Points of Interest) to the server. Then the server will return proper POIs to the user. In people's life, we have the need of multiple types service. That is, what the user wants is some combinations of different POIs rather than single POIs. For example, one restaurant, one cafe and one cinema. In addition, the visit time of these POIs are different. So the order of each POI in one combination is up to the user. More precisely, what the user need is sequential multi-type POI recommendation. To support this service, we propose a new framework where the interaction between the user and the server is changed. This new service is totally different from the typical one. Therefore, a new algorithm to solve this challenging problem is proposed too. It adopts a recursion idea. At the last, some simulations are conducted to testify the effectiveness of the algorithm based on real data from the Internet.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126848375","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

Overview of Data Mining and Visual Analytics towards Big Data in Smart Grid 面向智能电网大数据的数据挖掘与可视化分析综述

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.83

Lin Hou, Yiying Zhang, Yang Yu, Yancui Shi, Kun Liang

引用次数: 10

Content Replication Scheme Using Stable Matching in Vehicular Networks 基于稳定匹配的车载网络内容复制方案

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI: 10.1109/IIKI.2016.18

Xiaolan Tang, Donghui Hong, Wenlong Chen

{"title":"Content Replication Scheme Using Stable Matching in Vehicular Networks","authors":"Xiaolan Tang, Donghui Hong, Wenlong Chen","doi":"10.1109/IIKI.2016.18","DOIUrl":"https://doi.org/10.1109/IIKI.2016.18","url":null,"abstract":"Present researches on content replication in vehicular networks mainly utilize the mobile vehicular nodes to carry contents, while the high mobility, the limited resources and the security risks of vehicular nodes prohibit the performance enhancements. In this paper, we propose a content replication scheme using stable matching, namely RSM, in which the roadside units take the role of content carriers. For an efficient solution in terms of the access ratio and the access delay, the original content replication problem is formulated as a stable matching problem of bipartite graph, whose left vertices stand for the contents and whose right vertices for the storage cells of roadside units. Given a preference ranking of each content based on its response quota and a priority ranking of each storage cell based on its encountering latency quota, the weak-ordering stable matching problem is solved in polynomial time through Gale-Shapley algorithm and the stable improvement cycles algorithm. Besides, a multi-replica preprocessing algorithm is designed to substitute several new contents for a content having more than one replica, and thus to overcome the potential one-to-many mapping in stable matching. Experiments show that the RSM scheme achieves a high access ratio and a small storage cost with an acceptable access delay.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131167067","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