<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Wireless Communications, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 7693 </description>
		<year>2009</year>
		<month>November </month>
		<day>19</day>
		<item>
			<title><![CDATA[IEEE Transactions on Wireless Communications - cover]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336755]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336755]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>c1</startPage>
			<endPage>c2</endPage>
			<fileSize>80</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Quantized beamforming with channel prediction - transactions letters]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336756]]></link>
			<description><![CDATA[This paper investigates a quantized beamforming system with feedback delay. A linear channel predictor is used to cope with the feedback delay. We derive an upper bound on the symbol error rate (SER) of phaseshift keying (PSK) signal. Based on the bound, we design a predictor that provides good error performance. We also demonstrate that the beamformer design methods developed in a delay-free scenario are applicable to the system with feedback delay.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336756]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5377</startPage>
			<endPage>5382</endPage>
			<fileSize>315</fileSize>
			<authors><![CDATA[Zhu, P.;Tang, L.;Wang, Y.;You, X.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Delay versus energy consumption of the IEEE 802.16e sleep-mode mechanism]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336757]]></link>
			<description><![CDATA[We propose a discrete-time queueing model for the evaluation of the IEEE 802.16e sleep-mode mechanism of Power Saving Class (PSC) I in wireless access networks. Contrary to previous studies, we model the downlink traffic by means of a Discrete Batch Markov Arrival Process (D-BMAP) with &#x039D; phases, which allows to take traffic correlation into account. The tradeoff between energy saving and increased packet delay is discussed. In many situations, the sleep-mode performance improves for heavily correlated traffic. Also, when compared to other strategies, the exponential sleep-period update strategy of PSC I may not always be the best.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336757]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5383</startPage>
			<endPage>5387</endPage>
			<fileSize>226</fileSize>
			<authors><![CDATA[Vuyst, S.D.;Turck, K.D.;Fiems, D.;Wittevrongel, S.;Bruneel, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Space-frequency linear dispersion codes for single carrier-frequency domain equalization]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336758]]></link>
			<description><![CDATA[This letter addresses the application of Linear Dispersion Codes (LDC) in space and frequency domains in Single Carrier - Frequency Domain Equalization (SCFDE) systems. Space-Frequency (SF)-LDCs are more suitable than Space- Time (ST)-LDC in high mobility environments. However, the application of LDCs in space and frequency domains in SCFDE systems is not straightforward as in Orthogonal Frequency Division Multiplexing (OFDM) systems because in this case there is no direct access to subcarriers at the transmitter. This letter shows that it is possible to induce a target SF symbol dispersion in SCFDE by using a simple linear pre-coder and a conventional LDC that spreads the symbols in time and space domains according to specific ST dispersion matrices. The letter shows how to derive the ST dispersion matrices to be used at the transmitter as a function of the dispersion matrices describing the target SF dispersion. The presented procedure can be applied to both pure transmit diversity and pure multiplexing schemes, which are special cases of LDCs. Therefore, the proposed scheme provides a low complexity implementation of any dispersion in space and frequency over SCFDE systems, which alternatively would require the use of FFT/IFFT also at the transmitter side. The letter also shows a performance comparison of SF-LDCs and ST-LDCs in a typical propagation environment for future radio systems. The comparison confirms the suitability of using the dispersion in frequency rather than time for a wide range of coherence bandwidths.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336758]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5388</startPage>
			<endPage>5393</endPage>
			<fileSize>232</fileSize>
			<authors><![CDATA[Marchetti, N.;Cianca, E.;Prasad, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Theoretical analysis of the orthogonality factor in WCDMA downlinks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336759]]></link>
			<description><![CDATA[Wideband code-division multiaccess (WCDMA) downlink transmission is prone to self interference caused by the loss of orthogonality between the spreading codes due to multipath fading. The degree of loss of orthogonality in downlink WCDMA is usually measured in terms of the orthogonality factor (OF) which is directly related to the level of intra-cell interference. This paper presents accurate theoretical analysis of the OF over generalized fading channels. New exact expressions of the average OF are derived for full and partial RAKE receivers over arbitrarily correlated multipath fading channels.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336759]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5394</startPage>
			<endPage>5399</endPage>
			<fileSize>439</fileSize>
			<authors><![CDATA[Hamdi, K.A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Secure communications in local multipoint distribution service (LMDS) networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336760]]></link>
			<description><![CDATA[The transmission of confidential information over LMDS networks is investigated in the present paper from an information-theoretic standpoint. The major factor impairing the link performance at these networks is rain attenuation, a physical phenomenon exhibiting both spatial and temporal variation. Based on an accurate channel modeling, analytical expressions of the probability of non-zero secrecy capacity and the outage probability for this type of networks are provided, giving for the first time an information-theoretic approach of the problem of secure transmission for LMDS networks. Useful conclusions are drawn through extended numerical results suggesting the increase of operational frequency and the use of more directional antennas to improve security in transmission of confidential messages for this type of networks.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336760]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5400</startPage>
			<endPage>5403</endPage>
			<fileSize>190</fileSize>
			<authors><![CDATA[Anastasopoulos, M.P.;Petraki, D.K.;Hsiao-Hwa Chen;]]></authors>
		</item>
		<item>
			<title><![CDATA[Uplink capacity improvement through orthogonal code hopping in uplink-synchronized CDMA systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336761]]></link>
			<description><![CDATA[We propose an orthogonal code hopping multiple access (OCHMA) scheme in order to improve the capacity of an uplink-synchronized code division multiple access (CDMA) systems. When orthogonal codes (OCs) are used for channelization in uplink-synchronized CDMA systems, a finite set of OCs tends to severely limit the capacity gain of the uplink-synchronized CDMA systems. The OCHMA system allows each user to use a different OC for each symbol according to an allocated hopping pattern (HP). It also allows multiple users to use the same OC at a specific symbol time, which is called an HP collision. Thus, the proposed OCHMA scheme can accommodate more users than the number of available OCs. We analyze the capacity of the OCHMA scheme and compare the performance of the OCHMA with that of conventional schemes including the system using multi-scrambling codes (MSC) which have also been proposed to overcome a code-limited situation.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336761]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5404</startPage>
			<endPage>5410</endPage>
			<fileSize>399</fileSize>
			<authors><![CDATA[Jung, B.C.;Cho, S.S.;Sung, D.K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performances of EGC and MRC diversity for UWB PAPM systems in IEEE channel models]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336762]]></link>
			<description><![CDATA[Accurate approximations to the bit error rates of equal gain combining and maximal ratio combining diversity are obtained for pulse-amplitude-and-position-modulation operating in IEEE ultra-wide bandwidth (UWB) channel models. Numerical results are presented to show the accuracy of the approximations for the IEEE CM1 and CM3 UWB channel models. Results for pulse amplitude modulation and pulse position modulation are obtained as special cases of the more general results. Precise estimates of the loss of equal gain combining relative to maximal ratio combining are obtained for both lineof- sight CM1 and non-line-of-sight CM3 channels. Noteworthy, while the performance loss of equal gain combining with respect to maximal ratio combining is less than 0.4 dB for the non-lineof- sight channel, it can be as much as 2 dB for the line-of-sight channel.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336762]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5411</startPage>
			<endPage>5415</endPage>
			<fileSize>234</fileSize>
			<authors><![CDATA[Chen, Y.;Beaulieu, N.C.;Rajwani, F.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A cooperative multi-group priority MAC protocol for multi-packet reception channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336763]]></link>
			<description><![CDATA[Medium access control (MAC) protocol design for cooperative networks over multi-packet reception (MPR) channels is a challenging topic, but has not been addressed in the literature yet. In this paper, we propose a cooperative multi-group priority (CMGP) based MAC protocol to exploit the cooperation diversity for throughput enhancement over MPR channels. The proposed approach can bypass the computationally-intensive active user identification process. Moreover, our method can efficiently utilize the idle periods for packet relaying, and can thus effectively limit the throughput loss resulting from the relay phase. By means of a Markov chain model, the worstcase throughput analysis is conducted. The results allow us to investigate the throughput performance of the proposed CMGP protocol directly in terms of the MPR channel coefficients. Simulation results confirm the system-wide throughput advantage achieved by the proposed scheme, and also validate the analytic results.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336763]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5416</startPage>
			<endPage>5421</endPage>
			<fileSize>371</fileSize>
			<authors><![CDATA[Wen-Fang Yang;Jwo-Yuh Wu;Li-Chun Wang;Ta-Sung Lee;]]></authors>
		</item>
		<item>
			<title><![CDATA[Amplify-and-Forward Relay Networks Under Received Power Constraint]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336764]]></link>
			<description><![CDATA[Relay networks have received considerable attention recently, especially when limited size and power resources impose constraints on the number of antennas at each node. While fixed and mobile relays can co-operate to improve reception at the desired destination, they also contribute to un-intended interference for neighboring cells reusing the same frequency. In this paper, we propose and analyze a relay scheme to simultaneously maximize SNR and minimize MSE, for an amplify-and-forward (AF) relay network operating under a receive power constraint guaranteeing that the received signal power is bounded to control interference to neighboring cells. If the intended destination lies at the periphery of the cell, then the proposed scheme guarantees that the total power leaking into neighboring cells is bounded. The optimal relay factors are provided for both correlated and uncorrelated noise at the relays. Simulation results are presented to verify the analysis.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336764]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5422</startPage>
			<endPage>5426</endPage>
			<fileSize>294</fileSize>
			<authors><![CDATA[Behbahani, A.S.;Eltawil, A.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Spectrum sensing in cognitive radio using goodness of fit testing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336765]]></link>
			<description><![CDATA[One of the most important challenges in cognitive radio is how to measure or sense the existence of a signal transmission in a specific channel, that is, how to conduct spectrum sensing. In this letter, we first formulate spectrum sensing as a goodness of fit testing problem, and then apply the Anderson-Darling test, one of goodness of fit tests, to derive a sensing method called Anderson-Darling sensing. It is shown by both analysis and numerical results that under the same sensing conditions and channel environments, Anderson-Darling sensing has much higher sensitivity to detect an existing signal than energy detector-based sensing, especially in a case where the received signal has a low signal-to-noise ratio (SNR) without prior knowledge of primary user signals.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336765]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5427</startPage>
			<endPage>5430</endPage>
			<fileSize>193</fileSize>
			<authors><![CDATA[Haiquan Wang;En-hui Yang;Zhijin Zhao;Wei Zhang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Simultaneous transmission of MAP IE and data for minimizing MAC overhead in the IEEE 802.16e OFDMA systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336766]]></link>
			<description><![CDATA[An advanced MAP transmission scheme for improving Media Access Control(MAC) overhead in the IEEE 802.16e systems is proposed. In the IEEE 802.16e system, when a Base Station(BS) broadcasts a MAP message, which is a control message about scheduling information, it applies a robust Modulation and Coding Scheme(MCS) level and allocates a large amount of radio resources, which induce a huge MAP overhead. Our proposed scheme utilizes piggybacked MAP IEs, in which control messages are concatenated with data packets and transmitted with the MCS level applied to data transmission. Due to the fact that the rate at which data is transmitted is generally higher than the rate at which broadcasting messages are transmitted, the proposed scheme can increase average data rate of a MAP transmission and consequently reduce the amount of resources allocated to the MAP transmission. Numerical analysis and simulations are presented to show that the MAP overhead is critical to system performance and can be improved by the proposed scheme.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336766]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5431</startPage>
			<endPage>5435</endPage>
			<fileSize>301</fileSize>
			<authors><![CDATA[Juyeop Kim;Dong-Ho Cho;]]></authors>
		</item>
		<item>
			<title><![CDATA[Location-based pairwise key predistribution for wireless sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336767]]></link>
			<description><![CDATA[A practical pairwise key distribution scheme is necessary for wireless sensor networks since sensor nodes are susceptible to physical capture and constrained in their resources. In this paper, we investigate a simple and practical scheme that achieves higher connectivities and perfect resilience with less resources, even in case of deployment errors.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336767]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5436</startPage>
			<endPage>5442</endPage>
			<fileSize>400</fileSize>
			<authors><![CDATA[Kwon, T.;Lee, J.;Song, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Some results for the fast MMSE-SIC detection in spatially multiplexed MIMO systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336768]]></link>
			<description><![CDATA[We study the implementation algorithm for the MMSE-SIC detection with optimal detection order in a VBLAST system. We develop the LDL<sup>H</sup> decomposition based algorithm with backward substitution (LDBABS), which is shown to require as many multiplications as two other most efficient algorithms. We then propose a modified LDBABS algorithm that utilizes the scheme of incomplete LDL<sup>H</sup> decomposition together with the initial ordering information. The modified LDBABS algorithm is shown to require averagely fewer multiplications than any other implementation algorithm under the independent identically distributed Rayleigh fading channel. It is known that the real-valued MMSE-SIC detector with optimal detection order outperforms its complex-valued counterpart by approximately 1 dB. We finally propose a fast algorithm for the real-valued MMSE-SIC detector with optimal detection order. The number of real-valued multiplications required by this fast algorithm is approximately 1.57 times that required by the complex-valued LDBABS algorithm.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336768]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5443</startPage>
			<endPage>5448</endPage>
			<fileSize>240</fileSize>
			<authors><![CDATA[Tsung-Hsien Liu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Full-rate cooperative communications with spatial diversity for half-duplex uplink relay channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336769]]></link>
			<description><![CDATA[This paper proposes a full-rate cooperative communication technique with spatial diversity for single-carrier transmissions. In order to achieve both the spatial diversity and the full-rate, data streams are simultaneously transmitted through all direct and relay channels with different phase rotation and cyclic delay patterns. The phase rotation and cyclic delay patterns are derived in the sense of minimizing interlayer interference and a corresponding destination structure is presented for decoupling each layer at the destination. Simulation results show that the proposed technique achieves spatial diversity without sacrificing spectral efficiency and outperforms conventional full-rate cooperative communication techniques.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336769]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5449</startPage>
			<endPage>5454</endPage>
			<fileSize>365</fileSize>
			<authors><![CDATA[Ui-Kun Kwon;Chan-Ho Choi;Gi-Hong Im;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance analysis of serial cooperative communications with decode-and-forward relaying and blind-EGC reception under nakagami fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336770]]></link>
			<description><![CDATA[We analyze a serial cooperative transmission system with DF relaying over Nakagami fading channels. We consider a system in which the simple receivers will not estimate the amplitude of the received signals. Hence, signals are combined with equal gain before decoding. Moreover, the relays use a simple protocol when relaying the messages ¿ they re-transmit the message if they can decode the received message correctly; otherwise, they do not transmit anything and remain idle. We will derive an exact expression for the asymptotic symbol error rate of the system and evaluate the diversity properties.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336770]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5455</startPage>
			<endPage>5460</endPage>
			<fileSize>254</fileSize>
			<authors><![CDATA[Feng Xu;Qing F. Zhou;Lau, F.C.M.;Dian-Wu Yue;Sau F. Hau;]]></authors>
		</item>
		<item>
			<title><![CDATA[Interference-free code design for MC-CDMA uplink transmissions]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336771]]></link>
			<description><![CDATA[In a recent study, solutions have been proposed for completely suppressing the multiple access interference (MAI) arising in the uplink of a quasi-synchronous multicarrier codedivision multiple-access network as a consequence of multipath distortions and carrier frequency offsets. This result is achieved by employing exponential orthogonal codes or selecting a particular subset of the Walsh-Hadamard code family without the need for any channel state information at the transmitter side. In the present letter, we revisit this problem and show that MAI suppression can be achieved by following a different line of reasoning which leads to a transmission scheme exhibiting a lower peak-to-average power ratio.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336771]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5461</startPage>
			<endPage>5465</endPage>
			<fileSize>242</fileSize>
			<authors><![CDATA[Sanguinetti, L.;Taponecco, L.;Morelli, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[How much time is needed for wideband spectrum sensing?]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336772]]></link>
			<description><![CDATA[In this paper, we consider a wideband cognitive radio network (CRN) which can simultaneously sense multiple narrowband channels and thus aggregate the perceived available channels for transmission. We study the problem of designing the optimal spectrum sensing time and power allocation schemes so as to maximize the average achievable throughput of the CRN subject to the constraints of probability of detection and the total transmit power. The optimal sensing time and power allocation strategies are developed under two different total power constraints, namely, instantaneous power constraint and average power constraint. Finally, numerical results show that, under both cases, for a CRN with three 6MHz channels, if the frame duration is 100ms and the target probability of detection is 90% for the worst case signal-to-noise ratio of primary users being ¿12dB, ¿15dB and ¿20dB, respectively, the optimal sensing time is around 6ms and it is almost insensitive to the total transmit power.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336772]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5466</startPage>
			<endPage>5471</endPage>
			<fileSize>353</fileSize>
			<authors><![CDATA[Yiyang Pei;Ying-Chang Liang;Kah Chan Teh;Kwok Hung Li;]]></authors>
		</item>
		<item>
			<title><![CDATA[Theoretical analysis of a MAP based blind frame synchronizer]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336773]]></link>
			<description><![CDATA[We have recently proposed in [1] a blind frame synchronization method based on a Maximum A Posteriori (MAP) approach. In this letter, we study the properties of this method and show that this synchronization technique is well suitable for codes having a sparse parity check matrix, such as Low-Density Parity-Check (LDPC) codes. We also find the probability distributions involved in our synchronization criterion and expand the analytical expression of the probability of false synchronization. Through computer simulations we validate our theoretical results and show that this synchronization technique has excellent performance when applied to LDPC codes. We also show that this method outperforms another approach of blind frame synchronization that computes hard values of the syndrome instead of its Log-Likelihood Ratios (LLR).]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336773]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5472</startPage>
			<endPage>5476</endPage>
			<fileSize>321</fileSize>
			<authors><![CDATA[Imad, R.;Houcke, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Effects of channel dispersion and path correlations on system-wide throughput in MIMO-based cellular systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336774]]></link>
			<description><![CDATA[We compute cell-wide mean throughputs for a wide range of multiple-input-multiple-output (MIMO) system design parameters, in both single- and multi-cell scenarios, using realistic models for channel dispersion, path correlations, and cochannel interference. We assume the use of single-carrier modulation, and quantify the degradation in downlink throughput as the channel dispersion increases. Our results highlight the potential harm even from mild dispersion in MIMO links. In studying path correlations, we assume linear arrays at each end of the link, and quantify the interplay among device size, number of antenna elements, path correlation, and carrier frequency. We show that, under practical size constraints, the use of additional antenna elements can be counterproductive.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336774]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5477</startPage>
			<endPage>5482</endPage>
			<fileSize>403</fileSize>
			<authors><![CDATA[Pupala, R.N.;Greenstein, L.J.;Daut, D.G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[The non validity of the gaussian approximation for multi-user interference in ultra wide band impulse radio: from an inconvenience to an advantage - transactions papers]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336775]]></link>
			<description><![CDATA[The huge potential of Ultra Wide Band Impulse Radio (UWB IR) with Multiple Access was initially evaluated using the Standard Gaussian Approximation which assumed that Multi User Interference could be approximated as classical Gaussian noise. Later the Standard Gaussian Approximation has been proved to be unvalid in several cases. Thus the performance of the classical UWB IR correlation receiver dramatically reduces. We show in this paper how the non gaussianity of the Multi User Interference can be exploited, turning the non gaussianity into an advantage, increasing the performance with respect to the Gaussian interference case which was supposed to be too optimistic until now.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336775]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5483</startPage>
			<endPage>5489</endPage>
			<fileSize>841</fileSize>
			<authors><![CDATA[Fiorina, J.;Domenicali, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Minimum-energy all-to-all multicasting in wireless ad hoc networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336776]]></link>
			<description><![CDATA[A wireless ad hoc network consists of mobile nodes that are powered by batteries. The limited battery lifetime imposes a severe constraint on the network performance, energy conservation in such a network thus is of paramount importance, and energy efficient operations are critical to prolong the lifetime of the network. All-to-all multicasting is one fundamental operation in wireless ad hoc networks, in this paper we focus on the design of energy efficient routing algorithms for this operation. Specifically, we consider the following minimum-energy all-to-all multicasting problem. Given an all-to-all multicast session consisting of a set of terminal nodes in a wireless ad hoc network, where the transmission power of each node is either fixed or adjustable, assume that each terminal node has a message to share with each other, the problem is to build a shared multicast tree spanning all terminal nodes such that the total energy consumption of realizing the all-to-all multicast session by the tree is minimized. We first show that this problem is NP-Complete. We then devise approximation algorithms with guaranteed approximation ratios. We also provide a distributed implementation of the proposed algorithm. We finally conduct experiments by simulations to evaluate the performance of the proposed algorithm. The experimental results demonstrate that the proposed algorithm significantly outperforms all the other known algorithms.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336776]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5490</startPage>
			<endPage>5499</endPage>
			<fileSize>596</fileSize>
			<authors><![CDATA[Liang, W.;Brent, R.;Xu, Y.;Wang, Q.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Near-capacity irregular variable length coding and irregular unity rate coding]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336777]]></link>
			<description><![CDATA[In this contribution we introduce an EXtrinsic Information Transfer (EXIT) chart matching technique for the design of two serially concatenated irregular codecs, each constituted by a variety of component codes. This approach facilitates a higher degree of design freedom than matching the EXIT function of an irregular codec to that of a regular codec, comprising only a single component code. As a result, a narrower EXIT chart tunnel can be created, facilitating operation at E<sub>b</sub>/N<sub>0</sub> values that are closer to the channel¿s capacity bound. This is demonstrated for a serial concatenation of iteratively decoded Irregular Variable Length Coding (IrVLC) and Irregular Unity Rate Coding (IrURC), which is favourably compared with an IrVLC and regular Unity Rate Coding (URC) based benchmarker. Finally, we show that the iterative decoding complexity of our IrVLCIrURC scheme can be reduced by about 25% upon employing a method of jointly performing EXIT chart matching, while seeking a reduced iterative decoding complexity.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336777]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5500</startPage>
			<endPage>5507</endPage>
			<fileSize>305</fileSize>
			<authors><![CDATA[Maunder, R.G.;Hanzo, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A cellular neural network and utility-based radio resource scheduler for multimedia CDMA communication systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336778]]></link>
			<description><![CDATA[The paper proposes a cellular neural network and utility (CNNU)-based radio resource scheduler for multimedia CDMA communication systems supporting differentiated quality-of-service (QoS). Here, we define a relevant utility function for each connection, which is its radio resource function weighted by a QoS requirement deviation function and a fairness compensation function. We also propose cellular neural networks (CNN) to design the utility-based radio resource scheduler according to the Lyapunov method to solve the constrained optimization problem. The CNN is powerful for complicated optimization problems and has been proved that it can rapidly converge to a desired equilibrium; the utility-based scheduling algorithm can efficiently utilize the radio resource for system, keep the QoS requirements of connections guaranteed, and provide the weighted fairness for connections. Therefore, the CNNUbased scheduler, which determines a radio resource assignment vector for all connections by maximizing an overall system utility, can achieve high system throughput and keep the performance measures of all connections to meet their QoS requirements. Simulation results show that the CNNU-based scheduler attains the average system throughput greater than the EXP [9] and the HOLPRO [5] scheduling schemes by an amount of 23% and 33%, respectively, in the QoS guaranteed region.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336778]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5508</startPage>
			<endPage>5519</endPage>
			<fileSize>602</fileSize>
			<authors><![CDATA[Shen, S.;Chung-Ju Chang;Li-Chun Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Energy optimal scheduler for diversity fading channels with maximum delay constraints]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336779]]></link>
			<description><![CDATA[We present a minimal energy packet scheduling and rate control scheme with a strict maximum delay constraint. This problem occures natually in real-time wireless multimedia transmission where a hard delay limit is imposed on each packet. In general, the communication link is assumed to be a diversity channel with multiple parallel sub-channels(e.g. OFDM, or MIMO eigenchannels.) We present both the theoretical optimal solution, which assumes prescient traffic and channel knowlodge, and a causal scheduler where the future is only known statistically. We show that the causal scheduler performs well, to within 3 dB of the prescient optimal in a single channel, and is even better with diversity channels.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336779]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5520</startPage>
			<endPage>5529</endPage>
			<fileSize>422</fileSize>
			<authors><![CDATA[Shyh-hao Kuo;Cavers, J.K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design and analysis of asynchronous wakeup for wireless sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336780]]></link>
			<description><![CDATA[In wireless sensor networks, scheduling the sleep duration of each node is one of the key elements for controlling critical performance metrics such as energy consumption and latency. Since the wakeup interval is a primary parameter for determining the sleeping schedule, how to tune the wakeup interval is crucial for the overall network performance. In this paper, we present an effective framework for tuning asynchronous wakeup intervals of IEEE 802.15.4 sensor networks from the energy consumption viewpoint. First, we derive an energy consumption model of each node as an explicit function of the wakeup interval, and empirically validate the derived model. Second, based on the proposed model, we formulate the problem of tuning the wakeup interval with the following two objectives: to minimize total energy consumption and to maximize network lifetime. We show that these two problems can be optimally solved by an iterative algorithm with global information by virtue of the convexity of the problem structure. Finally, as practical solutions, we further propose heuristic optimization algorithms that only exploit local information. In order to develop heuristic algorithms, we propose two broadcasting schemes, which are entitled as maximum wakeup interval broadcasting and efficient local maximum broadcasting. These broadcasting algorithms enable nodes in the network to have heterogeneous wakeup intervals.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336780]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5530</startPage>
			<endPage>5541</endPage>
			<fileSize>633</fileSize>
			<authors><![CDATA[Tae Rim Park;Kyung-Joon Park;Myung J. Lee;]]></authors>
		</item>
		<item>
			<title><![CDATA[Three-dimensional multipath shape factors for spatial modeling of wireless channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336781]]></link>
			<description><![CDATA[This paper develops a generalized theory of multipath shape factors used to study the small-scale fading statistics in three-dimensional non-omnidirectional multipath channels. Previous results for horizontal propagation channels are special cases of the present framework when the multipath angular power density (APD) and the travel direction of the mobile unit are confined to a plane. The three-dimensional multipath shape factors are derived in terms of the first three degrees of unnormalized spherical harmonics of the APD. Based on the so derived shape factors, analytical expressions for the level crossing rate, average fade duration and approximate envelope correlation are derived for a Rayleigh fading three-dimensional channel.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336781]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5542</startPage>
			<endPage>5551</endPage>
			<fileSize>1066</fileSize>
			<authors><![CDATA[Valchev, D.G.;Brady, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance analysis of IR-UWB in a multi-user environment]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336782]]></link>
			<description><![CDATA[In Impulse Radio Ultra Wide Band (IR-UWB) based systems, we show that the Multi-User Interference (MUI) assuming fixed spreading codes can be well approximated by a Generalized-Gaussian Distribution (GGD). Then, we derive an accurate closed-form expression of the approximation for the Average Error Probability (AEP) in both Direct-Sequence (DS) and Time-Hopping (TH) multiple access context. From this approximation, we are able to characterize and to select the set of codes minimizing the AEP for both multiple access techniques. The merit of each multiple access technique is then analyzed: we especially prove that the probability to find an optimal pair of codes goes to one when increasing the number of chips per symbol with TH technique whereas this probability goes to zero with DS technique. Numerical illustrations confirm our claims.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336782]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5552</startPage>
			<endPage>5563</endPage>
			<fileSize>483</fileSize>
			<authors><![CDATA[Kharrat-Kammoun, F.;Le Martret, C.J.;Ciblat, P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An algorithm for wireless relay placement]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336783]]></link>
			<description><![CDATA[An algorithm is given for placing relays at spatial positions to improve the reliability of communicated data in a sensor network. The network consists of many power-limited sensors, a small set of relays, and a receiver. For each sensor, the receiver receives a direct signal as well as an indirect signal from one of the available relays. The relays rebroadcast the transmissions in order to achieve diversity at the receiver. Both amplify-and-forward and decode-and-forward relay networks are considered. Channels are modeled with Rayleigh fading, path loss, and additive white Gaussian noise. Performance analysis and numerical results are given.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336783]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5564</startPage>
			<endPage>5574</endPage>
			<fileSize>3569</fileSize>
			<authors><![CDATA[Cannons, J.;Milstein, L.B.;Zeger, K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A low-overhead energy detection based cooperative sensing protocol for cognitive radio systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336784]]></link>
			<description><![CDATA[Cognitive radio and dynamic spectrum access represent a new paradigm shift in more effective use of limited radio spectrum. One core component behind dynamic spectrum access is the sensing of primary user activity in the shared spectrum. Conventional distributed sensing and centralized decision framework involving multiple sensor nodes is proposed to enhance the sensing performance. However, it is difficult to apply the conventional schemes in reality since the overhead in sensing measurement and sensing reporting as well as in sensing report combining limit the number of sensor nodes that can participate in distributive sensing. In this paper, we shall propose a novel, low overhead and low complexity energy detection based cooperative sensing framework for the cognitive radio systems which addresses the above two issues. The energy detection based cooperative sensing scheme greatly reduces the quiet period overhead (for sensing measurement) as well as sensing reporting overhead of the secondary systems and the power scheduling algorithm dynamically allocate the transmission power of the cooperative sensor nodes based on the channel statistics of the links to the BS as well as the quality of the sensing measurement. In order to obtain design insights, we also derive the asymptotic sensing performance of the proposed cooperative sensing framework based on the mobility model. We show that the false alarm and mis-detection performance of the proposed cooperative sensing framework improve as we increase the number of cooperative sensor nodes.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336784]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5575</startPage>
			<endPage>5581</endPage>
			<fileSize>481</fileSize>
			<authors><![CDATA[Shunqing Zhang;Tianyu Wu;Lau, V.K.N.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A joint power control and interference avoidance code assignment strategy for downlink MC-DS-CDMA with 2D spreading]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336785]]></link>
			<description><![CDATA[Maintaining the quality-of-service (QoS) requirement by transmission power adjustment while eliminating interference is an important but difficult task in the downlink multicarrier direct-sequence code division multiple access (MC-DSCDMA) systems with two-dimensional (2D) spreading. To achieve this goal, we integrate the power control (PC) mechanism and the interference avoidance code assignment strategy. This joint policy is to firstly eliminate interference via an interference avoidance (IA) code assignment strategy and then maintain the QoS via a power control mechanism. To facilitate the code assignment strategy, a new PC-based multiple access interference (MAI) coefficient is defined through performance analysis. Thanks to the help of the PC-based MAI coefficient, we can evaluate each candidate code by quantitatively predicting the amount of interference produced by a possible code assignment event. With this interference pre-evaluation, the PC mechanism can not only maintain the QoS with less transmission power but also eliminate extra MAI in the system. The simulation results show that the proposed joint scheme can maintain a predefined signal quality and significantly improve the call admission rate while largely reducing the power consumption. The contribution of this paper fills up the missing link between the power control and code assignment in the 2D-spread MC-DS-CDMA systems.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336785]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5582</startPage>
			<endPage>5591</endPage>
			<fileSize>443</fileSize>
			<authors><![CDATA[Chih-Wen Chang;Chien-Cheng Kuo;]]></authors>
		</item>
		<item>
			<title><![CDATA[Reconfigurable rateless codes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336786]]></link>
			<description><![CDATA[We propose novel reconfigurable rateless codes, that are capable of not only varying the block length but also adaptively modify their encoding strategy by incrementally adjusting their degree distribution according to the prevalent channel conditions without the availability of the channel state information at the transmitter. In particular, we characterize a reconfigurable rateless code designed for the transmission of 9,500 information bits that achieves a performance, which is approximately 1 dB away from the discrete-input continuousoutput memoryless channel¿s (DCMC) capacity over a diverse range of channel signal-to-noise (SNR) ratios.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336786]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5592</startPage>
			<endPage>5600</endPage>
			<fileSize>322</fileSize>
			<authors><![CDATA[Bonello, N.;Zhang, R.;Chen, S.;Hanzo, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A comprehensive analysis of low-power operation for beacon-enabled IEEE 802.15.4 wireless networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336787]]></link>
			<description><![CDATA[ZigBee, a unique communication standard designed for low-rate wireless personal area networks, has extremely low complexity, cost, and power consumption for wireless connectivity of inexpensive, portable, and moving devices. ZigBee uses the IEEE 802.15.4 standard as its communication protocol for medium access control (MAC) layer and physical (PHY) layer. The IEEE 802.15.4 MAC layer achieves duty-cycle operations by setting two system parameters, macBeaconOrder (BO) and macSuperFrameOrder (SO), to achieve low power consumption for ZigBee devices. This study comprehensively analyzes IEEE 802.15.4 duty-cycle operation. Specifically, a novel analytical model that accommodates a general traffic distribution is developed. An NS-2 based simulation model, which is validated by the developed analytical model is also proposed. Through the experiments conducted by the analytical and simulation models, some important performance-evaluation insights are gained that can be used as guidelines for future low-power ZigBee network deployment.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336787]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5601</startPage>
			<endPage>5611</endPage>
			<fileSize>580</fileSize>
			<authors><![CDATA[Yu-Kai Huang;Ai-Chun Pang;Hui-Nien Hung;]]></authors>
		</item>
		<item>
			<title><![CDATA[Traffic adaptive relaying topology control]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336788]]></link>
			<description><![CDATA[The optimization of the relaying topology in multihop cellular network should provide the answer to the question who is transmitting to whom, and when, in such a way to insure the best system performance. In the case of temporally and spatially varying traffic distribution the optimal topology will also vary in time and an efficient way for topology control is needed in order to maximize the system performance. In this paper we present an algorithm for efficient relaying topology control, which is aware of the intercell interference, requiring coordinated action between the cells and resulting in multicell jointly optimal relaying topology. Numerical results demonstrate that an adaptive relaying topology control provides the network utility improvements and presents the framework for quantifying these improvements for spatially and temporally varying traffic.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336788]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5612</startPage>
			<endPage>5620</endPage>
			<fileSize>566</fileSize>
			<authors><![CDATA[Lorenzo, B.;Glisic, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A multi-channel token ring protocol for QoS provisioning in inter-vehicle communications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336789]]></link>
			<description><![CDATA[This paper proposes a multi-channel token ring media access control (MAC) protocol (MCTRP) for inter-vehicle communications (IVC). Through adaptive ring coordination and channel scheduling, vehicles are autonomously organized into multiple rings operating on different service channels. Based on the multi-channel ring structure, emergency messages can be disseminated with a low delay. With the token based data exchange protocol, the network throughput is further improved for non-safety multimedia applications. An analytical model is developed to evaluate the performance of MCTRP in terms of the average full ring delay, emergency message delay, and ring throughput. Extensive simulations with ns-2 are conducted to validate the analytical model and demonstrate the efficiency and effectiveness of the proposed MCTRP.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336789]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5621</startPage>
			<endPage>5631</endPage>
			<fileSize>895</fileSize>
			<authors><![CDATA[Yuanguo Bi;Kuang-Hao Liu;Cai, L.X.;Xuemin Shen;Hai Zhao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Delay-sensitive distributed power and transmission threshold control for S-ALOHA network with finite state markov fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336790]]></link>
			<description><![CDATA[In this paper, we consider the delay-sensitive power and transmission threshold control design in S-ALOHA network with FSMC fading channels. The random access system consists of an access point with &#x039A; competing users, each has access to the local channel state information (CSI) and queue state information (QSI) as well as the common feedback (ACK/NAK/Collision) from the access point. We seek to derive the delay-optimal control policy (composed of threshold and power control). The optimization problem belongs to the memoryless policy &#x039A;-agent infinite horizon decentralized Markov decision process (DECMDP), and finding the optimal policy is shown to be computationally intractable. To obtain a feasible and low complexity solution, we recast the optimization problem into two subproblems, namely the power control and the threshold control problem. For a given threshold control policy, the power control problem is decomposed into a reduced state MDP for single user so that the overall complexity is &#x003C3;(&#x039D;J), where &#x039D; and J are the buffer size and the cardinality of the CSI states. For the threshold control problem, we exploit some special structure of the collision channel and common feedback information to derive a low complexity solution. The delay performance of the proposed design is shown to have substantial gain relative to conventional throughput optimal approaches for S-ALOHA.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336790]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5632</startPage>
			<endPage>5638</endPage>
			<fileSize>293</fileSize>
			<authors><![CDATA[Huang Huang;Lau, V.K.N.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On error analysis and distributed phase steering for wireless network coding over fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336791]]></link>
			<description><![CDATA[Network coding notions promise significant gains in wireless networks¿ throughput and quality of service. Future systems employing such paradigms are known to be also highly scalable and resilient to node failure and churn rates. We propose a simple framework where a single relay listens to two nodes transmitting simultaneously over the same band in the presence of Nakagami-m fading. For this multiple-access channel (MAC), we derive in closed-form the exact bit error rate of antipodal signaling with maximum-likelihood detection. As the MAC is the bottleneck in error of the overall system, this provides a good performance measure of the aggregate architecture. Using the new error expressions derived, we then propose a simple closedloop cooperation strategy where via a ternary feedback from the relay node, significant gains in signal to noise ratio at the relay can be achieved. Our novel error analysis method is applicable to a number of other systems such as the vertical Bell labs spacetime (V-BLAST) scheme and synchronous multi-user systems.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336791]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5639</startPage>
			<endPage>5649</endPage>
			<fileSize>530</fileSize>
			<authors><![CDATA[Peng, A.Y.-C.;Yousefi, S.;Il-Min Kim;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design and analysis of SIP-based mobile VPN for real-time applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336792]]></link>
			<description><![CDATA[Mobile Virtual Private Network (MVPN) has been developed to secure mobile user¿s communication between untrusted external networks and protected private internal network. The IETF¿s solution, however, leads to some problems: where should we put the external Home Agent (HA), how could we trust the external HA, and overhead of three tunnels. In this paper, we propose an alternative SIP-based MVPN. Because the proposed architecture is based on SIP, the problems inherited from Mobile IP are not problems in our architecture. In addition, there is no need to tunnel a packet three times as that in IETF MVPN. In this paper, we also propose analytical models to evaluate and compare the performance of the proposed SIP-basedMVPN with the IETF MVPN. The results show that the proposed SIP-basedMVPN can reduce packet delivery cost significantly. It is especially suitable for real-time applications.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336792]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5650</startPage>
			<endPage>5661</endPage>
			<fileSize>553</fileSize>
			<authors><![CDATA[Zong-Hua Liu;Jyh-Cheng Chen;Tuan-Che Chen;]]></authors>
		</item>
		<item>
			<title><![CDATA[QoS-driven network coded wireless multicast]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336793]]></link>
			<description><![CDATA[Emerging wireless multicast applications simultaneously impose two requirements to the underlying communication networks: to provide sufficient bandwidth and to support a variety of quality-of-service (QoS) sensitivities. For the first requirement, network coding has been proposed recently as an effective way of improving bandwidth utilization. However, almost all previous works about network coding focus on the throughput gain without considering the QoS requirements. Optimal network code construction in wireless multicast under different QoS constraints remains as a significant challenge. In this research, we study the QoS-driven network coding problem. We use large deviation principle to establish the relationship among source rate, link condition, QoS requirement, and network code. Using this relationship, under given QoS requirements, we solve the optimal network code construction problem. The proposed network code supports maximal source rate without violating the QoS requirements. These results constitute the foundations for future designing and implementing network coding based wireless multicast protocols.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336793]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5662</startPage>
			<endPage>5670</endPage>
			<fileSize>443</fileSize>
			<authors><![CDATA[Pu, W.;Luo, C.;Wu, F.;Chen, C.W.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Robust transmit processing forBICM-OFDM systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336794]]></link>
			<description><![CDATA[In this paper, we introduce robust cyclic space¿ frequency (CSF) filtering for systems combining bit¿interleaved coded modulation (BICM) and orthogonal frequency division multiplexing (OFDM). The proposed robust CSF filtering scheme exploits imperfect channel state information at the transmitter (CSIT) and takes into account the reliability of the CSIT via a Bayesian model. To further improve robustness, we combine CSF filtering with orthogonal space¿time block coding in the frequency domain and refer to the resulting scheme as SFC¿ CSF filtering. We also propose a linear prediction method for improving the quality of the CSIT via post¿processing. Based on an upper bound on the worst¿case pairwise error probability we formulate an optimization problem for the robust CSF filters which can be solved exactly for certain special cases. For the general case, we obtain an approximate solution by solving a related problem with additional constraints. This approximate solution can be further improved with a gradient algorithm for the original problem. Simulation results confirm the excellent performance of BICM¿OFDM with robust CSF and SFC¿ CSF filtering and the effectiveness of the proposed CSIT post¿ processing method.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336794]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5671</startPage>
			<endPage>5681</endPage>
			<fileSize>485</fileSize>
			<authors><![CDATA[Chen, H.Z.B.;Schober, R.;Gerstacker, W.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Dimensioning and location planning of broadband wireless networks under multi-level cooperative relaying]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336795]]></link>
			<description><![CDATA[This paper studies the problem of network dimensioning and location planning (DLP) in multi-hop wireless networks by incorporating recent advances in wireless multilevel cooperative relaying (CR), which has been recognized as an effective design paradigm for achieving throughput/capacity enhancement in modern metropolitan area networks. The paper is committed to develop an optimization framework and a suite of decent solution approaches which can manipulatively capture the nature of the DLP problem and precisely characterize the behavior of multi-level cooperative relaying. For this purpose, the tasks of dimensioning, relay placement, relay allocation, and signal relay sequence design are jointly considered and accommodated into a unified framework. To make the solution of the optimization problem computationally tractable, a heuristic two-phase algorithm is developed. Simulation and case studies are conducted to verify the proposed optimization framework, and the results demonstrate the significant cost reduction and achievable rate improvement due to multi-level CR.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336795]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5682</startPage>
			<endPage>5691</endPage>
			<fileSize>1009</fileSize>
			<authors><![CDATA[Bin Lin;Pin-Han Ho;]]></authors>
		</item>
		<item>
			<title><![CDATA[Algorithms and bounds for estimating location, directionality, and environmental parameters of primary spectrum users]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336796]]></link>
			<description><![CDATA[Most existing work on dynamic spectrum access deals with creating a spectral and temporal map of spectrum white space, and then filling it. The spectrum can be better utilized by increasing the spatial awareness of secondary users to include knowledge of the locations of all primary and secondary users, as well as the orientations and parameters of their directional or omni-directional antennas. This paper derives a Maximum Likelihood (ML) algorithm, an approximate ML algorithm, and associated performance bounds for jointly estimating a transmitter¿s position, orientation, beam width, and transmit power, as well as the environment¿s path loss exponent, using received signal strength measurements. The methods can be used for either a primary or secondary user. Simulations are used to determine what types of sensor geometries lead to good estimates of each parameter, to evaluate the performance of the estimators, and to determine spectrum availability as a function of spatial coordinates.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336796]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5692</startPage>
			<endPage>5701</endPage>
			<fileSize>499</fileSize>
			<authors><![CDATA[Martin, R.K.;Thomas, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Opportunistic spectrum sharing with multiple cochannel primary transmitters]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336797]]></link>
			<description><![CDATA[We present a distributed, collaborative algorithm to enable opportunistic spectrum access for cognitive radios in the presence of multiple cochannel transmitters. A spectrum hole detection and estimation technique based on received signal strength observations is developed, which allows the coexistence of both licensed and unlicensed transmitters. We address the issues of how to perform collaborative spectrum sensing in the presence of multiple cochannel transmitters and how to determine the maximum transmit power that can be used for a given frequency channel by a cognitive radio while avoiding harmful interference to the licensed network. Simulation results are provided to validate the feasibility and performance of the proposed scheme.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5336754&arnumber=5336797]]></guid>
			<volume>8</volume>
			<issue>11</issue>
			<startPage>5702</startPage>
			<endPage>5710</endPage>
			<fileSize>463</fileSize>
			<authors><![CDATA[Nasif, A.O.;Mark, B.L.;]]></authors>
		</item>
	</channel>
</rss>