2018 IEEE International Conference on Communications (ICC)最新文献_第2页

Trapping Set Analysis of Horizontal Layered Decoder 水平分层解码器的捕获集分析

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422965

N. Raveendran, B. Vasic

引用次数: 3

A Deadline-Aware Coflow Scheduling Approach for Big Data Applications 面向大数据应用的截止日期感知协同流调度方法

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422563

Wenda Tang, Song Wang, Duanchao Li, T. Huang, Wanchun Dou, Shui Yu

{"title":"A Deadline-Aware Coflow Scheduling Approach for Big Data Applications","authors":"Wenda Tang, Song Wang, Duanchao Li, T. Huang, Wanchun Dou, Shui Yu","doi":"10.1109/ICC.2018.8422563","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422563","url":null,"abstract":"Many datacenters usually process complex jobs such as MapReduce jobs. From a network perspective, most of these jobs trigger multiple parallel data flows, which comprise a coflow group semantically. When to schedule the jobs in datacenter or across multiple datacenters, most of current job schedulers have not considered the underlying network traffic load, which is suboptimal for jobs completion times. We present a new deadline-aware coflow scheduling approach called DCS, which takes the underlying network traffic load into consideration while guaranteeing high percentage of coflows that meet their deadlines. DCS aims to alleviate the network congestion in datacenters whose network worload are unbalanced, and it includes two stages for coflow scheduling: Firstly, it generates the task placement proposal by considering the underlying network workload. Secondly, it makes scheduling decision by estimating both task's execution time and transmission waiting time under the previous task placement proposal. The real-world data based simulation results have shown that DCS outperforms all existing solutions on reducing the percentage of coflows that miss their deadlines.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122749351","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

Transmitting and Sharing: A Truthful Double Auction for Cognitive Radio Networks 传输与共享:认知无线电网络的真实双重拍卖

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422505

Xiang Zhang, Dejun Yang, G. Xue, Ruozhou Yu, Jian Tang

{"title":"Transmitting and Sharing: A Truthful Double Auction for Cognitive Radio Networks","authors":"Xiang Zhang, Dejun Yang, G. Xue, Ruozhou Yu, Jian Tang","doi":"10.1109/ICC.2018.8422505","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422505","url":null,"abstract":"The scarcity of spectrum channels resides in the limited bandwidth resource and the exploding demand from spectrum-based services and devices. To help ease this scarcity, the concept of cognitive radio networks (CRNs) is proposed, where licensed spectrum holders (primary users) may lease their channels to unlicensed users (secondary users). Many CRN auctions are thus designed to incentivize primary users (PUs) to share their idle channels with secondary users (SUs). Most of these auctions assume that a transmitting PU does not lease its channel to SUs; if it leases its channel to SUs, it does not transmit itself. To further utilize the resource, researchers have studied the scenario where a transmitting PU is allowed to lease its channels to SUs if the transmissions of the SUs do not undermine the transmission of the PU. However, the study assumes that there is only one PU who owns the licensed channels, whereas in practice, channels may be contributed by multiple PUs. This prevents the result of the study from being directly applied to the multi-PU scenario, as the potential competitions among the PUs are neglected. We extend the scenario to the CRN with multiple PUs and propose TDSA-PS as a Truthful Double Spectrum Auction with transmitting Primary users Sharing. We prove that TDSA-PS is truthful, individually rational, budget-balanced, and computationally efficient.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114398898","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

High Energy Efficiency Transmission in MIMO Satellite Communications MIMO卫星通信中的高能效传输

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422808

Yuanyuan Ma, Tiejun Lv, Xuewei Zhang, Hui Gao, Shui Yu

{"title":"High Energy Efficiency Transmission in MIMO Satellite Communications","authors":"Yuanyuan Ma, Tiejun Lv, Xuewei Zhang, Hui Gao, Shui Yu","doi":"10.1109/ICC.2018.8422808","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422808","url":null,"abstract":"In this paper, we propose a high energy efficiency transmission scheme in multi-beam MIMO satellite systems. Satellite is regarded as a two-way decode-and- forward (DF) relay, where multiple pairs of users exchange information within pair. Zero-forcing transceivers are employed at the satellite. The challenge is that of deriving an accurate yet tractable expression of the system-level energy efficiency (EE) to be used as our objective function. To tackle this challenge, firstly, a closed-form expression of the EE is derived under the assumption of perfect satellite channel. Secondly, based on this analytical expression, we formulate a resource allocation optimization problem for the EE maximization by jointly optimizing satellite power and users power, subject to limited transmit power and minimum quality-of-service (QoS) constraints. Finally, the successive convex approximation technique is invoked to transform the original optimization problem into a concave fractional programming problem, which is then efficiently solved by the existed methods. Simulation results demonstrate the effectiveness of the proposed algorithms.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"706 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122972064","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

Joint Decision of Sensing Threshold and Power Allocation in OFDM Cognitive Radio Networks OFDM认知无线网络中感知阈值与功率分配的联合决策

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422510

Xu Wang, S. Ekin, E. Serpedin

引用次数: 0

Murmuration Inspired Clustering Protocol for Underwater Wireless Sensor Networks 水下无线传感器网络的噪声激励聚类协议

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422175

Robert Webster, K. Munasinghe, A. Jamalipour

{"title":"Murmuration Inspired Clustering Protocol for Underwater Wireless Sensor Networks","authors":"Robert Webster, K. Munasinghe, A. Jamalipour","doi":"10.1109/ICC.2018.8422175","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422175","url":null,"abstract":"Underwater Wireless Sensor Networks are characterized by their harsh channel conditions, lack of access to terrestrial services such as GPS for localization, limited battery life and low memory and processing capabilities. Furthermore, the effect of passive node mobility produces dynamic network topology and decreases localization accuracy. For terrestrial networks, access to GPS signals can provide accurate location information which can be used to ensure efficient network reconfiguration. Such a luxury does not exist in the underwater environment. In this paper, we propose a cluster-based network that can reconfigure as the network spatially evolves. The clustering algorithm is based on the swarming patterns of birds, fish and insects called murmurations. We reduce the murmuration behavior into two variables: orientation and opacity. The orientation data determines which nodes should be clustered together, and opacity data determines the optimal cluster head. Our results show that our murmuration inspired clustering algorithm manages network topology changes caused by underwater currents effectively and is shown to improve network lifetime by decreasing the number of cluster redefinitions and cluster head selections, thereby reducing unnecessary overhead in an already energy constrained environment. Furthermore, our results show that the decrease in network coverage due to node death is minimized by moving energy consumption to nodes with overlapping coverage regions.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128988046","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}

引用次数: 10

Urban Traffic Bottleneck Identification Based on Congestion Propagation 基于拥塞传播的城市交通瓶颈识别

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422108

Wenwei Yue, Changle Li, Guoqiang Mao

{"title":"Urban Traffic Bottleneck Identification Based on Congestion Propagation","authors":"Wenwei Yue, Changle Li, Guoqiang Mao","doi":"10.1109/ICC.2018.8422108","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422108","url":null,"abstract":"Traffic congestion has seriously caused various problems in society, economy and environment, especially in urban areas. A traffic bottleneck is always seen as the root cause of congestion which frequently deduces the congestion emergence, queues formation and congestion propagation. However, bottlenecks are caused by many complicated factors and vary with spatial and temporal environment which are difficult to be defined and identified in urban areas. In this paper, we first propose a novel definition of bottlenecks in urban area based on the congestion propagation costs and the congestion weights of road segments. Then according to the definition, we present an urban bottleneck identification method using causal congestion trees and causal congestion graphs to identify some bottlenecks. This paper implements some experiments based on the urban inductive loop detector data. According to our proposed method, we identify several bottleneck groups around the urban area. Furthermore, we also improve the road capacity of identified bottlenecks and compare the congestion level and congestion propagation range before and after the improvement to verify the identified bottlenecks.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127681356","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}

引用次数: 10

MocLis: A Non-Tunneling Moving Cell Support Protocol Based on Locator/ID Split for 5G System MocLis:一种基于定位/ID分离的5G系统非隧道移动小区支持协议

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422994

Takamasa Ochiai, Kohei Matsueda, Takao Kondo, Hiroaki Takano, R. Kimura, R. Sawai, F. Teraoka

引用次数: 4

A Novel Online Convex Optimization Algorithm Based on Virtual Queues 一种基于虚拟队列的在线凸优化算法

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422560

Xuanyu Cao, Junshan Zhang, H. Poor

{"title":"A Novel Online Convex Optimization Algorithm Based on Virtual Queues","authors":"Xuanyu Cao, Junshan Zhang, H. Poor","doi":"10.1109/ICC.2018.8422560","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422560","url":null,"abstract":"In this paper, online convex optimization (OCO) problems with time-varying objective and constraint functions are studied from the perspective of an agent who takes actions in real-time. Information about the current objective and constraint functions is revealed only after the corresponding action is already chosen. Inspired by a fast converging algorithm for time-invariant optimization in the very recent work cite{yu2017simple}, we develop a novel online algorithm based on virtual queues for constrained OCO. Optimal points of the dynamic optimization problems with full knowledge of the current objective and constraint functions are used as a dynamic benchmark sequence. Upper bounds on the regrets with respect to the dynamic benchmark and the constraint violations are derived for the presented algorithm in terms of the temporal variations of the underlying dynamic optimization problems. It is observed that the proposed algorithm possesses sublinear regret and sublinear constraint violations, as long as the temporal variations of the optimization problems are sublinear, i.e., the objective and constraint functions do not vary too drastically across time. The performance bounds of the proposed algorithm are superior to those of the state-of- the-art OCO method in most scenarios.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130816718","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

Throughput Maximization of Delay-Sensitive Request Admissions via Virtualized Network Function Placements and Migrations 通过虚拟化网络功能放置和迁移实现延迟敏感请求接收的吞吐量最大化

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-07-27 DOI: 10.1109/ICC.2018.8422337

Meitian Huang, W. Liang, Yu Ma, Song Guo

{"title":"Throughput Maximization of Delay-Sensitive Request Admissions via Virtualized Network Function Placements and Migrations","authors":"Meitian Huang, W. Liang, Yu Ma, Song Guo","doi":"10.1109/ICC.2018.8422337","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422337","url":null,"abstract":"Network Function Virtualization (NFV) has attracted significant attentions from both industry and academia as an important paradigm change in network service provisioning. Most existing studies on NFV dealt with admissions of user requests through deploying Virtualized Network Function (VNF) instances for individual user requests, without considering sharing VNF instances among multiple user requests to provide better network services and improve network throughput. In this paper, we study the network throughput maximization problem by adopting two different VNF instance scalings: (i) horizontal scaling by migrating existing VNF instances from their current locations to new locations; and (ii) vertical scaling by instantiating more VNF instances if needed. Specifically, we first propose a unified framework that jointly considers both vertical and horizontal scalings to maximize the network throughput, by admitting as many requests as possible while meeting their resource demands and end-to-end transmission delay requirements. We then devise an efficient heuristic algorithm for the problem. We finally conduct experiments to evaluate the performance of the proposed algorithm. Experimental results demonstrate that the proposed algorithm outperforms a baseline algorithm.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129609303","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}

引用次数: 20