2013 IEEE Global Communications Conference (GLOBECOM)最新文献_第5页

Performance evaluation of an enhanced cryptography solution for m-Health applications in cooperative environments 协作环境中移动医疗应用增强型加密解决方案的性能评估

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

Fábio Canelo, Bruno M. C. Silva, J. Rodrigues, Zuqing Zhu

引用次数: 8

Diibuted componentwise EM algorithm or mixture models in sensor networks 传感器网络中的分布式组件电磁算法或混合模型

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

Jia Yu, Pei-Jung Chung

引用次数: 1

Smart hybrid power system for base transceiver stations with real-time energy management 基于实时能量管理的基站智能混合电源系统

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

P. Diamantoulakis, A. Ghassemi, G. Karagiannidis

{"title":"Smart hybrid power system for base transceiver stations with real-time energy management","authors":"P. Diamantoulakis, A. Ghassemi, G. Karagiannidis","doi":"10.1109/GLOCOM.2013.6831494","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831494","url":null,"abstract":"Reducing the power consumption of base transceiver stations (BTSs) in mobile communications networks is typically achieved through energy saving techniques, where they can also be combined with local power generators to create a hybrid power system (HPS). Such a system has reduced power consumption and operational cost, without taking the advantage of real-time energy management. In this paper, we introduce the smart HPS that can facilitate energy consumption scheduling (ECS) via an intelligent connection to the power grid. In doing so, we first develop sensor control and communication systems with an embedded smart ECS unit for the HPS. Then, we propose a real-time energy management algorithm to reduce the operational cost of BTS, according to real-time pricing and estimating demand and supply. The numerical results presented show a significant reduction in the BTS operational costs. We also develop a techno-economic and sizing analysis to describe the total cost of the smart HPS taking the real-time energy pricing into account. Since the lifetime of the operating system can be quite long, our results show that there is possibility to make a profit.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"1 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":"129642495","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}

引用次数: 7

Content-based sensor search for the Web of Things 基于内容的物联网传感器搜索

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

C. Truong, K. Römer

引用次数: 27

MobiCache: When k-anonymity meets cache MobiCache:当k-匿名遇到缓存时

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

Xiao-yan Zhu, Haotian Chi, Ben Niu, Weidong Zhang, Zan Li, Hui Li

引用次数: 71

Maximizing number of satisfiable routing requests in static ad hoc networks 在静态自组织网络中最大化可满足的路由请求数量

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

Zane Sumpter, Lucas Burson, Bin Tang, Xiao Chen

{"title":"Maximizing number of satisfiable routing requests in static ad hoc networks","authors":"Zane Sumpter, Lucas Burson, Bin Tang, Xiao Chen","doi":"10.1109/GLOCOM.2013.6831041","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831041","url":null,"abstract":"We study an energy-efficient routing problem in static ad hoc networks. The problem, referred to as maxR, is to maximize the number of routing requests that can be satisfied in the network, under the constraint that each node has finite battery power. The online version of the problem, where the sequence of messages that has to be routed over the network is not known ahead of time, has been studied extensively. In this paper, we study the offline version of the problem where the sequence of requests is pre-known. As far as we know, the offline maxR problem, its hardness and approximability have not been well studied. We show that after appropriate transformation, offline maxR is equivalent to the well-known maximum disjoint path problem, which is NP-hard. We propose a greedy algorithm called GDP that has a constant approximation ratio to the optimal algorithm. GDP can be used as a benchmark to evaluate the performance of online algorithms as it is known that the best offline algorithm performs better than any online algorithm. We then put forward a new online algorithm called MECBE to solve the online maxR problem. Simulation results show that GDP outperforms MECBE, which outperforms the state-of-the-art online algorithm OML, in terms of the number of satisfiable requests, the average energy consumption per request, and the number of energy-depleted nodes.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"37 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":"123863804","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}

引用次数: 9

Optimizing user association and frequency reuse for heterogeneous network under stochastic model 随机模型下异构网络用户关联与频率复用优化

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

Yicheng Lin, Wei Yu

{"title":"Optimizing user association and frequency reuse for heterogeneous network under stochastic model","authors":"Yicheng Lin, Wei Yu","doi":"10.1109/GLOCOM.2013.6831376","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831376","url":null,"abstract":"This paper considers the joint optimization of frequency reuse and base-station (BS) bias for user association in downlink heterogeneous networks for load balancing and intercell interference management. To make the analysis tractable, we assume that BSs are randomly deployed as point processes in multiple tiers, where BSs in each tier have different transmission powers and spatial densities. A utility maximization framework is formulated based on the user coverage rate, which is a function of the different BS biases for user association and different frequency reuse factors across BS tiers. Compared to previous works where the bias levels are heuristically determined and full reuse is adopted, we quantitatively compute the optimal user association bias and obtain the closed-form solution of the optimal frequency reuse. Interestingly, we find that the optimal bias and the optimal reuse factor of each BS tier have an inversely proportional relationship. Further, we also propose an iterative method for optimizing these two factors. In contrast to system-level optimization solutions based on specific channel realization and network topology, our approach is off-line and is useful for deriving deployment insights. Numerical results show that optimizing user association and frequency reuse for multi-tier heterogeneous networks can effectively improve cell-edge user rate performance and utility.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","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":"123881149","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}

引用次数: 40

A flow aggregation method for the scalable and efficient quality of service support in Next Generation Networks 下一代网络中可扩展、高效的服务质量支持流聚合方法

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

Mustafa Sanli, E. G. Schmidt, Hasan Cengiz Güran

{"title":"A flow aggregation method for the scalable and efficient quality of service support in Next Generation Networks","authors":"Mustafa Sanli, E. G. Schmidt, Hasan Cengiz Güran","doi":"10.1109/GLOCOM.2013.6831408","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831408","url":null,"abstract":"The services in the Next Generation Network (NGN) will be created on demand by the customers and will require end-to-end Quality of Service (QoS) for each flow. A very significant component for the end-to-end QoS support in the Internet is the packet schedulers in the routers. The complexity of the packet scheduling algorithms increases with the number of flows. As a solution, flow aggregation decreases the number of flows processed by the scheduler. The previous work in the literature proves that if the flow aggregator is fair, the end-to-end delay bounds of the aggregated flows are preserved and suggests limiting the service rate for the aggregate flow to achieve fairness in the expense of a lower utilization of the network resources. In this paper, we present a new method for flow aggregation, which relaxes this limit on the aggregate service rate, to increase the link utilization. We analytically show that our aggregation method is fair. Consequently, the end-to-end delay bounds in the network are preserved. In addition, we provide simulation results to demonstrate the decreased average delay of the aggregated flow.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"25 35","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120899709","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}

引用次数: 2

On the capacity analysis of HetNets with range expansion and eICIC 基于范围扩展和eICIC的HetNets容量分析

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

Arvind Merwaday, S. Mukherjee, Ismail Güvenç

引用次数: 11

PESC: A parallel system for clustering ECG streams based on MapReduce PESC:一种基于MapReduce的心电流聚类并行系统

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

L. Yang, Jin Zhang, Qian Zhang

引用次数: 2