Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017177
Yu Liu, J. Niu
Mobile applications become increasingly popular currently. Both authentication and privacy are very important for mobile applications. A promising approach for local authentication is to match the acceleration sensor samples of the two candidate smart phones. However, the acceleration sensor on the smart phones sample at different rates and the starting phases are not aligned. This paper presents a new local authentication method for mobile applications called Overlapped-shaking. Overlapped-shaking is a background service for smart phones which can measure the similarities between two shaking patterns. We design a new acceleration samples matching method called SAM, which can handle the data in different sample rates and offset at the beginning. We implement a demonstration of Overlapped-shaking service on Android smart phones. Test results show that our approach works very well for acceleration-based smart phone authentications.
{"title":"Overlapped-shaking: A local authentication method for mobile applications","authors":"Yu Liu, J. Niu","doi":"10.1109/ComComAp.2014.7017177","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017177","url":null,"abstract":"Mobile applications become increasingly popular currently. Both authentication and privacy are very important for mobile applications. A promising approach for local authentication is to match the acceleration sensor samples of the two candidate smart phones. However, the acceleration sensor on the smart phones sample at different rates and the starting phases are not aligned. This paper presents a new local authentication method for mobile applications called Overlapped-shaking. Overlapped-shaking is a background service for smart phones which can measure the similarities between two shaking patterns. We design a new acceleration samples matching method called SAM, which can handle the data in different sample rates and offset at the beginning. We implement a demonstration of Overlapped-shaking service on Android smart phones. Test results show that our approach works very well for acceleration-based smart phone authentications.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125373597","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017196
Jin Ren, Zhengping Li, Yujie Guo
We investigate iterative detection and decoding, a.k.a. turbo detection, for multiple-input multiple-output (MIMO) transmission. This investigation is based on a low complexity soft output MIMO detector with a priori information feedback. We show that maximum a posteriori performance (without turbo iteration) can be achieved, at a much lower computational cost, by using the proposed soft-output MIMO detector.
{"title":"Iterative detection and decoding of MIMO signal using a low-complexity soft-output detector","authors":"Jin Ren, Zhengping Li, Yujie Guo","doi":"10.1109/ComComAp.2014.7017196","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017196","url":null,"abstract":"We investigate iterative detection and decoding, a.k.a. turbo detection, for multiple-input multiple-output (MIMO) transmission. This investigation is based on a low complexity soft output MIMO detector with a priori information feedback. We show that maximum a posteriori performance (without turbo iteration) can be achieved, at a much lower computational cost, by using the proposed soft-output MIMO detector.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131130178","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017189
Lei Han, Yi Lin, Weiwei Jia
This paper explores intrinsic characteristics of solid state device (SSD) by modifying the system schedulers as core. Based on obtained characteristics, we design a new block I/O scheduler. Different from mechanical hard disk device (HDD), SSDs have many widely cognitive features, such as none-mechanical, inherent parallelism, high read and write speeds and so on. Considering the current system schedulers are optimized for HDD, we suppose these schedulers may be not optimal for SSD. We manage to modify the essential parts of system schedulers and test them under different workloads, then summarize the characteristics for improving performance like sorting order of requests, read-write interference and parallelism. We implement a new scheduler called Layer_Read which has the different organizations according to the access pattern on a Linux 2.6.34 kernel. The scheduler divides read requests into different sub-layers in accordance with their starting sector numbers, and dispatches requests in a round-robin way among the sub-layers in order to utilize inherent parallelism. Besides that, the scheduler continuously dispatches multiple read or write requests which can reduce the read-write interference. Through the experiment validated, the scheduler has some performance improvement when compared with other system schedulers.
{"title":"A new I/O scheduler designed for SSD through exploring performance characteristics","authors":"Lei Han, Yi Lin, Weiwei Jia","doi":"10.1109/ComComAp.2014.7017189","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017189","url":null,"abstract":"This paper explores intrinsic characteristics of solid state device (SSD) by modifying the system schedulers as core. Based on obtained characteristics, we design a new block I/O scheduler. Different from mechanical hard disk device (HDD), SSDs have many widely cognitive features, such as none-mechanical, inherent parallelism, high read and write speeds and so on. Considering the current system schedulers are optimized for HDD, we suppose these schedulers may be not optimal for SSD. We manage to modify the essential parts of system schedulers and test them under different workloads, then summarize the characteristics for improving performance like sorting order of requests, read-write interference and parallelism. We implement a new scheduler called Layer_Read which has the different organizations according to the access pattern on a Linux 2.6.34 kernel. The scheduler divides read requests into different sub-layers in accordance with their starting sector numbers, and dispatches requests in a round-robin way among the sub-layers in order to utilize inherent parallelism. Besides that, the scheduler continuously dispatches multiple read or write requests which can reduce the read-write interference. Through the experiment validated, the scheduler has some performance improvement when compared with other system schedulers.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129482367","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017178
A. A. Farooqui, S. S. Zaidi, A. Memon, S. Qazi
Supervisory Control and Data Acquisition (SCADA) systems are traditionally proprietary and well protected. Due to increasing use of commercial/open source technology and communication protocols, there are growing concerns about the associated security threats. SCADA networks are usually employed in critical infrastructure, therefore, not much technical data of the actual systems is accessible to the research community. Most of the researchers simulate the SCADA functioning through development of testbed. Such projects are usually expensive and requiring financial sponsorship. In this paper we present a simple, inexpensive and flexible approach to develop a SCADA testbed utilizing TrueTime, a MATLAB/ Simulink based tool. The paper describes TrueTime simulation blocks, our control system, simulation of Denial of Service (DoS) attack and its effects. The main aim was to assess the effectiveness and suitability of TrueTime for the intended use in the development of a larger scale SCADA testbed. The results shown reflect that TrueTime can be effectively used for the purpose of SCADA network simulations and collection of necessary data for security analysis.
{"title":"Cyber Security Backdrop: A SCADA testbed","authors":"A. A. Farooqui, S. S. Zaidi, A. Memon, S. Qazi","doi":"10.1109/ComComAp.2014.7017178","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017178","url":null,"abstract":"Supervisory Control and Data Acquisition (SCADA) systems are traditionally proprietary and well protected. Due to increasing use of commercial/open source technology and communication protocols, there are growing concerns about the associated security threats. SCADA networks are usually employed in critical infrastructure, therefore, not much technical data of the actual systems is accessible to the research community. Most of the researchers simulate the SCADA functioning through development of testbed. Such projects are usually expensive and requiring financial sponsorship. In this paper we present a simple, inexpensive and flexible approach to develop a SCADA testbed utilizing TrueTime, a MATLAB/ Simulink based tool. The paper describes TrueTime simulation blocks, our control system, simulation of Denial of Service (DoS) attack and its effects. The main aim was to assess the effectiveness and suitability of TrueTime for the intended use in the development of a larger scale SCADA testbed. The results shown reflect that TrueTime can be effectively used for the purpose of SCADA network simulations and collection of necessary data for security analysis.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134553852","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017214
Chao Wang, Ju Cheng Yang, Yarui Chen, Cao Wu, Yanbin Jiao
To overcome the shortcomings of the traditional methods, this paper proposes a novel face recognition method based on the image latent semantic features and ensemble extreme learning machine. The image latent semantic analysis is to acquire the high-level features from the face image, which has good robustness to illumination and expression changes. The image latent features are extracted as fellows: firstly, we obtain the low-level features of face image by the feature extraction methods of Gabor filter, local ternary pattern (LTP), and invariant moments. Then, we build the feature-image matrix based on the low-level features, and decompose the matrix with two dimension matrix decomposition to get the image latent semantic features. Finally, the ensemble extreme learning machine is used to classify the latent semantic features, which combines lots of extreme learning machine to obtain a stable classifier. The experimental results show that our proposed algorithm is more effective when compared with other algorithms.
{"title":"Image latent semantic analysis based face recognition with ensemble extreme learning machine","authors":"Chao Wang, Ju Cheng Yang, Yarui Chen, Cao Wu, Yanbin Jiao","doi":"10.1109/ComComAp.2014.7017214","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017214","url":null,"abstract":"To overcome the shortcomings of the traditional methods, this paper proposes a novel face recognition method based on the image latent semantic features and ensemble extreme learning machine. The image latent semantic analysis is to acquire the high-level features from the face image, which has good robustness to illumination and expression changes. The image latent features are extracted as fellows: firstly, we obtain the low-level features of face image by the feature extraction methods of Gabor filter, local ternary pattern (LTP), and invariant moments. Then, we build the feature-image matrix based on the low-level features, and decompose the matrix with two dimension matrix decomposition to get the image latent semantic features. Finally, the ensemble extreme learning machine is used to classify the latent semantic features, which combines lots of extreme learning machine to obtain a stable classifier. The experimental results show that our proposed algorithm is more effective when compared with other algorithms.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129650095","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017201
Xiang Zheng, Fang Xiong, YaoNan Dai
Cloud computing is a new method, which provides computing capabilities on demand, integrates IT resources and services through public communication network, and offers users new types of service product and delivery model. In radio and TV industry, one important development area is hybrid TV during the transition from the mere broadcast institution to full-service provider. This paper based on the characteristic of cloud computing, tentatively proposes the solution provided by clouding computing for some problems in the implementation of hybrid TV, such as hybrid architecture, large-scale data, interaction of transmission system, and the variety of terminal requirement.
{"title":"The technical exploration of implementing hybrid TV with cloud computing in radio and TV industry","authors":"Xiang Zheng, Fang Xiong, YaoNan Dai","doi":"10.1109/ComComAp.2014.7017201","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017201","url":null,"abstract":"Cloud computing is a new method, which provides computing capabilities on demand, integrates IT resources and services through public communication network, and offers users new types of service product and delivery model. In radio and TV industry, one important development area is hybrid TV during the transition from the mere broadcast institution to full-service provider. This paper based on the characteristic of cloud computing, tentatively proposes the solution provided by clouding computing for some problems in the implementation of hybrid TV, such as hybrid architecture, large-scale data, interaction of transmission system, and the variety of terminal requirement.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126105813","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017183
Z. Tang, Bao-kang Zhao, Wanrong Yu, Zhenqian Feng, Chunqing Wu
To date, traditional satellite systems are contained-designed and inflexible for configuration update, space systems interconnections and providing fine-grained services. In this paper, we propose a novel satellite network architecture: software defined satellite networks (SDSN) to solve these problems. The new architecture is based on the central control patten of software defined networks (SDN), and takes full use of the inter-satellite links (ISLs) forwarding and GEO broadcasting for rapid network deployment. With global network view and central control ability, SDSN can (1) balance the flexibility and controllability of space dynamic routing algorithms, (2) rapidly deploy flexible and fine-grained network management strategies, (3) reduce the system cost, and (4) improve the collaboration between satellites and the compatibility of heterogeneous space systems. Meanwhile, the challenges are also introduced in designing and deploying the new architecture. Finally, the performance of the new SDSN architecture is validated in this paper.
{"title":"Software defined satellite networks: Benefits and challenges","authors":"Z. Tang, Bao-kang Zhao, Wanrong Yu, Zhenqian Feng, Chunqing Wu","doi":"10.1109/ComComAp.2014.7017183","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017183","url":null,"abstract":"To date, traditional satellite systems are contained-designed and inflexible for configuration update, space systems interconnections and providing fine-grained services. In this paper, we propose a novel satellite network architecture: software defined satellite networks (SDSN) to solve these problems. The new architecture is based on the central control patten of software defined networks (SDN), and takes full use of the inter-satellite links (ISLs) forwarding and GEO broadcasting for rapid network deployment. With global network view and central control ability, SDSN can (1) balance the flexibility and controllability of space dynamic routing algorithms, (2) rapidly deploy flexible and fine-grained network management strategies, (3) reduce the system cost, and (4) improve the collaboration between satellites and the compatibility of heterogeneous space systems. Meanwhile, the challenges are also introduced in designing and deploying the new architecture. Finally, the performance of the new SDSN architecture is validated in this paper.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115307996","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017170
Zhao Kai, H. Cui, Tang Kun
Classical Bit Extraction algorithms can guarantee truncated scalable coded video stream with good reconstructed quality under error-free bandwidth limited channels. However, they are deficient in two folds: firstly, packet loss is not considered in the truncated rate-distortion model; secondly the reference of original video sequence is unavoidable. To overcome the above shortcomings, this paper firstly introduces a low complexity error propagation distortion model, in which error drift distortion due to rate truncation and packet loss can both be analyzed in the absence of the original sequence. Based on this model, an optimized bit extraction algorithm is proposed for the transmission of H.264/SVC MGS stream over bandwidth limited error-prone channels. Extensive simulation results show that, the error drift distortion of both base layer and enhancement layer can be accurately predicted based on the introduced error propagation distortion model. In addition, compared with the benchmark bit extraction algorithms provided by JSVM, our proposed algorithm can not only provide a higher reconstructed quality of truncated MGS video stream under various rate constraints and channel conditions, but as well achieve the promising performance with a much lower time complexity.
{"title":"Optimized Bit Extraction of H.264-SVC MGS stream over error-prone channels","authors":"Zhao Kai, H. Cui, Tang Kun","doi":"10.1109/ComComAp.2014.7017170","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017170","url":null,"abstract":"Classical Bit Extraction algorithms can guarantee truncated scalable coded video stream with good reconstructed quality under error-free bandwidth limited channels. However, they are deficient in two folds: firstly, packet loss is not considered in the truncated rate-distortion model; secondly the reference of original video sequence is unavoidable. To overcome the above shortcomings, this paper firstly introduces a low complexity error propagation distortion model, in which error drift distortion due to rate truncation and packet loss can both be analyzed in the absence of the original sequence. Based on this model, an optimized bit extraction algorithm is proposed for the transmission of H.264/SVC MGS stream over bandwidth limited error-prone channels. Extensive simulation results show that, the error drift distortion of both base layer and enhancement layer can be accurately predicted based on the introduced error propagation distortion model. In addition, compared with the benchmark bit extraction algorithms provided by JSVM, our proposed algorithm can not only provide a higher reconstructed quality of truncated MGS video stream under various rate constraints and channel conditions, but as well achieve the promising performance with a much lower time complexity.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123136950","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017169
Gangyong Jia, Guangjie Han
As power density increases with high technology, the high temperature has threatened the system performance, reliability and even system safety. Develop a thermal management for reducing temperature, but without disturbing fairness, is becoming more and more important. Therefore, in this paper, we propose a DTS-DVFS management which combines Dynamic Time-Slice Scaling (DTS) with Dynamic Voltage and Frequency Scaling (DVFS). Through fine-grained thermal characterization based on task behavior, dynamically determine both Time-slice Scaling factor (TSF) and Voltage and Frequency Scaling factor (VSF) for each task on real-time which not only reduces temperature but also retains fairness. Besides scaling both time-slice and voltage and frequency for each task according to TSF and VSF respectively, combining alternative scheduling scheme based on boosting thermal model which predicts the temperature of the chip. Through our experiments in real machine, results demonstrate our proposed policy can reduce the chip average and peak temperature maximums by 4.2°C and 2.9°C with negligible fairness loss.
{"title":"Combine dynamic time-slice scaling with DVFS for coordinating thermal and fairness on CPU","authors":"Gangyong Jia, Guangjie Han","doi":"10.1109/ComComAp.2014.7017169","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017169","url":null,"abstract":"As power density increases with high technology, the high temperature has threatened the system performance, reliability and even system safety. Develop a thermal management for reducing temperature, but without disturbing fairness, is becoming more and more important. Therefore, in this paper, we propose a DTS-DVFS management which combines Dynamic Time-Slice Scaling (DTS) with Dynamic Voltage and Frequency Scaling (DVFS). Through fine-grained thermal characterization based on task behavior, dynamically determine both Time-slice Scaling factor (TSF) and Voltage and Frequency Scaling factor (VSF) for each task on real-time which not only reduces temperature but also retains fairness. Besides scaling both time-slice and voltage and frequency for each task according to TSF and VSF respectively, combining alternative scheduling scheme based on boosting thermal model which predicts the temperature of the chip. Through our experiments in real machine, results demonstrate our proposed policy can reduce the chip average and peak temperature maximums by 4.2°C and 2.9°C with negligible fairness loss.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125111818","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}
Pub Date : 2014-10-01DOI: 10.1109/ComComAp.2014.7017203
Yunchuan Sun, Junsheng Zhang, R. Bie, Hongli Yan, Ye Xia, Zhangbing Zhou
Large scaled sensing data are continuously generated by the trillions of sensing devices in the Internet of Things(IoT). It becomes a big challenge to organize and manage these sensing data. In this paper, we propose an event-based organizing model, Event-Linked Network(ELN), to manage the big sensing data. Several different types of queries are also explored, which are different from the queries on traditional relational databases.
{"title":"Event-based organization model for sensing data","authors":"Yunchuan Sun, Junsheng Zhang, R. Bie, Hongli Yan, Ye Xia, Zhangbing Zhou","doi":"10.1109/ComComAp.2014.7017203","DOIUrl":"https://doi.org/10.1109/ComComAp.2014.7017203","url":null,"abstract":"Large scaled sensing data are continuously generated by the trillions of sensing devices in the Internet of Things(IoT). It becomes a big challenge to organize and manage these sensing data. In this paper, we propose an event-based organizing model, Event-Linked Network(ELN), to manage the big sensing data. Several different types of queries are also explored, which are different from the queries on traditional relational databases.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125202754","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
扫码关注我们
求助内容：
应助结果提醒方式：