CHINACOM 2011
C3HetNet 2011CSCN 2011NRN 2011SATCOM 2011ADIM 2011HSR Com 2011

    CHINACOM

    6th International ICST Conference on Communications and Networking in China

    The aim of CHINACOM is to bring together Chinese and international researchers and practitioners in communications, networking and information technologies to showcase the latest advances in these areas. Following the big successes of CHINACOM'06-'10, CHINACOM'11 will be held in Harbin, China, one …

    The aim of CHINACOM is to bring together Chinese and international researchers and practitioners in communications, networking and information technologies to showcase the latest advances in these areas. Following the big successes of CHINACOM'06-'10, CHINACOM'11 will be held in Harbin, China, one of the most beautiful cities in China, on Aug. 17-19 2011. The conference will be technically sponsored by Create-Net and Harbin Institute of Technology (HIT). CHINACOM is developing into a premier annual international conference for the presentation of original research advances in the field of communications, networking and advance information technologies. The conference will consist of four technical symposia, panels, workshops and tutorials. The technical sessions will present original research of fundamental or practical significance, while the panels and workshops will focus on recent developments, emerging applications, related business issues, and special topics. Original contributions on recent advances in testbed developments and design and experimental evaluations of systems and subsystems are particularly encouraged.

    more »
    Editor(s): Shuguo Wang , Victor C.M. Leung , Peter Han Joo Chong and Boon-Chong Seet
    Publisher
    IEEE
    Conference dates
    17th–19th Aug 2011
    Location
    Harbin, People's Republic of China
    Appeared in EUDL
    27th Mar 2012
    Appears in
    IEEEXplore

    Copyright © 2012–2013 IEEE

    • Relay Selection with Noisy Limited Feedback

      Research Article in 6th International ICST Conference on Communications and Networking in China

      Lei Wang, Guangrong Zhang, Guo Wei

      Abstract
      Relay selection is a simple technique to achieve spatial diversity in cooperative networks. However, some feedback is generally required from the destination to the relays, raising the issue of the e…Relay selection is a simple technique to achieve spatial diversity in cooperative networks. However, some feedback is generally required from the destination to the relays, raising the issue of the effect of feedback error. This paper focuses on relay selection systems with noisy limited feedback. We propose an analytical framework to analyze such a system and derive the closed-form SNR expression. As resources allocated to feedback
      and transmitting data, a fundamental tradeoff exists between the allocated resources in both phases. On the basis of the closedform SNR expression, the optimal resource allocation maximizing the achievable rate upper bound is found. Simulation results illustrate the achievable rate for various system configurations.
       more »

    • Robust Design for Opportunistic Collaborative Beamforming with Noisy Limited Feedback

      Research Article in 6th International ICST Conference on Communications and Networking in China

      Lei Wang, Zhiyong Wang, Guo Wei

      Abstract
      This paper presents a robust limited feedback design for opportunistic collaborative beamforming. The proposed scheme focuses on the index assignment problem with noisy limited feedback. Simulation …This paper presents a robust limited feedback design
      for opportunistic collaborative beamforming. The proposed scheme focuses on the index assignment problem with noisy limited feedback. Simulation results show that the proposed framework has significant SNR gain compared to the random index assignment. Furthermore, for large number of relay nodes, we show that under two-nearest constellation feedback channel assumption, the SNR loss of the proposed robust design grows linearly with the feedback error probbility. It is also proved that the order of the average SNR loss increases with the relay number and is upper bounded by 1.6.
       more »

    • A General Model for Store-carry-forward Routing Schemes with Multicast in Delay Tolerant Networks

      Research Article in 6th International ICST Conference on Communications and Networking in China

      Jiajia Liu, Xiaohong Jiang, Hiroki Nishiyama, Nei Kato

      Abstract
      Delay tolerant networks (DTNs) are sparse and highly mobile wireless ad hoc networks, where no contemporaneous end-to-end path may ever exist at any given time instant, and thus the “store-carry-forw…Delay tolerant networks (DTNs) are sparse and highly mobile wireless ad hoc networks, where no contemporaneous end-to-end path may ever exist at any given time instant, and thus the “store-carry-forward” kind of schemes becomes a natural routing option. A lot of models have been proposed to analyze the unicast performance of such routing schemes in the DTNs, while few works consider the multicast scenario. In this paper, we develop a general continuous time Markov chain-based theoretical framework to characterize the complicated message delivery process of the DTN multicast scenarios, based on which analytical expressions are further derived for both the expected delivery delay and expected delivery cost. The developed theoretical framework is general in the sense that: 1) it can be used to analyze the DTN multicast performance under the common “store-carry-forward” routing schemes; 2) it can also be used for the common mobility models; 3) it covers some available models developed for the DTN unicast as special cases. We then apply the theoretical framework to explore the delivery performance of two popular routing schemes, the epidemic routing and the two-hop relaying.
      more »

    • An Adaptive Scheduling Algorithm for Conversational Video Services in LTE System

      Research Article in 6th International ICST Conference on Communications and Networking in China

      Huali Qi, Ling Qiu, Bao Zhang

      Abstract
      In this paper, an adaptive scheduling algorithm for conversational video services in long-term evolution (LTE) system is proposed. Aiming at LTE system, we add group of picture (GOP) pattern identifi…In this paper, an adaptive scheduling algorithm for conversational video services in long-term evolution (LTE) system is proposed. Aiming at LTE system, we add group of picture (GOP) pattern identification module to the radio resource management (RRM) of evolved Node B (eNB) in order to obtain video frame information for scheduler. Then an adaptive scheduling algorithm based on frame scheduling priority which takes into account the frame weight, user’s channel quality and system load for conversational video services is proposed. The scheduler can adaptively select video frame based on the relationship between frame’s tolerable delay and time window. Simulation results show that the proposed algorithm achieves higher performance in average video quality and system throughput by preferentially transmitting high priority frames and avoiding unnecessary losses of low priority frames.
       more »

    • An Improved Routing Scheme for Relay Enhanced Cellular Networks

      Research Article in 6th International ICST Conference on Communications and Networking in China

      zhangchao Ma, Yu Sheng, Jianquan Wang

      Abstract
      Relaying is expected to be one of the key elements of future cellular networks. This paper studies the performance of different routing schemes for cellular networks enhanced with multiple relay stat…Relaying is expected to be one of the key elements of future cellular networks. This paper studies the performance of different routing schemes for cellular networks enhanced with multiple relay stations (RSs). It is assumed that resource reusing is enabled between RSs while the interference between BS and RS signals is eliminated. Taking into account the specific resource allocation strategy, a new routing scheme is proposed to improve routing performance. Through system-level simulations, the proposed algorithm is evaluated and compared with both non-relaying and relaying systems with benchmark routing algorithms. Simulation results demonstrate that the proposed algorithm can achieve better system throughput while guaranteeing the fairness performance.
       more »