Protecting Location Privacy for Task Allocation in Ad Hoc Mobile Cloud Computing

ABSTRACT:

Mobile cloud computing is an emerging cloud computing paradigm that integrates cloud computing and mobile computing to enable many useful mobile applications. However, the large-scale deployment of mobile cloud computing is hindered by the concerns on possible privacy leakage. In this paper, we investigate the privacy issues in the ad hoc mobile cloud computing, and propose a framework that can protect the location privacy when allocating tasks to mobile devices. Our mechanism is based on differential privacy and geocast, and allows mobile devices to contribute their resources to the ad hoc mobile cloud without leaking their location information. We develop analytical models and task allocation strategies that balance privacy, utility, and system overhead in an ad hoc mobile cloud. We also conduct extensive experiments based on real-world datasets, and the results show that our framework can protect location privacy for mobile devices while providing effective services with low system overhead. We investigate the capability of localizing node failures in communication networks from binary states (normal/failed) of end to end paths. Given a set of nodes of interest, uniquely localizing failures within this set requires that different observable path states associate with different node failure events. However, this condition is difficult to test on large networks due to the need to enumerate all possible node failures.

INTRODUCTION

Now a days, mobile devices such as smartphones and tablets have gained tremendous popularity. These devices are often equipped with a variety of sensors such as camera, microphone, GPS, accelerometer, gyroscope, and compass. The data (e.g., position, speed, temperature, and heart rate) generated by these sensors enable many useful mobile applications, including location-based services mobile sensing and mobile crowdsourcing . Although improved largely over the past several years, mobile devices are still resource-constrained mainly due to the limited battery lifetime. 
One such approach, generally known as network tomography, focuses on inferring internal network characteristics based on end-to-end performance measurements from a subset of nodes with monitoring capabilities, referred to as monitors. Unlike direct measurement, network tomography only relies on end-to-end performance (e.g., path connectivity) experienced by data packets, thus addressing issues such as overhead, lack of protocol support, and silent failures. In cases where the network characteristic of interest is binary (e.g., normal or failed), this approach is known as Boolean network tomography. In this paper, we study an application of Boolean network tomography to localize node failures from measurements of path states.1 Under the assumption that a measurement path is normal if and only if all nodes on this path behave normally, we formulate the problem as a system of Boolean equations, where the unknown variables are the binary node states, and the known constants are the observed states of measurement paths. The goal of Boolean network tomography is essentially to solve this system of Boolean equations.
A recent work by To and Ghinita has been proposed to protect location privacy of crowdsourcing workers in spatial crowdsourcing. However, their solution does not consider worker reputation, and thus cannot provide any quality control over the final result. Therefore, it can not be easily applied to the mobile cloud computing scenario where service quality is very important.In this paper, we propose a framework that provides solutions to the above challenges, where both location privacy and service quality are considered. In our framework, the CCP only has access to sanitized location data of mobile servers according to differential privacy (DP). Since every mobile server is subscribed to a cellular service provider (CSP) with which it already has a trust relationship, the CSP can integrate mobile server location and reputation information, and provides the data to the CCP in noisy form according to DP. To generate the noisy mobile server data, we adapt the Private Spatial Decomposition (PSD) approach proposed in and construct a new structure called Reputationbased PSD (R-PSD). Since fake points need to be created in the DP model, geocast is used to disseminate tasks to mobile servers to prevent the CCP from identifying these points. To summarize, our main contributions are as follows: 1) We identify the specific challenges for task allocation in ad hoc mobile clouds, and propose a framework that can achieve differential privacy for mobile server location data while providing high service quality. 
2) We introduce a new structure called R-PSD that partitions the space based on both reputation and location information, and develop an efficient search strategy that finds appropriate R-PSD partitions to ensure high quality of service. 
3) We use a geocast mechanism when disseminating tasks to mobile servers to overcome the restrictions imposed by DP, and the overhead during this process is incorporated into the design of the search strategy. 
4) We conduct extensive experiments based on real-world datasets to show the effectiveness of the proposed framework.

SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:

System : Pentium IV 2.4 GHz.
Hard Disk        : 40 GB.
Floppy Drive : 1.44 Mb.
Monitor : 15 VGA Colour.
Mouse : Logitech.
Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

Operating system : Windows XP.
Coding Language :  JAVA
Data Base :  MYSQL


CONCLUSION:

In this paper, we have investigated the privacy issues in the ad hoc mobile cloud computing, and have proposed a framework that protects the location privacy of mobile servers when allocating mobile cloud computing tasks. We studied the fundamental capability of a network in localizing failed nodes from binary measurements (normal/failed) of paths between monitors. We proposed two novel measures: maximum identifiability index that quantifies the scale of uniquely localizable failures writ a given node set, and maximum identifiable set that quantifies the scope of unique localization under a given scale of failures. We showed that both measures are functions of the maximum identifiability index per node. We studied these measures for three types of probing mechanisms that offer different controllability of probes and complexity of implementation. For each probing mechanism, we established necessary/sufficient conditions for unique failure localization based on network topology, placement of monitors, constraints on measurement paths, and scale of failures. We further showed that these conditions lead to tight upper/lower bounds on the maximum identifiability index, as well as inner/outer bounds on the maximum identifiable set. We showed that both the conditions and the bounds can be evaluated efficiently using polynomial time algorithms. Our evaluations on random and real network topologies showed that probing mechanisms that allow monitors to control the routing of probes have significantly better capability to uniquely localize failures.

REFERENCES:

1. J. Schiller and A. Voisard, Location-based services. Elsevier, 2004.
2. M. Spreitzer and M. Theimer, “Providing location information in aubiquitous computing environment,” Mobile Computing, pp. 397–423, 1996.
3. T. Choudhury, S. Consolvo, B. Harrison, J. Hightower, A. LaMarca,L. LeGrand, A. Rahimi, A. Rea, G. Bordello, B. Hemingway et al., “The mobile sensing platform: An embedded activity recognition system,” Pervasive Computing, IEEE, vol. 7, no. 2, pp. 32–41, 2008.
4. S. B. Eisenman, E. Miluzzo, N. D. Lane, R. A. Peterson, G.-S. Ahn, and A. T. Campbell, “Bikenet: A mobile sensing system for cyclist experience mapping,” ACM Transactions on Sensor Networks (TOSN), vol. 6, no. 1, p. 6, 2009.
5. F. Alt, A. S. Shirazi, A. Schmidt, U. Kramer, and Z. Nawaz, “Locationbased
6. crowdsourcing: extending crowdsourcing to the real world,” in Proceedings of the 6th Nordic Conference on Human-Computer Interaction: Extending Boundaries. ACM, 2010, pp. 13–22.
A. R. Khan, M. Othman, S. A. Madani, and S. U. Khan, “A survey of mobile cloud computing application models,” Communications Surveys & Tutorials, IEEE, vol. 16, no. 1, pp. 393–413, 2014.
7. S. Abolfazli, Z. Sanaei, E. Ahmed, A. Gani, and R. Buyya, “Cloudbased augmentation for mobile devices: motivation, taxonomies, and open challenges,” Communications Surveys & Tutorials, IEEE, vol. 16, no. 1, pp. 337–368, 2014.
8. N. Fernando, S. W. Loke, and W. Rahayu, “Dynamic mobile cloud computing: Ad hoc and opportunistic job sharing,” in Utility and Cloud Computing (UCC), 2011 Fourth IEEE International Conference on. IEEE, 2011, pp. 281–286.
9. G. Huerta-Canepa and D. Lee, “A virtual cloud computing provider for mobile devices,” in Proceedings of the 1st ACM Workshop on Mobile Cloud Computing & Services: Social Networks and Beyond. ACM, 2010, p. 6.
10. E. E. Marinelli, “Hyrax: cloud computing on mobile devices using mapreduce,” Master’s thesis, Carnegie Mellon University, 2009. 
11. Krontiris, F. C. Freiling, and T. Dimitriou, “Location privacy in urban sensing networks: research challenges and directions,” Wireless Communications, IEEE, vol. 17, no. 5, pp. 30–35, 2010.
12. J.W. Brown, O. Ohrimenko, and R. Tamassia, “Haze: Privacy-preserving real-time traffic statistics,” in Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 2013, pp. 530–533.
13. M. Duckham and L. Kulik, “A formal model of obfuscation and negotiation for location privacy,” in Pervasive computing. Springer, 2005, pp. 152–170.
14. R. Shokri, G. Theodorakopoulos, C. Troncoso, J.-P. Hubaux, and J.- Y. Le Boudec, “Protecting location privacy: optimal strategy against localization attacks,” in Proceedings of the 2012 ACM conference on Computer and communications security. ACM, 2012, pp. 617–627.
15. M. L. Yiu, G. Ghinita, C. S. Jensen, and P. Kalnis, “Enabling search services on outsourced private spatial data,” The VLDB Journal, vol. 19,. 3, pp. 363–384, 2010.



Leave a Reply
Command
Name E-Mail Phone
  



  Categories