System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Communications in China (ICCC), 2012 1st IEEE International Conference on

Date 15-17 Aug. 2012

Filter Results

Displaying Results 1 - 25 of 156
  • [Copyright notice]

    Publication Year: 2012 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (69 KB)  
    Freely Available from IEEE
  • Program

    Publication Year: 2012 , Page(s): 1 - 20
    Save to Project icon | Request Permissions | PDF file iconPDF (146 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012 , Page(s): 1 - 19
    Save to Project icon | Request Permissions | PDF file iconPDF (1053 KB)  
    Freely Available from IEEE
  • Technical Program Committee (TPC) members

    Publication Year: 2012 , Page(s): 1 - 12
    Save to Project icon | Request Permissions | PDF file iconPDF (99 KB)  
    Freely Available from IEEE
  • Committees

    Publication Year: 2012 , Page(s): 1 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (58 KB)  
    Freely Available from IEEE
  • International conference on communication in China: Advanced internet and cloud (AIC) — Program

    Publication Year: 2012 , Page(s): 1 - 2
    Save to Project icon | Request Permissions | PDF file iconPDF (75 KB)  
    Freely Available from IEEE
  • International conference on communication in China: Communication QoS and reliability (CQR) — Program

    Publication Year: 2012 , Page(s): 1 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (83 KB)  
    Freely Available from IEEE
  • International conference on communication in China: Communication theory and security (CTS) — Program

    Publication Year: 2012 , Page(s): 1 - 2
    Save to Project icon | Request Permissions | PDF file iconPDF (77 KB)  
    Freely Available from IEEE
  • International conference on communication in China: Optical networks and systems (ONS) — Program

    Publication Year: 2012 , Page(s): 1 - 2
    Save to Project icon | Request Permissions | PDF file iconPDF (80 KB)  
    Freely Available from IEEE
  • International conference on communication in China: Signal processing for communications (SPC) — Program

    Publication Year: 2012 , Page(s): 1 - 4
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • International conference on communication in China: Wireless communication systems (WCS) — Program

    Publication Year: 2012 , Page(s): 1 - 7
    Save to Project icon | Request Permissions | PDF file iconPDF (103 KB)  
    Freely Available from IEEE
  • International conference on communication in China: Wireless networking and applications (WNA) — Program

    Publication Year: 2012 , Page(s): 1 - 4
    Save to Project icon | Request Permissions | PDF file iconPDF (87 KB)  
    Freely Available from IEEE
  • Energy-efficient Cooperative Sensing Schedule for heterogenous users in Cognitive Radio Networks

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (166 KB) |  | HTML iconHTML  

    In this paper, we study the Cooperative Sensing Scheduling (CSS) problem for Cognitive Radio Network (CRN), from the perspective of balance between sensing performance and energy consumption. We place this problem in a practical scenario where both the primary users (PUs) and the secondary users (SUs) are heterogeneous: PU channels are different in terms of channel admission control, idle probability and channel capacity; SUs differs in sensing performance and sensing energy consumption. We formulate the CSS problem as a programming problem, whose optimal solution is proved to exist but takes considerable time and energy to reach. We then propose two heuristic algorithms, i.e., Centralized Algorithm and Multi-oligarch Algorithm, to obtain sub-optimal solutions. A Revised Initialization algorithm is also presented to improve the performance of these two algorithms. Simulation results show that the two algorithms achieve sub-optimal solutions with efficiency and effectiveness. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy minimization in two-way relay networks with digital network coding

    Publication Year: 2012 , Page(s): 7 - 11
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (179 KB) |  | HTML iconHTML  

    In a two-way wireless relay network, two nodes communicate with each other through a relay, and throughput is enhanced by the relay transmitting a linear combination of the messages received from the two sources either at the bit level (digital network coding) or the signal level (analog network coding). In this paper, we solve for the fraction of time resources allocated to each transmission mode in a DNC-based two-way relay network that minimizes total energy while ensuring queue stability at all nodes, for a given pair of random packet arrival rates. We also provide a queueing analysis of the relaying protocol designed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal space alignment and degrees of freedom for the two-cluster multi-way relay channel

    Publication Year: 2012 , Page(s): 12 - 17
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (188 KB) |  | HTML iconHTML  

    This paper investigates the degrees of freedom (DoF) of the multi-way relay channel. Specifically, the focus is on the case when there are two clusters and each cluster has two users that wish to exchange messages within the cluster with the help of the relay. It is assumed that the relay has N antennas and each of the users has M antennas. A DoF outerbound is derived and it is shown that for several scenarios of interests the DoF outerbound can be achieved. Specifically, when N ≤ M, a network coding based two-way relaying approach with time division multiplex access (TDMA) is sufficient to achieve the DoF outerbound. When M <; N ≤ 4/3M, the signal space alignment with multiple access and broadcast transmission between the clusters can achieve the DoF outerbound. It is also show that when N ≥ 4M, the DoF outerbound can be achieved by just using multiple access and broadcast transmission between the users. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Harnessing multiple wireless interfaces for guaranteed QoS in proximate P2P networks

    Publication Year: 2012 , Page(s): 18 - 23
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (308 KB) |  | HTML iconHTML  

    We consider the problem of content distribution to a group of cooperative wireless peer devices that desire the same block of information. The QoS metric is that peers are all required to receive the block by a fixed deadline, with a certain target probability. The block is divided into chunks, which are received via two methods that can be used simultaneously - (i) the B2P (base-station-to-peer) network: each peer has an unreliable, expensive, unicast channel to a cellular base station, and (ii) the P2P (peer-to-peer) network: peers can share the content over a free, lossless internal wireless broadcast network. Chunks are coded using random linear codes to alleviate the duplicate chunk reception issue. We seek an algorithm that can attain the QoS metric at the lowest cost of using B2P network. We transform the problem into two questions of (i) deciding which peer should broadcast on the P2P channel at each time, and (ii) how long B2P transmissions should take place. We use dynamic programming and queueing ideas to show that for large field sizes, a combination of Max-Rank-First and Non-min-Rank-First policies for P2P transmissions is optimal, and determine the stopping time for B2P transmissions using a Markov chain model. We provide performance bounds for finite field sizes, and illustrate our insights using simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achievable rates and energy efficiency in cognitive radio channels with sensing errors

    Publication Year: 2012 , Page(s): 24 - 29
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (206 KB) |  | HTML iconHTML  

    In this paper, achievable rates and energy efficiency in cognitive radio channels are analyzed in the presence of sensing errors. The cognitive secondary users are initially assumed to perform channel sensing and then enter into data transmission phase. Under sensing uncertainty and Gaussian primary user interference assumptions, additive disturbance experienced at the secondary receiver is seen to have a Gaussian mixture density. Achievable rates under such assumptions are examined and a closed-form rate expression is determined. An outage capacity formulation is also derived. Finally, energy efficiency is analyzed by investigating the minimum energy per bit and wideband slope expressions in the low-SNR regime. Through this analysis, tradeoffs and interactions between sensing parameters, sensing performance, throughput, transmission energy, and energy efficiency are identified. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay modeling in mobile cognitive radio networks

    Publication Year: 2012 , Page(s): 30 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (196 KB) |  | HTML iconHTML  

    In mobile cognitive radio networks, the expected delay for a packet to be delivered to its destination via a singlehop communication (without relaying) is a fundamental metric that can provide a guidance to multi-hop routing protocol design and route planning. In this paper, we characterize the impact of PU activities, spectrum availabilities, channel bandwidth, MAC access, SU mobilities, and interference, on cognitive radio network delays, and derive the expected delay for a packet to be directly delivered to its destination by incorporating both the waiting delay and the transmission delay. Simulation studies are performed to validate the effectiveness of our delay model. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beamforming based signal strengthening via underground acoustics sensor networks

    Publication Year: 2012 , Page(s): 36 - 40
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (263 KB) |  | HTML iconHTML  

    As the advances in sensing and wireless communication technologies, e.g., ZigBee, RFID, and WiFi, wireless sensor networks provide a promising opportunity to enhance underground environment monitoring, e.g., coal mine disaster monitoring. However, these wireless technologies suffer from signal distortion and short Non-Line-Of-Sight (NLOS). Furthermore, in underground disaster it is difficult to transmit sensing data to the ground via wireless signals. In this paper, we study beamforming based signal strengthening scheme in underground wireless sensor networks. Compare with traditional wireless signals, we use acoustic signal, which has several merits: first, it has much longer wavelength, which results to slower decay and longer propagation distance; second, it is resistant to signal distortion, which may help enhance the robustness of the underground monitoring system. Theoretical analysis is provided on both systematic and stochastic errors. Extensive simulations are carried out for theoretical verification. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaborative data dissemination in cognitive VANETs with sensing-throughput tradeoff

    Publication Year: 2012 , Page(s): 41 - 45
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (203 KB) |  | HTML iconHTML  

    Vehicular ad hoc networks (VANETs) have recently received considerable attentions for both safety and commercial applications. In this paper, we address popular content distribution (PCD) in VANETs, in which a popular file is downloaded by a group of on-board units (OBUs) passing by a roadside unit (RSU). Due to high speeds and channel fadings, the OBUs may not finish downloading the entire file from the RSU, but only possess several content pieces. In this paper, we propose a cooperative approach using coalitional graph game to establish a peer-to-peer (P2P) network among the OBUs, in which content pieces are exchanged to complete the file downloading process. Further, we adopt cognitive radio (CR) technique for implementing vehicle-to-vehicle (V2V) transmissions. Simulation results show that the proposed algorithm enjoys a better performance in various conditions, compared to the non-cooperative approach, where OBUs randomly response to content requests from other OBUs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Node capability aware resource provisioning in a heterogeneous cloud

    Publication Year: 2012 , Page(s): 46 - 50
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (605 KB) |  | HTML iconHTML  

    Although MapReduce, the core technology of cloud computing, lowers the barriers to enter the parallel computing, it introduces the other challenging research issue of improving its performance via properly resource provisioning. This issue is more complex in a heterogeneous cloud with multiple jobs since the nodes have various capability and workloads. In addition, the limited resources must be shared among all jobs. In this paper, this optimization problem, called Node Capability-aware Provisioning Problem (NCPP), is first formulated as a mathematical model. The purpose of NCPP is to minimize the job execution time which is influenced by node capability. However, NCPP is subject to the resource constraints on the nodes in a cloud. Moreover, the node Capability-Aware Resource Provisioner (CARP) is proposed based on Apache Hadoop to show its feasibility to solve NCPP in a systematic way. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost efficient datacenter selection for cloud services

    Publication Year: 2012 , Page(s): 51 - 56
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (774 KB) |  | HTML iconHTML  

    Many cloud services nowadays are running on top of geographically distributed infrastructures for better reliability and performance. They need an effective way to direct the user requests to a suitable datacenter, in a cost efficient manner. Previous work focused mostly on the electricity cost of datacenters. The approaches favor datacenters at locations with cheaper electricity prices. In this paper, we augment the picture by considering another significant cost contributor: network bandwidth. We propose to utilize statistical multiplexing to strategically bundle demands at different locations. The anti-correlation between demands effectively smooths out the aggregated bandwidth usage, thereby saving the bandwidth cost calculated by burstable billing methods that charge the peak bandwidth usage. We present an optimization framework that models the realistic environment and practical constraints a cloud faces. We develop an efficient distributed algorithm based on dual decomposition and the subgradient method, and evaluate its effectiveness and practicality using real-world traffic traces and electricity costs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Smart-blocking file storage method in cloud computing

    Publication Year: 2012 , Page(s): 57 - 62
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (258 KB) |  | HTML iconHTML  

    Cloud storage is one of the underlying services in cloud computing. However, there are some critical issues in file storage which should be resolved urgently, such as the blocking file storage. In order to solve the shortages of hot file storage and parallel computing support issues in fixed-blocking storage, we propose a smart-blocking file storage method in this paper. By setting up 6 grouping factors, the method can determine whether the file should be blocked or not automatically depending on the size of the file and the client bandwidth. The proposed method can block the file into similar size sub-blocks as large as possible when the file is judged to be blocked. Normally the size of the last sub-block is smaller than other similar sub-blocks. But the gap maintains within the size of the next smaller grouping factor. The Metadata server can address the hot files when the file is blocked. In addition, the proposed method also defines the file uniformity and the system uniformity to quantitatively describe the uniformity of sub-blocks in the file and in the whole system. Analysis and simulation demonstrate the proposed method has better system uniformity in file storage, the node load balance caused by hot file, and a large number of file fragments reduction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing time analysis of cloud services with retrying fault-tolerance technique

    Publication Year: 2012 , Page(s): 63 - 67
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (318 KB) |  | HTML iconHTML  

    This paper studies the processing time of cloud services using the retrying technique for fault tolerance. Specifically, the processing time of a cloud service is modeled and the probability distribution of the processing time is derived considering the effect imposed by retrying tasks in the case of service failures happening. As another important performance metric that can better reflect the Quality of Service (QoS) requirements of customers, the percentile of processing time is also studied. The percentile of processing time characterizes a threshold processing time so that a certain percentage of requests can be served in under the threshold value. Relationship between the task failure rate and percentile of processing time is studied through a numerical example. In addition, the percentile of processing time of cloud computing systems using the retrying technique is compared with that of systems using the check-pointing technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information as a service based architectural solution for WSN

    Publication Year: 2012 , Page(s): 68 - 73
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (482 KB) |  | HTML iconHTML  

    Wireless Sensors have seen a lot of applications in our daily lives in the recent years. The market has been flooded with high end consumer electronics using wireless sensor technology. However, most of the current technologies require the sensor to be in the vicinity of the end-user application. There has been some study in the techniques for sensor provisioning and sharing for the large number of existing Wireless Sensor Networks. Virtualization of Wireless Sensor Networks (WSNs) is a step forward in exposing these WSNs to large user base from remote locations. However, there is still a huge gap in bringing together information available from heterogeneous, distributed resources of Wireless Sensor Networks to a non-localized user. In this work, we utilize IaaS paradigm of Cloud Computing in virtualization of sensor networks which gives the flexibility of handling heterogeneous systems. The system also enables a smart device user to access information generated by Wireless Sensors through the cloud via SaaS based design. This allows the system to take common computational tasks to be hosted as a service through the cloud. It frees the smart device user from running heavy applications for data processing and storing. Thus, system provides the smart device user a Cloud Enabled Wireless Sensor Network infrastructure. The system architecture provides the necessary features for it to be scalable and flexible, ensuring reliable sensor data transfer and processing through cloud infrastructure. We also present a small test bed implementation of the system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.