<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Communications Letters, IEEE - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 4234 </description>
		<year>2009</year>
		<month>June     </month>
		<day>19</day>
		<item>
			<title><![CDATA[IEEE Communications Letters - front cover]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939327]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939327]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>c1</startPage>
			<endPage>c2</endPage>
			<fileSize>48</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Enhanced SNR estimates from direct-sequence spread-spectrum demodulator statistics]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939328]]></link>
			<description><![CDATA[Demodulator statistics are used in a binary directsequence spread-spectrum receiver to improve the performance of a well-known signal-to-noise ratio (SNR) estimate for ratios of the binary symbol energy to one-sided noise density that are below approximately 7 dB. The new estimate requires no pilot symbols, training sequences, data symbol decisions, or channel measurements, and it can be obtained prior to decoding.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939328]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>289</startPage>
			<endPage>291</endPage>
			<fileSize>189</fileSize>
			<authors><![CDATA[Boyd, S.W.;Pursley, M.B.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Security flaw of authentication scheme with anonymity for wireless communications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939329]]></link>
			<description><![CDATA[Recently, Wu et al. discussed some security flaws of enhanced authentication scheme with anonymity for wireless environments proposed by Lee et al. and showed how to overcome the problems regarding anonymity and backward secrecy. However, in the paper, we will show that Wu et al.¿s improved scheme still did not provide user anonymity as they claimed.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939329]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>292</startPage>
			<endPage>293</endPage>
			<fileSize>117</fileSize>
			<authors><![CDATA[Ji-Seon Lee;Jik Hyun Chang;Dong Hoon Lee;]]></authors>
		</item>
		<item>
			<title><![CDATA[Analysis of cognitive radio spectrum access with finite user population]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939330]]></link>
			<description><![CDATA[A new loss model for cognitive radio spectrum access with finite user population are presented, and exact solution for the model and its approximation for computation scalability are given. Our model provides the investigation of the delay performance of a cognitive radio system. We study the delay performance of a cognitive radio system under various primary traffic loads and spectrum band allocations.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939330]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>294</startPage>
			<endPage>296</endPage>
			<fileSize>193</fileSize>
			<authors><![CDATA[Wong, E.W.M.;Chuan Heng Foh;]]></authors>
		</item>
		<item>
			<title><![CDATA[A simple adaptive optimization scheme forIEEE 802.11 with differentiated channel access]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939331]]></link>
			<description><![CDATA[This letter proposes an adaptive scheme to optimize the system throughput of IEEE 802.11 with differentiated channel access ability. Due to the difficulty of estimating the number of active stations and that approaches based on the estimation may not converge reported in previous research, the proposed scheme is developed to maximize the system throughput without the requirement of station number information while providing service differentiation among different traffic classes. Specially, the scheme is simple to implement and it only requires to measure the time the channel is in idle and collision states separately. Performance evaluation results show that the scheme is effective in achieving near to the theoretical maximum system throughput.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939331]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>297</startPage>
			<endPage>299</endPage>
			<fileSize>301</fileSize>
			<authors><![CDATA[Mao, J.;Mao, Y.;Leng, S.;Bai, X.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Asymptotic performance analysis of amplify-and-forward cooperative networks in a nakagami-m fading environment]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939332]]></link>
			<description><![CDATA[This letter analyzes the performance of repetitionbased cooperative wireless networks using amplify-and forward relaying. The network consists of a source, R parallel relays, and a destination, and the channel coefficients are distributed as independent, non-identical, Nakagami-m. The approximated average symbol error rate (SER) is investigated. For sufficiently large SNR, this letter derives a close-form average SER when m is an integer. The simplicity of the asymptotic results provides valuable insights into the performance of cooperative networks and suggests means of optimizing them. We also use simulation to verify the analytical results. Results show that the derived error rates are tight approximations particularly at medium and high SNR.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939332]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>300</startPage>
			<endPage>302</endPage>
			<fileSize>210</fileSize>
			<authors><![CDATA[Maham, B.;Hjorungnes, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the impact of mobility and soft vertical handoff on voice admission control in loosely coupled 3G/WLAN networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939333]]></link>
			<description><![CDATA[Loose coupling between 3G and WLAN ensures flexibility and openness. However, providing an ubiquitousmobile voice service in a loosely coupled 3G/WLAN network requires both packet-level and call-level quality of service (QoS) guarantees using soft vertical handoff (SVHO) and call admission control (CAC). In this paper, we evaluate the impact of both SVHO and WLAN mobility on call blocking and dropping probabilities rederived for the integrated network. For this purpose, we propose a new multi-region mobility model that accurately estimate these probabilities under a resource-efficient dynamicthreshold SVHO compared to a standard static-threshold SVHO. Results show us that the resource-efficient SVHO blocks and drops much less voice calls than the static one when very low mean and high variability of multi-mode mobile station velocities are noticed. Therefore, resource-efficient SVHO implementations are highly recommended in these mobility environments.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939333]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>303</startPage>
			<endPage>305</endPage>
			<fileSize>262</fileSize>
			<authors><![CDATA[Ali, R.B.;Pierre, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multi-neighbor random key pre-distribution: a probabilistic analysis]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939334]]></link>
			<description><![CDATA[In this study, to obtain stronger connectivity, we propose and analyze a scheme extended by random key predistribution (RKP), which can work only in highly dense networks and require path construction. We propose a multi-neighbor random key pre-distribution scheme that releases these strong constraints. Accordingly, an establishment protocol and a probabilistic analysis in terms of dependency overhead are presented. We have made use of the measure of dependence to derive the exact value of the key connectivity probability.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939334]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>306</startPage>
			<endPage>308</endPage>
			<fileSize>193</fileSize>
			<authors><![CDATA[Wei-Shou Li;Tung-Shih Su;Wen-Shyong Hsieh;]]></authors>
		</item>
		<item>
			<title><![CDATA[A simple detect-and-forward scheme in fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939335]]></link>
			<description><![CDATA[In this letter, we introduce and analyze a Detect-and- Forward scheme for cooperative communications over fading channels based on the transmission of partial source-relay channel state information. The proposed scheme is simple to implement and its efficiency is demonstrated through constrained capacity calculation and throughput evaluation based on practical coding schemes.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939335]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>309</startPage>
			<endPage>311</endPage>
			<fileSize>177</fileSize>
			<authors><![CDATA[Benjillali, M.;Szczecinski, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On a buffering hypothesis in 802.11 analytic models]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939336]]></link>
			<description><![CDATA[Using detailed statistical analysis of data taken from simulations and test-bed experiments, we have recently reported the inappropriateness of a queue-decoupling approximation that has been implicitly adopted by many distinct authors to incorporate queueing behavior in analytic models of finite load 802.11 networks. In the present paper we show that this flawed hypothesis leads to network throughput prediction errors in the presence of stations with asymmetric offered loads. We suggest that care should be taking in drawing deductions from models that adopt this hypothesis and that further modeling innovation is necessary.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939336]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>312</startPage>
			<endPage>314</endPage>
			<fileSize>220</fileSize>
			<authors><![CDATA[Huang, K.D.;Duffy, K.R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Antenna location design for generalized distributed antenna systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939337]]></link>
			<description><![CDATA[A squared distance criterion for antenna location design in generalized distributed antenna systems (GDAS) is proposed to maximize the cell averaged ergodic capacity. The criterion requires the antenna port locations minimize the expectation of the squared distance between a randomly distributed user and the nearest antenna port. This is equivalent to codebook design in vector quantization. For uniform user distribution, we can easily derive analytical expressions for antenna locations. For more general user distribution, we can obtain numerical results using the codebook design algorithm. Applying the proposed criterion to circular-layout GDAS with uniform user distribution and linear cell with non-uniform user distribution, we achieve near optimal performance.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939337]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>315</startPage>
			<endPage>317</endPage>
			<fileSize>241</fileSize>
			<authors><![CDATA[Wang, X.;Zhu, P.;Chen, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Contention free inter-cellular slot reservation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939338]]></link>
			<description><![CDATA[A distributed reservation protocol tailored for cellular wireless networks is presented that facilitates contention free inter-cellular slot allocation and reservation. While reserved slots are protected from inter-cell interference by a busy burst enabled reservation protocol, collisions due to simultaneously accessed unreserved slots by neighboring cells are mitigated by means of resource partitioning patterns. Shifting these partitioning patterns over time allows each cell to successively probe all slots. This ensures that full frequency reuse is maintained, in the way that all cells may utilize the entire frequency band. In effect a contention free inter-cellular slot allocation policy is established that in a distributed manner dynamically controls the spatial reuse, in terms of concurrently accessed radio resources by neighboring cells.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939338]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>318</startPage>
			<endPage>320</endPage>
			<fileSize>197</fileSize>
			<authors><![CDATA[Auer, G.;Videv, S.;Ghimire, B.;Haas, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Primary network cognition with spatial diversity signature]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939339]]></link>
			<description><![CDATA[The identification of primary networks improves efficiency in dynamic spectrum access. We propose a spatial diversity signature for the primary signal detection, which exploits the structure of space-time or space-frequency codeword based on Alamouti scheme. The signature pattern informs the secondary user which network transmits the primary signal and enables to maintain an experiential database for each primary network. The proposed scheme provides reliable detection and network identification performance over frequency-selective fading channels in low signal-to-noise ratio regimes, without sacrificing the data rate of primary system.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939339]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>321</startPage>
			<endPage>323</endPage>
			<fileSize>272</fileSize>
			<authors><![CDATA[Dae-Young Seol;Tae-Won Yune;Gi-Hong Im;]]></authors>
		</item>
		<item>
			<title><![CDATA[Asymptotic spectral behavior of spectrally precoded OFDM signal with arbitrary input statistics]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939340]]></link>
			<description><![CDATA[In this letter, we study the asymptotic spectral behavior of the spectrally precoded orthogonal frequency-division multiplexing (SP-OFDM) signal with arbitrary input statistics. It is shown that all constraints and spectral precoders previously developed for SP-OFDM with independent and identically distributed and zero-mean data provide fast decaying spectral sidelobes for SP-OFDM with arbitrary input statistics.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939340]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>324</startPage>
			<endPage>326</endPage>
			<fileSize>168</fileSize>
			<authors><![CDATA[Hao-Ming Chen;Char-Dir Chung;]]></authors>
		</item>
		<item>
			<title><![CDATA[Sidelobe suppression in NC-OFDM systems using constellation adjustment]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939341]]></link>
			<description><![CDATA[In this letter, a new method for sidelobe suppression in non-contiguous orthogonal frequency division multiplexing (NC-OFDM) systems is proposed. Unlike the conventional approach, sidelobes are suppressed by iteratively adjusting the constellation points for the subcarriers that are close to the edges of the used bandwidth. The constellation points corresponding to the maximum sidelobe suppression are chosen for transmission. Simulation results show that the proposed algorithm yields good performance improvement in terms of sidelobe suppression, and does not have a significant impact on the peak-to-average power ratio (PAPR).]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939341]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>327</startPage>
			<endPage>329</endPage>
			<fileSize>269</fileSize>
			<authors><![CDATA[Li, D.;Dai, X.;Zhang, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance analysis of linear receivers in a MIMO relaying system]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939342]]></link>
			<description><![CDATA[We investigate the performance of linear receivers in a cooperative system which consists of a source, a decodeand- forward (DF) relay and a destination that are all multiantenna nodes. The relay uses zero-forcing (ZF) equalization whereas the destination employs maximum ratio combining (MRC) as well as ZF techniques. Considering that perfect channel state information is available at the relay and destination, and the fading is Rayleigh, we derive a closed-form approximate expression for the outage probability of the post-receiver signalto- noise ratio (SNR) of each data stream at the destination and analyze the diversity order. The validity of the outage probability expression is confirmed with the numerical results.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939342]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>330</startPage>
			<endPage>332</endPage>
			<fileSize>208</fileSize>
			<authors><![CDATA[Chalise, B.K.;Vandendorpe, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A geometric approach for turbo decoding of reed-solomon codes in QAM modulation schemes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939343]]></link>
			<description><![CDATA[This work studies the turbo decoding of Reed- Solomon codes in QAM modulation schemes for additive white Gaussian noise channels (AWGN) by using a geometric approach. Considering the relations between the Galois field elements of the Reed-Solomon code and the symbols combined with their geometric dispositions in the QAM constellation, a turbo decoding algorithm, based on the work of Chase and Pyndiah, is developed. Simulation results show that the performance achieved is similar to the one obtained with the pragmatic approach with binary decomposition and analysis.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939343]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>333</startPage>
			<endPage>335</endPage>
			<fileSize>184</fileSize>
			<authors><![CDATA[Roosen Runge, C.J.;Piqueira, J.R.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Gallager's decoding algorithm &#x0391; over high order modulations]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939344]]></link>
			<description><![CDATA[Gallager's decoding algorithm &#x0391;(GDA) for low density parity-check (LDPC) codes is of interest mainly due to its good performance with extremely low complexity. In this paper, we analyze GDA over 2<sup>m</sup>-ary pulse-amplitude modulation (2<sup>m</sup>-PAM). Firstly, we represent its average error probability by means of a recursion formula. We then define its threshold for additive white Gaussian noise (AWGN) channels and derive its stability condition. The bit-to-symbol mapping strategies have a strong influence on the performance of LDPC-coded modulation systems. Finally, we show that the bit-reliability mapping strategy proposed by Li and Ryan maximizes the threshold of the LDPCcoded modulation system with GDA over Gray-mapped 2<sup>m</sup>-PAM in the AWGN channel.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939344]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>336</startPage>
			<endPage>338</endPage>
			<fileSize>290</fileSize>
			<authors><![CDATA[Hyun-Koo Yang;Myung-Kyu Lee;Kyeongcheol Yang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Interleaver optimization of convolutional turbo code for 802.16 systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939345]]></link>
			<description><![CDATA[Convolutional turbo code (CTC) has been adopted as an optional channel coding scheme for wireless metropolitan area networks (WMAN) and digital video broadcasting (DVB) owing to its powerful error correction capability and flexibility. In spite of the fact that the internal interleaver of CTC mainly affects the characteristics of the code, interleaving parameters, especially for small and moderate block sizes, have not been fully optimized in terms of performance. In this paper, we investigate structural behavior of interleaving parameters and suggest several optimization methodologies for the CTC interleaver of 802.16 systems. Simulation shows that power gains up to 0.7 dB can be acquired at a target frame error rate of 10<sup>¿5</sup> by only substituting the newly optimized parameters for the current ones.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939345]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>339</startPage>
			<endPage>341</endPage>
			<fileSize>221</fileSize>
			<authors><![CDATA[Sung-Joon Park;Jun-Ho Jeon;]]></authors>
		</item>
		<item>
			<title><![CDATA[Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939346]]></link>
			<description><![CDATA[In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QCLDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939346]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>342</startPage>
			<endPage>344</endPage>
			<fileSize>339</fileSize>
			<authors><![CDATA[Jiang, X.;Lee, M.H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A proof of wavelength conversion not improving the lagrangian bound of the static RWA problem]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939347]]></link>
			<description><![CDATA[The fact that wavelength conversion hardly improves the performance of static routing and wavelength assignment (RWA) in Wavelength Division Multiplexing (WDM) networks has been observed in many previous studies. However, other than simulation results, until now there was no formal proof of such fact. In this paper, we formally prove that wavelength conversion does not improve the Lagrangian bound of the static RWA problem.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939347]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>345</startPage>
			<endPage>347</endPage>
			<fileSize>144</fileSize>
			<authors><![CDATA[Zhang, J.Y.;Wu, J.;Bochmann, G.V.;Savoie, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multivariate distributions for workload generation in video on demand systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939348]]></link>
			<description><![CDATA[In this letter we present an analysis of workload in a real video on demand service with the objective of generating more accurate input data for simulation models. As well as statistically characterizing key aspects in the server workload of the multimedia system, we consider their statistical dependencies.We propose a procedure to generate multivariate distributions using normal copulas in the video on demand system. Results show that the proposed method fits exactly the statistical distributions to the empirical data and matches the real correlation coefficients matrix.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939348]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>348</startPage>
			<endPage>350</endPage>
			<fileSize>271</fileSize>
			<authors><![CDATA[Melendi, D.;Garcia, R.;Paneda, X.G.;Garcia, V.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Recursive formulas for the moments of queue length in the BMAP/G/1 queue]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939349]]></link>
			<description><![CDATA[We present recursive formulas for the moments of the joint distribution of the queue length and the state of the underlying process in the BMAP/G/1 at the service completion and arbitrary time epochs.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939349]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>351</startPage>
			<endPage>353</endPage>
			<fileSize>145</fileSize>
			<authors><![CDATA[Dudin, A.;Klimenok, V.;Lee, M.H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A capture-aware access control method for enhanced RFID anti-collision performance]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939350]]></link>
			<description><![CDATA[This letter presents a novel anti-collision algorithm for Radio Frequency Identification (RFID) systems that drastically improve throughput performance via an intelligent access control for capture inducement. In order to induce the capture, our protocol attempts to divide tags into multiple groups depending on received signal strength, and allow only a selected pair of groups to join the contention process, in which the outcome of contention is more likely to lead to capture due to a significant difference in their signal strengths. Numerical results show that our proposed algorithm significantly outperforms the existing approaches in terms of throughput.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939350]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>354</startPage>
			<endPage>356</endPage>
			<fileSize>179</fileSize>
			<authors><![CDATA[Shin, W.J.;Kim, J.G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An improved ranging algorithm for ad-hoc relay networks over IEEE 802.16 OFDMA systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939351]]></link>
			<description><![CDATA[We present a novel ranging scheme with a specific notification code to reduce the complexity of ranging detection while providing a sufficient ranging opportunity for small ranging success time (RST) in ad-hoc relay (AHR) networks over IEEE 802.16 OFDMA systems. Computational complexity and RST are analyzed. The simulation results show that the proposed scheme outperforms the conventional one and can be a good choice for ranging protocol in battery-powered AHR networks.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939351]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>357</startPage>
			<endPage>359</endPage>
			<fileSize>204</fileSize>
			<authors><![CDATA[Woo-Geun Ahn;Hyung-Myung Kim;]]></authors>
		</item>
		<item>
			<title><![CDATA[A simple framework of utility max-min flow control using sliding mode approach]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939352]]></link>
			<description><![CDATA[Motivated by the limitations of current optimal flow control approach, we develop a new utility max-min flow control framework using classic sliding mode control. It consists of a source algorithm and a binary congestion feedback mechanism, in which only the sources with the highest utility at each congested link are required to reduce their transmission rates. It can be directly applied to a multi-service network with heterogeneous applications that have different QoS characteristics. The proposed framework achieves the utility max-min fairness among applications efficiently in the sense of low overhead and rapid convergence. Rigorously, the system is proven to be asymptotically stable by means of Lyapunov¿s theorem.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939352]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>360</startPage>
			<endPage>362</endPage>
			<fileSize>237</fileSize>
			<authors><![CDATA[Jiong Jin;Wei-Hua Wang;Palaniswami, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A novel and efficient unlinkable secret handshakes scheme]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939353]]></link>
			<description><![CDATA[An unlinkable secret handshakes is a two-party authentication protocol which protects the privacy of parties¿ affiliation and identity to everyone except for the intended parties. However, we find that the latest solution proposed by Jarecki et al. is not very efficient. In particular, each party requires O(log &#x003B7;) exponentiations where &#x003B7;is the number of parties affiliated with a single organization. In this paper, we propose a novel unlinkable secret handshakes protocol. Compared with Jarecki et al¿s scheme, our proposal is simple intuitionally and requires only constant exponentiations.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939353]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>363</startPage>
			<endPage>365</endPage>
			<fileSize>160</fileSize>
			<authors><![CDATA[Huang, H.;Cao, Z.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A shadow zone aware routing protocol for acoustic underwater sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939354]]></link>
			<description><![CDATA[Shadow zone and delay aware routing (SZODAR) scheme is a practical and distributed protocol that can find routes around shadow zones. In SZODAR, sensor nodes can raise or lower their acoustic transceivers to a depth such that shadow zones of the neighboring nodes are avoided. This paper presents the protocol working principle and preliminary calculations of the engineering parameters.]]></description>
			<pubDate><![CDATA[May  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4939326&arnumber=4939354]]></guid>
			<volume>13</volume>
			<issue>5</issue>
			<startPage>366</startPage>
			<endPage>368</endPage>
			<fileSize>192</fileSize>
			<authors><![CDATA[Nguyen, S.T.;Cayirci, E.;Yan, L.;Rong, C.;]]></authors>
		</item>
	</channel>
</rss>