2014 IEEE International Conference on Communications (ICC)最新文献_第5页

Optical transmission schemes for GEO feeder links GEO馈线链路的光传输方案

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883972

W. Cowley, D. Giggenbach, R. M. Calvo

引用次数: 14

Coalition based interference mitigation in femtocell networks with multi-resource allocation 多资源分配飞蜂窝网络中基于联盟的干扰抑制

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883731

Yanjie Dong, Min Sheng, Shun Zhang, Chungang Yang

引用次数: 4

Low-complexity 3D target tracking in Wireless Aerial Sensor Networks 无线航空传感器网络中的低复杂度三维目标跟踪

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883347

S. Uludag, Murat Karakus, Evrim Guler

{"title":"Low-complexity 3D target tracking in Wireless Aerial Sensor Networks","authors":"S. Uludag, Murat Karakus, Evrim Guler","doi":"10.1109/ICC.2014.6883347","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883347","url":null,"abstract":"With the proliferation of the application areas of the Wireless Sensor Networks (WSNs) and the technological advances in sensor electronics, target tracking has become one of the most important functions in WSNs. The overwhelming majority of moving target tracking studies in WSNs has assumed either one-dimensional space (lineland), or two-dimensional domain (flat-land). However, many existing, such as environmental monitoring of rugged terrain, structural health monitoring of buildings, underground and underwater WSN applications, and emerging applications, such as search-and-rescue via Micro Aerial Vehicles, reconnaissance by insect-sized flying robots, need target tracking in three-dimensional space. In this study, we assume a Wireless Aerial Sensor Network (WASN) with conventional low-power and low-complexity features and devise a low spatial and temporal complexity moving target tracking mechanism in 3D based on g-h filter that considers measurement errors. Our prefatory simulations show promising preliminary results for our approach in terms of very low inaccuracy rates between the true location of the target and the forecasts at the sink node as well as negligible estimate errors in terms of Euclidean distance.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116116163","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

Revisiting a primitive: Analysis of approximate message authentication codes 重新访问原语:分析近似消息身份验证码

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883408

S. Hossein, A. Tabatabaei, N. Zivic

引用次数: 1

Contract-theoretic modeling for content delivery in relay-based publish-subscribe networks 基于中继的发布-订阅网络中内容交付的契约理论建模

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883728

Yifan Li, Ping Wang, D. Niyato, Yang Zhang

{"title":"Contract-theoretic modeling for content delivery in relay-based publish-subscribe networks","authors":"Yifan Li, Ping Wang, D. Niyato, Yang Zhang","doi":"10.1109/ICC.2014.6883728","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883728","url":null,"abstract":"Mobile social network (MSN) has been widely studied as a novel and effective way for communication in the current era of fast developing mobile devices, which enables the contents and services to be delivered opportunistically when mobile users contact. In this paper, we aim to optimize the content delivery from the content provider (CP) to the subscribers via relays in between. Tandem queueing model is applied to model the content delivery process, based on which absorbing Markov chain is used to derive the quality of the content delivery service received by the subscribers. The validity of the proposed queuing model has been verified by our simulation results. Observing that the content provider always has dominant control on the content delivery process and is pursuing the maximum profit by strategically designing the “rights” and “obligation” items for the subscribers, contract theory is adopted to reach an economically optimal solution. The numerical results verify the effectiveness of the contract-theoretic approach in maximizing the content provider's profit, and the capability to ensure the satisfaction of the heterogeneous subscribers with different quality of service (QoS) requirements.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122701830","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

On the analysis of effective capacity over generalized fading channels 广义衰落信道的有效容量分析

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883613

Zhe Ji, Chao Dong, Youzheng Wang, Jianhua Lu

引用次数: 36

DAQ: Deadline-Aware Queue scheme for scheduling service flows in data centers DAQ:数据中心中用于调度业务流的截止日期感知队列方案

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883779

Cong Ding, R. Rojas-Cessa

{"title":"DAQ: Deadline-Aware Queue scheme for scheduling service flows in data centers","authors":"Cong Ding, R. Rojas-Cessa","doi":"10.1109/ICC.2014.6883779","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883779","url":null,"abstract":"We propose a scheme to schedule the transmission of data center traffic to guarantee a transmission rate for long flows without affecting the rapid transmission required by short flows. We call the proposed scheme Deadline-Aware Queue (DAQ). The traffic of a data center can be broadly classified into long and short flows, where the terms long and short refer to the amount of data to be transmitted. In a data center, the long flows require modest transmission rates to keep maintenance, data updates, and functional operation. Short flows require either fast service or be serviced within a tight deadline. Satisfaction of both classes of bandwidth demands is needed. DAQ uses per-class queues at supporting switches, keeps minimum flow state information, and uses a simple but effective flow control. The credit-based flow control, employed between switch and data sources, ensures lossless transmissions. We study the performance of DAQ and compare it to those of other existing schemes. The results show that the proposed scheme improves the achievable throughput for long flows up to 37% and the application throughput for short flows up to 33% when compared to other schemes. DAQ guarantees a minimum throughput for long flows despite the presence of heavy loads of short flows.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122782100","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

Programming network via Distributed Control in Software-Defined Networks 软件定义网络中的分布式控制网络编程

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883789

Boyang Zhou, Chunming Wu, X. Hong, M. Jiang

{"title":"Programming network via Distributed Control in Software-Defined Networks","authors":"Boyang Zhou, Chunming Wu, X. Hong, M. Jiang","doi":"10.1109/ICC.2014.6883789","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883789","url":null,"abstract":"Programming a network for innovative services or for function improvements has never been easier using Software-Defined Networking (SDN). However, the programming tasks can also be significantly complicated by the asynchrony of data plane states and complexities of service control states. In order to reduce the complexity for programming a network service in Distributed Control Plane of SDN, we propose a proGRAmming Control (GRACE) layer as a generic solution, which provides two key features, namely, reconfigurability and reusability. Their implementations deal with aforementioned challenges, thus to achieve the consistency of the data plane states and the reusability of the service control states at the distributed controllers. This paper introduces the reconfigurability and reusability with their design goals and their impact on the programmability of DCP. We further use two popular network services, ICN (Information-Centric Networking) and CDN (Content Distribution Networks) to illustrate these concepts. NS-3 simulations and PlanetLab emulations are conducted to show the advantage of using the GRACE layer for ICN and CDN. Results show that the ICN Interest delay is reduced by 19.6% and CDN request delay is reduced by 81% in extremely harsh network conditions.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122875555","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

Achieving Multi-Authority Access Control with Efficient Attribute Revocation in smart grid 基于高效属性撤销的智能电网多权限访问控制

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883390

Dongxiao Liu, Hongwei Li, Yi Yang, Haomiao Yang

引用次数: 30

Communication strategies for two models of discrete energy harvesting 两种离散能量收集模型的通信策略

2014 IEEE International Conference on Communications (ICC) Pub Date : 2014-06-10 DOI: 10.1109/ICC.2014.6883630

K. F. Trillingsgaard, P. Popovski

{"title":"Communication strategies for two models of discrete energy harvesting","authors":"K. F. Trillingsgaard, P. Popovski","doi":"10.1109/ICC.2014.6883630","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883630","url":null,"abstract":"Energy harvesting is becoming a viable option for powering small wireless devices. Energy for data transmission is supplied by the nature, such that when a transmission is about to take place in an arbitrary instant, the amount of available energy is a random quantity. The arrived energy is stored in a battery and transmissions are interrupted if the battery runs out of energy. We address communication in slot-based energy harvesting systems, where the transmitter communicates with ON-OFF signaling: in each slot it can either choose to transmit (ON) or stay silent (OFF). Two different models of harvesting and communication are addressed. In the first model an energy quantum can arrive, with a certain probability, in each slot. The second model is based on a frame of size F: energy arrives periodically over F slots, in batches containing a random number of energy quanta. We devise achievable strategies and compare the slot- with the frame-based model in the case of an errorless transmission channel. Additionally, for the slot-based model and channel with errors, we provide a new proof of the capacity achieved by the save-and-transmit scheme.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122978602","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