<?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>2012</year>
		<month>February </month>
		<day>10</day>
		<item>
			<title><![CDATA[Table of contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6146703]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6146703]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>c1</startPage>
			<endPage>c4</endPage>
			<fileSize>61</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Staff List]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6146704]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6146704]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>c2</startPage>
			<endPage>c2</endPage>
			<fileSize>42</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Modeling Session Completion in Sparse Vehicular Internet Access]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109201]]></link>
			<description><![CDATA[It is costly to provide full AP coverage on roads due to the limited range of radio transmission. To address this issue, whether a vehicle can complete all data transmission before it leaves an AP's coverage area becomes an essential topic in sparse WiFi deployment. This letter establishes an analytical model to estimate the session completion for sparse vehicular Internet access. We take various network parameters into consideration, such as the vehicle density, the bandwidth, the transmission range of an AP, and the data volume delivered in each vehicular session.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109201]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>161</startPage>
			<endPage>163</endPage>
			<fileSize>296</fileSize>
			<authors><![CDATA[Sou, Sok-Ian;Ho, Hsiu-Fang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multiuser Detection with Sparse Spectrum Gaussian Process Regression]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095289]]></link>
			<description><![CDATA[Multiuser detection in direct-sequence code-division multiple access (DS-CDMA) systems can be implemented by using Gaussian process (GP) for regression in the sense of minimum mean square error criterion. In this Letter we investigate the application of sparse spectrum Gaussian process (SSGP) to the multiuser detection problem. The key point of the SSGP is that the sparsity of spectral representation of Gaussian process leads to an algorithm with much lower complexity than the full GP, while keeping almost the same bit error rate (BER) for DS-CDMA systems. Experimental results validate our proposed SSGP based multiuser detection method. It achieves greater efficiency and good BER performance.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095289]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>164</startPage>
			<endPage>167</endPage>
			<fileSize>202</fileSize>
			<authors><![CDATA[Wang, Shaowei;Gu, Hualai;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimal Upward Scaling of Minimum-TSC Binary Signature Sets]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095290]]></link>
			<description><![CDATA[We consider upward scaling an overloaded min-TSC binary signature set and propose an optimal solution based on improved sphere decoding algorithm. Instead of previous suboptimal approach, we are guaranteed to find the optimal maximum-likelihood (ML) searching result with low complexity.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095290]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>168</startPage>
			<endPage>171</endPage>
			<fileSize>241</fileSize>
			<authors><![CDATA[Wei, Lili;Chen, Wen;]]></authors>
		</item>
		<item>
			<title><![CDATA[Asymptotically Optimum Energy Profile for Successive Interference Cancellation in DS-CDMA under a Power Unbalance Constraint]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109196]]></link>
			<description><![CDATA[A new Ordinary Differential Equation (ODE) governing the SNIR evolution of a Successive Interference Canceller (SIC) for DS-CDMA is derived when the number of users tends to infinity and all users share the same channel encoder. Using Variational Calculus, this ODE is applied to obtaining the energy profile that maximizes the average spectral efficiency when a constraint on the power unbalance (maximum power to minimum power ratio) of received users is enforced. The conditions for extremality of the optimum energy profile are established in terms of the common encoder's Packet Error Rate (PER) function.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109196]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>172</startPage>
			<endPage>175</endPage>
			<fileSize>220</fileSize>
			<authors><![CDATA[Sala, Josep;Rey, Francesc;Villares, Javier;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance of Spatial Modulation in the Presence of Channel Estimation Errors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095295]]></link>
			<description><![CDATA[This work investigates the negative effects of channel estimation errors on the performance of spatial modulation (SM) when operating over flat Rayleigh fading channels. The pairwise error probability of the SM scheme is derived in the presence of channel estimation errors and an upper bound on the average bit error probability is evaluated for M-PSK and M-QAM signalling. It is shown via computer simulations that the derived upper bound becomes very tight with increasing signal-to-noise ratio (SNR) and the SM scheme is quite robust to channel estimation errors.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095295]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>176</startPage>
			<endPage>179</endPage>
			<fileSize>297</fileSize>
			<authors><![CDATA[Basar, Ertugrul;Aygolu, Umit;Panayirci, Erdal;Poor, H. Vincent;]]></authors>
		</item>
		<item>
			<title><![CDATA[Recursive Bit Metric Generation for PSK Signals with Gray Labeling]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109194]]></link>
			<description><![CDATA[This letter presents a novel bit metric generation approach for phase shift keying (PSK) with Gray labeling. This approach generates bit metrics recursively based on a simplified function which can reduce the computational complexity greatly at a very small bit error rate (BER) performance loss. At last, the generalized mutual information (GMI) is used to demonstrate the good performance of this method in bit-interleaved coded modulation (BICM) systems.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109194]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>180</startPage>
			<endPage>182</endPage>
			<fileSize>325</fileSize>
			<authors><![CDATA[Wang, Lei;Xu, Dazhuan;Zhang, Xiaofei;]]></authors>
		</item>
		<item>
			<title><![CDATA[Position-Based FSK Scheme Toward Power-Saving Transmission in LECIM Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109199]]></link>
			<description><![CDATA[This letter introduces a new FSK modulation for low energy critical infrastructure monitoring (LECIM) networks, where it is crucial to facilitate low energy operation necessary for multi-year battery life of endpoint devices. By increasing the modulation order with on-off signaling based on position (or time-shift), the resulting position-based FSK scheme enables power-saving transmission at the endpoint device. Theoretical analysis and simulation results verify that the proposed modulation is suitable for LECIM networks.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109199]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>183</startPage>
			<endPage>185</endPage>
			<fileSize>412</fileSize>
			<authors><![CDATA[Oh, Mi-Kyung;Choi, Sangsung;Kwon, Young-Hyoun;]]></authors>
		</item>
		<item>
			<title><![CDATA[On Distribution of SaS Noise and its Application in Performance Analysis for Linear Rake Receivers]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093993]]></link>
			<description><![CDATA[In this letter, we exploit the Cauchy-Gaussian mixture model to approximate the symmetric &#x03b1;-stable (S&#x03b1;S) distribution. An optimal mixture ratio that only depends on &#x03b1; is derived from minimizing the average approximation error. We then consider the signal detection with a linear Rake receiver and present an approximate expression for error performance. Furthermore, the performances of several typical linear Rake techniques are compared analytically. Numerical results are provided to corroborate the proposed studies.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093993]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>186</startPage>
			<endPage>189</endPage>
			<fileSize>221</fileSize>
			<authors><![CDATA[Fan, Lisheng;Li, Xutao;Lei, Xianfu;Li, Wei;Gao, Feifei;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Accuracy Enhanced IEEE 1588 Synchronization Protocol for Dynamically Changing and Asymmetric Wireless Links]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6029936]]></link>
			<description><![CDATA[IEEE 1588 is the clock synchronization protocol for networked measurement and control system, and widely used for both wire-line and wireless network environments. IEEE 1588 was initially considered for wire-line networks, but its application is extended to wireless network especially for indoor wireless networks which can not use Global Positioning System (GPS) technology. However, the conventional IEEE 1588 assumes symmetric/asymmetric fixed data rate links, and time accuracy errors are caused for dynamically changing wireless links. We propose an enhanced synchronization algorithm for IEEE 1588 in order to compensate the offset error due to the dynamically changing data rate of the wireless link and to enhance the accuracy of time.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6029936]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>190</startPage>
			<endPage>192</endPage>
			<fileSize>311</fileSize>
			<authors><![CDATA[Lee, Sungwon;Lee, Seunggwan;Hong, Choongseon;]]></authors>
		</item>
		<item>
			<title><![CDATA[Hotspot Gravitation Mobility Model]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093912]]></link>
			<description><![CDATA[Mobility model, which is usually inspired by some characteristics of users' behavior, is an important technique for performance evaluation and simulation of mobile networks. In this paper, a gravitation-based mobility model, namely hotspot gravitation mobility model (HGMM) inspired by the behavior that a user tends to move towards to the nearer hotspot, is proposed to model man's general movement. We concern with the determinate rules underlying uncertain movement behavior for most of people in HGMM. Other two existing mobility models are taken as the comparisons. Then, the trajectory and final distribution of users are illustrated via simulation, in which HGMM shows its advantage on the target of movement route and the non-rectilinear trajectory in large scale. In addition, the remainder issues for HGMM are discussed at the end.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093912]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>193</startPage>
			<endPage>195</endPage>
			<fileSize>271</fileSize>
			<authors><![CDATA[Du, Zhenguo;Hong, Peilin;Xue, Kaiping;]]></authors>
		</item>
		<item>
			<title><![CDATA[Improved and Extended Range Scale Algorithm for Wireless Cellular Location]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093913]]></link>
			<description><![CDATA[The range scale algorithm (RSA) proposed in 2004 is a constrained optimization problem with only three base stations (BSs). In this letter, by introducing a new variable to replace the square term, the quadratic objective function of the constrained optimization problem in RSA is turned into a linear objective function. Then the computational complexity is reduced and the performance is improved. Moreover, when the number of BSs is larger than three, we construct a new objective function and give the corresponding constraints. So the RSA is extended for more BSs and the performance of positioning is improved significantly. Simulation results demonstrate that our proposed algorithms improve the location accuracy over traditional algorithms in different Non-line-of-sight (NLOS) environments.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093913]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>196</startPage>
			<endPage>198</endPage>
			<fileSize>207</fileSize>
			<authors><![CDATA[Wu, Shixun;Li, Jiping;Liu, Shouyin;Chong, Jong-Wha;]]></authors>
		</item>
		<item>
			<title><![CDATA[Efficient Iterative SIC and Detection for Two-Path Cooperative Block Transmission Relaying]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109191]]></link>
			<description><![CDATA[In this paper, we present a block transmission for an amplify-and-forward two-path relaying in frequency-selective block fading channel. In particular, this paper focuses on an efficient and yet robust iterative successive interference cancellation (SIC) incorporating various diversity detections, after performing a complete interrelay interference (IRI) cancellation at destination. The performance results are provided to verify the superiority of the proposed iterative SIC and detections compared to a conventional SIC and detection.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109191]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>199</startPage>
			<endPage>201</endPage>
			<fileSize>256</fileSize>
			<authors><![CDATA[Baek, Jong-Seob;Seo, Jong-Soo;]]></authors>
		</item>
		<item>
			<title><![CDATA[Dynamic Duty-Cycle Scheduling Schemes for Energy-Harvesting Wireless Sensor Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095298]]></link>
			<description><![CDATA[In this letter, we propose two novel dynamic duty-cycle scheduling schemes (called DSR and DSP) in order to reduce sleep latency, while achieving balanced energy consumption among sensor nodes in wireless sensor networks (WSNs) with energy harvesting capability. In DSR, each sensor node is allowed to adjust its duty-cycle according to the current amount of residual energy only. Since the residual energy of nodes in energy-harvesting WSNs can increase over time due to their harvesting opportunity, the estimation of prospective increase in their residual energy is useful to achieve our goal. Hence, DSP allows each of sensor nodes to reduce its duty-cycle more aggressively in proportion to such an increase. Through NS-2 simulations, we verified that our proposed schemes outperform the duty-cycle scheduling scheme used in a representative existing MAC protocol such as RI-MAC.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095298]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>202</startPage>
			<endPage>204</endPage>
			<fileSize>251</fileSize>
			<authors><![CDATA[Yoo, Hongseok;Shim, Moonjoo;Kim, Dongkyun;]]></authors>
		</item>
		<item>
			<title><![CDATA[Wideband and Ultra-Wideband Characterization of Three-Dimensional MIMO Wireless Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093990]]></link>
			<description><![CDATA[In this paper, we compute cross-correlation functions (CCF)s between space-time-frequency (STF) transfer functions of two sub-channels of three-dimensional (3D) outdoor wideband (WB) and ultra-wideband (UWB) multiple-input multiple-output (MIMO) wireless channels. Such a 3D channel modeling is demanding to consider both azimuthal and elevation multipath propagation waveforms. Using the derived CCF and for a multiple-input single-output system (MISO), we calculate coherence bandwidth (CB) and power spectral density (PSD) at mobile station (MS), and in a stationary scenario. Numerical analysis showes that both CB and PSD highly depend the channel bandwidth, while PSD is also influenced by the elevation distribution of multipath waveforms.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093990]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>205</startPage>
			<endPage>207</endPage>
			<fileSize>237</fileSize>
			<authors><![CDATA[Pistea, A. M.;Rad, H. Saligheh;]]></authors>
		</item>
		<item>
			<title><![CDATA[Bargaining Game Theoretic Framework for Stimulating Cooperation in Wireless Cooperative Multicast Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093987]]></link>
			<description><![CDATA[This Letter proposes a multi-player bargaining game to stimulate selfish receiving nodes to participate in cooperative multicasts (CMs). In the game, the source node can reward the relaying nodes by, in return, forwarding messages originated from the relays. And all the cooperative nodes aim to achieve optimal data-rate gains through the game. Define the cooperative strategy of a node as the number of data-symbols (in one data-frame) that it is willing to relay for the cooperative partner nodes. We can prove that the game has a unique Nash bargaining solution (NBS). Simulation results show that the proposed NBS based CM scheme can achieve Pareto optimal rate allocation among the cooperative nodes. The source node can achieve significant rate-gain in comparison with direct multicast and the relay nodes can also get fair rate-rewards from the source according to the level of contribution that they have made to improve the performance of the source.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093987]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>208</startPage>
			<endPage>211</endPage>
			<fileSize>292</fileSize>
			<authors><![CDATA[Zhang, Guopeng;Yang, Kun;Hu, Qingsong;Liu, Peng;Ding, Enjie;]]></authors>
		</item>
		<item>
			<title><![CDATA[Novel High Performance MIMO-OFDM Based Measures for NLOS Identification in Time-Varying Frequency and Space Selective Channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093989]]></link>
			<description><![CDATA[This paper proposes new measures for non-line-of-sight (NLOS) identification in wireless localization systems. The measures are defined based on the space-time-frequency channel correlation features of multi-input multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Here, space-time channel correlation refers to the correlation across antenna elements and time, and frequency channel correlation refers to the correlation across subcarriers. The probability-of-detection performance of these NLOS identification methods is investigated. The results represent a high identification performance when the LOS and NLOS powers are in the same order of magnitude.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093989]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>212</startPage>
			<endPage>215</endPage>
			<fileSize>272</fileSize>
			<authors><![CDATA[Xu, Wenjie;Zekavat, Seyed A. Reza;]]></authors>
		</item>
		<item>
			<title><![CDATA[Subspace-Based Propagation Delay Estimation Robust to Frequency Offset for Two-Way Ranging]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095292]]></link>
			<description><![CDATA[This letter proposes a subspace-based propagation delay estimation algorithm immune to sampling frequency offset and carrier frequency offset. The proposed algorithm is able to achieve a highly accurate propagation delay estimation by combining subspace-based fractional delay estimation with a symmetric double sided two-way ranging protocol. Not only Cramer-Rao lower bound (CRLB) was derived but also the performance of the proposed algorithm was analyzed and verified through Monte-Carlo simulations in additive white Gaussian noise (AWGN) and a two-path channel.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095292]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>216</startPage>
			<endPage>219</endPage>
			<fileSize>363</fileSize>
			<authors><![CDATA[Oh, Daegun;Kwak, Myung-kyun;Chong, Jong-Wha;]]></authors>
		</item>
		<item>
			<title><![CDATA[Distributed Detection and Fusion of Weak Signals in Fading Channels with Non-Gaussian Noises]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109195]]></link>
			<description><![CDATA[Distributed detection and information fusion have received recent research interest due to the success of emerging wireless sensor network (WSN) technologies. For the problem of distributed detection in WSNs under energy constraints, a weak signal model in the canonical parallel fusion scheme with additive non-Gaussian noises and fading channels is considered. To solve this problem in the Neyman-Pearson setting, a unified asymptotic fusion rule generalizing the maximum ratio combiner (MRC) fusion rule is proposed. Explicit formulas for the threshold and detection probability applicable for wide classes of fading channels and noise distributions are written out. Both asymptotic analysis and Monte Carlo modeling are used to examine the performance of the proposed detection fusion rule.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109195]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>220</startPage>
			<endPage>223</endPage>
			<fileSize>301</fileSize>
			<authors><![CDATA[Park, Jintae;Shevlyakov, Georgy;Kim, Kiseon;]]></authors>
		</item>
		<item>
			<title><![CDATA[Outage Performance of Opportunistic Cooperation in Amplify-and-Forward Relaying Systems with Relay Selection]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095294]]></link>
			<description><![CDATA[Opportunistic cooperation (OC) dynamically switches between a cooperative mode (CM, using direct and relayed links) and a non-cooperative mode (NM, using only the direct link). In this letter, we consider OC in amplify-and-forward (AF) relaying systems where a best relay is selected as an active relay if CM is selected. The OC is shown to have the same full diversity order as the CM. In terms of asymptotic outage probability, we show that the power gain (sometimes also referred to coding gain) achieved from using the OC compared to the CM is -frac{10}{K+1} log_{10} (1-((2^{R})/(2^R +1))^{K+1} ) dB where R is the data rate used for outage threshold. The result says that the power gain is always positive (in dB) and it increases when the data rate increases or the number of relays decreases. Numerical results are provided to verify the analysis and to give insights on the outage performance of the OC.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095294]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>224</startPage>
			<endPage>227</endPage>
			<fileSize>332</fileSize>
			<authors><![CDATA[Lee, In-Ho;Kim, Dongwoo;]]></authors>
		</item>
		<item>
			<title><![CDATA[A General Framework for Performance Analysis of Space Shift Keying (SSK) Modulation in the Presence of Gaussian Imperfect Estimations]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093916]]></link>
			<description><![CDATA[In this letter, accurate performance analysis of wireless communication system adopting Space Shift Keying (SSK) modulation scheme is introduced. More specifically, the performance of SSK system consisting of N_T transmit and N_R receive antennas with Maximum-Likelihood (ML) detection and imperfect Channel State Information (CSI) at the receiver is studied. The exact Average Bit Error Probability (ABEP) over Rayleigh fading channels is obtained in closed-form for N_T=2 and arbitrary N_R; while union upper bound is used to compute the ABEP when N_T&#x003E;2 and arbitrary N_R. Furthermore, simple and general asymptotic expression for the ABEP is derived and analyzed. Numerical results are also provided, sustained by simulations which corroborate the exactness of the theoretical analysis.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093916]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>228</startPage>
			<endPage>230</endPage>
			<fileSize>194</fileSize>
			<authors><![CDATA[Ikki, Salama S.;Mesleh, Raed;]]></authors>
		</item>
		<item>
			<title><![CDATA[Capacity Scaling of Indoor Pico-Cellular Networks via Reuse]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109197]]></link>
			<description><![CDATA[Cell splitting/frequency reuse is a fundamental characteristic of cellular networks. In macrocellular networks, where pathloss is governed by the distance-to-a-power law, the SINR distribution is invariant to scale, i.e. the spectral efficiency per base (bps/Hz/base) remains constant, and hence the capacity increases linearly with the density of cells. We show for indoor networks, where signals suffer exponential loss in addition to the inverse square distance law, the median SINR decreases with the density of cells. This results in the capacity being proportional to the square-root of the improvement in the density of cells.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109197]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>231</startPage>
			<endPage>233</endPage>
			<fileSize>433</fileSize>
			<authors><![CDATA[Ling, Jonathan;Chizhik, Dmitry;]]></authors>
		</item>
		<item>
			<title><![CDATA[The Benefit of Co-Locating Groups of Nodes in Cooperative Line Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093992]]></link>
			<description><![CDATA[We consider two topologies for the deployment of nodes in a one-dimensional network. The first deployment scenario considers nodes equally spaced on a line, while the second topology has groups of co-located nodes, such that the groups are equally spaced on the line, and such that the two networks have equal average density. In both linear topologies, nodes transmit cooperatively, as opportunistic large arrays, in each hop. The difference is only that in the first topology, the cooperators have disparate path loss, while in the second they do not. We study the multi-hop transmission for both cases, where the one hop distance remains the same for both the topologies. We model both the scenarios with a quasi-stationary Markov chain and show that the co-located groups deployment gives better performance, especially for higher path loss exponents.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093992]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>234</startPage>
			<endPage>237</endPage>
			<fileSize>210</fileSize>
			<authors><![CDATA[Hassan, Syed Ali;Ingram, Mary Ann;]]></authors>
		</item>
		<item>
			<title><![CDATA[Seeing is Believing&#x2014;Enhancing Message Dissemination in Vehicular Networks Through Visual Cues]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6120095]]></link>
			<description><![CDATA[One of the stumbling blocks for implementation of Vehicular Ad Hoc Networks is the penetration rate: the percentage of vehicles that have the communication equipment installed. As the equipment deployment is unlikely to happen instantaneously, it is important to explore the performance gains achievable at low penetration rates. This especially pertains to safety applications, which are expected to provide life-saving information to all drivers on the road within a given region. We propose a technique that can be employed by safety applications to address the low penetration issue. By using visual cues on the equipped vehicles, such as specific patterns of hazard warning lights, we show that for all but the lowest vehicle densities, a radio penetration rate of 30% is sufficient to inform more than 95% of drivers in the region of interest in a timely manner.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6120095]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>238</startPage>
			<endPage>241</endPage>
			<fileSize>487</fileSize>
			<authors><![CDATA[Boban, Mate;Vinhoza, Tiago T. V.;Tonguz, Ozan K.;Barros, Joao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Hop-by-Hop Traceback in Wireless Sensor Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109200]]></link>
			<description><![CDATA[We propose two advancements in the existing Bloom filter based traceback schemes for WSNs (Wireless Sensor Networks): the support of directed queries, and a way of reducing the false positive rate at the nodes nearer to the sink. Simulation results show that the proposed mechanism can efficiently traceback the packets with very few false positives.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109200]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>242</startPage>
			<endPage>245</endPage>
			<fileSize>298</fileSize>
			<authors><![CDATA[Siddiqui, Muhammad Shoaib;Amin, Syed Obaid;Hong, Choong Seon;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Novel Scheduler for Concurrent Tx/Rx Wireless Mesh Networks with Weighted Links]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6120100]]></link>
			<description><![CDATA[This paper considers the NP-hard problem of scheduling weighted links in concurrent transmit/receive wireless mesh networks. The problem generalizes existing works to links with weight w_{ij}&#x02265; 1. We propose an O(|V|^2) algorithm, where V is the set of routers, that is orders of magnitude faster than computationally intensive approaches that use the well-known Goemans-Williamson (GWA)'s maximum cut algorithm and also brute-force. Our algorithm generates schedules, on average, with at most 3% and 9% fewer links than the GWA and brute-force approaches respectively.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6120100]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>246</startPage>
			<endPage>248</endPage>
			<fileSize>506</fileSize>
			<authors><![CDATA[Chin, Kwan-Wu;Soh, Sieteng;Meng, Chen;]]></authors>
		</item>
		<item>
			<title><![CDATA[Complexity Reduction of Ordered Statistics Decoding Using Side Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109198]]></link>
			<description><![CDATA[In this letter, the complexity of the ordered statistics decoding of linear binary block codes is reduced assuming that partial knowledge about the transmitted codeword is available at the decoder. Such side information is provided to the decoder at the receiver from the encoder at the transmitter over a highly reliable low-rate channel. Side information is exploited at the decoder to significantly reduce the number of test codewords that have to be examined during the decoding without sacrificing the error rate performance of the decoder. Side information is represented either by the single parity checks of non-overlapping codeword segments, or by the Hamming weight of the codeword or its part. The proposed method can be readily integrated with other list decoding techniques. Finally, implementation of the proposed complexity reducing scheme in practical systems is also discussed.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109198]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>249</startPage>
			<endPage>251</endPage>
			<fileSize>159</fileSize>
			<authors><![CDATA[Alnawayseh, Saif E. A.;Loskot, Pavel;]]></authors>
		</item>
		<item>
			<title><![CDATA[Adaptive Slepian-Wolf Decoding Based on Expectation Propagation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095297]]></link>
			<description><![CDATA[A major difficulty that plagues the practical use of Slepian-Wolf (SW) coding (and distributed source coding in general) is that the precise correlation among sources needs to be known a priori. However, belief propagation (BP) algorithm cannot adapt efficiently to the statistical change of the correlation. This paper proposes an adaptive SW decoding scheme which can perform online time-varying correlation estimation at the bit-level by incorporating expectation propagation (EP) algorithm. Moreover, we compare the proposed EP-based approach with Monte Carlo method using particle filtering (PF) algorithm. Our results show that the proposed EP estimator obtains the comparable estimation accuracy with less computational complexity than the PF method.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095297]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>252</startPage>
			<endPage>255</endPage>
			<fileSize>334</fileSize>
			<authors><![CDATA[Cui, Lijuan;Wang, Shuang;Cheng, Samuel;]]></authors>
		</item>
		<item>
			<title><![CDATA[Decoding Metric Study for Turbo Codes in Very Impulsive Environment]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093986]]></link>
			<description><![CDATA[In this paper, we study the decoding metric of turbo codes in very impulsive environments. Channel impairments, for example in ad hoc networks, contain not only the thermal noise, but also the network interference generated by other nodes, which exhibits an impulsive nature. We use stable distributions to model this interference due to their heavy tail property. In order to adapt to this type of interference, we propose the p-norm as a decoding metric to replace the conventional Euclidean distance. Simulation results show that the p-norm allows a significant error correction improvement compared with other metrics in very impulsive cases, and its performance appears to be close to the optimal decoder.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093986]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>256</startPage>
			<endPage>258</endPage>
			<fileSize>188</fileSize>
			<authors><![CDATA[Gu, Wei;Clavier, Laurent;]]></authors>
		</item>
		<item>
			<title><![CDATA[A New Approach for Evaluating the BER of a Multirate, Multiclass OFFH-CDMA System]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109193]]></link>
			<description><![CDATA[In this letter, we propose a new approach to evaluate the bit error rate (BER) of a multirate, multiclass optical fast frequency hopping code-division multiple-access (OFFH-CDMA) system. This proposed approach does not require knowledge of the generated users' code sequences, which makes the system analysis straightforward. Furthermore, the presented formalism can also be successfully applied to most multi-weight multi-length family of codes, as long as the corresponding code parameters are employed.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109193]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>259</startPage>
			<endPage>261</endPage>
			<fileSize>176</fileSize>
			<authors><![CDATA[Raddo, Thiago R.;Sanches, Anderson L.;dos Reis, Jr., Jose V.;Borges, Ben-Hur V.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Using Genetic Algorithm to Optimize Mixed Placement of 1R/2R/3R Regenerators in Translucent Lightpaths for Energy-Efficient Design]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6120094]]></link>
			<description><![CDATA[We propose an evolutionary approach to efficiently optimize the mixed placements of 1R/2R/3R regenerators in translucent lightpaths. The genetic algorithm encodes the placements of mixed types of regenerators as genes, and incorporates adaptive genetic operators for effective search strategy. We consider both end-to-end signal transmission quality and regeneration energy cost, and design the fitness function for multi-objective optimization. The simulation results show that the proposed approach converges within 50 generations even when the lightpath under investigation is as long as 31 hops. To improve the flexibility of network designs, multiple energy-efficient mixed regenerator placement (MRP) results can be obtained simultaneously.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6120094]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>262</startPage>
			<endPage>264</endPage>
			<fileSize>440</fileSize>
			<authors><![CDATA[Zhu, Zuqing;Wan, Chuanqi;Zhong, Weida;]]></authors>
		</item>
		<item>
			<title><![CDATA[Internal Backpressure for Terabit Switch Fabrics]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093988]]></link>
			<description><![CDATA[This paper proposes and analyzes the efficiency of novel backpressure schemes for Terabit switch fabrics. The proposed schemes aim at buffer optimization under uniform traffic distribution with Bernoulli packet arrival process. Results show that a reduction of the needed maximum buffer capacity with up to 47% can be achieved with switch-internal backpressure mechanisms at the expense of a small control overhead.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6093988]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>265</startPage>
			<endPage>267</endPage>
			<fileSize>181</fileSize>
			<authors><![CDATA[Manolova, Anna V.;Ruepp, Sarah;Rytlig, Andreas;Berger, Michael;Wessing, Henrik;Dittmann, Lars;]]></authors>
		</item>
		<item>
			<title><![CDATA[Strategies for Virtual Optical Network Allocation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095293]]></link>
			<description><![CDATA[This paper presents Integer Linear Programming (ILP) formulations to optimally allocate Virtual Optical Networks (VONs) over a transparent optical network substrate. These formulations serve the purpose of building either completely transparent VONs or opaque ones, where electrical termination capabilities are assumed at each virtual network node. In addition, a lightweight Greedy Randomized Adaptive Search (GRASP) heuristic is provided for the transparent case. The obtained results validate the accuracy of the proposed heuristic and reveal the benefits of the presented solutions against simpler shortest-path-based VON allocation strategies.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095293]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>268</startPage>
			<endPage>271</endPage>
			<fileSize>184</fileSize>
			<authors><![CDATA[Pages, Albert;Perello, Jordi;Spadaro, Salvatore;Junyent, Gabriel;]]></authors>
		</item>
		<item>
			<title><![CDATA[Sampling ISP Backbone Topologies]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095296]]></link>
			<description><![CDATA[Large computer networks are too large to emulate or actually reproduce in conventional lab environments. Graph generation/reduction techniques have been a valuable tool to solve this limitation. However, current techniques focus on local features (e.g. router out-degree, clustering coefficient, traffic difference between edges for building a hierarchy) that do not preserve router-level backbone geographical/hierarchical features or the end-to-end delay between any arbitrary points. This letter proposes a geographical-based reduction mechanism that enables emulation in lab settings while preserving the global features of typical backbone networks. The performance evaluation is based on six inferred ISP backbone maps.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095296]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>272</startPage>
			<endPage>274</endPage>
			<fileSize>183</fileSize>
			<authors><![CDATA[Vaquero, Luis M.;Lor, Suksant Sae;Audsin, Dev;Murray, Paul;Wainwright, Nick;]]></authors>
		</item>
		<item>
			<title><![CDATA[ecMTCP: An Energy-Aware Congestion Control Algorithm for Multipath TCP]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095291]]></link>
			<description><![CDATA[In this paper, we develop an energy-aware congestion control algorithm for multipath TCP, called ecMTCP. ecMTCP moves traffic from the most congested paths to the more lightly loaded paths, as well as from higher energy cost paths to the lower ones, thus achieving load-balancing and energy-savings. Our simulation results show that ecMTCP can achieve greater energy-savings compared to MPTCP, and preserve fairness to regular TCP.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6095291]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>275</startPage>
			<endPage>277</endPage>
			<fileSize>246</fileSize>
			<authors><![CDATA[Le, Tuan Anh;Hong, Choong Seon;Razzaque, Md. Abdur;Lee, Sungwon;Jung, Heeyoung;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Simple Model for Predicting the Number and Duration of Rebuffering Events for YouTube Flows]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109192]]></link>
			<description><![CDATA[In this paper, we propose a simple model for predicting the number of rebuffering events and their duration in progressive downloads from YouTube. These metrics are necessary to predict the quality perceived by YouTube users. The proposed rebuffering model is based on two thresholds of the amount of data stored by the player buffer: the first threshold is extracted from the results of previous studies, and the second is derived from the experimental results presented in this paper. The proposed model can be easily implemented in simulation tools and we present an example of its use in a Long-Term Evolution simulator in which the mentioned quality metrics have been estimated for different users.]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6109192]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>278</startPage>
			<endPage>280</endPage>
			<fileSize>170</fileSize>
			<authors><![CDATA[Ameigeiras, Pablo;Azcona-Rivas, Alba;Navarro-Ortiz, Jorge;Ramos-Munoz, Juan J.;Lopez-Soler, Juan M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Staff List]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6146705]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[February  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6146702&arnumber=6146705]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>c3</startPage>
			<endPage>c3</endPage>
			<fileSize>68</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>
