M. Loukil, Mariem Zekri, Takoua Ghariani, B. Jouaber
{"title":"A Reputation based Vertical Handover Decision making Framework (R-VHDF)","authors":"M. Loukil, Mariem Zekri, Takoua Ghariani, B. Jouaber","doi":"10.1109/GLOCOMW.2012.6477617","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477617","url":null,"abstract":"Mobility management over heterogeneous wireless networks is becoming a major interest area as new technologies and services continue to proliferate the wireless networking market. Context awareness can play a major role to improve mobile networking systems and to ensure seamless mobility. In this paper, we focus on Vertical Handover (VHO) decision optimization within heterogeneous wireless environments, where users may connect to different wireless access networks simultaneously (e.g. 2.5G, 3G, WiFi, WiMax). We propose a Reputation based Vertical Handover Decision making Framework (R-VHDF) where the decision is not only based on the Received Signal Strength (RSS), as in most horizontal handover processes, but also on context information about QoS and radio conditions, as well as on networks and previous user's experiences (QoE or Reputation). The solution is based on a flexible and evolutionary distributed context management architecture that handles dynamic and static context information and allows mobile devices to be always connected to the most suitable access network by making VHO decisions based on networks' Reputations. The proposed framework encompasses auto-programmable platforms and distributed context management components within middleware servers and mobile devices. It is validated thought a prototype implementation and performance results are presented and discussed.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133868096","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 new opportunistic interference alignment scheme and performance comparison of MIMO interference alignment with limited feedback","authors":"J. Leithon, C. Yuen, H. Suraweera, Hui Gao","doi":"10.1109/GLOCOMW.2012.6477736","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477736","url":null,"abstract":"We investigate the performance of several interference alignment (IA) schemes for a three-user MIMO channel with limited feedback. In our study, we consider traditional IA with quantized channel state information at each transmitter, and opportunistic IA (OIA) that exploits the idea of opportunistic selection to select users whose interfering channels are most aligned. The performance of the former is determined by the quantization resolution, whereas the performance of the later depends on the number of users available for selection. We show that OIA only requires a small number of users to achieve a comparable performance to traditional IA schemes with quantized feedback. Motivated by this fact, we propose a new user selection criterion that outperforms the existing state of the art. Simulations show the superior performance of our OIA scheme under different strong/mild interference conditions.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130379911","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":"Column generation approach for one-shot virtual network embedding","authors":"A. Jarray, A. Karmouch","doi":"10.1109/GLOCOMW.2012.6477689","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477689","url":null,"abstract":"Network Virtualization has been proposed as new promising resource management approach that allows multiple customized Virtual Networks (VNs) to be setup on a shared physical infrastructure. In this paper, our focus is on the embedding problem which consists on the mapping of VN resources onto physical infrastructure network. Since this problem is known to be NP-hard, in literature, number of works have been proposed heuristic based-embedding approaches. The mapping of VN links and nodes are performed on two separate stages, which may ensue in a high blocking of VN requests and an under-utilization of substrate resources. To handle these drawbacks, we propose a mathematical model which makes use of large scale optimization tools and propose a Column Generation formulation coupled with a Branch and Bound technique in order to solve it efficiently.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"336 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124307117","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":"Routing and resource allocation with collision constraint in multi-hop cognitive radio networks","authors":"L. Lai, Jian Wang, Aiping Huang, Hangguan Shan","doi":"10.1109/GLOCOMW.2012.6477709","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477709","url":null,"abstract":"In this paper, we study the routing and resource allocation problem in multi-hop cognitive radio networks. The collision between primary users (PUs) and secondary users (SUs) is taken into consideration, which is unavoidable if activities of PUs and SUs are not synchronized with each other. Our objective is to maximize the average throughput of a secondary traffic flow while the number of collisions is restricted to be less than a predefined threshold. Aiming at this, a proper routing path is selected according to its longtime achievable throughput performance, and then radio resource on the selected path is allocated to get a high throughput. A routing path selection algorithm is proposed which expands the paths hop by hop and discards unnecessary paths. The resource allocation problem is formulated to an optimization problem with aforementioned objective and restriction. A low-complexity heuristic algorithm is proposed to solve the problem. Simulation results show that the proposed method is effective and can achieve the performance similar to the optimal solution.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115721073","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":"Internet traffic classification based on bag-of-words model","authors":"Yin Zhang, Yi Zhou, Kai Chen","doi":"10.1109/GLOCOMW.2012.6477666","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477666","url":null,"abstract":"Interest in traffic classification has dramatically grown in the past few years in both industry and academia. As more and more applications are encrypting the payloads and not to use well-known ports, traditional traffic classification methods such as transport-layer protocol ports based ones can not accurately and efficiently deal with these applications. In this paper we investigate the problem of classifing traffic flows into different application categories. And a new bag-of-words (BoW) model based traffic classification method is proposed, which has been widely used in document classification and computer vision. In the new traffic classification method the application categories of interests represents the bags, centroids represent the words of the BoW model, respectively. By constructing representation vectors for the application categories and calculating the cosine similarity between each category representation vector and newly built-up vector converted from flows to be tested, we can find the application category that a tested flow belongs to. Using real traffic traces we demonstrate that the proposed approach is able to achieve 93% overall accuracy and the classification is not affected by the packet arrival sequences (e.g. out of order arrivals). The overall accuracy of the proposed approach is observed to be higher than the widely used C4.5 algorithm by 10% in our experiment when the out of order arrival happens.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124636894","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":"On space-time block codes for two-user MIMO interference channels","authors":"Long Shi, Wei Zhang, X. Xia","doi":"10.1109/GLOCOMW.2012.6477547","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477547","url":null,"abstract":"In this paper, a design criterion for space-time block codes (STBC) is proposed for two-user MIMO interference channels when a group zero-forcing (ZF) algorithm is applied at each receiver to eliminate the inter-user interference. Based on the design criterion, a design of STBC for two-user interference channels is proposed that can achieve full diversity for each user with the group ZF receiver. The code rate approaches one when the time delay in the encoding (or code block size) gets large. Performance results demonstrate that the full diversity is guaranteed by our proposed STBC with the group ZF receiver.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124887362","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}
Amer M. Magableh, R. Radaydeh, Mohamed-Slim Alouini
{"title":"Shared access protocol (SAP) in femtocell channel resources for cellular coverage enhancement","authors":"Amer M. Magableh, R. Radaydeh, Mohamed-Slim Alouini","doi":"10.1109/GLOCOMW.2012.6477636","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477636","url":null,"abstract":"Femtocells are promising techniques employed in cellular systems to enhance the indoor coverage, especially in areas with high density and high traffic rates. In this paper, we propose an efficient resource utilization protocol, named shared access protocol (SAP), that enables the unlicensed macro-cell user equipments (MC-UE) to communicate with partially closed access femtocell base stations and hence, improves and enhances the overall system performance in closed environments. For the proposed system model, we obtain, in closed-form, the main signal-to-interference plus noise ratio (SINR) characteristics, including the probability density function (PDF) and the cumulative distribution function (CDF). In addition, these expressions are further used to derive several performance metrics in closed-form, such as, the average bit error rate (BER), outage probability, and the average channel capacity for the proposed SAP herein. Furthermore, Monte-carlo simulations as well as numerical results are provided showing a good match that ensures and confirms the correctness of the derived expressions.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"518 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459136","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 new algorithm of virtual network embedding based on minimum node stress and adjacent principle","authors":"Hongyan Cui, Fangjie Kong, Yun-jie Liu","doi":"10.1109/GLOCOMW.2012.6477676","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477676","url":null,"abstract":"As the main approach of solving the ossification of current internet, network virtualization has been the focus of international future network research. The core problem of the area is virtual network embedding, which is centering on how to efficiently map the virtual requests to the substrate network. In order to reduce the computational complexity, previous researches mainly devise heuristic algorithm and divide the whole process into node mapping and link mapping. But most of them consider separately node mapping and link mapping, which may lead to poor performance of the whole algorithm because of the unreasonable node mapping. In this paper, a new algorithm is proposed based on the minimum node stress and adjacent principle. During the period of node mapping, the node stress is kept balanced. Meanwhile, using the adjacent principle, the link stress can be reduced to a low level. Thus, the possibility of bottleneck node is reduced and the resource of substrate network can be efficiently used. The simulation demonstrates that the new algorithm reduces the maximum node stress and link stress of the substrate network, and makes it load balance.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134313928","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":"Receiver design for shot noise limited MIMO FSO/UV communication systems","authors":"Ankit Gupta, M. Brandt-Pearce","doi":"10.1109/GLOCOMW.2012.6477747","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477747","url":null,"abstract":"In this paper we develop receiver design techniques for shot noise limited multiple-input multiple-output (MIMO) systems, specifically 2×2 MIMO non-line-of-sight (NLOS) free space optical (FSO) or ultraviolet (UV) communication systems, to illustrate the spatial multiplexing advantage of using a MIMO technique. The receivers considered are the zero forcing receiver, the minimum mean square error (MMSE) receiver, the maximum likelihood receiver (ML) for nondispersive channels, and the maximum-likelihood sequence estimation (MLSE) receiver and the maximum-a-posteriori (MAP) one shot receiver for dispersive channels. Performance expressions are derived for a 2×2 MIMO UV NLOS systems. The results indicate that the throughput can be significantly increased using a multibeam approach.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133731946","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":"Link sleeping optimization for green virtual network infrastructures","authors":"Ebrahim Ghazisaeedi, Ning Wang, R. Tafazolli","doi":"10.1109/GLOCOMW.2012.6477685","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477685","url":null,"abstract":"Power consumption in Information and Communication Technology (ICT) is 10% of total energy consumed in industrial countries. According to the latest measurements, this amount is increasing rapidly in recent years. In the literature, a variety of new schemes have been proposed to save energy in operational communication networks. In this paper, we propose a novel optimization algorithm for network virtualization environment, by sleeping reconfiguration on the maximum number of physical links during off-peak hours, while still guaranteeing the connectivity and off-peak bandwidth availability for supporting parallel virtual networks over the top. Simulation results based on the GÉANT network topology show our novel algorithm is able to put notable number of physical links to sleep during off-peak hours while still satisfying the bandwidth demands requested by ongoing traffic sessions in the virtual networks.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131617507","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}