Efficient Computation Offloading Decision in Mobile Cloud Computing over 5G Network

Due to the significant advancement of Smartphone technology, the applications targeted for these devices are getting more and more complex and demanding of high power and resources. Mobile cloud computing (MCC) allows the Smart phones to perform these highly demanding tasks with the help of powerful cloud servers. However, to decide whether a given part of an application is cost-effective to execute in local mobile device or in the cloud server is a difficult problem in MCC. It is due to the trade-off between saving energy consumption while maintaining the strict latency requirements of applications. Currently, 5th generation mobile network (5G) is getting much attention, which can support increased network capacity, high data rate and low latency and can pave the way for solving the computation offloading problem in MCC. In this paper, we design an intelligent computation offloading system that takes tradeoff decisions for code offloading from a mobile device to cloud server over the 5G network. We develop a metric for tradeoff decision making that can maximize energy saving while maintain strict latency requirements of user applications in the 5G system. We evaluate the performances of the proposed system in a test-bed implementation, and the results show that it outperforms the state-of-the-art methods in terms of accuracy, computation and energy saving.     

A secure search protocol for lightweight and low-cost RFID systems

In radio frequency identification (RFID) systems, search protocols are used to find a specific item in a large number of tagged products. These protocols should be secure against RFID attacks such as traceability, impersonation, DoS and eavesdropping. Sundaresan et al. (IEEE Trans Dependable Secure Comput, 2015) presented a server-less search protocol based on 128-bits PRNG function and claimed that their method can address all vulnerabilities of previous protocols. In this paper, we prove that Sundaresan et al.’s protocol is vulnerable to traceability attack with the high probability. In addition, we present an improved protocol to solve the proposed problem and analyze its security level informally and formally based on AVISPA tool and BAN logic.     

An Improvement Energy Consumption Policy Using Communication Reduction in Wireless Body Sensor Network

Dedicated short-range communications (DSRC) is an important wireless technology for current and future automotive safety and mitigation of traffic jams. In this work, we have designed a Coplanar waveguide microstrip patch antenna with linear, upper and bottom and side slots for application in DSRC. The patch antenna was designed using glass epoxy substrate (FR4). Various parametric analyses such as the current distribution, reflection coefficient, radiation pattern on E- and H-plane as well as the realized gain (dB) were performed. The results were obtained by simulation using high-frequency structure simulator tool. The proposed antenna covers a frequency band of 5.8–5.9 GHz which is highly dedicated to the DSRC wireless communication technology for enhancement of safety of the automotive transport system. The designed antenna shows a good return loss of ??19 dB at 5.9 GHz.The designed antenna shows a promising gain, return loss and radiation pattern for use in DSRC for automotive transport systems.

     

Unital Design Based Location Service for Subterranean Network Using Long Range Topology

Wireless Personal Communications - Wireless Underground Networks comprise the ability to constantly monitor several physical parameters such as ground temperature, water level and soil condition,...     

Recovery error bounds on compressed sensing of noisy signals

Compressed sensing is an emerging technique in the field of digital signal acquisition. It promises almost exact recovery of high‐dimensional signals from a very small set of measurements. However, this technique is challenged by the task of recovering signals immersed in noise. In this paper, we derive upper and lower bounds on mean squared recovery error of noisy signals. These bounds are valid for any number of acquired measurements and at any signal‐to‐noise ratio. This work is highly useful for the design of any compressed sensing‐based real world application by quantifying recovery error entailed with realistic digital signal acquisition scenarios. Copyright © 2013 John Wiley & Sons, Ltd.     

Collision avoidance slot allocation scheme for multi-cluster wireless sensor networks

This paper introduces a collision avoidance slot allocation scheme for Time Division Multiple Access (TDMA) based Medium Access Control (MAC) in multi-cluster wireless sensor networks. TDMA MAC protocols have built-in active-sleep duty cycle that can be leveraged for limiting idle listening. Also, they can overcome the overhearing problem, thus have better energy efficiency. Enabling concurrent intra-cluster communications using a single radio channel is a key issue in TDMA MAC protocols. Using orthogonal frequency channels or different Code Division Multiple Access codes for different adjacent clusters can solve the problem at the expense of cost. In this paper, we propose a new distributed slot allocation protocol called  Coordinated   Time   Slot   Allocation (CTSA) that can reduce collisions significantly using a single radio channel. We use simulations to study the effects of different system parameters on the performance of our proposed protocol. Simulation results show that applying CTSA over clustering protocols can significantly reduce collisions. It also shows fast convergence for our proposed CTSA protocol. In this paper we apply our CTSA scheme to the Low Energy Adaptive Clustering Hierarchy protocol which forms the basis for many cluster based routing protocols. CTSA is also compared with the SRSA algorithm proposed by Wu and Biswas (Wirel Netw 13(5):691–703, 2007) by means of simulation.     

Cooperative caching for content dissemination in vehicular networks

The explosive growth of mobile data traffic has made cellular operators to seek low‐cost alternatives for cellular traffic off‐loading. In this paper, we consider a content delivery network where a vehicular communication network composed of roadside units (RSUs) is integrated into a cellular network to serve as an off‐loading platform. Each RSU subjecting to its storage capacity caches a subset of the contents of the central content server. Allocating the suitable subset of contents in each RSU cache such that maximizes the hit ratio of vehicles requests is a problem of paramount value that is targeted in this study. First, we propose a centralized solution in which, we model the cache content placement problem as a submodular maximization problem and show that it is NP‐hard. Second, we propose a distributed cooperative caching scheme, in which RSUs in an area periodically share information about their contents locally and thus update their cache. To this end, we model the distributed caching problem as a strategic resource allocation game that achieves at least 50% of the optimal solution. Finally, we evaluate our scheme using simulation for urban mobility simulator under realistic conditions. On average, the results show an improvement of 8% in the hit ratio of the proposed method compared with other well‐known cache content placement approaches.     

Effects of Augmented Reality Display Settings on Human Wayfinding Performance

Augmented reality (AR) entails overlaying the real world with information from computer-generated displays. Current AR technologies support limited mobility, although this is expected to change in the future. This paper presents experimental results of effects of various AR display strategies on human performance in a simulation-based analog of a ldquosearch and rescuerdquo navigation task. The augmentation scheme was a spatially and temporally registered map that was overlaid onto a corresponding real-world maze. The experiment required the participants to traverse the maze, periodically answer orientation questions, obtain a target object, and exit the maze as quickly as possible. One hundred twenty participants were evaluated in six different conditions. There were two control conditions (paper map or compass prior to entering the maze), and four experimental conditions (combinations of egocentric and exocentric maps, and continuously on or on-demand map display). Performance measures consisted of duration of time to traverse the maze and percentage of maze covered. AR resulted in better performance than the control conditions in terms of accuracy by facilitating the participants' coverage of the maze. Results show that the better performance with respect to time was in the map control condition. This result may be due to the small size of the maze, which could be memorized. However, AR is expected to exhibit better performance compared to a paper map, when more complex environments are employed. These results demonstrate promising benefits in mobile AR usage in specific navigation tasks. Design guidelines were extracted to guide future AR systems continued progress in enhancing performance.     

A wide axial-ratio beamwidth circularly-polarized oval patch antenna with sunlight-shaped slots for gnss and wimax applications

Wireless Networks - This paper proposes a quadruple band stacked oval patch antenna with sunlight-shaped slots supporting L1/L2/L5 GNSS bands and the 2.3 Ghz WiMAX band. The antenna produces...