<![CDATA[ IEEE Transactions on Mobile Computing - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 7755 2017November 23<![CDATA[A Platform for Free-Weight Exercise Monitoring with Passive Tags]]>1612327932932178<![CDATA[Analysis and Design of Low-Duty Protocol for Smartphone Neighbor Discovery]]>$<30$ seconds for at least 80 percent of all connections) with a low duty cycle (1 percent).]]>1612329433071317<![CDATA[CeilingTalk: Lightweight Indoor Broadcast Through LED-Camera Communication]]>1612330833191993<![CDATA[Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval]]>$m$ channels (frequencies) is a powerful means for distributed dissemination of data to clients who access the channels through multi-antennae equipped on their mobile devices. The $delta$-antennae largest weight data retrieval ($delta$ALWDR) problem is to compute a schedule for downloading a subset of data items that has a maximum total weight using $delta$ antennae in a given time interval. In this paper, we first give a linear programming (LP) relaxation for $delta$ALWDR and show that it is polynomial-time solvable when every data item appears at most once. We also show that when there exist data items with multiple occurrences, the integrality gap of this LP formula is 2. We then present an approximation algorithm of ratio $1-frac{1}{e}$ for the $delta$-antennae $gamma$-separated largest weight data retrieval ($delta$A$gamma$LWDR) problem, a weaker version of $delta$ ALWDR where each block of up to $gamma$ data (time) slots is separated by a vacant slot on all channels, applying the techniques called collectively randomized LP rounding and layered DAG construction. We show that $delta$A$gamma$LWDR is ${mathcal NP}-$complete even for the simple case of $gamma =2$, $m=3$, and equal-weight data items each appearing up to 3 times. Our algorithm runs in time ]]>161233203333693<![CDATA[Elastic Routing in Ad Hoc Networks with Directional Antennas]]>ad hoc network equipping directional antennas at each node are analyzed. More specifically, this paper considers a general framework in which the beam width of each node can scale at an arbitrary rate relative to the number of nodes. We introduce an elastic routing protocol, which enables to increase per-hop distance elastically according to the beam width, while maintaining an average signal-to-interference-and-noise ratio at each receiver as a constant. We then identify fundamental operating regimes characterized according to the beam width scaling and analyze throughput scaling laws for each of the regimes. The elastic routing is shown to achieve a much better throughput scaling law than that of the conventional nearest-neighbor multihop for all operating regimes. The gain comes from the fact that more source–destination pairs can be simultaneously activated as the beam width becomes narrower, which eventually leads to a linear throughput scaling law. In addition, our framework is applied to a hybrid network consisting of both wireless ad hoc nodes and infrastructure nodes. As a result, in the hybrid network, we analyze a further improved throughput scaling law and identify the operating regime where the use of directional antennas is beneficial. In addition, we perform numerical evaluation in both ad hoc and hybrid networks, which completely validates our analytical results.]]>161233343346693<![CDATA[Enhanced Co-Primary Spectrum Sharing Method for Multi-Operator Networks]]>1612334733601420<![CDATA[Exploring Vision-Based Techniques for Outdoor Positioning Systems: A Feasibility Study]]>1612336133751413<![CDATA[Improving VANET Simulation with Calibrated Vehicular Mobility Traces]]>1612337633891433<![CDATA[Minimum-Cost Network-Wide Broadcast over Reliable MAC-Layer Multicast]]>$k$ of recipients, specifically $1+A k^b$ in our model (for some $b geq 0$, $A geq 0$). This allows us to capture a wide array of MAC-layer approaches and their costs, simply by varying the value of $b$ (relative to $A$), in a problem formulation subsuming the Connected Dominating Set and Spanning Tree problems. We give a systematic analysis of this problem, including positive and negative results. In particular, we show the problem is: approximable by a factor varying from $2H_{Delta}+2$ down to 2 as $b$ varies from 0 to 1 (where $Delta$ is the maximum degree of the network graph and $H_Delta$ is the $Delta$th harmonic number); approximable by a factor varying from 2 to 1 (i.e., optimal) as $b$ varies from 1 to $log _2 (frac{1}{A}+2)$; and optimally solvable thereafter. Finally, we present numerical results comparing the two algorithms above with other natural heuristics. We find there is an advantage in algorithms taking into consideration the value $b$, even if $b$ can only be roughly estimated.]]>161233903402712<![CDATA[Mobile Contextual Recommender System for Online Social Media]]>1612340334161882<![CDATA[Multi-Lane Pothole Detection from Crowdsourced Undersampled Vehicle Sensor Data]]>1612341734302602<![CDATA[Multi-Source Video Multicast in Internet-Connected Wireless Mesh Networks]]>1612343134441417<![CDATA[mw-HierBack: A Cost-Effective and Robust Millimeter Wave Hierarchical Backhaul Solution for HetNets]]>mw-HierBack) system to organize densely deployed base stations (BSs) in HetNet. A group of Super-BSs (S-BSs) are selected to minimize the resource cost on the gateways and to robustly relay backhaul traffic of the remaining BSs to the core network against any blockage or link failure. Under this network structure, we present a path protection strategy to balance backhaul traffic among S-BSs and to minimize the fluctuations incurred by rerouting. The simulation results show our solution can efficiently scale with the growth of BSs and properly route the backhaul traffic without overloading any one of the S-BSs.]]>1612344534581013<![CDATA[Overlapping Coalition Formation Game for Resource Allocation in Network Coding Aided D2D Communications]]>1612345934721159<![CDATA[Performance and Security Analyses of Onion-Based Anonymous Routing for Delay Tolerant Networks]]>1612347334872048<![CDATA[Post-Streaming Rate Analysis—A New Approach to Mobile Video Streaming with Predictable Performance]]>161234883501788<![CDATA[Providing Guaranteed Protection in Multi-Hop Wireless Networks with Interference Constraints]]>no , additional resources beyond what was required without any protection. This is due to the fact that after a failure, links that previously interfered with the failed link can be activated, thus leading to a “recapturing” of lost capacity. We provide an ILP formulation to find an optimal solution for both binary and SINR interference constraints, and develop corresponding time-efficient algorithms. Our approach utilizes up to 87 percent less protection resources than traditional disjoint path routing to provide guaranteed protection. For the case of 2-hop interference, our protection scheme requires only 8 percent more resources on average than providing no protection whatsoever.]]>161235023512566<![CDATA[QuickSync: Improving Synchronization Efficiency for Mobile Cloud Storage Services]]>sync) inefficiency problem of modern mobile cloud storage services. Our measurement results demonstrate that existing commercial sync services fail to make full use of available bandwidth, and generate a large amount of unnecessary sync traffic in certain circumstances even though the incremental sync is implemented. For example, a minor document editing process in Dropbox may result in sync traffic 10 times that of the modification. These issues are caused by the inherent limitations of the sync protocol and the distributed architecture. Based on our findings, we propose QuickSync, a system with three novel techniques to improve the sync efficiency for mobile cloud storage services, and build the system on two commercial sync services. Our experimental results using representative workloads show that QuickSync is able to reduce up to 73.1 percent sync time in our experiment settings.]]>1612351335261631<![CDATA[SecureMAC: Securing Wireless Medium Access Control Against Insider Denial-of-Service Attacks]]> channelization to prevent excessive reservations, randomization to thwart reactive targeted jamming, coordination to counter control-message aware jamming and resolve over-reserved and under-reserved spectrum, and power attribution to determine each node's contribution to the received power. Our theoretical analyses and implementation evaluations demonstrate superior performance over previous approaches, which either ignore security issues or give up the benefit of cooperation when under attack by disabling user coordination (such as the Nash equilibrium of continuous wideband transmission). In realistic scenarios, our SecureMAC implementation outperforms such schemes by 76-159 percent.]]>161235273540789<![CDATA[Spectrum Reuse Ratio in 5G Cellular Networks: A Matrix Graph Approach]]>matrix graph, is proposed. This approach is robust to interference and random topology. Based on the derived properties of the matrix graph, an asymptotic optimal algorithm with low complexity is obtained to address the spectrum allocation problem with interference constraints, which is known as an NP-hard problem. The proposed algorithm yields a fundamental tradeoff between spectrum reuse ratio and computational complexity. Simulation results also support the theoretical performance gains. As a result, the proposed matrix graph approach is specifically useful for characterizing the next-generation cellular networks.]]>1612354135531018<![CDATA[TeamPhone: Networking SmartPhones for Disaster Recovery]]>1612355435671669<![CDATA[Why 6 Mbps is Not (Always) the Optimum Data Rate for Beaconing in Vehicular Networks]]>1612356835791988<![CDATA[WMSP: Bringing the Wisdom of the Crowd to WiFi Networks]]>1612358035911482