2016 IEEE Global Communications Conference (GLOBECOM)最新文献_第9页

On Random Walks and Random Sampling to Find Max Degree Nodes in Assortative Erdos Renyi Graphs 分类Erdos Renyi图中寻找最大度节点的随机漫步和随机抽样

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842044

Jonathan Stokes, S. Weber

{"title":"On Random Walks and Random Sampling to Find Max Degree Nodes in Assortative Erdos Renyi Graphs","authors":"Jonathan Stokes, S. Weber","doi":"10.1109/GLOCOM.2016.7842044","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842044","url":null,"abstract":"Social networks are naturally modeled as graphs, with edges indicating associations of users, and as such user popularity or influence is captured by the degree of the node corresponding to the user. It is of natural interest to seek maximum degree nodes, i.e., most popular members, in this graph, and as these networks are large, this requires an efficient search algorithm. In this paper we address the problem of finding a maximum degree node (as distinct from finding the maximum degree) in Erdos Renyi (ER) random graphs, where these graphs are ``rewired'' in a way to reach a target assortativity without affecting the marginal degree distribution. We address two questions: i) how many maximum degree nodes are in such a graph, on average, and ii) is it easier to find such a node via a biased random walk (BRW) or via random (star) sampling (RSS)? To answer the first question, we show that large ER graphs possess on average a unique maximum degree node. The answer to the second question is that the superiority of BRW vs. RSS depends critically on the assortativity. In particular, RSS is independent of, and BRW is highly sensitive to, the assortativity. We demonstrate numerically the sensitivity of BRW to assortativity is connected to the prevalence of local maxima; these maxima limit the ability of BRW to follow a gradient on the graph. Finally, we establish how the prevalence of local maxima may be computed from the joint degree distribution of the graph.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"495 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133272308","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

A Storage-Latency Tradeoff Study for Cache-Aided MIMO Interference Networks 缓存辅助MIMO干扰网络的存储-延迟权衡研究

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841552

Youlong Cao, Fan Xu, Kangqi Liu, M. Tao

{"title":"A Storage-Latency Tradeoff Study for Cache-Aided MIMO Interference Networks","authors":"Youlong Cao, Fan Xu, Kangqi Liu, M. Tao","doi":"10.1109/GLOCOM.2016.7841552","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841552","url":null,"abstract":"Caching is an effective technique to improve user perceived experience for massive content delivery in wireless networks. An essential problem in cache-aided wireless networks is to find what and how much gain can be achieved by caching. This paper provides a study of the fundamental storage- latency tradeoff for a cache-aided MIMO interference network with 3 transmitters and 3 receivers and each node equipped with $M$ antennas. By using a newly proposed novel file splitting and caching strategy, the network topology during the content delivery phase is turned opportunistically to MIMO X channel, MIMO broadcast channel, MIMO multicast channel, or a hybrid form of these channels. Linear-precoding based interference management schemes such as interference alignment and neutralization over finite symbol extension are designed for these channels. We characterize the storage-latency tradeoff by emph{fractional delivery time} (FDT), a metric to evaluate the worst-case delivery time of the actual traffic load at a rate specified by the degrees of freedom (DoF) of the considered channel. The achievable FDT of our proposed scheme decreases piecewise linearly with the normalized cache sizes and is inversely proportional to the number of antennas. It is also shown that the achievable FDT is optimal at certain cache size regions and is within a multiplicative gap of 2 from the optimum at other regions.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133293908","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

Symbol Error Probability of Cluster-Based Cooperative Cellular Networks 基于集群的协同蜂窝网络符号错误概率研究

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842311

R. Senanayake, Phee Lep Yeoh, J. Evans

引用次数: 0

Robust Frequency-Domain Equalization for Single-Carrier Broadband MIMO Systems 单载波宽带MIMO系统的鲁棒频域均衡

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842231

Pengfei Zhe, Y. Zhu

引用次数: 1

An Energy-Aware Algorithm for Optimizing Resource Allocation in Software Defined Network 软件定义网络中资源优化分配的能量感知算法

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841589

Ting Yu, Yanni Han, Xuemin Wen, Xin Chen, Zhen Xu

{"title":"An Energy-Aware Algorithm for Optimizing Resource Allocation in Software Defined Network","authors":"Ting Yu, Yanni Han, Xuemin Wen, Xin Chen, Zhen Xu","doi":"10.1109/GLOCOM.2016.7841589","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841589","url":null,"abstract":"With the increasing popularity of cloud computing, the huge amount of energy consumed by data centers has gained much attention. Current proposals address the energy efficiency problem by two major methods: optimizing the allocation of physical servers and network elements (routers or switches). In order to improve resource utilization and minimize the energy consumption, the former method focuses on virtual machine (VM) placement regardless of the inherent traffic between VMs. The latter designs power saving routing and flow scheduling while this method neglects the resource demands in VMs. In this paper, we jointly consider the VM placement and network routing to optimize energy cost. In addition, we take advantage of the centralized and global controller in Software Defined Networking (SDN) paradigm. Inspired by the idea of Data Field, we propose a novel algorithm to evaluate the importance and relationships among multiple VMs. The potential score based on Data Field is a more accurate global ranking considering the resource demands and inter-VM traffic. Extensive simulations are conducted on different scales of typical data center topologies, such as Fat-Tree and BCube. Results show that our proposal can reduce the number of active devices including the servers and network elements, and thereby saves power consumption. Moreover, the proposed algorithm improves network performance by decreasing the average hops of per flow.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132262229","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}

引用次数: 12

Link-Level Analysis of Low Latency Operation in LTE Networks LTE网络中低延迟操作的链路级分析

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841958

Kianoush Hosseini, Shim Patel, A. Damnjanovic, Wanshi Chen, J. Montojo

引用次数: 5

On the Accuracy of Heart Rate Variability Measures from Undersampled RR Interval Time Series 欠采样RR区间时间序列心率变异性测量的准确性研究

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842045

Giorgio Quer, A. Alasaad, R. Rao

{"title":"On the Accuracy of Heart Rate Variability Measures from Undersampled RR Interval Time Series","authors":"Giorgio Quer, A. Alasaad, R. Rao","doi":"10.1109/GLOCOM.2016.7842045","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842045","url":null,"abstract":"The heart rate variability (HRV) is the variation in the pulsing frequency of the human heart. Measuring this parameter can reveal important information on the real-time interaction between the autonomic nervous system and the cardiocirculatory system. It can provide useful insight on an individual's state of stress or well being even outside a clinical setting, thanks to inexpensive and unobtrusive wireless sensors and the computing capability of our smartphones. These sensors are battery operated, so their current sampling frequency may be inadequate to measure HRV parameters. In this article, we focus on the accuracy of the detection of the RR interval time series (the instantaneous heart rate), and we investigate the sampling frequency needed to obtain a given level of accuracy for different signals and HRV parameters. We provide the guidelines for an opportunistic choice of the sampling rate to achieve a desired accuracy, and we propose a series of techniques to improve this accuracy with a fixed sampling frequency. We show the effectiveness of the proposed techniques in terms of relative error reduction and energy savings for the wireless sensors.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133219168","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

Effective-Capacity Based Auctions for Relay Selection over Wireless Cooperative Communications Networks 基于有效容量的无线协作通信网络中继选择竞价

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841767

Qixuan Zhu, Xi Zhang

{"title":"Effective-Capacity Based Auctions for Relay Selection over Wireless Cooperative Communications Networks","authors":"Qixuan Zhu, Xi Zhang","doi":"10.1109/GLOCOM.2016.7841767","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841767","url":null,"abstract":"Cooperative communication is an efficient technique for mobile wireless networks supporting information transmission through relay nodes, which forward the signal received from a source node to its destination. Applying the cooperative communication in wireless networks can significantly improve the network performance. One of the most important challenges is how to efficiently allocate the access opportunity of a relay node to multiple mobile-users while taking into account the delay-bounded quality of service (QoS) for the time-sensitive multimedia data transmissions. To overcome these difficulties, in this paper we propose a novel game-theory based scheme to resolve the relay node allocation problem by measuring the maximum throughput for time-sensitive multimedia data transmission under a QoS requirement as the effective capacity gain. We formulate this one relay allocation problem as a single-relay-auction such that all mobile-user players can decide whether to patriciate in this relay auction, and the mobile-user player who places the highest bid obtains the relay allocation. The mobile-user players who lose or stay out of the auction can only directly transmit information to their destinations. Then, we derive the optimal strategies for the single-relay-auction, maximizing the payoff (effective capacity gain minus costs) in each bid round.The extensive simulation results obtained validate and evaluate our proposed schemes.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127805863","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

Context Awareness with Ambient FM Signal Using Multi-Domain Features 利用多域特征与环境调频信号进行上下文感知

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841694

Jie Wang, Xueyan Feng, Qinghua Gao, Hao Yue, Yuguang Fang

{"title":"Context Awareness with Ambient FM Signal Using Multi-Domain Features","authors":"Jie Wang, Xueyan Feng, Qinghua Gao, Hao Yue, Yuguang Fang","doi":"10.1109/GLOCOM.2016.7841694","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841694","url":null,"abstract":"Context awareness plays an important role in many emerging applications, such as mobile computing and smart space. Since FM signal is ubiquitous, it has been recognized as an attractive and promising technique to realize context awareness. When a target is at different locations or performs different activities, it will exert different influence on the FM signal around it. Therefore, it is possible to deduce its location and activity by analysing its influence on the FM signal. However, FM signal is extremely weak and noisy, which makes it a challenging task to achieve high-performance context awareness. In this paper, we propose a new method for improving the performance of an FM-based context-aware system using multi-domain features. Specifically, we extract signal features not only from the time domain, but also from the wavelet domain, the frequency domain, and the space domain, and construct robust and discriminative multi-domain features to characterize the FM signal. Furthermore, we also model context awareness as a classification problem and develop a robust iterative sparse representation classification algorithm to efficiently solve this problem. Extensive experiments performed in a 7.2m×10.8m clutter indoor laboratory with one multi- channel FM receiver demonstrate that the proposed schemes could achieve more than 90% accuracy of location estimation and activity recognition when 3 antennas are used.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131270973","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}

引用次数: 1

Low-Complexity Base Station Cooperation for mmWave Heterogeneous Cellular Networks 毫米波异构蜂窝网络的低复杂度基站合作

2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841968

Christodoulos Skouroumounis, C. Psomas, I. Krikidis

{"title":"Low-Complexity Base Station Cooperation for mmWave Heterogeneous Cellular Networks","authors":"Christodoulos Skouroumounis, C. Psomas, I. Krikidis","doi":"10.1109/GLOCOM.2016.7841968","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841968","url":null,"abstract":"In this paper, we study the problem of base station (BS) cooperation in millimeter wave multi- tier heterogeneous cellular networks. In contrast to conventional approaches, where a number of BSs jointly transmit data to a user, we investigate a low-complexity technique that enables the selection of a single BS for transmission. Specifically, a single BS that provides the highest instantaneous signal-to-interference-plus- noise ratio is selected, among the strongest BSs from each tier. By using stochastic geometry tools, we derive closed-form expressions for the coverage probability and the diversity gain of the system by taking into account spatial randomness and blockage effects. Our results show that the proposed scheme achieves full diversity and is appropriate for networks with strict computation constraints. In addition, we study the case where users employ successive interference cancellation (SIC) to further boost the achieved performance; SIC allows the mitigation of strong interference terms from the received signal. The impact of SIC on the coverage probability of the system is studied and closed-form expressions are provided.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131378500","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