<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Mobile Computing, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 7755 </description>
		<year>2013</year>
		<month>May      </month>
		<day>16</day>
		<item>
			<title><![CDATA[Distributed Cooperative Caching in Social Wireless Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175019]]></link>
			<description><![CDATA[This paper introduces cooperative caching policies for minimizing electronic content provisioning cost in Social Wireless Networks (SWNET). SWNETs are formed by mobile devices, such as data enabled phones, electronic book readers etc., sharing common interests in electronic content, and physically gathering together in public places. Electronic object caching in such SWNETs are shown to be able to reduce the content provisioning cost which depends heavily on the service and pricing dependences among various stakeholders including content providers (CP), network service providers, and End Consumers (EC). Drawing motivation from Amazon's Kindle electronic book delivery business, this paper develops practical network, service, and pricing models which are then used for creating two object caching strategies for minimizing content provisioning costs in networks with homogenous and heterogeneous object demands. The paper constructs analytical and simulation models for analyzing the proposed caching strategies in the presence of selfish users that deviate from network-wide cost-optimal policies. It also reports results from an Android phone-based prototype SWNET, validating the presented analytical and simulation results.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175019]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1037</startPage>
			<endPage>1053</endPage>
			<fileSize>1748</fileSize>
			<authors><![CDATA[Taghizadeh, Mahmoud;Micinski, Kristopher;Biswas, Subir;Ofria, Charles;Torng, Eric;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Efficient Time-Bound Collision Prevention Scheme for RFID Re-Entering Tags]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175017]]></link>
			<description><![CDATA[The efficiency of RFID applications is severely degraded when multiple tags transmit their IDs simultaneously. As a result, many anticollision algorithms have been proposed for reducing collisions at the reader. However, these algorithms focus only on the tags within communication range of the reader in the previous or current frames. That is, they ignore tags which move out of range of the reader in one frame, but then move back within range several frames later. As a result, the identification performance of the reader is seriously degraded. The present study analyzes the effect of re-entering tags on the performance of three common anticollision algorithms and proposes a new reblocking algorithm (RBA) to alleviate the problem. The lower and upper bounds of the collision probability for re-entering tags are derived using a multinomial coefficients approach. The performance evaluation results show that the proposed algorithm consumes fewer cycles and provides a more robust identification performance than existing blocking algorithms in real-world RFID systems characterized by re-entering tags.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175017]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1054</startPage>
			<endPage>1064</endPage>
			<fileSize>800</fileSize>
			<authors><![CDATA[Li, Jung-Shian;Huo, Yu-Min;]]></authors>
		</item>
		<item>
			<title><![CDATA[Network-Assisted Mobile Computing with Optimal Uplink Query Processing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175899]]></link>
			<description><![CDATA[Many mobile applications retrieve content from remote servers via user generated queries. Processing these queries is often needed before the desired content can be identified. Processing the request on the mobile devices can quickly sap the limited battery resources. Conversely, processing user queries at remote servers can have slow response times due communication latency incurred during transmission of the potentially large query. We evaluate a network-assisted mobile computing scenario where midnetwork nodes with &#x0022;leasing&amp;#x201D; capabilities are deployed by a service provider. Leasing computation power can reduce battery usage on the mobile devices and improve response times. However, borrowing processing power from mid-network nodes comes at a leasing cost which must be accounted for when making the decision of where processing should occur. We study the tradeoff between battery usage, processing and transmission latency, and mid-network leasing. We use the dynamic programming framework to solve for the optimal processing policies that suggest the amount of processing to be done at each mid-network node in order to minimize the processing and communication latency and processing costs. Through numerical studies, we examine the properties of the optimal processing policy and the core tradeoffs in such systems.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175899]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1065</startPage>
			<endPage>1078</endPage>
			<fileSize>979</fileSize>
			<authors><![CDATA[Chan, Carri W.;Bambos, Nicholas;Singh, Jatinder Pal;]]></authors>
		</item>
		<item>
			<title><![CDATA[ALERT: An Anonymous Location-Based Efficient Routing Protocol in MANETs]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175018]]></link>
			<description><![CDATA[Mobile Ad Hoc Networks (MANETs) use anonymous routing protocols that hide node identities and/or routes from outside observers in order to provide anonymity protection. However, existing anonymous routing protocols relying on either hop-by-hop encryption or redundant traffic, either generate high cost or cannot provide full anonymity protection to data sources, destinations, and routes. The high cost exacerbates the inherent resource constraint problem in MANETs especially in multimedia wireless applications. To offer high anonymity protection at a low cost, we propose an Anonymous Location-based Efficient Routing proTocol (ALERT). ALERT dynamically partitions the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a nontraceable anonymous route. In addition, it hides the data initiator/receiver among many initiators/receivers to strengthen source and destination anonymity protection. Thus, ALERT offers anonymity protection to sources, destinations, and routes. It also has strategies to effectively counter intersection and timing attacks. We theoretically analyze ALERT in terms of anonymity and efficiency. Experimental results exhibit consistency with the theoretical analysis, and show that ALERT achieves better route anonymity protection and lower cost compared to other anonymous routing protocols. Also, ALERT achieves comparable routing efficiency to the GPSR geographical routing protocol.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175018]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1079</startPage>
			<endPage>1093</endPage>
			<fileSize>1741</fileSize>
			<authors><![CDATA[Shen, Haiying;Zhao, Lianyu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Toward Accurate Mobile Sensor Network Localization in Noisy Environments]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175902]]></link>
			<description><![CDATA[The node localization problem in mobile sensor networks has received significant attention. Recently, particle filters adapted from robotics have produced good localization accuracies in conventional settings. In spite of these successes, state-of-the-art solutions suffer significantly when used in challenging indoor and mobile environments characterized by a high degree of radio signal irregularity. New solutions are needed to address these challenges. We propose a fuzzy logic-based approach for mobile node localization in challenging environments. Localization is formulated as a fuzzy multilateration problem. For sparse networks with few available anchors, we propose a fuzzy grid-prediction scheme. The fuzzy logic-based localization scheme is implemented in a simulator and compared to state-of-the-art solutions. Extensive simulation results demonstrate improvements in the localization accuracy from 20 to 40 percent when the radio irregularity is high. A hardware implementation running on Epic motes and transported by iRobot mobile hosts confirms simulation results and extends them to the real world.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175902]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1094</startPage>
			<endPage>1106</endPage>
			<fileSize>765</fileSize>
			<authors><![CDATA[Chenji, Harsha;Stoleru, Radu;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the Forwarding Performance under Heterogeneous Contact Dynamics in Mobile Opportunistic Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6178254]]></link>
			<description><![CDATA[In this paper, we focus on how the heterogeneous contact dynamics of mobile nodes impact the performance of forwarding algorithms in mobile opportunistic networks (MONs). To this end, we consider two representative heterogeneous network models, each of which captures heterogeneity among node pairs (individual) and heterogeneity in underlying environment (spatial), respectively, and examine the full extent of difference in delay performance they cause on forwarding algorithms through formal stochastic comparisons. We first show that these heterogeneous models correctly capture non-Poisson contact dynamics observed in real traces. We then rigorously establish stochastic/convex ordering relationships on the delay performance of direct forwarding and multicopy two-hop relay protocol under these heterogeneous models and the corresponding homogeneous model, all of which have the same average intercontact time of a random pair of nodes. In particular, we demonstrate that the heterogeneous models predict an entirely opposite ordering relationship in delay performance depending on which of the two heterogeneity structures is captured. We also provide simulation results including the delay performance of epidemic routing protocol to support the analytical findings. Our results thus suggest that the heterogeneity in mobile nodes' contact dynamics should be properly taken into account for the performance evaluation of forwarding algorithms. Our results will also be useful for better design of forwarding algorithms correctly exploiting the heterogeneity structure.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6178254]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1107</startPage>
			<endPage>1119</endPage>
			<fileSize>890</fileSize>
			<authors><![CDATA[Lee, Chul-Ho;Eun, Do Young;]]></authors>
		</item>
		<item>
			<title><![CDATA[DSS: Distributed SINR-Based Scheduling Algorithm for Multihop Wireless Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175901]]></link>
			<description><![CDATA[The problem of developing distributed scheduling algorithms for high throughput in multihop wireless networks has been extensively studied in recent years. The design of a distributed low-complexity scheduling algorithm becomes even more challenging when taking into account a physical interference model, which requires the SINR at a receiver to be checked when making scheduling decisions. To do so, we need to check whether a transmission failure is caused by interference due to simultaneous transmissions from distant nodes. In this paper, we propose a scheduling algorithm under a physical interference model, which is amenable to distributed implementation with 802.11 CSMA technologies. The proposed scheduling algorithm is shown to achieve throughput optimality. We present two variations of the algorithm to enhance the delay performance and to reduce the control overhead, respectively, while retaining throughput optimality.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175901]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1120</startPage>
			<endPage>1132</endPage>
			<fileSize>1662</fileSize>
			<authors><![CDATA[Ryu, Jiho;Joo, Changhee;Kwon, Ted &#x0022;Taekyoung&#x201D;;Shroff, Ness B.;Choi, Yanghee;]]></authors>
		</item>
		<item>
			<title><![CDATA[Path Selection under Budget Constraints in Multihop Cognitive Radio Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6178255]]></link>
			<description><![CDATA[Cognitive radio (CR) technology opens the licensed spectrum bands for opportunistic usage and initiates spectrum trading to improve the spectrum utilization. In this paper, we investigate the path selection problem in multihop cognitive radio networks (CRNs) under constraints on flow routing, link scheduling and CR source's budget. We extend the per-user-based spectrum trading in prior work to CR session-based spectrum trading, and effectively develop the spectrum trading mechanisms based on the cross-layer optimization in multihop CRNs. We introduce a new service provider, called secondary service provider (SSP), to help CR sessions to select the paths for packet delivery. Considering the price of bands and the potential returning of primary services at different CR links, the SSP purchases the licensed spectrum and jointly conducts flow routing and link scheduling under the budget constraints. We also propose a 4D conflict graph to characterize the conflict relationship among CR links and mathematically formulate the path selection problem under multiple constraints into an optimization problem with the objective of maximizing the end-to-end throughput. Due to the NP-hardness of the problem, we have also developed a heuristic algorithm to find the approximate solution.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6178255]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1133</startPage>
			<endPage>1145</endPage>
			<fileSize>808</fileSize>
			<authors><![CDATA[Pan, Miao;Yue, Hao;Zhang, Chi;Fang, Yuguang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Proteus: Multiflow Diversity Routing for Wireless Networks with Cooperative Transmissions]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193105]]></link>
			<description><![CDATA[In this paper, we consider the use of cooperative transmissions in multihop wireless networks to achieve Virtual Multiple Input Single Output (VMISO) links. Specifically, we investigate how the physical layer VMISO benefits translate into network level performance improvements. We show that the improvements are nontrivial (15 to 300 percent depending on the node density) but rely on two crucial algorithmic decisions: the number of cooperating transmitters for each link; and the cooperation strategy used by the transmitters. We explore the tradeoffs in making routing decisions using analytical models and derive the key routing considerations. Finally, we present Proteus, an adaptive diversity routing protocol that includes algorithmic solutions to the above two decision problems and leverages VMISO links in multihop wireless network to achieve performance improvements. We evaluate Proteus using NS2-based simulations with an enhanced physical layer model that accurately captures the effect of VMISO transmissions.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193105]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1146</startPage>
			<endPage>1159</endPage>
			<fileSize>1078</fileSize>
			<authors><![CDATA[Lakshmanan, Sriram;Sivakumar, Raghupathy;]]></authors>
		</item>
		<item>
			<title><![CDATA[Measurement-Based Design of Roadside Content Delivery Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180168]]></link>
			<description><![CDATA[With today's ubiquity of thin computing devices, mobile users are accustomed to having rich location-aware information at their fingertips, such as restaurant menus, shopping mall maps, movie showtimes, and trailers. However, delivering rich content is challenging, particularly for highly mobile users in vehicles. Technologies such as cellular-3G provide limited bandwidth at significant costs. In contrast, providers can cheaply and easily deploy a small number of WiFi infostations that quickly deliver large content to vehicles passing by for future offline browsing. While several projects have proposed systems for disseminating content via roadside infostations, most use simplified models and simulations to guide their design for scalability. Many suspect that scalability with increasing vehicle density is the major challenge for infostations, but few if any have studied the performance of these systems via real measurements. Intuitively, per-vehicle throughput for unicast infostations degrades with the number of vehicles near the infostation, while broadcast infostations are unreliable, and lack rate adaptation. In this work, we collect over 200 h of detailed highway measurements with a fleet of WiFi-enabled vehicles. We use analysis of these results to explore the design space of WiFi infostations, in order to determine whether unicast or broadcast should be used to build high-throughput infostations that scale with device density. Our measurement results demonstrate the limitations of both approaches. Our insights lead to Starfish, a high-bandwidth and scalable infostation system that incorporates device-to-device data scavenging, where nearby vehicles share data received from the infostation. Data scavenging increases dissemination throughput by a factor of 2-6, allowing both broadcast and unicast throughput to scale with device density.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180168]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1160</startPage>
			<endPage>1173</endPage>
			<fileSize>1361</fileSize>
			<authors><![CDATA[Kone, Vinod;Zheng, Haitao;Rowstron, Antony;O'Shea, Greg;Zhao, Ben Y.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Predictable Mobile Routing for Spacecraft Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193104]]></link>
			<description><![CDATA[In predictable mobile networks, network nodes move in a predictable way and therefore have dynamically changing but predictable connectivity. We have developed a model that formalizes predictable dynamic topologies as sequences of static snapshots. We use this model to design and evaluate a predictable mobile-routing protocol based on link-state routing, whose performance is superior to its static and ad hoc counterparts. Our routing protocol accounts for occurrences of additional, unpredictable changes, as well as their interaction with predictable changes. We evaluate our protocol using simulations based on randomly generated topologies and spacecraft-network scenarios. In both cases, we show that our protocol outperforms traditional routing protocols and is well suited for routing in next-generation space networks.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193104]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1174</startPage>
			<endPage>1187</endPage>
			<fileSize>731</fileSize>
			<authors><![CDATA[Fischer, Daniel;Basin, David;Eckstein, Knut;Engel, Thomas;]]></authors>
		</item>
		<item>
			<title><![CDATA[Deployment of a Connected Reinforced Backbone Network with a Limited Number of Backbone Nodes]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180167]]></link>
			<description><![CDATA[In recent years, we have witnessed a surge of interest in enabling communications over meshed wireless networks. Particularly, supporting peer-to-peer communications over a multihop wireless network has great potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of network nodes. In these scenarios, the deployment of a backbone network could potentially facilitate higher performance network communications. In this paper, we study the novel reinforced backbone network (RBN) deployment problem considering the practical limitation in the number of available backbone nodes and enforcing backbone network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient backbone network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the genetic algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the genetic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available backbone nodes.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180167]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1188</startPage>
			<endPage>1200</endPage>
			<fileSize>627</fileSize>
			<authors><![CDATA[Chu, Shan;Wei, Peng;Zhong, Xu;Wang, Xin;Zhou, Yu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Modeling Beacon Period Length of the UWB and 60-GHz mmWave WPANs Based on ECMA-368 and ECMA-387 Standards]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180169]]></link>
			<description><![CDATA[To evaluate the performance of the distributed medium access control layer of the emerging ultrawideband and 60-GHz millimeter wave (mmWave) wireless personal area networks based on ECMA-368 and ECMA-387 standards, the first step is to determine the beacon period length (BPL) of the superframe in a given network. In this paper, we provide an analytical model for the probability mass function (PMF) of the BPL as a function of the network dimensions, number of beaconing devices, antenna beamwidth, and the transmission range of the devices. To enable devices with steerable directional antennas in the ECMA-387 standard to have simultaneous communications with neighbors in their different antenna sectors, we propose an improvement to the standard for which we computed the PMF of the BPL in its worst case. The effect of beacon period (BP) contraction on the PMF is also considered and modeled. The proposed model for all cases is evaluated by simulating different scenarios in the network and the results show that on average, the model for the average BPL has an error of 1.2 and 2.5 percent in the current definition of the standard and in the proposed modification, respectively, without BP contraction and 0.9 and 1.5 percent, respectively, with BP contraction.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180169]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1201</startPage>
			<endPage>1213</endPage>
			<fileSize>1520</fileSize>
			<authors><![CDATA[Ajorloo, Hossein;Manzuri-Shalmani, Mohammad Taghi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Adaptive Duty Cycle Control with Queue Management in Wireless Sensor Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6189353]]></link>
			<description><![CDATA[This paper proposes a control-based approach to the duty cycle adaptation for wireless sensor networks. The proposed method controls the duty cycle through the queue management to achieve high-performance under variable traffic rates. To have energy efficiency while minimizing the delay, we design a feedback controller, which adapts the sleep time to the traffic change dynamically by constraining the queue length at a predetermined value. In addition, we propose an efficient synchronization scheme using an active pattern, which represents the active time slot schedule for synchronization among sensor nodes, without affecting neighboring schedules. Based on the control theory, we analyze the adaptation behavior of the proposed controller and demonstrate system stability. The simulation results show that the proposed method outperforms existing schemes by achieving more power savings while minimizing the delay.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6189353]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1214</startPage>
			<endPage>1224</endPage>
			<fileSize>4351</fileSize>
			<authors><![CDATA[Byun, Heejung;Yu, Junglok;]]></authors>
		</item>
		<item>
			<title><![CDATA[Localization of RFID Tags Using Stochastic Tunneling]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175900]]></link>
			<description><![CDATA[This paper presents a novel localization scheme in the 3D wireless domain that employs cross correlation in backscattered signal power from a cluster of radio frequency identification (RFID) tags to estimate their location. Spatially co-located RFID tags, energized by a common tag reader, exhibit correlation in their received signal strength indicator (RSSI) values. Hence, for a cluster of RFID tags, the posterior distribution of their unknown radial separation is derived as a function of the measured RSSI correlations between them. The global maxima of this posterior distribution represent the actual radial separation between the RFID tags. The radial separations are then utilized to obtain location estimates of the tags. However, due to the nonconvex nature of the posterior distribution, deterministic optimization methods that are used to solve true radial separations between tags provide inaccurate results due to local maxima, unless the initial radial separation estimates are within the region of attraction of its global maximum. The proposed RFID localization algorithm called LOCalization Using Stochastic Tunneling (LOCUST) utilizes constrained simulated annealing with tunneling transformation to solve this nonconvex posterior distribution. The tunneling transformation allows the optimization search operation to circumvent or &#x0022;tunnel&amp;#x201D; through ill-shaped regions in the posterior distribution resulting in faster convergence to the global maximum. Finally, simulation results of our localization method are presented to demonstrate the theoretical conclusions.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6175900]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1225</startPage>
			<endPage>1235</endPage>
			<fileSize>1772</fileSize>
			<authors><![CDATA[Basheer, M.R.;Jagannathan, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Predicting Human Movement Based on Telecom's Handoff in Mobile Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6178258]]></link>
			<description><![CDATA[Investigating human movement behavior is important for studying issues such as prediction of vehicle traffic and spread of contagious diseases. Since mobile telecom network can efficiently monitor the movement of mobile users, the telecom's mobility management is an ideal mechanism for studying human movement issues. The problem can be abstracted as follows: What is the probability that a person at location $(A)$ will move to location $(B)$ after $(T)$ hours. The answer cannot be directly obtained because commercial telecom networks do not exactly trace the movement history of every mobile user. In this paper, we show how to use the standard outputs (handover rates, call arrival rates, call holding time, and call traffic) measured in a mobile telecom network to derive the answer for this problem.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6178258]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1236</startPage>
			<endPage>1241</endPage>
			<fileSize>483</fileSize>
			<authors><![CDATA[Lin, Yi-Bing;Huang-Fu, Chien-Chun;Alrajeh, Nabil;]]></authors>
		</item>
		<item>
			<title><![CDATA[Understanding the Information Propagation Speed in Multihop Cognitive Radio Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185554]]></link>
			<description><![CDATA[Information propagation speed (IPS) in a multihop cognitive radio network (CRN) is an important factor that affects the network's delay performance and needs to be considered in network planning and routing protocol design. The impact of primary user (PU) activities on IPS makes the problem of analyzing IPS in multihop CRNs very challenging and, hence, unsolved in existing literature. In this paper, we fill this technical void. We establish models of IPS in multihop CRNs and compute how to maximize IPS in two cases. The first case, named the maximum network IPS, maximizes IPS across a network topology over an infinite plane. The second case, named the maximum flow IPS, maximizes the IPS between a given pair of source and destination nodes separated by a fixed distance. We reveal that both maximum IPSs are determined by the PU activity level and the placement of secondary user (SU) relay nodes. We design optimal relay placement strategies in CRNs to maximize these two IPSs under different PU activity levels. The correctness of our analytical results is validated by simulations and numerical experiments.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185554]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1242</startPage>
			<endPage>1255</endPage>
			<fileSize>1188</fileSize>
			<authors><![CDATA[Han, Chuan;Yang, Yaling;]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Open Access Publishing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6506837]]></link>
			<description><![CDATA[Advertisement: This publication offers open access options for authors. IEEE open access publishing.]]></description>
			<pubDate><![CDATA[June  2013]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6506837]]></guid>
			<volume>12</volume>
			<issue>6</issue>
			<startPage>1256</startPage>
			<endPage>1256</endPage>
			<fileSize>413</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>