<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Communications Letters, IEEE - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 4234 </description>
		<year>2009</year>
		<month>November </month>
		<day>23</day>
		<item>
			<title><![CDATA[IEEE Communications Letters - cover]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337052]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337052]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>c1</startPage>
			<endPage>c1</endPage>
			<fileSize>59</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Estimation of a probability with guaranteed normalized mean absolute error]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337053]]></link>
			<description><![CDATA[The estimation of a probability p from repeated Bernoulli trials is considered in this letter. A sequential approach is followed, using a simple stopping rule. A closed-form expression and an upper bound are obtained for the mean absolute error of the unbiased estimator of p. The results given permit the estimation of an arbitrary probability with a prescribed level of normalized mean absolute error.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337053]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>817</startPage>
			<endPage>819</endPage>
			<fileSize>375</fileSize>
			<authors><![CDATA[Mendo, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance of two-hop regenerative relay network under correlated nakagami-m fading at multi-antenna relay]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337054]]></link>
			<description><![CDATA[Performance of cooperative relaying employing infrastructure based fixed relays having multiple antennas has been investigated. Here, both relay and destination perform maximal ratio combining combining of the signals. Closed form expressions for outage probability and bit error rate have been derived for Nakagami-m fading channels, with integer values of m. The effect of fading correlation among relay antennas and relay positioning on the system performance have also been studied.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337054]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>820</startPage>
			<endPage>822</endPage>
			<fileSize>295</fileSize>
			<authors><![CDATA[Katiyar, H.;Bhattacharjee, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Random coding error exponent for dual-hop nakagami-m fading channels with amplify-and-forward relaying]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337055]]></link>
			<description><![CDATA[We derive the random coding error exponent for dual-hop transmission over Nakagami-m fading channels with amplify-and-forward relaying. This information-theoretic measure allows us to determine the capacity and cutoff rate as well as to gain valuable insight into the inherent tradeoff between the communication reliability and transmission rate in such channels.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337055]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>823</startPage>
			<endPage>825</endPage>
			<fileSize>242</fileSize>
			<authors><![CDATA[Hien Quoc Ngo;Tony Q. S. Quek;Hyundong Shin;]]></authors>
		</item>
		<item>
			<title><![CDATA[Pilot-assisted channel estimation method for OFDMA systems over time-varying channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337056]]></link>
			<description><![CDATA[Conventional time-varying (TV) channel estimation (CE) methods for OFDM systems need optimal evenly spaced pilots to track channel time variations in one symbol period and the inter-carrier interference (ICI) on pilots caused by Doppler spread are regarded as noise. For practical OFDMA systems, the required evenly spaced pilots are unsatisfied and the ICI on pilots increase estimation errors. In this letter, a TV CE method for practical OFDMA systems is proposed. The time variations of the frequency domain transmission function in one symbol period are approximated by a linear model in time-frequency blocks for each user. Time domain transformations are avoided and evenly spaced pilots are not required. Furthermore, the ICI on pilots are mitigated by correlative coding. Simulation results demonstrate the Symbol-Error-Rate (SER) and Mean-Square- Error (MSE) performances of the proposed OFDMA CE method over TV channels.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337056]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>826</startPage>
			<endPage>828</endPage>
			<fileSize>182</fileSize>
			<authors><![CDATA[Li, D.;Feng, S.;Ye, W.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance evaluation of triple-branch GSC diversity receivers over generalized-K fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337057]]></link>
			<description><![CDATA[In this letter, a detailed performance analysis of generalized selection combining GSC(2,3) receivers operating over independent but not necessarily identically distributed (n.i.d.) generalized-K (KG) fading channels is presented. For this class of receivers, a novel closed-form expression for the moments of the output signal-to-noise ratio (SNR) is derived. This result can be afterwards used to evaluate the outage probability and the average symbol error probability of different signal constellations. Various performance evaluation results are also presented and compared to equivalent simulation ones.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337057]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>829</startPage>
			<endPage>831</endPage>
			<fileSize>374</fileSize>
			<authors><![CDATA[Peppas, K.P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An analytical framework for neighbor discovery strategies in ad hoc networks with sectorized antennas]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337058]]></link>
			<description><![CDATA[This letter analyzes a class of neighbor discovery algorithms in ad hoc networks using directional antennas for both reception and transmission. We consider synchronized and random sector - timeslot assignment strategies and compare their behaviors. Analytic results validated by simulation clearly show the latency benefits of the synchronized sector assignment over the random assignment.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337058]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>832</startPage>
			<endPage>834</endPage>
			<fileSize>212</fileSize>
			<authors><![CDATA[Joon-Sang Park;Sung-woo Cho;Sanadidi, M.Y.;Gerla, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the capacity growth of opportunistic single-relay selection using quality-based feedback in fixed-gain amplify-and-forward relaying]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337059]]></link>
			<description><![CDATA[In this letter, the capacity of simple opportunistic single-relay selection (OSRS) is addressed for a dual-hop cooperative network with a source, destination, and lots of possibly cooperative relays. We provide asymptotic lower and upper bounds on the capacity of OSRS. Quality-based channel state reporting (QBR) is used to avoid increases in the feedback load, especially when the number of relays is large. The numerical results show that QBR does not degrade the capacity while it successfully reduces feedback.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337059]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>835</startPage>
			<endPage>837</endPage>
			<fileSize>283</fileSize>
			<authors><![CDATA[Eun-Hee Shin;Dongwoo Kim;]]></authors>
		</item>
		<item>
			<title><![CDATA[Bit rate comparison of adaptive OFDM and cyclic prefixed single-carrier with DFE]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337060]]></link>
			<description><![CDATA[This letter considers two variants of a cyclic prefixed block transmission: (i) orthogonal frequency division multiplexing (OFDM), (ii) cyclic prefixed single-carrier (CPSC) transmission with decision feedback equalization (DFE). We aim at comparing these two schemes in terms of achievable bit rate with adaptive bit loading. It is analytically demonstrated that, for all signal to noise ratio values, OFDM achieves a bit rate greater than or equal to that of DFE-CPSC, independently of whether uniform or optimal power allocation is considered.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337060]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>838</startPage>
			<endPage>840</endPage>
			<fileSize>159</fileSize>
			<authors><![CDATA[Devillers, B.;Vandendorpe, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Capacity and fairness tradeoff in multiuser scheduling system with reduced feedback]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337061]]></link>
			<description><![CDATA[Multiuser diversity is an effective technique to increase the capacity of wireless networks. However, the poor fairness among the mobile stations (MSs) and the heavy feedback load as the number of MSs increases are the main problems in implementing multiuser diversity. We propose a new scheduling scheme with opportunistic feedback. Specifically, the schedule for multiple users is based on two different criteria such as the absolute SNR and the normalized SNR. Simulation result shows that the tradeoff between capacity and fairness can be fine-tuned through the proposed scheduling scheme.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337061]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>841</startPage>
			<endPage>843</endPage>
			<fileSize>227</fileSize>
			<authors><![CDATA[Taejoon Kim;Jong-Tae Lim;]]></authors>
		</item>
		<item>
			<title><![CDATA[A distributed selection cooperation protocol with feedback and its DMT in nakagami-m fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337062]]></link>
			<description><![CDATA[Selection cooperation is a simple and effective method proposed for cooperative diversity systems. We develop a distributed cooperative protocol with feedback based on selection cooperation. The best relay is selected in a fully decentralized manner and the protocol can be easily integrated with existing wireless networks. The diversity-multiplexing tradeoff (DMT) of the proposed protocol as well as common selection cooperation with feedback is derived over Nakagami-m fading channels. The result shows the protocol has significant increase of the spectral efficiency compared with the one without feedback. We also show that the selection cooperation has the same DMT as opportunistic relaying in general fading channels with or without feedback.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337062]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>844</startPage>
			<endPage>846</endPage>
			<fileSize>177</fileSize>
			<authors><![CDATA[Wang, H.;Yang, S.;Lin, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the beamforming design for efficient interference alignment]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337063]]></link>
			<description><![CDATA[An efficient interference alignment (IA) scheme is developed for k-user single-input single-output frequency selective fading interference channels. The main idea is to steer the transmit beamforming matrices such that at each receiver the subspace dimensions occupied by interference-free desired streams are asymptotically the same as those occupied by all interferences. Our proposed scheme achieves a higher multiplexing gain at any given number of channel realizations in comparison with the original IA scheme, which is known to achieve the optimal multiplexing gain asymptotically.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337063]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>847</startPage>
			<endPage>849</endPage>
			<fileSize>197</fileSize>
			<authors><![CDATA[Sang Won Choi;Jafar, S.A.;Sae-Young Chung;]]></authors>
		</item>
		<item>
			<title><![CDATA[Distributed wake-up scheduling for data collection in tree-based wireless sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337064]]></link>
			<description><![CDATA[In a multi-hop wireless network, a conventional way of defining interference neighbors is to prohibit a node from using the same slot/code as those of its 1-hop and 2-hop neighbors. However, for data collection in a wireless sensor network, since the set of communication nodes is limited and the transmission directions are toward the sink, we show that a less strict set of interference neighbors can be defined. Based on this observation, we develop an efficient distributed wake-up scheduling scheme for data collection in a sensor network that achieves both energy conservation and low reporting latency.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337064]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>850</startPage>
			<endPage>852</endPage>
			<fileSize>271</fileSize>
			<authors><![CDATA[Fang-Jing Wu;Yu-Chee Tseng;]]></authors>
		</item>
		<item>
			<title><![CDATA[An efficient on-the-fly encoding algorithm for binary and finite field LDPC codes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337065]]></link>
			<description><![CDATA[We present a general framework on prototype structures for efficiently encoding low density parity check codes onthe- fly. The encoding algorithm is applicable to finite field based codes and can handle a wide range of high code rates and large block lengths. This structure can be used particularly in data storage and multimedia applications with increased code rate and throughput requirements. We also establish the necessary and sufficient conditions for the existence of such encoders.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337065]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>853</startPage>
			<endPage>855</endPage>
			<fileSize>200</fileSize>
			<authors><![CDATA[Srinivasa, S.G.;Weathers, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Efficient bad equalizer in two-ray multipath fading channels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337066]]></link>
			<description><![CDATA[An efficient bidirectional arbitrated decision feedback (BAD) equalizer is presented in single-carrier block transmission system in the Two-Ray multipath fading channels, where the output from the bidirectional equalizers are combined together directly using maximal ratio combining (MRC) rule to improve the signal-to-noise ratio (SNR) before demodulation. The computational complexity of the BAD equalizer presented is linear with the channel length, which is the same as conventional decision feedback equalizer (DFE) and is significantly lower than that of conventional BAD equalizer as well as the maximum likelihood (ML) algorithm. While the performance of the new scheme depends on the specific channel characteristics, it is shown by simulation results that the performance of the new BAD can surpass the one of DFE dramatically in the minimum or non-minimum phase Two-Ray multipath fading channels.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337066]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>856</startPage>
			<endPage>858</endPage>
			<fileSize>1611</fileSize>
			<authors><![CDATA[Wang, J.;Yang, H.;Yi, K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Dynamic resource allocation with service guarantees over large scale optical networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337067]]></link>
			<description><![CDATA[The lack of effective contention resolution mechanisms in the optical domain presents dynamic optical switching architectures with a hard dilemma between high loss (when adopting one-way reservations) and high delay (when using two-way reservations). In this work we evaluate an alternative hierarchical network architecture, which achieves a satisfactory compromise by partitioning the network into a number of geographically limited domains operating in slot and frame synchronous mode where two-way reservations are effective.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337067]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>859</startPage>
			<endPage>861</endPage>
			<fileSize>289</fileSize>
			<authors><![CDATA[Orphanoudakis, T.G.;Drakos, A.;Leligou, H.C.;Stavdas, A.;Boucouvalas, A.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A sybil-proof referral system based on multiplicative reputation chains]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337068]]></link>
			<description><![CDATA[Transactions between peers in social networks generate direct reputation (social capital) information. This can be augmented with indirect referrals, on demand or continually, thus giving peers additional information prior to engaging in transactions with others. Despite proposed deterrents such as identity acquisition costs, false referrals through sybil identities pose a significant threat. In this note, we show how a reputation system which multiplicatively chains referrals, and adds referrals from different referral paths/chains, is sybil-proof.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337068]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>862</startPage>
			<endPage>864</endPage>
			<fileSize>146</fileSize>
			<authors><![CDATA[Kesidis, G.;Tangpong, A.;Griffin, C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Incorporating mutation probability into priority-aware protection in optical networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337069]]></link>
			<description><![CDATA[A persisting major challenge for optical network operators is to meet the various availability requirements of the different subscribed services through the deployment of effective protection strategies. Priority-aware shared protection is a promising scheme that has been proposed in the open literature as a potential approach to tackling this challenge. However, the priority-aware protection strategy is rigid in the sense that it privileges the high priority connections regardless of the low priority ones. Hence, this letter proposes to improve priority-aware protection by introducing the mutation probability parameter. This parameter expresses the likelihood that a highpriority connection be relegated temporarily to a lower priority level during recovery. In this way, the mutation-based protection strategy offers optical operators the possibility to increase the availability of their low-priority clients without violating the availability requirements of their high-priority ones. Performance of this novel protection strategy is analyzed in this letter by precisely calculating the connection availabilities resulting from its deployment.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337069]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>865</startPage>
			<endPage>867</endPage>
			<fileSize>207</fileSize>
			<authors><![CDATA[Fawaz, W.;Khabbaz, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A novel server selection method to achieve delay-based fairness in the server palm]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337070]]></link>
			<description><![CDATA[It is pivotal to achieve delay-based fairness when users access the same content, especially in real-time services, from content-replicated servers based upon the client-server communication model. To resolve this issue, this letter proposes a novel server selection method of providing users with delaybased fairness from all the corresponding servers by applying the delay-based dynamic deficit round robin (D3RR) scheme. The deficit counter of the D3RR is adjusted based upon round trip times (RTTs) of data traffic measured by passive-based probing which ensures low resource waste. Performance evaluation results highlight that the delay variance among all the corresponding servers can be maintained as low as possible and delay-based fairness is guaranteed without unnecessary waste of resources.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337070]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>868</startPage>
			<endPage>870</endPage>
			<fileSize>244</fileSize>
			<authors><![CDATA[Young-Tae Han;Min-Gon Kim;Hong-Shik Park;]]></authors>
		</item>
		<item>
			<title><![CDATA[LMA initiated route optimization protocol for improving PMIP handover performance]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337071]]></link>
			<description><![CDATA[We propose a Local Mobility Anchor (LMA) initiated route optimization protocol for a smooth transition from the old optimized path to a new optimized path after handover in Proxy Mobile IP (PMIP). The LMA initiated protocol can reduce the handover latency and achieve fast recovery of the optimized path after handover. As a result, the proposed protocol solves the out-of-sequence delivery problem during the route optimization procedure.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337071]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>871</startPage>
			<endPage>873</endPage>
			<fileSize>346</fileSize>
			<authors><![CDATA[Jin Seek Choi;Boo Geum Jung;Tae-il Kim;]]></authors>
		</item>
		<item>
			<title><![CDATA[A tree key graph design scheme for hierarchical multi-group access control]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337072]]></link>
			<description><![CDATA[A tree key graph design scheme for hierarchical multi-group access control with low communication overhead is presented. A simulation result shows that the proposed scheme can reduce a communication overhead up to about 15.2% compared to the previously proposed scheme.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337072]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>874</startPage>
			<endPage>876</endPage>
			<fileSize>337</fileSize>
			<authors><![CDATA[Han-Seung Koo;O-Hyung Kwon;Sung-Woong Ra;]]></authors>
		</item>
		<item>
			<title><![CDATA[A distributed self-deployment algorithm for the coverage of mobile wireless sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337073]]></link>
			<description><![CDATA[This letter addresses a coverage problem through the use of a self-deployed mobile wireless sensor network. We propose a distributed motion coordination algorithm for the mobile sensors to autonomously form a sensor barrier between two given landmarks to achieve the barrier coverage. The algorithm is developed based on some simple rules that are computationally efficient and require less communication overhead.]]></description>
			<pubDate><![CDATA[November  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5337051&arnumber=5337073]]></guid>
			<volume>13</volume>
			<issue>11</issue>
			<startPage>877</startPage>
			<endPage>879</endPage>
			<fileSize>266</fileSize>
			<authors><![CDATA[Cheng, T.M.;Savkin, A.V.;]]></authors>
		</item>
	</channel>
</rss>