{"title":"Radio-over-Radio: I/Q-stream backhauling for cloud-based networks via millimeter wave links","authors":"J. Bartelt, G. Fettweis","doi":"10.1109/GLOCOMW.2013.6825082","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825082","url":null,"abstract":"Cloud-based centralized processing is one approach to improve mobile networks in terms of capacity, energy consumption, utilization, and cost. However, some joint processing techniques envisioned for such cloud-based networks require the backhauling of received symbols, usually in the form of an I/Q-stream, which requires a drastically higher data rate on the backhaul link than the backhauling of decoded user data. Until recently, the required data rate could only be provided by fiber and not by wireless links, which could be deployed easier and at lower cost. In this paper, we propose the concept of Radio-over-Radio by extending the popular Radio-over-Fiber approach to wireless millimeter wave links. We analyze the characteristics of the new concept and give first results on a joint optimization of the wireless access and backhaul links by means of joint coding under a data rate constraint on the backhaul.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128961476","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}
Hyoungju Ji, Hyojin Lee, Seung-Ji Choi, Youngbum Kim, Younsun Kim, A. Papasakellariou, T. Novlan
{"title":"Interference avoidance and coordination for small cells in B4G cellular networks","authors":"Hyoungju Ji, Hyojin Lee, Seung-Ji Choi, Youngbum Kim, Younsun Kim, A. Papasakellariou, T. Novlan","doi":"10.1109/GLOCOMW.2013.6824981","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6824981","url":null,"abstract":"Base station density in modern cellular networks is continuously increasing in order to cope with the exponential increase in mobile data traffic. Cellular networks which used to rely on macro cells for both system coverage and data transfer are now turning to small cells at an increasing rate. Small cells can complement macro cell dominant cellular networks by providing a cost effective means for offloading mobile data traffic. As in macro cells, communication performance in small cells is determined in large part by the inter-cell interference. Compared to macro cells, inter-cell interference can be much more severe for small cells due to their clustered deployment in urban hotspot areas. This paper discusses how inter-cell interference can be effectively managed in small cells with the use of a diverse range of interference avoidance/coordination techniques.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129052430","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}
Angelos K. Marnerides, Michael R. Watson, Noor-ul-Hassan Shirazi, A. Mauthe, D. Hutchison
{"title":"Malware analysis in cloud computing: Network and system characteristics","authors":"Angelos K. Marnerides, Michael R. Watson, Noor-ul-Hassan Shirazi, A. Mauthe, D. Hutchison","doi":"10.1109/GLOCOMW.2013.6825034","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825034","url":null,"abstract":"The deployment of cloud computing environments is increasingly common, and we are implicitly reliant on them for many services. However, their dependence on virtualised computer and network infrastructures introduces risks related to system resilience. In particular, the virtualised nature of the cloud has not yet been thoroughly studied with respect to security issues including vulnerabilities and appropriate anomaly detection. This paper proposes an approach for the investigation and analysis of malware in virtualised environments. We carry out an analysis, on a system and network-wide scale, and further pinpoint some system and network features specifically by studying the example of the Kelihos malware.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122386494","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":"Hiding behind the clouds: Efficient, privacy-preserving queries via cloud proxies","authors":"Surabhi Gaur, M. Moh, M. Balakrishnan","doi":"10.1109/GLOCOMW.2013.6825035","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825035","url":null,"abstract":"This paper proposes PriView, a privacy-preserving technique for querying third-party services from mobile devices. Classical private information retrieval (PIR) schemes are difficult to deploy and use, since they require the target service to be replicated and modified. To avoid this problem, PriView utilizes a novel, proxy-mediated form of PIR, in which the client device fetches XORs of dummy query responses from each of two proxies and combines them to produce the required result. Unlike conventional PIR, PriView does not require the third-party service to be replicated or modified in any way. We evaluated a PriView implementation for the Google Static Maps service utilizing an Android OS front-end and Amazon EC2 proxies. PriView is able to provide tunable confidentiality with low overhead, allowing bandwidth usage, power consumption, and end-to-end latency to scale sublinearly with the provided degree of confidentiality.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132138902","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":"Adaptive packet transmission scheme to improve video streaming for multi-homed devices","authors":"Dongchil Kim, K. Chung","doi":"10.1109/GLOCOMW.2013.6825041","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825041","url":null,"abstract":"Because of the explosive development of different wireless technologies, mobile users can now access multiple wireless networks simultaneously. In this environment, a multiple path scheduling algorithm can improve the performance of the wireless networks and ensure high quality of video streaming for mobile users. This may not be the case, however, for TCP flows. One key reason is the occurrence of out-of-order packets resulting from different delays in alternative paths. Another is packet loss stemming from the unstable channel status of wireless networks. To better exploit multiple path scheduling for TCP flows, this paper proposes a new scheduling algorithm called Adaptive Packet Transmission Scheme (APTS) for multi-homed devices. Our scheme accurately estimates the available bandwidth of wireless networks using a TCP-Friendly Rate Control for Wireless Networks (TFRC-WN) scheme. APTS also distributes TCP packets to the multiple paths simultaneously according to the estimated available bandwidth. Our scheme effectively reduces the number of out-of-order packets by predicting the receiving sequences. Through simulation results, we prove that our scheme improves the performance of TCP and the video quality of mobile users.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130996728","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":"Secret key generation from reciprocal spatially correlated MIMO channels","authors":"Eduard Axel Jorswieck, A. Wolf, S. Engelmann","doi":"10.1109/GLOCOMW.2013.6825164","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825164","url":null,"abstract":"Secret key generation from reciprocal multi-antenna channels is an interesting alternative to cryptographic key management in wireless systems without infrastructure access. In this work, we study the secret key rate for the basic source model with a MIMO channel. First, we derive an expression for the secret key rate under spatial correlation modelled by the Kronecker model and with spatial precoding at both communication nodes. Next, we analyze the result for uncorrelated antennas to understand the optimal precoding for this special case, which is equal power allocation. Then, the impact of correlation is characterized using Majorization theory. Surprisingly for small SNR, spatial correlation increases the secret key rate. For high SNR, the maximum secret key rate is achieved for uncorrelated antennas. The results indicate that a solid system design for reciprocal MIMO key generation is required to establish the secret key rate gains.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126853886","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":"Radio resource allocation for multicast transmissions over High Altitude Platforms","authors":"Ahmed Ibrahim, A. Alfa","doi":"10.1109/GLOCOMW.2013.6825000","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825000","url":null,"abstract":"In this paper, we study radio resource allocation (RRA) for multicasting in OFDMA based High Altitude Platforms (HAPs). We formulate an optimization problem for a scenario in which different sessions are multicasted to user terminals (UTs) across HAP service area. We then solve it to find the best allocation of HAP resources such as radio power, sub-channels, and time slots. The objective is to maximize the number of UTs that receive the requested multicast streams in the HAP service area in a given OFDMA frame. The optimization problem comes out to be a Mixed Integer Non-Linear Program (MINLP). Due to the high complexity of the problem and lack of special structures, we believe that breaking it into two easier subproblems and iterating between them to achieve convergence can lead to an acceptable solution. Subproblem 1 turns out to be a Binary Integer Linear Program (BILP) of no explicitly noticeable structure and therefore Lagrangian relaxation is used to dualize some constraints to get a BILP with some special structure that is easy to solve. The subgradient method is used to solve for the dual variables in the dual problem for three proposed methods to get the tightest bound in each. The obtained bounds can be used in a branch and bound (BnB) algorithm as its bounding subroutine at each node. Subproblem 2 turns out to be a simple linear program (LP) for which the simplex algorithm can be used to solve the subproblem to optimality. This paper focuses on subproblem 1 and its proposed solution techniques. In the results section of this paper, we compare the solution goodness for each method versus the well known bounding technique used in BnB which is linear program (LP) relaxation.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126928143","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":"Incentive-oriented downlink scheduling for wireless networks with real-time and non-real-time flows","authors":"I.-Hong Hou, Jing Zhu, R. Vannithamby","doi":"10.1109/GLOCOMW.2013.6824995","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6824995","url":null,"abstract":"We study the problem of designing downlink scheduling policy for wireless networks with both real-time and non-real-time flows. Most existing scheduling policies for these networks unfairly favor one type of flows. As a result, strategic clients may lie about their types of traffic in order to get more service from the base station. To counter these strategic behaviors, a scheduling policy should be incentive compatible in the sense that clients cannot improve their performance by lying. We propose a novel scheduling policy that is incentive compatible. The policy can be easily implemented as a thin layer between the Network layer and the MAC layer. It can also work with a wide range of upper-layer and lower-layer protocols while providing satisfactory performance to both real-time and non-real-time flows. Simulation results show that this policy outperforms other widely used policies by large margins under a variety of scenarios.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123192180","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":"Resource allocation algorithm for cognitive radio network with heterogeneous user traffic","authors":"Alia Asheralieva, K. Mahata","doi":"10.1109/GLOCOMW.2013.6855682","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6855682","url":null,"abstract":"In this paper we present a novel approach for resource allocation in cognitive radio network (CRN) with heterogeneous user traffic. In this approach we deploy some form of reinforcement learning, and make a short-term resource allocation based on the long-term traffic prediction. The corresponding resource allocation algorithm derived in the paper is implemented in cognitive 3rd Generation Partnership Project Long Term Evolution (3GPP LTE) network. Performance analysis of the algorithm has shown that the proposed approach for resource allocation achieves better performance than other schemes designed to deal with the problem of heterogeneous user applications.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123413293","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":"Distributed resource allocation for self-organizing small cell networks: An evolutionary game approach","authors":"Prabodini Semasinghe, K. Zhu, E. Hossain","doi":"10.1109/GLOCOMW.2013.6825070","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825070","url":null,"abstract":"Future wireless networks are expected to be highly heterogeneous with the co-existence of macrocells and a large number of small cells. In this case, centralized control and manual intervention will be highly inefficient. Therefore, self organization and distributed resource allocation are of paramount importance for the successful deployment of small cell networks. In this work, we propose an evolutionary game theory (EGT)-based distributed resource allocation scheme for small cell networks. EGT is a suitable tool to address the self organized small cell resource allocation problem since it allows the players with bounded rationality to make individual decisions and learn from the environment for attaining the equilibrium with the minimum information exchange. Also, fairness can be provided. Specifically, we show how EGT can be used for subcarrier and power allocation of small cell networks. Replicator dynamics is used to model the strategy adaptation process of the small cell base stations and the evolutionary equilibrium is obtained as the solution. Numerical results show the effectiveness of the proposed scheme.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126546623","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}