2013 IEEE Globecom Workshops (GC Wkshps)最新文献_第3页

Fuzzy Q-Learning for Mobility Robustness Optimization in wireless networks 基于模糊q学习的无线网络移动鲁棒性优化

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6824965

A. Klein, Nandish P. Kuruvatti, Jörg Schneider, H. Schotten

{"title":"Fuzzy Q-Learning for Mobility Robustness Optimization in wireless networks","authors":"A. Klein, Nandish P. Kuruvatti, Jörg Schneider, H. Schotten","doi":"10.1109/GLOCOMW.2013.6824965","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6824965","url":null,"abstract":"The high popularity of smartphones and mobile PCs is expected to increase wireless data traffic in the order of 1000 times by 2020 [1]. However, the current situation of Mobile Network Operator (MNO)s is characterized by increasing margin pressure due to declining revenues and an increasing cost base. Self-optimization functionalities, e.g. for Mobility Robustness Optimization (MRO), are essential means for reducing Operational Expenditure (OPEX). In particular, mobile user groups or moving networks at high speeds impose challenges and may severely degrade network performance as well as user experience. The Fuzzy Q-Learning-based approach presented in this paper aims at providing a generic basis for enabling self-optimizing and self-healing network operations. The designed concept consists of the following key components: Fuzzy Inference System (FIS), heuristic Exploration/Exploitation Policy (EEP), and Q-Learning (QL). Its performance in a reference scenario is compared with a trend-based handover (HO) optimization scheme presented in [2] and a scheme that assigns time-to-trigger (TTT) values based on velocity estimates.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"116 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":"129410581","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}

引用次数: 19

A novel theoretical throughput estimation method for IEEE 802.11 WLANs 一种新的IEEE 802.11无线局域网理论吞吐量估计方法

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6855749

Junsu Choi, Hyoungjoo Lee, Sunghyun Choi, K. Lee

引用次数: 2

Enabling high data rate VLC via MIMO-LEDs PPM 通过MIMO-LEDs PPM实现高数据速率VLC

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825132

M. Biagi, A. Vegni

引用次数: 21

Quality of service aware virtual network mapping across multiple domains 跨多个域的服务质量感知虚拟网络映射

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825033

Hao Di, V. Anand, Hong-Fang Yu, Le Min Li, D. Liao, Gang Sun

{"title":"Quality of service aware virtual network mapping across multiple domains","authors":"Hao Di, V. Anand, Hong-Fang Yu, Le Min Li, D. Liao, Gang Sun","doi":"10.1109/GLOCOMW.2013.6825033","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825033","url":null,"abstract":"Network virtualization allows the coexistence of multiple virtual networks on a shared substrate network. A virtual network created by a service provider (SP) typically spans across multiple domains that may be managed by different infrastructure providers (InPs). The topology and resource information on each domain is confidential and kept private by the InP. However, a domain-level view is required to achieve quality of service (QoS)-aware VN mapping across multiple domains. In this paper, we present a framework for the QoS-aware VN mapping across multiple domains. In the framework, the VN mapping is accomplished by the mapping manager that is the broker between the SPs and the InPs. The mapping manager collects the mapping candidates for the VN request from the InPs, and then establishes the abstracted domain-level graph. Finally the candidates are selected on the domain-level graph with QoS consideration. We formulate the problem of candidate selection as an integer linear programming (ILP) and also present a heuristic algorithm to solve it. The simulation results show that our proposed framework can achieve low resource allocation cost and good QoS performance for the VN request.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"48 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":"130410666","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}

引用次数: 4

A geometrical probability-based approach towards the analysis of uplink inter-cell interference 基于几何概率的上行小区间干扰分析方法

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6855735

Maryam Ahmadi, Minming Ni, Jianping Pan

引用次数: 8

Multi-beam transmission diversity with hybrid beamforming for MIMO-OFDM systems MIMO-OFDM系统中混合波束形成的多波束传输分集

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6824962

Chanhong Kim, Taeyoung Kim, J. Seol

引用次数: 113

Energy Aware Evolutionary routing protocol with probabilistic sensing model and wake-up scheduling 基于概率感知模型和唤醒调度的进化路由协议

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825099

Enan A. Khalil, S. Özdemir

{"title":"Energy Aware Evolutionary routing protocol with probabilistic sensing model and wake-up scheduling","authors":"Enan A. Khalil, S. Özdemir","doi":"10.1109/GLOCOMW.2013.6825099","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825099","url":null,"abstract":"Wireless Sensor Networks (WSNs) have become increasingly popular in recent years for controlling systems where human intervention is undesirable or impossible. The main challenges in designing and planning the operations WSNs are to optimize the energy consumption of sensor nodes and prolong the network lifetime. Hierarchical routing protocols are proven to be efficient to drastically reduce the energy consumption and prolong the lifespan of the network. For example, Energy-Aware Evolutionary Routing Protocol (EAERP) is an Evolutionary Algorithm (EA) based routing protocol that aims to achieve a better compromise between the stability time and network lifetime. This paper reformulates the design of EAERP according to the sensing model. Specifically, disc (isotropic) and probabilistic sensing model are considered. Moreover, for further extension of network lifetime a novel wake-up scheduling scheme applied to alternate between idle and active state of sensor nodes. As sensors become unable to cover targets due to consuming their energies another sensors will wake up and enroll in sensing duty. Extensive simulations are performed for each of sensing models and results show that the proposed protocol improves the energy efficiency and network lifetime.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"22 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":"114707005","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}

引用次数: 4

Performance evaluation of cooperative relay and Particle Swarm Optimization path planning for UAV and wireless sensor network 无人机与无线传感器网络协同中继性能评价与粒子群优化路径规划

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825191

Dac-Tu Ho, E. Grøtli, P. Sujit, T. Johansen, J. Sousa

{"title":"Performance evaluation of cooperative relay and Particle Swarm Optimization path planning for UAV and wireless sensor network","authors":"Dac-Tu Ho, E. Grøtli, P. Sujit, T. Johansen, J. Sousa","doi":"10.1109/GLOCOMW.2013.6825191","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825191","url":null,"abstract":"Energy efficiency is crucial when wireless nodes are deployed in a remote or isolated area. This paper provides an optimal solution for data gathering from a wide area Wireless Sensor Network (WSN) with the use of Unmanned Aerial Vehicles (UAVs). Particle Swarm Optimization (PSO) is proposed as an optimization method to find the waypoints for a UAV in order to reduce the energy consumption and bit error rate (BER) of the sensor nodes, and the UAV travel time. In our previous work, the sensor nodes were required to transmit data to a Cluster Head (CH) node, which then forwarded the data to the UAV. The waypoints were restricted to be straight above the CH. In this work we employ cooperative relay, to make the data gathering more efficient. In addition, the waypoints of the UAV can be selected freely. To illustrate the effectiveness, we compare our new strategy to the one of our previous paper. Numerical results illustrate that the performance gap between them increases with the number of waypoints, in favor of the new strategy. Furthermore, the optimal number of waypoints for the UAV is also described, based on the size of the sensor network area and the density of the sensor node distribution. These contributions have maximized the network lifetime and communication quality, while minimized the UAV's flying time.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"56 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":"124330560","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}

引用次数: 45

Secured data storage on cloud systems via wavefront multiplexing 通过波前多路复用保护云系统上的数据存储

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825036

D. Chang, Joe Lee, H. Yeh, Frank Lu, Steve K. Chen, K. Yao

{"title":"Secured data storage on cloud systems via wavefront multiplexing","authors":"D. Chang, Joe Lee, H. Yeh, Frank Lu, Steve K. Chen, K. Yao","doi":"10.1109/GLOCOMW.2013.6825036","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825036","url":null,"abstract":"Security on data storage and transport are among many important concerns on cloud computing. Wavefront multiplexing/demultiplexing process (WF muxing/demuxing) embodying an architecture that utilizes multi-dimensional transmissions is the use of an algorithm for satellite and deep-space communications where transmissions demand a high degree of power combining, security, reliability, and optimization. It has found applications in fields beyond communications domain. One such application is data storage and transport on cloud. Multiple data sets are preprocessed by a WF muxing transformation before being stored /transported. WF muxed data is aggregated data from multiple data sets that have been “customized processed” and disassembled into any scalable number of sets of processed data, with each set being stored on a storage site. The original data is reassembled via a WF demuxing transformation after retrieving a lesser but scalable number of WF muxed data sets. In short, the WF muxed data storage solution enhances data security and data redundancy by, respectively, creating a new dimension to existing security/privacy methods and significantly reducing the storage space needed for data redundancy. In addition, WF muxing/demuxing methods enable a monitoring capability on the integrity of stored data. It becomes possible to identify independently whether the stored data is not contaminated or altered without scrutinizing through the data sets themselves.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"17 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":"126416916","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}

引用次数: 0

Fast bandwidth allocation policies for persistent data ferrying 用于持久数据传输的快速带宽分配策略

2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825183

Anthony Carfang, E. Frew

引用次数: 7