{"title":"How to design a common telecom infrastructure by competitors individually rational and collectively optimal","authors":"Xiaotie Deng, Jianping Wang, Juntao Wang","doi":"10.1109/JSAC.2017.2672318","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2672318","url":null,"abstract":"The fast development of 4G LTE networks calls for a huge amount of investment on infrastructure that mobile operators could no longer make it alone in building and maintaining their own network infrastructures. How to cut the cost by forming a joint venture responsible for building and maintaining a common infrastructure raises new challenging problems of pricing and coordination in the market making. In this paper, we propose a market solution where the joint venture decouples from the behaviors of share-holding mobile operators. We are interested in the pros and cons in economic benefits for such a joint operation. We set to study the best pricing and sharing strategies that maximizes the aggregate profit of members within the joint venture, each of which follows an individually rational and optimal strategy. Our technical analysis reveals a prisoner's dilemma structure embedded within such a game, which is the main factor leading to important game theoretical properties of such joint ventures. How to avoid the trap of the prisoner's dilemma to agree on the global optimum solution is a subtle challenge here. We develop game theoretical solutions to make such a dream cooperation possible as a Nash equilibrium. We also present experimental studies to verify our results numerically.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133183724","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}
Jinghua Jiang, Xiaolin Gui, Zhenkui Shi, Xingliang Yuan, Cong Wang
{"title":"Towards secure and practical targeted mobile advertising","authors":"Jinghua Jiang, Xiaolin Gui, Zhenkui Shi, Xingliang Yuan, Cong Wang","doi":"10.1109/MSN.2015.17","DOIUrl":"https://doi.org/10.1109/MSN.2015.17","url":null,"abstract":"Targeted mobile advertising has become a key economic force in recent years with the growing mobile app markets. However, the fact that it requires continuous collection of users' profiles raises severe privacy concerns. In this research, we propose to explore a secure and practical mobile advertising architecture, which aims to enable targeted advertising over encrypted mobile user preferences. The proposed idea is based upon a cryptographic primitive - private stream searching (PSS). We show how PSS can be leveraged in this new context, and discuss a number of solution directions to make our design practical and suitable for mobile devices.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"89 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":"128387960","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":"Rapid and parallel content screening for detecting transformed data exposure","authors":"Xiaokui Shu, Jing Zhang, D. Yao, Wu-chun Feng","doi":"10.1109/INFCOMW.2015.7179383","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179383","url":null,"abstract":"The leak of sensitive data on computer systems poses a serious threat to organizational security. Organizations need to identify the exposure of sensitive data by screening the content in storage and transmission, i.e., to detect sensitive information being stored or transmitted in the clear. However, detecting the exposure of sensitive information is challenging due to data transformation in the content. Transformations (such as insertion, deletion) result in highly unpredictable leak patterns. Existing automata-based string matching algorithms are impractical for detecting transformed data leaks because of its formidable complexity when modeling the required regular expressions. We design two new algorithms for detecting long and inexact data leaks. Our system achieves high detection accuracy in recognizing transformed leaks compared with the state-of-the-art inspection methods. We parallelize our prototype on graphics processing unit and demonstrate the strong scalability of our data leak detection solution analyzing big data.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124844701","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}
David Chen, J. Schuler, Pekka J. Wainio, Juha Salmelin
{"title":"5G Self-optimizing Wireless Mesh backhaul","authors":"David Chen, J. Schuler, Pekka J. Wainio, Juha Salmelin","doi":"10.1109/INFCOMW.2015.7179324","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179324","url":null,"abstract":"We will demonstrate an innovative network topology aware holistic smart backhaul solution - Self-optimizing Wireless Mesh Network (SWMN), supporting a partial mesh wireless backhaul implementation that is not only highly resilient and scalable, but also equipped with advanced SON (Self-Organizing Network) capabilities offering autonomous network configuration and traffic engineering features.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123330630","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}
Pan Yang, Xiaolin Gui, Jian An, Feng Tian, Jiachen Wang
{"title":"An encrypted image editing scheme based on homomorphic encryption","authors":"Pan Yang, Xiaolin Gui, Jian An, Feng Tian, Jiachen Wang","doi":"10.1109/INFCOMW.2015.7179367","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179367","url":null,"abstract":"There are lots of online image applications which provide image editor services for users. As the plain image may disclose privacy, this paper proposed an encrypted image editing scheme based on homomorphic encryption to make the service be able to process the encrypted image. To achieve this, firstly, a homomorphic encryption scheme was constructed for encrypting the pixels of image. Then, after translating the traditional image editing methods into the operations on encrypted pixels, the encrypted image can be edited homomorphically. The experiments show that our scheme is correct, secure and efficient enough to be used in practical applications.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116523670","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":"Mean free path applied to message dissemination in opportunistic networks","authors":"Kohei Sugiyama, T. Kubo, A. Tagami, T. Hasegawa","doi":"10.1109/INFCOMW.2015.7179421","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179421","url":null,"abstract":"Opportunistic networking including Delay-/Disruption-Tolerant Networking (DTN) has become an increasingly real possibility since there are a huge number of mobile devices, such as smartphones, all over the world. DTN is expected to find promising applications, such as message dissemination in a disaster-struck area, and offloading mobile data traffic onto DTNs in urban areas. One of the potential issues that may confront these applications is that opportunities for message relaying are limited since smartphone users are sparsely distributed among base station cells. In order to disseminate message efficiently, it is important to be able to accurately evaluate DTN performance, such as message dissemination coverage, and time. In this paper, we propose a novel yet simple analytical model of message dissemination in DTNs by applying the concept of mean free path. The mean free path is the average distance that a particle (e.g., an atom or a molecule) travels between successive collisions (in physics jargon). The basic idea is that by mapping a particle in three-dimensional space to a node in two-dimensional space, a meeting between two nodes is represented as a collision between two particles. We also perform simulation experiments in order to validate our model.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122672530","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}
Chia-Husan Chang, P. Lin, Junshan Zhang, Jeu-Yih Jeng
{"title":"Time dependent adaptive pricing for mobile internet access","authors":"Chia-Husan Chang, P. Lin, Junshan Zhang, Jeu-Yih Jeng","doi":"10.1109/INFCOMW.2015.7179441","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179441","url":null,"abstract":"Aiming to meet the explosive growth of mobile data traffic and reduce the network congestion, we study Time Dependent Adaptive Pricing (TDAP) with threshold policies to motivate users to shift their Internet access from peak hours to off-peak hours. With the proposed TDAP scheme, Internet Service Providers (ISPs) will be able to use less network capacity to provide users Internet access service with the same QoS. Simulation and analysis are carried out to investigate the performance of the proposed TDAP scheme based on the real Internet traffic pattern.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122633467","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 QoE anomaly detection and diagnosis framework for cellular network operators","authors":"Weijian Sun, Xiaowei Qin, Shuang Tang, Guo Wei","doi":"10.1109/INFCOMW.2015.7179426","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179426","url":null,"abstract":"Traditional anomaly detection and diagnosis framework of cellular network is on purpose to optimize KPIs (Key Performance Indicators). However, cellular network operators are now attaching great importance to the QoE (Quality of Experience) of OTT (Over the Top) services on their networks rather than current percent-based KPIs since KPI anomaly cannot represent QoE anomaly all the time. Currently, network operators cannot measure anomalous QoS (Quality of Service) metrics which have direct mapping relationships with QoE anomaly by Network-side instrumentation, let alone QoE anomaly. To address this limitation, this paper presents a QoE anomaly detection and diagnosis framework along with a case study to evaluate its feasibility. Our study, including QoE anomaly detection and cross-layer root cause analysis, are based on a month-long WeChat video call service dataset captured by our OTTCAP (Over the Top services capturing and analyzing Platform) under live DC-HSPA+ (Dual-Cell High Speed Packet Access Plus) network. Results of our work can be directly used by network operators to do QoE prediction and network optimization at Network-side.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116180926","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":"Optimal management of local energy trading in future smart microgrid via pricing","authors":"Yuan Wu, Xiaoqi Tan, L. Qian, D. Tsang","doi":"10.1109/INFCOMW.2015.7179446","DOIUrl":"https://doi.org/10.1109/INFCOMW.2015.7179446","url":null,"abstract":"In this paper, we investigate optimal management of local energy trading in future smart micro-grid (SMG) via pricing. In SMG, energy consumers and providers, in addition to trading with utility company, can also perform local energy trading controlled by a local trading manager (LTM) for reaping benefits. We first quantify the benefits achieved by the consumers and providers from local trading and then formulate a two-layered optimization framework to investigate i) how the energy consumers and providers maximize their benefits via appropriately adjusting their local trading decisions in response to the LTM's pricing, and ii) how the LTM adjusts its price in local market to benefit the consumers and providers as much as possible while guaranteeing a required gain for itself. We propose two algorithms to solve the layered optimization problem and perform numerical experiments with practical data set to validate the proposed local trading model and the algorithms.","PeriodicalId":278615,"journal":{"name":"2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116465933","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}