2013 IEEE Globecom Workshops (GC Wkshps)最新文献

筛选
英文 中文
QoS-oriented distributed opportunistic scheduling for wireless networks with hybrid links 具有混合链路的无线网络面向qos的分布式机会调度
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6855664
Wenguang Mao, Shanshan Wu, Xudong Wang
{"title":"QoS-oriented distributed opportunistic scheduling for wireless networks with hybrid links","authors":"Wenguang Mao, Shanshan Wu, Xudong Wang","doi":"10.1109/GLOCOMW.2013.6855664","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6855664","url":null,"abstract":"In this paper opportunistic scheduling is studied for a wireless network with hybrid links that have different characteristics and quality of service (QoS) requirements. More specifically, we consider two types of links coexisting in a network: 1) secure links for critical messages demanding physical layer security; 2) regular links for other messages. Since the transmission rate of a secure link is usually much lower than that of a regular link, fair sharing of the transmission opportunity between two types of links has some drawbacks: 1) if secure links generate more packets, the network throughput is low; 2) if regular links generate more packets, QoS of secure links may not be satisfied. To effectively schedule transmissions in a network with hybrid links, a QoS-oriented distributed opportunistic scheduling scheme is developed to maximize the overall system throughput under the constrains of QoS requirements of secure links. It is derived based on the optimal stopping theory. Performance results show that QoS of secure links can be gracefully guaranteed without necessarily compromising the overall throughput of hybrid links.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"33 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":"132813616","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}
引用次数: 3
Churn prediction in subscriber management for mobile and wireless communications services 移动和无线通信服务用户管理中的流失预测
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825120
Utku Yabas, H. Cankaya
{"title":"Churn prediction in subscriber management for mobile and wireless communications services","authors":"Utku Yabas, H. Cankaya","doi":"10.1109/GLOCOMW.2013.6825120","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825120","url":null,"abstract":"Subscriber churn is a concern of customer care management for most of the mobile and wireless service providers and operators due to its associated costs. This paper explains our work on subscriber churn analysis and prediction for such services. We work on data mining techniques to accurately and efficiently predict subscribers who will change-and-turn (churn) to another provider for the same or similar service. The dataset we use is a public and real dataset compiled by Orange Telecom for the KDD 2009 Competition. Number of teams achieved high scores on this dataset requiring a significant amount of computing resources. We are aiming to find alternative methods that can match or improve the recorded high scores with more efficient and practical use of resources. In this study, we focus on ensemble of meta-classifiers which have been studied individually and chosen according to their performances.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"89 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":"133537385","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}
引用次数: 11
Performance evaluation and comparison of RObust Header Compression (ROHC) ROHCv1 and ROHCv2 for multimedia delivery 鲁棒报头压缩(ROHC) ROHCv1和ROHCv2多媒体传输性能评价与比较
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825044
Mate Tomoskozi, P. Seeling, F. Fitzek
{"title":"Performance evaluation and comparison of RObust Header Compression (ROHC) ROHCv1 and ROHCv2 for multimedia delivery","authors":"Mate Tomoskozi, P. Seeling, F. Fitzek","doi":"10.1109/GLOCOMW.2013.6825044","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825044","url":null,"abstract":"In this paper the two implementations of RObust Header Compression (ROHC), namely ROHCv1 (RFC 3095) and ROHCv2 (RFC 5225), are evaluated in terms of potential throughput increase and complexity for wireless IP networks and compared with each other for different multimedia streams. In order to compress the header information to a minimum, RoHCv1 has been proposed some years back and recently RoHCv2 has been proposed with a complete redesign compared to its predecessor. The novelty of this paper is the presentation of the performance evaluation of ROHCv2 as well as a comparison between the two approaches that have never been published before. In addition, this paper presents real-world performance measurements of ROHCv2 for the first time. Our findings show that both versions have great potential in saving bandwidth for multimedia traffic in wireless networks, even with varying channel conditions by an IP/UDP/RTP header a compression gain of 83% and 86% is possible for ROHCv1 and ROHCv2, respectively. While the second version of ROHC is giving generally slightly better compression ratios than the first version, we found situations where the first version performs better.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"29 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":"134471204","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}
引用次数: 17
Software-defined networking in a multi-purpose DWDM-centric metro/aggregation network 以dwdm为中心的多用途城域/聚合网络中的软件定义网络
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825162
P. Ohlen, B. Skubic, Z. Ghebretensae, Wolfgang John, Meral Shirazipour
{"title":"Software-defined networking in a multi-purpose DWDM-centric metro/aggregation network","authors":"P. Ohlen, B. Skubic, Z. Ghebretensae, Wolfgang John, Meral Shirazipour","doi":"10.1109/GLOCOMW.2013.6825162","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825162","url":null,"abstract":"A DWDM-centric solution is a promising approach to build a multiservice metro/aggregation network that meets the future requirements on capacity, cost, and energy-efficiency for both residential, business and mobile backhaul/fronthaul transport. We propose to use SDN to provide a suitable control mechanism of the optical and packet layers in the network. We also introduce a discovery unit, which detects newly connected DWDM clients and sets up the corresponding optical service. This is demonstrated for the case of a converged fixed and mobile infrastructure. We then describe how this network and control architecture can be used to provide services to different client network applications, where the details of the physical infrastructure are hidden through network virtualization.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"106 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":"133035803","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}
引用次数: 11
A MIMO protocol for camera communications (CamCom) using undersampled frequency shift ON-OFF keying (UFSOOK) 一种使用欠采样频移开关键控(UFSOOK)的摄像机通信(CamCom) MIMO协议
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825131
R. Roberts
{"title":"A MIMO protocol for camera communications (CamCom) using undersampled frequency shift ON-OFF keying (UFSOOK)","authors":"R. Roberts","doi":"10.1109/GLOCOMW.2013.6825131","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825131","url":null,"abstract":"Camera communications is the use of an image sensor to receive LED modulated data. The undersampling properties of UFSOOK allows the encoding of bits at frequency shift ON-OFF keying frequencies that avoid flicker while at the same time being successfully decoded by a low frame rate camera. PWM dimming is supported via data modulation of the PWM frequency, but requires that FEC be added in the form of multi-phase sampling due to asynchronous clocking. Multiple LEDs can be modulated to send parallel data streams to the receiver enabling MIMO. This paper introduces a simple protocol that will allow the transmitter to inform the receiver how the MIMO data streams should be processed to realize the FEC and reconstruct the transmitted message.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"113 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":"124673433","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}
引用次数: 47
Authentication in GPS-directed mobile clouds gps定向移动云中的身份验证
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825032
Jonathan A. Larcom, Hong Liu
{"title":"Authentication in GPS-directed mobile clouds","authors":"Jonathan A. Larcom, Hong Liu","doi":"10.1109/GLOCOMW.2013.6825032","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825032","url":null,"abstract":"Mobile clouds fuse cloud computing and mobile computing with wireless networking in everyday life. Many applications of mobile clouds deploy GPS (Global Positioning System) to find locations and to synchronize clocks. Though security starts to draw scrutiny from academy, industry, and government, authentication in GPS-directed mobile clouds has not been brought to the table. Authentication of GPS acts as the first responder against security breaches. This paper, among the first, examines the vulnerabilities in GPS-directed mobile clouds. By systematic analysis, an attack model is devised to demonstrate the existing threats and to predict futuristic attack tactics. The paper proposes a novel defense approach, namely vertical-horizontal design of authentication. Vertical-horizontal design extends cross-layer design of cloud and device stacks (vertical) with interface design between sections of the system (horizontal). The solutions will be validated with event-driven simulation that complements incidental dangers and legal/regulation restrictions associated in experimenting with GPS-dependent systems.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"85 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":"125221866","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}
引用次数: 5
Interest-based cooperative caching in multi-hop wireless networks 多跳无线网络中基于兴趣的协同缓存
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825056
Javed Iqbal, P. Giaccone
{"title":"Interest-based cooperative caching in multi-hop wireless networks","authors":"Javed Iqbal, P. Giaccone","doi":"10.1109/GLOCOMW.2013.6825056","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825056","url":null,"abstract":"New communication protocols, as WiFi Direct, are now available to enable efficient Device-to-Device (D2D) communications in wireless networks based on portable devices. At the same time, new network paradigms, as Content-Centric-Networking (CCN), allow a communication focused on the content and not its location within the network, enabling a flexible location for the content, which can be cached in the nodes across the network. In such context, we consider a multi-hop wireless network adopting CCN-like cooperative caching, in which each user terminal acts also as a caching node. We propose an interest-based insertion policy for the caching, based on the concept of “social-distance” borrowed by online recommendation systems, to improve the performance of the overall network of caches; the main idea is to store only the contents which appear to be of interest for the local user. We show that our proposed scheme outperforms other well-known insertion policies, that are oblivious of such social-distance, in terms of cache hit probability and access delays.","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":"132035535","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}
引用次数: 25
Autonomous opportunistic spectrum access in distributed femtocell networks 分布式飞蜂窝网络中的自主机会频谱接入
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6855695
Ahmed K. F. Khattab, K. Elsayed
{"title":"Autonomous opportunistic spectrum access in distributed femtocell networks","authors":"Ahmed K. F. Khattab, K. Elsayed","doi":"10.1109/GLOCOMW.2013.6855695","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6855695","url":null,"abstract":"Femtocells randomly deployed in a given macrocell coverage area share the wireless spectrum available to the macrocell. The unplanned and ad hoc nature of the femtocell deployment in the macrocell environment renders centralized frequency planning inapplicable. Furthermore, the femtocells are unable to apriori know neither the channel assignment of their neighbours nor the impact of their transmissions on nearby macrocell users due to the lack of explicit coordination. In this paper, we present the distributed Autonomous Opportunistic Channel Access (AOCA) framework that allows the femtocells to share the available spectrum with the overlaying macrocell without any kind of coordination neither between the macrocell and femtocells nor amongst the femtocells. Furthermore, it provides statistical guarantees on the performance of the macrocell users. We formulate the AOCA constrained spectrum access problem as non-linear program to find its optimized parameters' settings. Simulation results show that AOCA achieves multiple folds improvement in the average femtocell network rate due to its probabilistic and non-greedy access that enables multiple neighbouring femtocells to simultaneously use a given channel.","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":"132346061","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
Secure transmission in multi-cell massive MIMO systems 多小区大规模MIMO系统中的安全传输
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825171
Jun Zhu, R. Schober, V. Bhargava
{"title":"Secure transmission in multi-cell massive MIMO systems","authors":"Jun Zhu, R. Schober, V. Bhargava","doi":"10.1109/GLOCOMW.2013.6825171","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825171","url":null,"abstract":"In this paper, we consider a multi-cell massive MIMO system with matched-filter precoding and artificial noise (AN) generation at the base station (BS) for secure downlink transmission in the presence of multi-antenna passive eavesdroppers. We derive two tight lower bounds for the achievable ergodic secrecy rate and a tight upper bound on the secrecy outage probability of the considered system. The analytical results are used to optimize the amount of power allocated for AN generation. Our results reveal that AN generation is not required in massive MIMO systems as long as the number of BS antennas is much larger than the number of eavesdropper antennas. However, as the number of eavesdropper antennas increases relative to the number of BS antennas, AN becomes beneficial and the amount of power optimally allocated to AN generation increases with the number of eavesdropper antennas.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"579 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":"132363150","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}
引用次数: 36
Large file distribution using efficient generation-based network coding 使用高效的基于生成的网络编码进行大型文件分发
2013 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOMW.2013.6825025
Ye Li, S. Blostein, W. Chan
{"title":"Large file distribution using efficient generation-based network coding","authors":"Ye Li, S. Blostein, W. Chan","doi":"10.1109/GLOCOMW.2013.6825025","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2013.6825025","url":null,"abstract":"To distribute a large amount of data through a network, much coordination information, such as packet scheduling and ARQ feedback, is needed between nodes. In this paper, we propose a network coding based scheme to ratelessly distribute data without any coordination between network nodes. To overcome the cubic decoding complexity of network coding, we follow a generation-based strategy, which groups the source packets into subsets called generations and only permits coding among packets belonging to the same generation. A maximum local potential innovativeness strategy is proposed to schedule transmissions of generations at intermediate nodes, where only local buffer information is needed. The transmission overhead at sink nodes, which is defined as the number of extra packets required for successful decoding caused by the non-optimal scheduling, is reduced by using overlapping generations where one source packet may be present in multiple generations. The and-or tree analysis technique is applied to analyze the performance of the overlapping generation-based network coding scheme and used to determine the optimal amount of overlap needed when constructing generations. The overall design is shown to achieve promising throughput rate while maintaining low decoding complexity.","PeriodicalId":174992,"journal":{"name":"2013 IEEE Globecom Workshops (GC Wkshps)","volume":"259 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":"133760303","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}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信