<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Wireless Communications, IEEE - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 7742 </description>
		<year>2009</year>
		<month>June     </month>
		<day>19</day>
		<item>
			<title><![CDATA[IEEE Wireless Communications - cover]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907550]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907550]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>c1</startPage>
			<endPage>c1</endPage>
			<fileSize>1571</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Table of contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907551]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907551]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>1</startPage>
			<endPage>1</endPage>
			<fileSize>44</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Wireless Communications back to The States [message from the editor-in-chief]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907552]]></link>
			<description><![CDATA[Dear readers, My term as the Editor-in-Chief ended last February. I am delighted to introduce the new Editor-in-Chief for the magazine, Prof. Yuguang "Michael" Fang, from the University of Florida. Michael has been on the Editorial Board of the magazine since January 2003, and has organized several special issues and handled the review process for many of our open call papers. He is a capable researcher and is very active in the professional community. I have no doubt he will continue in the tradition of our magazine's excellence since its start in 1994.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907552]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>2</startPage>
			<endPage>3</endPage>
			<fileSize>404</fileSize>
			<authors><![CDATA[Jamalipour, A.;Fang, Y.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Scanning the literature]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907553]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907553]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>4</startPage>
			<endPage>5</endPage>
			<fileSize>52</fileSize>
			<authors><![CDATA[Taleb, T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[OFDM for cognitive radio: merits and challenges [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907554]]></link>
			<description><![CDATA[Cognitive radio is a novel concept that enables wireless systems to sense the environment, adapt, and learn from previous experience to improve the quality of the communication. However, CR requires a flexible and adaptive physical layer in order to perform the required tasks efficiently. In this article, CR systems and their requirement of a physical layer are discussed, and the orthogonal frequency division multiplexing technique is investigated as a candidate transmission technology for CR. The challenges that arise from employing OFDM in CR systems are identified. The cognitive properties of some OFDM-based wireless standards also are discussed to indicate the trend toward a more cognitive radio.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907554]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>6</startPage>
			<endPage>15</endPage>
			<fileSize>6139</fileSize>
			<authors><![CDATA[Mahmoud, H.;Yucek, T.;Arslan, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Dynamic spectrum access in IEEE 802.22- based cognitive wireless networks: a game theoretic model for competitive spectrum bidding and pricing [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907555]]></link>
			<description><![CDATA[The emerging IEEE 802.22-based wireless regional area network technology will use the same radio spectrum currently allocated for TV service. This standard will use the concept of cognitive radio based on dynamic spectrum access to provide wireless access services in a large coverage area. A brief overview of the current state of the IEEE 802.22 standard is provided with a particular emphasis on the spectrum management (i.e., spectrum sensing and dynamic spectrum access) in this standard. Key research issues related to spectrum trading among TV broadcasters, WRAN service providers, and IEEE 802.22-based cognitive radio users are identified. To this end, a hierarchical spectrum trading model is presented to analyze the interaction among WRAN service providers, TV broadcasters, and WRAN users. In this model a double auction is established among multiple TV broadcasters and WRAN service providers who sell and buy the radio spectrum (i.e., TV bands), respectively. Again, multiple WRAN service providers compete with each other by adjusting the service price charged to WRAN users. We propose a joint spectrum bidding and service pricing model for WRAN service providers to maximize their profits. A non-cooperative game is formulated to obtain the solution in terms of the number of TV bands and the service price of a service provider. Numerical results are presented on the performance of this joint spectrum bidding and pricing model.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907555]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>16</startPage>
			<endPage>23</endPage>
			<fileSize>159</fileSize>
			<authors><![CDATA[Niyato, D.;Hossain, E.;Zhu Han;]]></authors>
		</item>
		<item>
			<title><![CDATA[Securing resource-constrained wireless ad hoc networks [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907556]]></link>
			<description><![CDATA[Huge interest in and demand for services over the information superhighway have pressed various telecommunications research fronts and led to a new form of future Internet consisting of wired and wireless segments where resource-constrained devices such as mobile devices, smart phones, palm pilots, and wireless sensors may become integral parts of the Internet rather than access-only platforms. One of the key design problems is the security in such heterogeneous networks, particularly over wireless networks with resource constraints. In this tutorial article we discuss a novel approach to addressing security issues, and articulate why and how ID-based cryptography can be effectively applied to address various security problems in resource-constrained wireless networks.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907556]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>24</startPage>
			<endPage>30</endPage>
			<fileSize>1090</fileSize>
			<authors><![CDATA[Yuguang Fang;Xiaoyan Zhu;Yanchao Zhang;]]></authors>
		</item>
		<item>
			<title><![CDATA[IP2P: a peer-to-peer system for mobile devices [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907557]]></link>
			<description><![CDATA[Peer-to-peer communications is a major trend in wireless Internet. In a P2P system, the calling peer must identify the network address of the called peer before establishing a P2P connection. This article proposes iP2P, a hybrid P2P system for mobile devices. iP2P utilizes the short message service as the control protocol to identify the address of the called peer. Our approach provides an efficient identification mechanism without the requirement for the maintenance of a centralized registrar server in a hybrid P2P system. We also show how iP2P can integrate effectively with the existing network address translation traversal mechanisms to solve the private IP address issue.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907557]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>30</startPage>
			<endPage>36</endPage>
			<fileSize>258</fileSize>
			<authors><![CDATA[Chien-Chun Huang-Fu;Yi-Bing Lin;Rao, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Vertical QoS mapping over wireless interfaces [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907558]]></link>
			<description><![CDATA[This article focuses on the problem of quality of service mapping between layers in a cascade. Protocol stacks in telecommunications networks are composed of functional layers. QoS provision depends on the performance achieved at each layer and is based on functions performed at layer interfaces. In practice, QoS derives from reliable physical and link layers that can offer specific transport services to upper network layers. The data flows (or bundles of flows) generated by the upper layers (e.g., the network layers) are forwarded down to a physical interface that transports the information along a channel that provides, if possible, the expected QoS to the upper layers. The action is called vertical QoS mapping and poses many challenges for a communication scientist, in particular if it is applied to wireless interfaces. This article states the definition of vertical QoS mapping, proposes a formal separation between technology-dependent and technology-independent layers, models each functional layer as a battery of buffers, generalizes the relation between layers through a chain of buffers in a cascade, formalizes the theoretical problems of vertical QoS mapping, and suggests possible solutions that use dynamic bandwidth allocation schemes.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907558]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>37</startPage>
			<endPage>43</endPage>
			<fileSize>261</fileSize>
			<authors><![CDATA[Marchese, M.;Mongelli, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Challenging issues in visual sensor networks [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907559]]></link>
			<description><![CDATA[Wireless sensor networks are an important research area that has attracted considerable attention. Most of this attention, however, has been concentrated on WSNs that collect scalar data such as temperature and vibration. Scalar data can be insufficient for many applications such as automated surveillance and traffic monitoring. In contrast, camera sensors collect visual data, which are rich in information and hence offer tremendous potential when used in WSNs. However, they raise new challenges such as the transmission of visual data with high computational and bandwidth requirements in mainly low-power visual sensor networks. In this article we highlight the challenges and opportunities of VSNs. We discuss major research issues of VSNs, specifically camera coverage optimization, network architecture, and low-power visual data processing and communication, and identify enabling approaches in this area.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907559]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>44</startPage>
			<endPage>49</endPage>
			<fileSize>205</fileSize>
			<authors><![CDATA[Charfi, Y.;Wakamiya, N.;Murata, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[DV-Loc: a scalable localization protocol using Voronoi diagrams for wireless sensor networks [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907560]]></link>
			<description><![CDATA[Localization systems have been identified as a key issue in the development and operation of wireless sensor networks. DV-Hop, a well-known localization algorithm, has recently been proposed for WSNs. Its basic idea relies on transforming the distance to all beacon nodes from hops to meters by using the computed average size of a hop. Despite its advantages, the DV-Hop algorithm has some limitations, mainly due to its high communication cost and energy consumption, which unfortunately limit its applicability to small or medium-sized sensor networks. The scalability issue of DV-Hop is a challenging problem that needs to be addressed. In this article we propose a novel localization-based protocol and show how Voronoi diagrams can be used efficiently to scale a DV-Hop algorithm while maintaining and/or reducing further DV-Hop's localization error. In our localization scheme, nodes can also be localized by their Voronoi cells. In order to evaluate the performance of our scheme, we present an extensive set of simulation experiments using ns-2. Our results clearly indicate that our proposed algorithm performs and scales better than DV-Hop.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907560]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>50</startPage>
			<endPage>55</endPage>
			<fileSize>250</fileSize>
			<authors><![CDATA[Boukerche, A.;Oliveira, H.A.B.F.;Nakamura, E.F.;Loureiro, A.A.F.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Prediction in wireless networks by Markov chains [accepted from open call]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907561]]></link>
			<description><![CDATA[Discrete sequence modeling and prediction is an important goal and a challenge for pervasive computing. Mobile clients' data request forecasting and location tracking in wireless cellular networks are characteristic application areas of sequence prediction in pervasive computing. This article presents information-theoretic techniques for discrete sequence prediction. It surveys, classifies, and compares the state-of-the-art solutions, suggesting routes for further research by discussing the critical issues and challenges of prediction in wireless networks.]]></description>
			<pubDate><![CDATA[April  2009]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4907549&arnumber=4907561]]></guid>
			<volume>16</volume>
			<issue>2</issue>
			<startPage>56</startPage>
			<endPage>64</endPage>
			<fileSize>841</fileSize>
			<authors><![CDATA[Katsaros, D.;Manolopoulos, Y.;]]></authors>
		</item>
	</channel>
</rss>