Mobile computing is human–computer interaction by which a computer is expected to be transported during normal usage, which allows for transmission of data, voice and video. Mobile computing involves mobile communication, mobile hardware, and mobile software.

SUPERMAN: Security Using Pre Existing Routing for Mobile Ad hoc Networks

Introduction :

The flexibility and mobility of Mobile Ad hoc Networks (MANETs) have made them increasing popular in a wide range of use cases. To protect these networks, security protocols have been developed to protect routing and application data. However, these protocols only protect routes or communication, not both. Both secure routing and communication security protocols must be implemented to provide full protection. The use of communication security protocols originally developed for wireline and WiFi networks can also place a heavy burden on the limited network resources of a MANET. To address these issues, a novel secure framework (SUPERMAN) is proposed. The framework is designed to allow existing network and routing protocols to perform their functions, whilst providing node authentication, access control, and communication security mechanisms. This paper presents a novel security framework for MANETs, SUPERMAN. Simulation results comparing SUPERMAN with IPsec, SAODV and SOLSR are provided to demonstrate the proposed frameworks suitability for wireless communication security.

Reference IEEE paper :

“SUPERMAN: Security Using Pre Existing Routing for Mobile Ad hoc Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTING, 2017.

Unique ID – SBI1064

DomainMOBILE COMPUTING

Book your project Now.  Checkout other projects here

Searching Trajectories by Regions of Interest

Introduction:

With the increasing availability of moving-object tracking data, trajectory search is increasingly important. We propose and investigate a novel query type named trajectory search by regions of interest (TSR query). Given an argument set of trajectories, a TSR query takes a set of regions of interest as a parameter and returns the trajectory in the argument set with the highest spatial-density correlation to the query regions. This type of query is useful in many popular applications such as trip planning and recommendation, and location based services in general. TSR query processing faces three challenges: how to model the spatial-density correlation between query regions and data trajectories, how to effectively prune the search space, and how to effectively schedule multiple so-called query sources. To tackle these challenges, a series of new metrics are defined to model spatial-density correlations. An efficient trajectory search algorithm is developed that exploits upper and lower bounds to prune the search space and that adopts a query-source selection strategy, as well as integrates a heuristic search strategy based on priority ranking to schedule multiple query sources. The performance of TSR query processing is studied in extensive experiments based on real and synthetic spatial data.

Reference IEEE paper :

“Searching Trajectories by Regions of Interest”, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2017.

Unique ID – SBI1063

Domain – MOBILE COMPUTING

Book your project Now.  Checkout other projects here

Quantifying Interdependent Privacy Risks with Location Data

Introduction :

Co-location information about users is increasingly available online. For instance, mobile users more and more frequently report their co-locations with other users in the messages and in the pictures they post on social networking websites by tagging the names of the friends they are with. The users’ IP addresses also constitute a source of co-location information. Combined with (possibly obfuscated) location information, such co-locations can be used to improve the inference of the users’ locations, thus further threatening their location privacy: As co-location information is taken into account, not only a user’s reported locations and mobility patterns can be used to localize her, but also those of her friends (and the friends of their friends and so on). In this paper, we study this problem by quantifying the effect of co-location information on location privacy, considering an adversary such as a social network operator that has access to such information. We formalize the problem and derive an optimal inference algorithm that incorporates such co-location information, yet at the cost of high complexity. We propose some approximate inference algorithms, including a solution that relies on the belief propagation algorithm executed on a general Bayesian network model, and we extensively evaluate their performance. Our experimental results show that, even in the case where the adversary considers co-locations of the targeted user with a single friend, the median location privacy of the user is decreased by up to 62% in a typical setting. We also study the effect of the different parameters (e.g., the settings of the location-privacy protection mechanisms) in different scenarios.

Reference IEEE paper :

“Quantifying Interdependent Privacy Risks with Location Data”, IEEE Transactions on Mobile Computing, 2017.

Unique ID SBI1062

DomainMOBILE COMPUTING

Book your project Now.  Checkout other projects here

Detecting Mobile Malicious Webpages in Real Time

Introduction :

Mobile specific webpages differ significantly from their desktop counterparts in content, layout and functionality. Accordingly, existing techniques to detect malicious websites are unlikely to work for such webpages. In this paper, we design and implement kAYO, a mechanism that distinguishes between malicious and benign mobile webpages.  kAYO makes this determination based on static features of a webpage ranging from the number of iframes to the presence of known fraudulent phone numbers. First, we experimentally demonstrate the need for mobile specific techniques and then identify a range of new static features that highly correlate with mobile malicious webpages. We then apply kAYO to a dataset of over 350,000 known benign and malicious mobile webpages and demonstrate 90% accuracy in classification. Moreover, we discover, characterize and report a number of webpages missed by Google Safe Browsing and VirusTotal, but detected by kAYO. Finally, we build a browser extension using kAYO to protect users from malicious mobile websites in real-time. In doing so, we provide the first static analysis technique to detect malicious mobile webpages.

Reference IEEE paper :

“Detecting Mobile Malicious Webpages in Real Time”, IEEE Transactions on Mobile Computing, 2017.

Unique ID -SBI1061

DomainMOBILE COMPUTING

Book your project Now.  Checkout other projects here

 

A Proxy based Collaboration System to Minimize Content Download Time and Energy Consumption

Introduction:

Mobile collaborative community (MCC) is an emerging technology that allows multiple mobile nodes (MNs) to perform a resource intensive task, such as large content download, in a cooperative manner. In this paper, we introduce a proxy-based collaboration system for the MCC where a content proxy (CProxy) determines the amount of chunks and the sharing order scheduled to each MN, and the received chunks are shared among MNs via Wi-Fi Direct. We formulate a multi-objective optimization problem to minimize both the collaborative content download time and the energy consumption in an MCC, and propose a heuristic algorithm for solving the optimization problem. Extensive simulations are carried out to evaluate the effects of the number of MNs, the wireless bandwidth, the content size, and dynamic channel conditions on the content download time and the energy consumption. Our results demonstrate that the proposed algorithm can achieve near-optimal performance and significantly reduce the content download time and has an energy consumption comparable to that of other algorithms.

Reference IEEE paper :

“A Proxy-based Collaboration System to Minimize Content Download Time and Energy Consumption”, IEEE Transactions on Mobile Computing, 2017.

Unique ID -SBI1060

Domain – MOBILE COMPUTING

Book your project Now.  Checkout other projects here