2012 IEEE Globecom Workshops最新文献

{"title":"OpenADN: Mobile apps on global clouds using OpenFlow and Software Defined Networking","authors":"S. Paul, R. Jain","doi":"10.1109/GLOCOMW.2012.6477663","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477663","url":null,"abstract":"In recent years, there has been an explosive growth in mobile applications (apps), most of which need to serve global audiences. This increasing trend of service access from mobile computing devices necessitates more dynamic application deployment strategies based on the user context (user device type, mobility, link conditions, location, energy constraints, etc.) and the variations in the user access demographics. Cloud computing provides unique new opportunities for application service providers (ASPs) to implement such deployment strategies by making it possible to dynamically allocate geographically distributed computing resources to the application. However, managing such a dynamic and distributed Internet-scale application deployment environment is hard; requiring ASPs to be able to intelligently route application traffic based on high-level application deployment policies over a dynamically changing deployment environment. To this end, we propose the design of an open and standard data plane abstraction called Open Application Delivery Networking (OpenADN) that will allow ASPs to express and enforce application traffic management policies and application delivery constraints at the required level of granularity. The key motivation to designing the OpenADN abstraction is to be able to extract and standardize a set of common application delivery requirements across a wide class of applications deployed over the Internet. OpenADN is designed within the Software Defined Networking (SDN) framework allowing each ASP to implement a separate control plane application to manage the data plane entities over OpenADN to suit the specific requirements of the application. The data plane entities may belong to the ASP itself or may be delegated to third party providers such as Internet Service Providers (ISPs) or Cloud Service Providers (CSPs). We also make a case for augmenting the flow abstraction layer of SDN (OpenFlow) to add adequate support for OpenADN. OpenADN uses IP for forwarding packets to endpoint locators, making it easy to deploy over the current Internet with only a few OpenADN aware entities.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"89 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":"131825345","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":"Exploiting the GOOSE protocol: A practical attack on cyber-infrastructure","authors":"Juan Hoyos, Mark Dehus, T. Brown","doi":"10.1109/GLOCOMW.2012.6477809","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477809","url":null,"abstract":"Security issues for the power industry have become increasingly relevant during the past decade as the industry has relied more and more on communication protocols. The Generic Object Oriented Substation Events (GOOSE) protocol is defined in IEC 61850 for the purpose of distributing event data across entire substation networks. In this paper we demonstrate a practical attack by exploiting weaknesses in GOOSE. We also show that this attack can have devastating consequences on the reliability of the grid and is capable of creating a widespread interruption in power generation and distribution.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"60 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":"131077199","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":"Opportunistic service promotion for end-to-end delay minimization in IEEE 802.11p vehicular networks","authors":"M. A. Salahuddin, Ala Al-Fuqaha","doi":"10.1109/GLOCOMW.2012.6477566","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477566","url":null,"abstract":"IEEE 802.11p Wireless Access for Vehicular Environments (WAVE) is the envisioned communication protocol for Vehicular Ad-hoc Networks (VANETs) and Intelligent Transportation Systems (ITS) applications. WAVE offers service differentiation by prioritizing packets based on an application's QoS requirements. This is accomplished by a multi-channel approach where a channel consists of multiple priority queues. Currently, WAVE uses static packet priorities without accounting for network load. In this paper, we propose a novel opportunistic service promotion technique for IEEE 802.11p (WAVE) to dynamically route lower priority packets through higher priority queues while meeting the required QoS w.r.t delay for all queues and underlying network link layer bounds. This will increase the QoS w.r.t end-to-end delay of all ITS applications. To show correctness and feasibility, our methodology entails formulating the opportunistic service promotion technique as an Integer Linear Programming (ILP) problem. We solve it to guarantee minimum overall end-to-end delay. We show significant improvement averaging at 30% decrease in the end-to-end delay over classical WAVE implementations.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"4 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":"132937968","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 study on the impact of packet loss and latency on real-time demand response in smart grid","authors":"M. Pruckner, Abdalkarim Awad, R. German","doi":"10.1109/GLOCOMW.2012.6477805","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477805","url":null,"abstract":"Communication will play a significant role in the evolving smart grid which will allow services such as self-healing, real-time demand response and efficient use of energy. Due to the large number, distributed and more importantly intermittent nature of energy resources (e.g. wind and solar plants), smart grid will rely heavily on communication for super-fast balance between electricity supply and demand. A quick and accurate match between electricity supply and demand has financial and technical benefits. It helps avoid running extra costly plants (e.g, gas turbines) on peak hours and it enhances power grid stability. In this paper we study the influence of some inherent properties of data communication networks (e.g. packet loss and latency) on the performance of the balance between electricity supply and demand. Moreover, we believe that, in the context of smart grid, data communication, and power components must be studied in a common environment. Therefore, we present simulation models for different power plants as well as a simulation model for demand and then, these models are equipped with computing and communication capability. These components represent the first step towards setting up a simulation framework that is able to test new smart grid applications. To demonstrate a realistic mechanism to match supply with demand, a merit order is followed. The preliminarily simulation results show that packet loss and latency have influence on the performance of real-time balance between electricity supply and demand.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"8 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":"128873737","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":"Support Vector Machine based fault detection & classification in smart grids","authors":"N. Shahid, S. Aleem, I. Naqvi, N. Zaffar","doi":"10.1109/GLOCOMW.2012.6477812","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477812","url":null,"abstract":"Smart Grids have recently attracted the attention of many profound research groups with their ability to create an automated and distributed energy level delivery. Computational Intelligence (CI) has been incorporated into various aspects of the smart grids, including fault detection and classification, which is a key issue in all the power systems. This paper presents two novel techniques for fault detection and classification in power Transmission Lines (TL). The proposed approaches are based on One-Class Quarter-Sphere Support Vector Machine (QSSVM). The first technique, Temporal-attribute QSSVM (TA-QSSVM), exploits the temporal and attribute correlations of the data measured in a TL for fault detection during the transient stage. The second technique is based on a novel One-Class SVM formulation, named as Attribute-QSSVM (A-QSSVM), that exploits attribute correlations only for automatic fault classification. The results indicate a detection and classification accuracy as high as 99%. Significant reduction (from O(n4) to O(n2)) in computational complexity is achieved as compared to the state-of-the-art techniques, which use Multi-Class SVM for fault classification. Moreover, unlike state-of-the-art techniques, both of these techniques are unsupervised and online and can be implemented on the existing monitoring infrastructure for online monitoring, fault detection and classification in power sytems.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"115 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":"134634826","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":"The self-growing concept as a design principle of cognitive self-organization","authors":"M. Emmelmann, B. Bochow, A. Makris, A. Kaloxylos, G. Koudouridis","doi":"10.1109/GLOCOMW.2012.6477695","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477695","url":null,"abstract":"In next generation systems and networks self-organization in networks of collaborating networks is expected to relax some of the intricacies of managing complex cooperative communication systems. In particular, in the presence of distributed cognitive decision-making, increasing complexity may increase potential interference between collaborating networks hence leading to performance, robustness and dependability issues. This paper focuses on a specific form of self-organization denoted here as self-growing, which is believed to provide a foundation for flexible, open and trustworthy networks, relax some of the scalability issues of collaborating cognitive networks, as well as to enable self-organization for resource constrained systems.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"147 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":"133788649","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":"Improving security level of LTE authentication and key agreement procedure","authors":"Fang-Yie Leu, I. You, Yi-Li Huang, Kangbin Yim, Cheng-Ru Dai","doi":"10.1109/GLOCOMW.2012.6477719","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477719","url":null,"abstract":"In recent years, LTE (Long Term Evolution) has been one of the mainstreams of current wireless communication systems. But when its HSS authenticates UEs, the random number RAND generated by HSS for creating other keys during its delivery from HSS to UE is unencrypted. Also, many parameters are generated by invoking a function with only one input key, thus very easily to be cracked. So in this paper, we propose an improved approach in which the Diffie-Hellman algorithm is employed to solve the exposure problem of RAND in the authentication process, and an Pair key mechanism is deployed when creating other parameters, i.e., parameters are generated by invoking a function with at least two input keys. The purpose is increasing the security levels of all generated parameters so as to make LTE more secure than before.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"43 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":"124192803","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 approach to beamformer design for massive MIMO systems based on k-Regularity","authors":"Gilwon Lee, Juho Park, Y. Sung, Junyeong Seo","doi":"10.1109/GLOCOMW.2012.6477657","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477657","url":null,"abstract":"In this paper, a new beamformer design paradigm, named k-regular beamformer, is proposed for massive multiple-input multiple-output (MIMO) transmission systems to achieve most of the gain inherent to a large antenna array without too much complexity. In the proposed k-regular beamforming scheme, each of multiple data streams for MIMO transmission is multiplied by k complex gains and assigned to k out of available NT transmit antennas, and signals assigned to the same transmit antenna are added and transmitted through the assigned antenna. The proposed k-regular beamformer can implement antenna selection (corresponding to k=1) to optimal eigen-beamforming (corresponding to k=NT) by controlling the parameter k, and thus enables arbitrary trade-off between complexity and performance. Two beamformer design algorithms, the maximum correlation method (MCM) and the projected iterative shrinkage-thresholding algorithm (PISTA), are proposed to design k-regular beamforming matrices. Numerical results show that the proposed k-regular beamformer even with small k significantly improves the rate gain over simple antenna selection and achieves most of the optimal eigen-beamforming performance with far less complexity than that required for optimal eigen-beamforming for massive MIMO transmission.","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":"123670002","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":"Inter-MAC green path selection for heterogeneous networks","authors":"O. Bouchet, A. Kortebi, M. Boucher","doi":"10.1109/GLOCOMW.2012.6477621","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477621","url":null,"abstract":"Gigabit home networks represent a key technology to make the Future Internet success a reality. Consumers will require networks to be simple to install, without the need of any new wire and with green consideration. To make this network ubiquitous, seamless and robust, a technology independent MAC layer will ensure its global control and provide connectivities to any number of devices the user wishes to connect to it in any room. In order to make this vision comes true, substantial progress is required in the fields of protocol design and in systems architectures. For this goal, we introduce a new convergence layer denoted inter-MAC, which provides a common infrastructure to the home network. Among the inter-MAC functionalities, we focused our interest on the path selection mechanism including the green aspect. To improve quality of service, reduce energy consumption and radiofrequency devices number, we define a new path selection protocol based on several metrics. We present some preliminary results obtained on an experimental testbed.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"51 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":"124030563","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":"Intra-frequency handover algorithm design in LTE networks using Doppler frequency estimation","authors":"Omar Altrad, S. Muhaidat","doi":"10.1109/GLOCOMW.2012.6477745","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2012.6477745","url":null,"abstract":"A dynamic method to trigger the handover algorithm in LTE networks is proposed. The method utilizes Doppler frequency estimation in the downlink for adjustment. This method is beneficial for high speed mobiles in micro cells, where the cell radius is small and needs a dynamic algorithm to respond in a timely manner. Comparison to the practical handover triggering method, which is currently implemented in LTE is evaluated1. Simulations at the system level show a marked decrease in the average number of handovers.","PeriodicalId":290330,"journal":{"name":"2012 IEEE Globecom Workshops","volume":"27 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":"124072368","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}