2012 1st IEEE International Conference on Communications in China (ICCC)最新文献_第8页

Spatial reuse in spectrum sharing: A Matrix Spatial Congestion Games approach 频谱共享中的空间复用:矩阵空间拥塞博弈方法

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356875

Kai Zhou, Gaofei Sun, Xinbing Wang, Z. Feng

{"title":"Spatial reuse in spectrum sharing: A Matrix Spatial Congestion Games approach","authors":"Kai Zhou, Gaofei Sun, Xinbing Wang, Z. Feng","doi":"10.1109/ICCChina.2012.6356875","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356875","url":null,"abstract":"Congestion games, with the nice property that simple dynamics are guaranteed to converge to Nash equilibrium, have been widely used as models for many resource sharing scenarios. However, an obvious limitation of the congestion games is that they fail to capture a key feature of wireless networks: spatial reuse. That is, users separated far away enough can access the same channels without interference. In this paper, in order to take spatial reuse into account, we extend the congestion games to Matrix Spatial Congestion Games (MSCG) where we let the interference level vary from user to user. What's more, we consider a situation where users are able to access multiple channels at a time. The main aim of this paper is to investigate under what conditions this new model still has the finite improvement property (FIP), which guarantees that a pure Nash Equilibrium (PNE) always exists. In terms of payoff functions we category MSCG into four types. And we have proved that FIP holds for two types, that are MSCG with non-resource-specific and non-user-specific payoff functions and MSCG with non-resource-specific and user-specific payoff functions. For the other two types, we show that FIP does not hold.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121456618","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

Indoor navigation system for visually impaired people using visible light communication and compensated geomagnetic sensing 使用可见光通信和补偿地磁传感的视障人士室内导航系统

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356940

M. Nakajima, S. Haruyama

引用次数: 53

A novel heuristic-based traffic distribution method for disaster zone Wireless Mesh Networks 一种基于启发式的灾区无线Mesh网络流量分配方法

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356874

M. Fouda, Hiroki Nishiyama, N. Kato

引用次数: 10

Interference-aware channel allocation for Device-to-Device communication underlaying cellular networks 蜂窝网络下设备对设备通信的干扰感知信道分配

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356919

Yanfang Xu, Rui Yin, Tao Han, Guanding Yu

{"title":"Interference-aware channel allocation for Device-to-Device communication underlaying cellular networks","authors":"Yanfang Xu, Rui Yin, Tao Han, Guanding Yu","doi":"10.1109/ICCChina.2012.6356919","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356919","url":null,"abstract":"Device-to-Device (D2D) communication underlaying cellular networks will become an important technology in future networks such as IMT-Advanced to improve spectral efficiency. In order to enhance the overall system performance, the mutual interference between cellular and D2D communication caused by reusing the spectrum should be properly coordinated and channel allocation is considered as one of the methods to coordinate the interference. In this paper, the problem of channel allocation in a single cell system with several D2D pairs wanting to communicate directly is modeled. Then, an optimal interference-aware channel allocation scheme based on Hungarian algorithm is proposed. The scheme aims to maximize the number of permitted D2D communication pairs in a system meanwhile avoiding the strong interference from D2D communication to the cellular communication. Besides, we also propose a heuristic algorithm to reduce the computational complexity. Simulation results show that the proposed methods enhance the number of permitted D2D communication pairs significantly and the heuristic algorithm has a performance similar to that of the optimal algorithm which is based on Hungarian algorithm.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117210917","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}

引用次数: 41

A generalized exact closed-form SER analysis for OSTBC-OFDM systems using QAM modulations 使用QAM调制的OSTBC-OFDM系统的广义精确封闭形式SER分析

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356913

Xudong Wang, N. Wu, Chunli Gao

引用次数: 0

Performance evaluation of three Network-on-Chip (NoC) architectures (Invited) 三种片上网络(NoC)架构的性能评估(特邀)

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356997

Jing Chen, P. Gillard, Cheng Li

{"title":"Performance evaluation of three Network-on-Chip (NoC) architectures (Invited)","authors":"Jing Chen, P. Gillard, Cheng Li","doi":"10.1109/ICCChina.2012.6356997","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356997","url":null,"abstract":"As the number of processing elements which can be placed on a single chip doubles about every two years, both System-on-Chip (SoC) and the microprocessor market call for high-performance, flexible, scalable, and design-friendly interconnection network architectures [1]. Network-on-Chip (NoC) has been proposed as a solution to multi-core communication problems. The advantages of NoC include high bandwidth, low latency, low power consumption and scalability. The interconnection architecture has a significant impact on the performance of networks in terms of point-to-point delay, throughput, and loss rate. We evaluate the performance of three NoC architectures, including the torus, the Metacube and the hypercube under Poisson and bit-complement traffic pattern. Network sizes of 32, 64, 128, 512 and 1024 nodes are considered. Three injection rates ranging from 10% to 30% are applied to the target networks. Performance evaluation reflects that the torus is a viable choice for small networks (32-64 nodes) and the Metacube exhibits similar performance to the hypercube for 128 nodes and 512 nodes networks under a moderate load. Lower link complexity and fewer long wires make the Metacube a cheaper alternative to the hypercube.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124333994","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}

引用次数: 16

MAC-layer protocol for TCP fairness in Wireless Mesh Networks 无线网状网络中TCP公平性的mac层协议

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356924

Faisal Nawab, Kamran Jamshaid, B. Shihada, P. Ho

引用次数: 7

Trust-based anomaly detection in wireless sensor networks 基于信任的无线传感器网络异常检测

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356878

Renyong Wu, Xue Deng, R. Lu, Xuemin Shen

引用次数: 21

Expected path duration maximized routing algorithm in CR-VANETs CR-VANETs中期望路径持续时间最大化路由算法

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356966

Jing Liu, Pinyi Ren, Shaoli Xue, Hao Chen

{"title":"Expected path duration maximized routing algorithm in CR-VANETs","authors":"Jing Liu, Pinyi Ren, Shaoli Xue, Hao Chen","doi":"10.1109/ICCChina.2012.6356966","DOIUrl":"https://doi.org/10.1109/ICCChina.2012.6356966","url":null,"abstract":"In Cognitive-Radio (CR) enabled Vehicular Ad-Hoc NETworks (CR-VANETs), high mobility of vehicles and dynamically varying spectrum occupation statuses frequently cause the established routes broken. To deal with the increasing mobility and dynamics of accessible spectrum, we propose an expected path-duration maximized routing (EPDM-R) algorithm in CR-VANETs. Specifically, we study the scenario of cognitive radio enabled vehicles communications freeway mobility model. the vehicles, as secondary users (SUs), can access the licensed channels of primary users (PUs) when these channels are not occupied, where the behaviors of PUs follow the call-based model. In the EPDM-R algorithm, we firstly calculate the expected link-duration for each link. Then, the max-bottleneck algorithm is used to solve for the route achieving the longest expected path-duration. Theoretic analysis prove the optimality of our proposed EPDM-R algorithm in terms of maximizing EPD. Simulation results demonstrate that our proposed algorithm has larger average path-duration than the Dijkstra based scheme and the scheme that does not take the PUs' behaviors into consideration.","PeriodicalId":154082,"journal":{"name":"2012 1st IEEE International Conference on Communications in China (ICCC)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127570435","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}

引用次数: 29

Robust multicast beamforming using covariance channel state information 使用协方差信道状态信息的鲁棒组播波束形成

2012 1st IEEE International Conference on Communications in China (ICCC) Pub Date : 2012-11-26 DOI: 10.1109/ICCChina.2012.6356961

Wei Zhang, Zhenyuan Chen, Qiushi Gong, Guo Wei

引用次数: 0