By Topic

Communication Technology (ICCT), 2012 IEEE 14th International Conference on

Date 9-11 Nov. 2012

Filter Results

Displaying Results 1 - 25 of 259
  • Improving video conferencing application quality for a mobile terminal through cognitive radio

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

    Cognitive radio (CR) is a form of wireless communication in which a transceiver can intelligently detect which communication channels are in use and which are not, and instantly move into vacant channels while avoiding occupied ones. This optimizes the use of available radio-frequency (RF) spectrum while minimizing interference to other users. In this paper, we propose a new approach which uses the CR for improving video conferencing application quality for a cognitive radio mobile terminal (CRMT). We also show through experimentation the interest of our approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing and bandwidth management for Wireless Mesh Networks using ant intelligence

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

    As bandwidth is a scarce resource in Wireless Mesh Networks (WMNs), a primary challenge of such networks is to design an effective bandwidth management mechanism. This paper presents a new scheme for bandwidth management using TOPSIS method utilizing a collection of mobile agents or “ants” to perform Quality of Service (QoS) provisioning by dynamic management of bandwidth. We introduce ANTTOPSIS to ensure better performance by collecting and disseminating necessary routing and bandwidth information as the ants travel throughout the network. We argue that ANTTOPSIS scheme is a suitable approach to support end-to-end QoS in WMNs where network topology and node connectivity are varying with time. Using explorer agents and reservation agents, ANTTOPSIS delivers adaptive services to support flow establishment and restoration. Moreover we discuss how ANTTOPSIS fits into our broader vision of flow management for WMNs. The result of simulation displays an improved performance in terms of bandwidth utilization, packet delivery ratio and delay. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techno-economic analysis of UMTS900 and UMTS2100 for rural connectivity in Tanzania

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

    Rural areas of the developing countries lack Information and Communication Technology (ICT) infrastructures such as access network, also known as last mile connectivity, to deliver ICT services. The lack of connectivity is due to high cost of implementing ICT infrastructures. Wireless technologies are envisioned as candidates for rural connectivity. They are not only easier and faster to deploy but also cheaper than the wired technologies. This paper presents a techno-economic analysis of two wireless technologies in Tanzania, called third generation (3G) implemented at 900MHz and at 2100MHz frequency bands. Objectives of techno-economic analysis are to investigate economic feasibility and to determine a cost effective option between the two connectivity options. Results show that, 3G at 900HMz is a feasible and cost - effective connectivity technology in Tanzania. These results can be generalized to other developing countries, since rural areas pose similar characteristics with regard to ICT infrastructure development. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Radix-tree based spectrum allocation model for cognitive radio networks: Maximizing network capacity

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

    Cognitive radio (CR) technology is a promising technology that provides opportunistic access to free channels for secondary users (SUs), and enhances the spectrum efficiency [1]. In this paper, we present a novel capacity-aware spectrum allocation model for cognitive radio networks. We first modeled interference constraints based on the interference temperature concept and let the SUs to increase their transmission power until the interference temperature on one of their neighbors exceeds its interference temperature threshold. The, knowing the potential links SINR and bandwidth, we calculated links capacity based on Shannon formula and modeled the co-channel interference between potential links on each channel using an interference graph. Finally, we formulated a spectrum assignment problem in the form of a binary integer linear problem (BILP) to find an optimal feasible set of simultaneously active links among all the potential links in an interference graph in a way that overall network capacity would be maximized. To reduce complexity, we also formulated this problem using genetic algorithm (GA) to find a sub optimal solution in less time. We also proposed a new radix tree based algorithm that, by removing the sparse areas in search space, leads to a considerable decrease in time complexity of spectrum allocation problem as compared to BILP algorithm. Simulation results have shown that this proposed model leads to a considerable improvement in overall network capacity as compared to genetic algorithm. We also showed that maximizing the number of active links between SUs as an objective function does not necessarily maximize the network capacity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel two-stage entropy-based spectrum sensing scheme in cognitive radio

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

    Spectrum sensing is a key problem in cognitive radio. However, traditional detectors become ineffective when noise uncertainty is severe. It was shown that the entropy of Gauss white noise is constant in the frequency domain, and a robust detector based on the entropy of spectrum amplitude was proposed. In this paper a novel detector is proposed based on the entropy of spectrum power density, and its performance is better than the previous scheme with less computational complexity. Furthermore, to improve the reliability of the detection, a two-stage entropy-based spectrum sensing scheme using two-bit decision is proposed, and simulation results show its superior performance with relatively low computational complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved certificateless authenticated key agreement protocol

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

    Recently, Mokhtarnameh, Ho, Muthuvelu proposed a certificateless key agreement protocol. In this paper, we show that their protocol is unsecured against a man-in-the-middle attack. In addition, the authors claimed that their scheme provides a binding long-term public key with a corresponding partial private key. In fact, their protocol does not achieve the binding. We propose an improved key agreement protocol based on the protocol proposed by Mokhtarnameh et al. The improved protocol can resist the man-in-the-middle attack as well as satisfy the desired security properties for key agreement. It truly achieves the one-to-one correspondence between the long-term public key and the partial private key of a user. Compared with the other related protocols, the protocol has advantages in both security and computational efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel MIMO channel model for high speed railway system

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

    This paper focuses on the Geometry based Stochastic Channel Model (GSCM) and its application in high speed railway (HSR) multiple-input multiple-output (MIMO) systems. Different probability distribution functions (PDFs) of scatterers are studied and simulation results show that scatterers in Gaussian distribution make the best approximation to the realistic power delay profile (PDP) and power azimuth spectra (PAS). Additionally, the impacts of different scattering area shapes on the PDP and PAS in high speed railway scenario are simulated. Based on the conclusions above and existing measurement data, a novel channel model is established with local and far scatterer clusters for high speed railway scenario. The simulation results verify that our model is realistic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel scheduling scheme for finite buffer service in time-varying channels

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

    In this paper, a new scheduling scheme is proposed for finite buffer services in time-varying wireless channel environments. With the proportional fair (PF) principle, we propose the use of a time factor (TF) to guarantee the stability of the system as well as shortening the average user delay. The proposed PF-TF algorithm is parametrically adjustable that can be applied under different channel conditions. Simulation results suggest that the proposed scheme is able to achieve a shorter delay than conventional algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A vanet-oriented routing protocol for intelligent taxi-call systems

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

    This paper proposes a lightweight routing protocol which can satisfy the city taxi-call application. The proposed routing protocol predicts and updates the routing information and uses the greedy algorithm based on hop distance to find routes to destination quickly. The proposed routing protocol performs well in taxi-call applications. We do comprehensive simulations to evaluate the proposed protocol by varying the node number and node velocity. The result proves its efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Video quality assessment and QoE-driven adjustment scheme in wireless networks

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

    With the further development of video, the assessment and optimization of video Quality of Experience (QoE) have become an important issue. Meanwhile, QoE is the main influential factor determining the success of video applications. The paper proposes a novel QoE real-time assessment and QoE-driven Send Bitrate (SBR) adjustment scheme. Firstly, in order to assess the user experience, the NS2 simulation platform is used to generate video streams and the Evalvid tool is adopted to evaluate QoE of these streams, which takes the video attributes and network parameters into account to get the Peak Signal to Noise Ratio (PSNR) value that is mapped to Mean Opinion Score (MOS) to represent QoE. Then we obtain an assessment model through neural networks. Secondly, based on the obtained model, the server provides the optimal video according to the network condition, namely adjusting the video SBR by the PSNR index and predicted bandwidth. The proposed scheme performs well in real-time video QoE assessment and makes the video server adjust video SBR, which matchs the network conditions and maximizes video QoE. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical routing and path recovery algorithm in home 6LoWPAN networks

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

    HiLow is a well-known hierarchical routing protocol used in 6LoWPAN, which has some drawbacks in accessibility, efficiency and path recoverability. In this paper, we have improved the HiLow protocol in aspects of interconnection between Internet and 6LoWPAN and network path recovery mechanism. Using an address mapping table to store both EUI-64 address and 16 bit short address, Internet nodes can access the 6LoWPAN nodes by an IPv6 address, which is generated by the EUI-64 address and IPv6 prefix. In addition, the common neighbor nodes are added into the neighbor table to improve routing efficiency between neighbors and path recovery mechanism is proposed for our modified protocol. Due to the benefits of additional data structure and path recovery mechanism, our protocol improves the routing efficiency and effectively reduce the cost for network reorganization caused by FFD (Full Function Device) failures and RFD (Reduced Function Device) failures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving routing protocols of WSN in WHSN

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

    Battery consumed node is typical in wireless sensor networks, but in the newly developed applications in household, we have found a new character that some nodes could be deployed inside the household appliances and use AC as its power supply, which are called as plug-in nodes. Unlike battery consumed nodes, they could transmit data without the limitation of energy consumption, which is a key challenge of traditional WSNs. In this paper, we introduced the wireless home sensor networks with the plug-in nodes. By taking the advantage of plug-in nodes for energy consumption free, we discussed and modified traditional protocols in WHSN, such as LEACH, SPIN and DD, brought out LEACH-Pi, SPIN-Pi and DD-Pi, by modifying their voting, assessment, and routing algorithms to greatly improve their performance, life time and response time of network, and energy consume. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of energy detection over double-Rayleigh fading channel

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

    The problem of spectrum sensing using energy detection over double-Rayleigh fading channel was addressed in this paper. Closed-form expressions of detection probability with and without diversity were derived based on probability density function method. The related integral involving Marcum-Q function was evaluated by using alternative representations. The validity of theoretical analyses was shown by comparing numerical results with Monte-Carlo Simulations. The results indicate that the detection performance for double-Rayleigh fading is even worse than other fading, which can be improved by diversity. These results help quantify and understand the achievable performance when double-Rayleigh fading happens. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference alignment for overlay cognitive radio based on game theory

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

    In cognitive radio (CR), interference alignment (IA) is an effective approach to eliminate the interference of secondary users (SUs). Thus, SUs can share the spectrum with primary users (PUs). In this paper, IA for overlay CR is discussed, and a time resource auction scheme based on game theory is proposed, which uses the given related equilibrium functions to balance the benefits of PU and SUs, meanwhile the time resource can be reasonably distributed. Simulation results are presented to show the effectiveness of the proposed scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel threshold key management scheme based on bilinear pairing without a trusted party in Mobile Ad Hoc Network

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

    In our scheme, the master key of Mobile Ad Hoc Network (MANET) is generated by all participants collectively, but it is not like most current scheme generated by Key Generation Center (KGC). Every participant can calculate the system public key, but any participant can not recover the system secret key without any other t-1 participants' help. Our elliptic curve cryptography (ECC)-based threshold polynomial is intrinsically safer and easier to implement than the current mainstream threshold polynomial based on prime-field. Our scheme is verifiable, it means that all participants must provide confidential and verifiable information λij for each other. Additionally, we design a new bilinear pairing based signcryption scheme, which is efficient in terms of both the communication overhead and the computational requirement. Security analysis results show that our scheme is more secure, verifiable and efficient compared with the previous schemes on Mobile Ad Hoc Network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random user selection method for LPI in multiuser MISO-OFDMA system

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

    The problem of wireless security for the downlink of MISO-OFDMA systems operating over a frequency-selective channel is investigated. By exploiting the dimensions provided by multiuser MISO-OFDMA systems for random user selection and beamforming, a novel physical-layer security method is to achieve low probability of interception (LPI), which let the attacker's equivalent channel be a random one, is proposed in the paper. Meanwhile, hypothesis testing is used to determine which subcarriers belong to him by any intended user without user selection information. Numerical results have verified the effective-ness. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HPAP: High precision active probe for path round-trip delay measurement

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

    Path round-trip delay, i.e., path round-trip time (RTT), is one of the key metrics for evaluating network performance, also plays a crucial role in several overlay network construction protocols, peer-to-peer (P2P) applications, etc. In this paper, we present HPAP, a high precision active probe for path RTT measurement, which is based on Berkeley Packet Filter (BPF) technology. When the measuring probe packets arrive at or depart from the Network Interface Card (NIC), the BPF can capture them quickly, and can mark the timestamps immediately. The HPAP can calculate the path RTT value according to these timestamps. By this method, the time-stamp position can be removed from application program to data link layer of TCP/IP stack. The experimental results show that the new scheme can nearly eliminate the location error, and can practically improve the path RTT measuring accuracy. This scheme has low-cost in the investment, so it can be applied widely. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Survivability analysis of wireless bypass-based protection for Passive Optical Network

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

    Network survivability is becoming a key issue in Passive Optical Networks (PONs). In conventional PONs, optical protection is applied to improve the network survivability. However, optical protection may be considered cost-prohibitive for cost-sensitive access networks. In this paper, by establishing wireless links among ONUs, we propose a novel wireless bypass-based protection method which has two schemes: intra-domain wireless bypass and inter-domain wireless bypass. We then present the survivability model of wireless bypass-based protection, and evaluate the survivability model by means of probabilistic analysis, taking both optical and wireless segments into account simultaneously. We also compared the survivability with full optical protection, and our results highlight that the bypass-based protection method perform an improvement in survivability. In addition, we quantitatively analyze the impact of probability of fiber link failure, wireless bypass links and wireless bypass distance on the network survivability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of PAPR reduction in OFDM system based on clipping technique with EVM

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

    The resistance to peak-to-average power ratio (PAPR) for orthogonal frequency division multiplexing (OFDM) communication system is analyzed and implemented on the basis of clipping technique. As two main quality criteria, error vector magnitude (EVM) and out-of-band power spectrum density (PSD) attenuation are adopted to check up the performance of clipping operation. For an OFDM system with 2MHz bandwidth and 340MHz center frequency, we calculate and compare PAPR reduction in the cases of different peak power clipping thresholds, where the average power of OFDM symbols is normalized to 0dB. The simulation results show that the peak power clipping threshold in the range of 6-8dB is suitable for the special OFDM system. In that case, the EVM is less than 3.5% and PSD attenuation curve approaches that without clipping operation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum transmit beamforming design for multiple input single output frequency-selective channels with per-antenna power constraint

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

    In transmit beamforming (BF) systems, one of key issues is how to design an appropriate BF vector to optimize the performance of the whole system. This paper addresses the transmit BF design problem for cyclic prefixed (CP) transmissions over Multiple Input Single Output (MISO) frequency-selective channels under per-antenna power constraints (PPC).In previous studies, several methods have been used to solve this problem, however, all lead to suboptimal solutions. In an attempt to get the optimal solution, we propose an efficient algorithm based on barrier method, which performs closely to the optimal total power constraint (TPC) solution and significantly outperforms the existing PPC solutions. Moreover, the simulation results also show that the proposed algorithm is robust on the different antenna power allocation and antenna number. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Best relaying protocol selection for cooperative networks

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

    Cooperative communication has been recently proposed in wireless communication systems for exploring the inherent spatial diversity in relay channels. In this work we investigate the performance of selecting best protocol between amplify and forward (AF) and decode and forward (DF) in multiple relay networks. In the selection scheme, the best protocol between AF and DF is selected depending on source-relay links qualities. Particularly we derive the asymptotic closed form expression for the symbol error rate (SER) for the system under studied and show that our scheme maintains full diversity order and is better than fixed protocols. Numerical results are also presented to validate the theoretical analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic clustering for multicell cooperative processing in mobile communications

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

    Multicell cooperative processing (MCP) has been recognized as a promising technique for enhancing the spectral efficiency of future wireless systems. However, MCP inevitably requires increased radio feedback and backhaul overhead. Therefore, only a limited number of base stations can cooperate for an affordable system complexity in practice. In this paper, we propose a novel dynamic clustering scheme for the cellular system incorporating MCP. The clusters are formed dynamically from users' point of view to minimize the co-channel interference, and are allowed to be overlapped. The objective of the clustering scheme is rate maximization of the cell-edge users. Compared with some conventional cooperation clustering schemes, the proposed scheme has proven to provide a good trade-off between user rates and overhead. Simulation results show that the user rates of the proposed scheme with a cluster consisting of two sectors can reach up to 95% of its upper bound. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel modulation classification algorithm based on daubechies5 wavelet and fractional fourier transform in cognitive radio

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

    Modulation classification is one of the most important tasks in signal waveform identification. In this paper, We address the problem of digital modulation classification in Additive White Gaussian Noise and Rayleigh fading channel. In order to classify digital modulation signal reliably, we propose an algorithm for automatic modulation recognition in this paper. We verify this algorithm using higher order statistical moments of wavelet transform and Fractional Fourier Transform as a feature set. Through this algorithm, we can discriminate 2ASK 2FSK BPSK and 16QAM without any prior signal information. In addition pre-processing and features subset selection using principal component analysis will reduce the network complexity and the recognizers performance is no significant decrease. The performance of the identification scheme is investigated through the simulations. Simulation results show that the performance of the proposed modulation classifier is superior to other existing signal classifiers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel beamforming method for multiple peer-to-peer relay networks

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

    One multi-antenna relay can support multiple peer-to-peer communications in AF (amplify-and-forward) manner. All sources transmit their signals to the relay in the first time slot. In the second time slot, the relay multiplies its received signal with an amplifying matrix, and broadcasts it to the destinations. We propose a novel method to specify the amplifying matrix in which we decompose the amplifying matrix into two parts. The first part is an MMSE (minimum mean square error) receiving matrix, and the second part is a beamforming matrix based on the maximization of VSLNR (virtual signal-to-leakage-plus-noise ratio). To apply our proposed algorithm, we first propose two simple power allocation methods: EPA (equal power allocation) and EGA (equal gain allocation), and then propose an optimization method using projection gradient algorithm. Numerical results show that our proposed algorithm outperforms the existing ZFBF (zero-forcing beamforming) algorithm and the optimal power allocation improves system performance significantly under asymmetric channel conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel resource allocation schemes in LTE PDCCH

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

    The Physical Downlink Control Channel (PDCCH) is used to signal dynamic resource assignment information in Long Term Evolution (LTE) system. In the presence of numerous active users, their control channel resource location based on PDCCH blind decoding mechanism is determined by the Radio Network Temporary Identifier (RNTI) which is allocated to them by eNodeB when they first access to the cell. This paper presents optimal and efficient resource allocation algorithms based on new RNTI allocation scheme for PDCCH. Three evaluation indexes of the proposed scheduling algorithms are evaluated through Monte-Carlo simulation. Simulation results indicate that system performance (like block probability, CCE utilization and allocation delay time) can be improved significantly with our proposed algorithms. View full abstract»

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