Han-Gyu Ko, Taehun Kim, Byoungoh Kim, Dongman Lee, In-Young Ko, S. Hyun
{"title":"Place-aware opportunistic service recommendation scheme in a smart space with Internet of Things","authors":"Han-Gyu Ko, Taehun Kim, Byoungoh Kim, Dongman Lee, In-Young Ko, S. Hyun","doi":"10.1109/CCNC.2014.6866613","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866613","url":null,"abstract":"In this paper, we present an opportunistic service recommendation scheme in a place with smart objects to provide users with appropriate composite services to accomplish their task goals. The proposed scheme infers possible tasks from interactions that people have experienced with smart objects including other places that are similar to a given place. The proposed scheme then evaluates the candidate tasks by measuring quality satisfaction of each task against given QoS constraints. We test the proposed scheme on our three smart testbeds where various smart objects equipped. Experiment results show that the proposed scheme finds potential tasks in the testbeds in a reasonable time.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131135440","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":"DLCA: Distributed load balancing and VCR-aware two-tier P2P VoD system","authors":"Lujie Zhong, Changqiao Xu","doi":"10.1109/CCNC.2014.6866571","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866571","url":null,"abstract":"Dynamic characteristics of user interactivity make supporting VCR-like operations in peer-to-peer (P2P) Video on Demand (VoD) streaming systems very challenging. Recently, the prediction-based prefetching of hot segments scheme has emerged as a promising approach to improve user Quality of Experience. However, this prediction model uses a centralized server to collect and analyze the large volumes of user viewing logs for predicting user VCR behavior. This log server can easily become bottleneck in terms of data exchange and processing. In this paper, we propose a novel distributed load balancing and VCR-aware two-tier P2P VoD System (DLCA). DLCA relies on a two-tier architecture. In the low tier, the common nodes form a classic gossip-based unstructured network for normal data distribution. On the top layer, a portion of strong nodes establish a structured DHT network for VCR-related information analysis and publish. By employing a pattern mining algorithm, each strong mode maintains a prefetching routing table, which can effectively assist common nodes prefetching segments for VCR-like interactivity during playback. Simulation results show how DLCA outperforms a state of the art centralised method in terms of performance.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134425195","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}
Bingshuang Liu, Shidong Wu, Tao Wei, Chao Zhang, Jun Yu Li, Jianyu Zhang, Yu Chen, Chen Li
{"title":"Splider: A split-based crawler of the BT-DHT network and its applications","authors":"Bingshuang Liu, Shidong Wu, Tao Wei, Chao Zhang, Jun Yu Li, Jianyu Zhang, Yu Chen, Chen Li","doi":"10.1109/CCNC.2014.6866591","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866591","url":null,"abstract":"Capturing accurate snapshots of peer-to-peer (P2P) networks, especially those with millions of users, is essential to many P2P-based applications, including those monitoring and analyzing P2P networks. The large scale and dynamic nature of P2P networks, however, make this task very challenging. Existent crawlers of P2P networks, for example, often miss a substantial portion of the ID space while unnecessarily crawling numerous nodes repeatedly. In this paper, we design and evaluate a new crawler called Splider. Unlike traditional crawling algorithms that adopt an iterative approach, Splider recursively splits the ID space of P2P nodes to crawl even tiny corners of the ID space, while avoiding crawling repeated nodes. We further implement a Splider prototype for BT-DHT, a Kademlia-based distributed hash table (DHT) P2P network, that exploits the structure of routing tables at BT-DHT nodes. Experiments show that Splider is able to gather more than 16 million nodes with a 100% recall ratio, whereas a traditional iterative crawler can at best capture only about 8 million nodes with a 66% recall ratio while its traffic-cost effectiveness is 50% less than Splider. Splider can further support distributed deployment; without any synchronization overhead, it reduces the time of capturing a full snapshot to be only about 3 minutes. We finally report and analyze the captured BT-DHT snapshots, including the spatial and temporal distribution of BT-DHT nodes and the existence of sybil and eclipse attacks in BT-DHT.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115186882","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":"Lessons learned in building pervasive platforms","authors":"C. Escoffier, Stéphanie Chollet, P. Lalanda","doi":"10.1109/CCNC.2014.6866540","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866540","url":null,"abstract":"The purpose of pervasive applications is to be invisible and to require a minimal amount of user attention. But invisibility raises lots of hard challenges, blocking the long-awaited pervasive era to emerge. The device heterogeneity and volatility, security enforcement and context-awareness are just some of the issues a developer must tackle inside the application code. To industrialize such development, we propose to use an application server dedicated to the pervasive environment. Thanks to this server, developers focus on the application, delegating to the server most of the pervasive constraint management. However, providing such a platform is a very difficult task. The pervasive environment constraints must be handled by this server in a consistent way, while being flexible enough to support the different applications. This paper describes the requirements of the pervasive applications and how our platform, named iCASA, deals with them.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116582955","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}
Abdullah Almaatouq, Ahmad Alabdulkareem, Mariam Nouh, Mansour Alsaleh, A. Alarifi, Abel Sanchez, A. Alfaris, John R. Williams
{"title":"A malicious activity detection system utilizing predictive modeling in complex environments","authors":"Abdullah Almaatouq, Ahmad Alabdulkareem, Mariam Nouh, Mansour Alsaleh, A. Alarifi, Abel Sanchez, A. Alfaris, John R. Williams","doi":"10.1109/CCNC.2014.6866597","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866597","url":null,"abstract":"Complex enterprise environments consist of globally distributed infrastructure with a variety of applications and a large number of activities occurring on a daily basis. This increases the attack surface and narrows the view of ongoing intrinsic dynamics. Thus, many malicious activities can persist under the radar of conventional detection mechanisms long enough to achieve critical mass for full-fledged cyber attacks. Many of the typical detection approaches are signature-based and thus are expected to fail in the face of zero-day attacks. In this paper, we present the building-blocks for developing a Malicious Activity Detection System (MADS). MADS employs predictive modeling techniques for the detection of malicious activities. Unlike traditional detection mechanisms, MADS includes the detection of both network-based intrusions and malicious user behaviors. The system utilizes a simulator to produce holistic replication of activities, including both benign and malicious, flowing within a given complex IT environment. We validate the performance and accuracy of the simulator through a case study of a Fortune 500 company where we compare the results of the simulated infrastructure against the physical one in terms of resource consumption (i.e., CPU utilization), the number of concurrent users, and response times. In addition to an evaluation of the detection algorithms with varying hyper-parameters and comparing the results.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"1959 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129455119","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":"A privacy protection system for HbbTV in Smart TVs","authors":"Marco Ghiglieri, Erik Tews","doi":"10.1109/CCNC.2014.6866595","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866595","url":null,"abstract":"The popularity of smart entertainment devices is growing every day. Products like blu-ray players, set-top boxes and Smart TVs (STV) with high connectivity are on the market. Many of them connect to the Internet via LAN or WiFi. Especially Smart TVs enable the broadcasting stations to provide real-time information directly to the consumers, for example additional information about a current TV program. HbbTV is one of the standards on STV for combining the two data media DVB and Internet. It defines how commonly used web technologies can be used as a transparent overlay over the current channel. Each respective broadcasting station is responsible for the contents of their channels' HbbTV signals. In this article, we describe how broadcasting stations measure the consumers viewing behavior more accurately using HbbTV. We show which technologies are used and which cause privacy risks, i.e., which methods lead to the exposure of personal preferences. Additionally, we describe a method how an evil-minded neighbor is able to monitor the viewing behavior without the user's knowledge and consent. This method is possible on most channels using HbbTV. It is not even required that the user actively starts the HbbTV application. Beyond that, we can collect this data on an encrypted WiFi network as well. Finally, we discuss our implementation for significantly reducing the privacy risk HbbTV poses.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128836915","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":"Referential bounds analysis of uplink radio resource scheduling in LTE network","authors":"Cuiyu Kong, Yen-Wen Chen, I-Hsuan Peng","doi":"10.1109/CCNC.2014.6866620","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866620","url":null,"abstract":"Energy efficiency in wireless broadband network is increasingly crucial because of the shrinking size and the battery constraint of mobile devices. Therefore, to save the power of user equipment (UE) is an important issue in practical network applications. Meanwhile, under the condition of limited spectrum and heavy traffic load in system, spectrum efficiency is also important resulting from the pursuits of high quality of service (QoS) and high data rate. In this paper, we propose and compare two extreme radio resource allocation schemes: the power-saving (PS) oriented scheme and the spectrum-saving (SS) oriented scheme in LTE uplink system. The PS oriented scheme minimizes the power consumption in allocating radio resource. On the contrary, the SS oriented scheme considers the efficient radio resource utilization to maximize the system throughput. Although the scheduling purposes are different, both schemes consider the changeable channel condition, QoS satisfaction, and continuous resource blocks (RB) for uplink scheduling in LTE network. Simulation results of system throughput, power consumption, and transmission quality (e.g. packet dropping rate) are compared and analyzed. As these two schemes are designed in minimizing the power consumption and maximizing the spectrum utilization, respectively, the experimental results can be applied as the referential bounds for the study of adaptive scheduling schemes.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126017537","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":"Femtocell as a relay with application of physical layer network coding","authors":"W. Oduola, Lijun Qian, Xiangfang Li","doi":"10.1109/CCNC.2014.6866619","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866619","url":null,"abstract":"This study takes advantage of the ability of Physical-Layer Network Coding (PNC) to embrace electromagnetic interference, improve spectral efficiency and achieve throughput optimality in a femtocell operated as a relay. Specifically, we make a case for a femtocell operating as a relay and utilizing PNC to eliminate the interference that exists between macrocells user equipments (MUEs) and femtocells home users equipments (HUEs) in an Opened Subscriber Group (OSG) co-channel deployment. With PNC implemented at the HNB relay, it becomes possible for the relay to take advantage of the information signals transmitted from both the HUE and MUE rather than treating the MUE's signals as interference. To guarantee the Service Quality (QoS) of femtocell users, we develop the closed-form expressions of the cummulative distributions function (CDF) of the received signal-to-noise ratios (SNR) and the outage probability of the HUE analytically. Simulation results match the analytical results and it is demonstrated that PNC is suitable for a relay operated femtocell network.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116985970","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}
Jian Song, Jun Liu, Yu Zhang, Sheng Zhou, Changyong Pan
{"title":"Energy efficient broadcast radius optimization in cellular networks","authors":"Jian Song, Jun Liu, Yu Zhang, Sheng Zhou, Changyong Pan","doi":"10.1109/CCNC.2014.6866543","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866543","url":null,"abstract":"In this paper, we study the optimal broadcast radius in cellular network from the perspective of energy efficiency. Firstly, we consider the scenario where the base stations have already been deployed. The relationship between the power-saving gain and the possible energy efficient broadcast radius is derived. Based on it, we investigate the optimal number of tiers of cells in the broadcast range. Next, we turn to the scenario with the base stations to be deployed. The power consumption per effective coverage area is defined to measure the energy efficiency of different broadcast radius, based on which we analyze the optimal broadcast radius under different channel conditions. Simulation results confirm that the optimal energy efficient broadcast radius is positively correlated with the static power of the broadcast channel, negatively correlated with the minimal required broadcast service rate in the two scenarios, and negatively correlated with the original cell radius in the first scenario.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132876378","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":"A novel self-checking pollution attackers identification scheme in wireless network coding","authors":"Donghai Zhu, Xinyu Yang, Wei Yu","doi":"10.1109/CCNC.2014.6866593","DOIUrl":"https://doi.org/10.1109/CCNC.2014.6866593","url":null,"abstract":"Pollution attacks refer to ones where attackers modify and inject corrupted data packets into the wireless network with network coding to disrupt the decoding process. In the context of network coding, the epidemic effect of pollution attacks can degrade network throughput significantly because of the mixing nature of network coding. To address this issue, a number of malicious nodes identification schemes have been developed in the past. However, these schemes have their limitations and cannot effectively deal with pollution attacks. In this paper, we propose a novel light-weight Self-checking Pollution Attackers Identification Scheme (SPAIS), which can identify the pollution attackers effectively and efficiently. Through making full use of the broadcast nature of wireless media and insight that a well-behaved node can monitor its downstream neighboring nodes locally by cooperating with other nodes, SPAIS hierarchically organizes the network as levels such that the nodes in the same level can monitor their downstream level nodes cooperatively. Through the combination of theoretical analysis and extensive simulations, our experimental data demonstrates that SPAIS can more effectively identify pollution attackers with a lower cost in comparison with the existing representative schemes. For example, even if the quality of the network connection is not in good condition and the malicious nodes send only one corrupted packet, the pollution attackers can be identified with a high probability.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"7 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131991275","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}