<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Communications and Networks, Journal of - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 5449605 </description>
		<year>2013</year>
		<month>May      </month>
		<day>21</day>
		<item>
			<title><![CDATA[Evaluation of the use of guard nodes for securing the routing in VANETs]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512236]]></link>
			<description><![CDATA[We address the problem of effective vehicular routing in hostile scenarios where malicious nodes intend to jeopardize the delivery of messages. Compromised vehicles can severely affect the performance of the network by a number of attacks, such as selectively dropping messages, manipulating them on the fly, and the likes. One of the best performing solutions that has been used in static wireless sensor networks to deal with these attacks is based on the concept of watchdog nodes (also known as guard nodes) that collaborate to continue the forwarding of data packets in case a malicious behavior in a neighbor node is detected. In this work, we consider the beacon-less routing algorithm for vehicular environments routing protocol, which has been previously shown to perform very well in vehicular networks, and analyze whether a similar solution would be feasible for vehicular environments. Our simulation results in an urban scenario show that watchdog nodes are able to avoid up to a 50% of packet drops across different network densities and for different number of attackers, without introducing a significant increase in terms of control overhead. However, the overall performance of the routing protocol is still far from optimal. Thus, in the case of vehicular networks, watchdog nodes alone are not able to completely alleviate these security threats.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512236]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>122</startPage>
			<endPage>131</endPage>
			<fileSize>731</fileSize>
			<authors><![CDATA[Martinez, Juan A.;Vigueras, Daniel;Ros, Francisco J.;Ruiz, Pedro M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Improving the performance of OFDM-based vehicular systems through diversity coding]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512237]]></link>
			<description><![CDATA[In this paper, we present diversity coded orthogonal frequency division multiplexing (DC-OFDM), an approach to maximize the probability of successful reception and increase the reliability of OFDM-based systems through diversity coding. We focus on the application of DC-OFDM to vehicular networks based on IEEE 802.11p technology and analyze the performance improvement using this new technology. It is shown that DC-OFDM significantly improves the performance of vehicular ad hoc networks in terms of throughput and the expected number of correctly received symbols.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512237]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>132</startPage>
			<endPage>141</endPage>
			<fileSize>946</fileSize>
			<authors><![CDATA[Arrobo, Gabriel E.;Gitlin, Richard D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Performance evaluation of improved fast PMIPv6-based network mobility for intelligent transportation systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512238]]></link>
			<description><![CDATA[The network mobility basic support (NEMO BS) protocol has been investigated to provide Internet connectivity for a group of nodes, which is suitable for intelligent transportation systems (ITS) applications. NEMO BS often increases the traffic load and handover latency because it is designed on the basis of mobile Internet protocol version 6 (MIPv6). Therefore, schemes combining proxy MIPv6 with NEMO (P-NEMO) have emerged to solve these problems. However, these schemes still suffer from packet loss and long handover latency during handover. Fast P-NEMO (FP-NEMO) has emerged to prevent these problems. Although the FP-NEMO accelerates handover, it can cause a serious tunneling burden between the mobile access gateways (MAGs) during handover. This problem becomes more critical as the traffic between the MAGs increases. Therefore, we propose a scheme for designing an improved FP-NEMO (IFP-NEMO) to eliminate the tunneling burden by registering a new address in advance. When the registration is completed before the layer 2 handover, the packets are forwarded to the new MAG directly and thereby the IFP-NEMO avoids the use of the tunnel between the MAGs during handover. For the evaluation of the performance of the IFP-NEMO compared with the FP-NEMO, we develop an analytical framework for fast handovers on the basis of P-NEMO. Finally, we demonstrate that the IFP-NEMO outperforms the FP-NEMO through numerical results.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512238]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>142</startPage>
			<endPage>152</endPage>
			<fileSize>479</fileSize>
			<authors><![CDATA[Ryu, Seonggeun;Choi, Ji-Woong;Park, Kyung-Joon;]]></authors>
		</item>
		<item>
			<title><![CDATA[A beacon-based trust management system for enhancing user centric location privacy in VANETs]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512239]]></link>
			<description><![CDATA[In recent years, more and more researches have been focusing on trust management of vehicle ad-hoc networks (VANETs) for improving the safety of vehicles. However, in these researches, little attention has been paid to the location privacy due to the natural conflict between trust and anonymity, which is the basic protection of privacy. Although traffic safety remains the most crucial issue in VANETs, location privacy can be just as important for drivers, and neither can be ignored. In this paper, we propose a beacon-based trust management system, called BTM, that aims to thwart internal attackers from sending false messages in privacy-enhanced VANETs. To evaluate the reliability and performance of the proposed system, we conducted a set of simulations under alteration attacks, bogus message attacks, and message suppression attacks. The simulation results show that the proposed system is highly resilient to adversarial attacks, whether it is under a fixed silent period or random silent period location privacy-enhancement scheme.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512239]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>153</startPage>
			<endPage>163</endPage>
			<fileSize>346</fileSize>
			<authors><![CDATA[Chen, Yi-Ming;Wei, Yu-Chih;]]></authors>
		</item>
		<item>
			<title><![CDATA[Secure and robust clustering for quantized target tracking in wireless sensor networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512240]]></link>
			<description><![CDATA[We consider the problem of secure and robust clustering for quantized target tracking in wireless sensor networks (WSN) where the observed system is assumed to evolve according to a probabilistic state space model. We propose a new method for jointly activating the best group of candidate sensors that participate in data aggregation, detecting the malicious sensors and estimating the target position. Firstly, we select the appropriate group in order to balance the energy dissipation and to provide the required data of the target in the WSN. This selection is also based on the transmission power between a sensor node and a cluster head. Secondly, we detect the malicious sensor nodes based on the information relevance of their measurements. Then, we estimate the target position using quantized variational filtering (QVF) algorithm. The selection of the candidate sensors group is based on multi-criteria function, which is computed by using the predicted target position provided by the QVF algorithm, while the malicious sensor nodes detection is based on Kullback-Leibler distance between the current target position distribution and the predicted sensor observation. The performance of the proposed method is validated by simulation results in target tracking for WSN.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512240]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>164</startPage>
			<endPage>172</endPage>
			<fileSize>400</fileSize>
			<authors><![CDATA[Mansouri, Majdi;Khoukhi, Lyes;Nounou, Hazem;Nounou, Mohamed;]]></authors>
		</item>
		<item>
			<title><![CDATA[Fundamental study on effect of preceding vehicle information on fuel consumption reduction of a vehicle group]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512241]]></link>
			<description><![CDATA[It is a concern that eco-driving vehicles, because their driving behavior differs from other vehicles due to e.g. e-start, may inhibit smooth traffic flow. Therefore, it is necessary to study the cooperative eco-driving done by a vehicle group, putting &#x201C;vehicle-to-vehicle communication&#x201D; and &#x201C;road-to-vehicle communication&#x201D; into perspective. Based on these factors, this study aimed to: 1) Analyze fuel consumption rates and driving behaviors of more than one vehicle following an Eco-Driving vehicle. 2) Examine the effect of information on the fuel consumption rate of the preceding vehicles on the following vehicles. As a result, the following findings were obtained: 1) By providing information to multiple following vehicles, the fuel consumption rate of the second vehicle was not lowered, while that of the third one was. 2) It is possible that, when information on fuel consumption of a preceding vehicle is provided to the following one, an inter-vehicular distance is shortened during deceleration to contribute to smooth traffic flow. From the above results, it is suggested that, when targeting a vehicle group, sharing the information on preceding vehicles is effective.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512241]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>173</startPage>
			<endPage>178</endPage>
			<fileSize>793</fileSize>
			<authors><![CDATA[Matsumoto, Shuichi;Kawashima, Hironao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Infotainment services based on push-mode dissemination in an integrated VANET and 3G architecture]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512242]]></link>
			<description><![CDATA[Given the bandwidth assignment for dedicated short range communications for use in vehicular ad-hoc network (VANET) and the expected introduction of equipment in the next few years, we elaborate on how VANET can support infotainment services. We define an architectural model for the integration of VANETs and cellular networks, according to a push mode paradigm where VANETs are used primarily to disseminate service announcements and general interest messages. Cooperation with cellular network is addressed by comparing architecture alternatives. A set of information dissemination protocols for VANETs is compared via simulations on a real urban map. Some results from a lab testbed based on IEEE 802.11p boards are presented along with an application developed for Android operating system to demonstrate the concept of the paper.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512242]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>179</startPage>
			<endPage>190</endPage>
			<fileSize>1165</fileSize>
			<authors><![CDATA[Baiocchi, Andrea;Cuomo, Francesca;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cell searching and DoA estimation for a mobile relay station in a multipath environment]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512243]]></link>
			<description><![CDATA[In this paper, a mobile relay station (MRS) for vehicles with a beamforming antenna is considered to increase the reliability of the transmission link, particularly for the MRS at the cell boundary. A cell searching and direction-of-arrival estimation method for an MRS with a uniform linear array is proposed for OFDM-based cellular systems in a multipath environment, even with the existence of the symbol timing offsets and carrier frequency offsets. The performance of the proposed method is evaluated by computer simulation using the standard profile of IEEE 802.16e.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512243]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>191</startPage>
			<endPage>197</endPage>
			<fileSize>2007</fileSize>
			<authors><![CDATA[Pec, Rothna;Hong, Tae Howan;Cho, Yong Soo;]]></authors>
		</item>
		<item>
			<title><![CDATA[RCDP: Raptor-based content delivery protocol for unicast communication in wireless networks for ITS]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512244]]></link>
			<description><![CDATA[Recent advances in forward error correction (FEC) coding techniques were focused on addressing the challenges of multicast and broadcast delivery. However, FEC approaches can also be used for unicast content delivery in order to solve transmission control protocol issues found in wireless networks. In thispaper, we exploit the error resilient properties of Raptor codes by proposing Raptor-based content delivery protocol (RCDP) &#x2014; a novel solution for reliable and bidirectional unicast communication in lossy links that can improve content delivery in situations where the wireless network is the bottleneck. RCDP has been designed, validated, optimized, and its performance has been analyzed in terms of throughput and resource efficiency. Experimental results show that RCDP is a highly efficient solution for environments characterized by high delays and packet losses making it very suitable for intelligent transport system oriented applications since it achieves significant performance improvements when compared to traditional transport layer protocols.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512244]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>198</startPage>
			<endPage>206</endPage>
			<fileSize>453</fileSize>
			<authors><![CDATA[Baguena, Miguel;Toh, C.K.;Calafate, Carlos T.;Cano, Juan-Carlos;Manzoni, Pietro;]]></authors>
		</item>
		<item>
			<title><![CDATA[A seamless flow mobility management architecture for vehicular communication networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512245]]></link>
			<description><![CDATA[Vehicular ad-hoc networks (VANETs) are self-organizing, self-healing networks which provide wireless communication among vehicular and roadside devices. Applications in such networks can take advantage of the use of simultaneous connections, thereby maximizing the throughput and lowering latency. In order to take advantage of all radio interfaces of the vehicle and to provide good quality of service for vehicular applications, we developed a seamless flow mobility management architecture based on vehicular network application classes with network-based mobility management. Our goal is to minimize the time of flow connection exchange in order to comply with the minimum requirements of vehicular application classes, as well as to maximize their throughput. Network simulator (NS-3) simulations were performed to analyse the behaviour of our architecture by comparing it with other three scenarios. As a result of this work, we observed that the proposed architecture presented a low handover time, with lower packet loss and lower delay.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512245]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>207</startPage>
			<endPage>216</endPage>
			<fileSize>5040</fileSize>
			<authors><![CDATA[Meneguette, Rodolfo Ipolito;Bittencourt, Luiz Fernando;Madeira, Edmundo Roberto Mauro;]]></authors>
		</item>
		<item>
			<title><![CDATA[Novel class of entanglement-assisted quantum codes with minimal ebits]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512246]]></link>
			<description><![CDATA[Quantum low-density parity-check (LDPC) codes based on the Calderbank-Shor-Steane construction have low encoding and decoding complexity. The sum-product algorithm (SPA) can be used to decode quantum LDPC codes; however, the decoding performance may be significantly decreased by the many four-cycles required by this type of quantum codes. All four-cycles can be eliminated using the entanglement-assisted formalism with maximally entangled states (ebits). The proposed entanglement-assisted quantum error-correcting code based on Euclidean geometry outperform differently structured quantum codes. However, the large number of ebits required to construct the entanglement-assisted formalism is a substantial obstacle to practical application. In this paper, we propose a novel class of entanglement-assisted quantum LDPC codes constructed using classical Euclidean geometry LDPC codes. Notably, the new codes require one copy of the ebit. Furthermore, we propose a construction scheme for a corresponding zigzag matrix and show that the algebraic structure of the codes could easily be expanded. A large class of quantum codes with various code lengths and code rates can be constructed. Our methods significantly improve the possibility of practical implementation of quantum error-correcting codes. Simulation results show that the entanglement-assisted quantum LDPC codes described in this study perform very well over a depolarizing channel with iterative decoding based on the SPA and that these codes outperform other quantum codes based on Euclidean geometries.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512246]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>217</startPage>
			<endPage>221</endPage>
			<fileSize>174</fileSize>
			<authors><![CDATA[Dong, Cao;Yaoliang, Song;]]></authors>
		</item>
		<item>
			<title><![CDATA[Spectrum management models for cognitive radios]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512247]]></link>
			<description><![CDATA[This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512247]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>222</startPage>
			<endPage>227</endPage>
			<fileSize>458</fileSize>
			<authors><![CDATA[Kaur, Prabhjot;Khosla, Arun;Uddin, Moin;]]></authors>
		</item>
		<item>
			<title><![CDATA[Extended equal service and differentiated service models for peer-to-peer file sharing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512248]]></link>
			<description><![CDATA[Peer-to-peer (P2P) systems have proved the most effective and popular file sharing applications in recent years. Previous studies mainly focused on equal service and differentiated service strategies when peers have no initial data before their downloads. For an upload-constrained P2P file sharing system, we model both the equal service process and the differentiated service process when the initial data distribution of peers satisfies some special conditions. Moreover, we show how to minimize the time required to distribute the file to any number of peers. The proposed fluid-based models can reveal the intrinsic relations among the initial data amount, the peer set size, and the minimum last finish time. The closed-form expressions derived from the extended models can closely approximate chunk-based models and systems, especially for relatively large files. As an application of the extended models, we show how to provide differentiated service efficiently to multiple peer sets. Since no limits are imposed on the upload bandwidth of peers or the size of each peer set, we believe that our analytic process and the results achieved can provide not only fundamental insights into bandwidth allocation and data scheduling but also a helpful reference for both improving system performance and building an effective incentive mechanism for P2P file sharing systems.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512248]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>228</startPage>
			<endPage>239</endPage>
			<fileSize>979</fileSize>
			<authors><![CDATA[Zhang, Jianwei;Wang, Yongchao;Xing, Wei;Lu, Dongming;]]></authors>
		</item>
		<item>
			<title><![CDATA[Call for papers]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512249]]></link>
			<description><![CDATA[Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512249]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>1</startPage>
			<endPage>1</endPage>
			<fileSize>517</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Call for papers]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512250]]></link>
			<description><![CDATA[Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512250]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>1</startPage>
			<endPage>1</endPage>
			<fileSize>296</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Call for papers]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512251]]></link>
			<description><![CDATA[Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512251]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>1</startPage>
			<endPage>1</endPage>
			<fileSize>296</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[JCN subscription application/renewal form]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512252]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512252]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>1</startPage>
			<endPage>1</endPage>
			<fileSize>255</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[[Front cover]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512253]]></link>
			<description><![CDATA[Presents the front cover for this issue of the publication.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512253]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>c1</startPage>
			<endPage>c1</endPage>
			<fileSize>539</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[[Back cover]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512254]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512254]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>c4</startPage>
			<endPage>c4</endPage>
			<fileSize>539</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Special issue on telematics communications and vehicular networking]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512255]]></link>
			<description><![CDATA[This special issue on Telematics Communication and Vehicular Networks examines the critical issues involved with telematics such as vehicular network infrastructure, vehicular network communication protocols, and vehicular services and applications.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512255]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>115</startPage>
			<endPage>121</endPage>
			<fileSize>832</fileSize>
			<authors><![CDATA[Manzoni, Pietro;Gitlin, Richard D.;Toh, C.K.;Zhang, Tao;Obana, Sadao;]]></authors>
		</item>
		<item>
			<title><![CDATA[[Back inside cover]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512256]]></link>
			<description><![CDATA[Provides a listing of current committee members and society officers.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512256]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>c3</startPage>
			<endPage>c3</endPage>
			<fileSize>252</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[[Front inside cover]]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512257]]></link>
			<description><![CDATA[Provides a listing of current committee members and society officers.]]></description>
			<pubDate><![CDATA[April  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6512257]]></guid>
			<volume>15</volume>
			<issue>2</issue>
			<startPage>c2</startPage>
			<endPage>c2</endPage>
			<fileSize>256</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>