PRIVACY-PRESERVING FRAMEWORK FOR SECURE ENCOUNTER-BASED SOCIAL NETWORKS

                    

   ABSTRACT

                        In social networks and encounter-based systems, link users share a location at the same time,and may connect with users who have an offline friendship.Our new technique supports challenges that are basically different from those undertaken by previous social network designs.Functional and security requirements for these new systems are availability, security, and privacy, and present several design options for building secure social networks. Proposed system provide several security guarantees, including privacy in the form of unlinkability of users sharing an encounter, confidentiality of data exchanged among encounter participants, and authentication of both users in a two-party conversation. The work provided better results when compared with the existing approach.

DOMAIN :SECURE COMPUTING

CONTACT DETAILS

Phn : 7200555526

e-mail : info.nanosoftwares@gmail.com

http://www.nanosoftwares.com/

FREQUENT POSITION UPDATE-EXCLUSIVE ANALYSIS FOR MOBILE AD HOC NETWORK USING TIME BASED BEACONS

• An increasing number of ad hoc networking protocols and location-aware services involve learning the mobile nodes’ location of their neighbors. 
• To preserve neighbor positions, nearly all geographic routing protocols exploit a well-liked method of periodic broadcasting of beacon packets that enclose the geographic location coordinates of the nodes. 
• From both the update cost and routing performance points of analysis, despite of the node mobility and traffic patterns in the network, we challenge and reveal that periodic beaconing is not smart. 
• Frequent Position Update-Exclusive Analysis (FPU-EA) strategy which vigorously amends the frequency of position updates based on the mobility dynamics of the nodes and the forwarding models in the network is intended in this work for geographic routing. 
• FPU-EA is based on two straightforward update principles: 1) nodes whose movements are tougher to guess update their locations more often (and vice versa), and (ii) nodes which are nearer to forwarding paths update their locations more often (and vice versa). 
• 
  DOMAIN : MOBILE COMPUTING
•  
  
  CONTACT INFORMATION
   Nano softwares
  Ph.no : 7200555526
  e-mail : info.nanosoftwares@gmail.com
  

Protecting Location Privacy in Sensor Networks Against a Global Eavesdropper

ABSTRACT:-

While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such contextual information can be exploited by an adversary to derive sensitive information such as the locations of monitored objects and data sinks in the field. Attacks on these components can significantly undermine any network application. Existing techniques defend the leakage of location information from a limited adversary who can only observe network traffic in a small region. However, a stronger adversary, the global eavesdropper, is realistic and can defeat these existing techniques. This paper first formalizes the location privacy issues in sensor networks under this strong adversary model and computes a lower bound on the communication overhead needed for achieving a given level of location privacy. The paper then proposes two techniques to provide location privacy to monitored objects (source-location privacy)-periodic collection and source simulation-and two techniques to provide location privacy to data sinks (sink-location privacy)-sink simulation and backbone flooding. These techniques provide trade-offs between privacy, communication cost, and latency. Through analysis and simulation, we demonstrate that the proposed techniques are efficient and effective for source and sink-location privacy in sensor networks.

Keywords: IEEE Project Titles 2012, Mobile Computing Titles, Wireless Communication Titles.

Cross-Layer Optimization for Multimedia Transport over Multicode CDMA Networks

ABSTRACT

Most previous work on code division multiple access (CDMA) considers the bit error ratio (BER) at the physical layer and the frame drop ratio (FDR) at the medium access control layer separately. However, a better system performance, e.g., in terms of a lower overall frame loss ratio (FLR), can be achieved if BER and FDR are jointly optimized. In this paper, we propose a cross-layer optimization scheme called traffic-adaptive scheme for multicode CDMA operating over a time division multiple access (TDMA) channel. Based on the traffic condition and buffer status, this scheme employs a Markov Decision Process (MDP) to determine the optimal value of the maximum number of simultaneous data frames that can be transmitted in each time slot of a TDMA frame so as to minimize the overall FLR of the system. To facilitate implementation, we also propose an approximation scheme named the rate-adaptive scheme to reduce the computation cost. Simulation and analytical results show that both the traffic-adaptive scheme and rate-adaptive scheme can significantly reduce FLR, increase the system throughput, and optimize the packet access delay of the system. Furthermore, the rate-adaptive scheme can achieve a performance close to the traffic-adaptive scheme when the traffic load in the system is high.

Keywords: Mobile Computing, Secure Computing, Networking, Data Mining.

A PRIVACY-PRESERVING LOCATION MONITORING SYSTEM FOR WIRELESS SENSOR NETWORKS

ABSTRACT

Monitoring personal locations with a potentially untrusted server poses privacy threats to the monitored individuals. To this end, we propose a privacy-preserving location monitoring system for wireless sensor networks. In our system, we design two in-network location anonymization algorithms, namely, resource and quality-aware algorithms, that aim to enable the system to provide high-quality location monitoring services for system users, while preserving personal location privacy. Both algorithms rely on the well-established k-anonymity privacy concept, that is, a person is indistinguishable among k persons, to enable trusted sensor nodes to provide the aggregate location information of monitored persons for our system. Each aggregate location is in a form of a monitored area A along with the number of monitored persons residing in A, where A contains at least k persons. The resource-aware algorithm aims to minimize communication and computational cost, while the quality-aware algorithm aims to maximize the accuracy of the aggregate locations by minimizing their monitored areas. To utilize the aggregate location information to provide location monitoring services, we use a spatial histogram approach that estimates the distribution of the monitored persons based on the gathered aggregate location information. Then, the estimated distribution is used to provide location monitoring services through answering range queries. We evaluate our system through simulated experiments. The results show that our system provides high-quality location monitoring services for system users and guarantees the location privacy of the monitored persons.

Keywords:- Mobile Computing, Networking, Data Mining, Secure Computing.

ON THE INFORMATION FLOW REQUIRED FOR TRACKING CONTROL IN NETWORKS OF MOBILE SENSING AGENTS

ABSTRACT

We design controllers that permit mobile agents with distributed or networked sensing capabilities to track (follow) desired trajectories, identify what trajectory information must be distributed to each agent for tracking, and develop methods to minimize the communication needed for the trajectory information distribution.

Keywords:- Mobile Computing, Data Mining, Secure Computing, Image Processing. 

INTERFERENCE-AWARE ROUTING IN WIRELESS MULTIHOP NETWORKS

ABSTRACT

Interference is an inherent characteristic of wireless (multihop) communications. Adding interference-awareness to important control functions, e.g., routing, could significantly enhance the overall network performance. Despite some initial efforts, it is not yet clearly understood how to best capture the effects of interference in routing protocol design. Most existing proposals aim at inferring its effect by actively probing the link. However, active probe measurements impose an overhead and may often misrepresent the link quality due to their interaction with other networking functions. Therefore, in this paper we follow a different approach and: 1) propose a simple yet accurate analytical model for the effect of interference on data reception probability, based only on passive measurements and information locally available at the node; 2) use this model to design an efficient interference-aware routing protocol that performs as well as probing-based protocols, yet avoids all pitfalls related to active probe measurements. To validate our proposal, we have performed experiments in a real testbed, setup in our indoor office environment. We show that the analytical predictions of our interference model exhibit good match with both experimental results as well as more complicated analytical models proposed in related literature. Furthermore, we demonstrate that a simple probeless routing protocol based on our model performs at least as good as well-known probe-based routing protocols in a large set of experiments including both intraflow and interflow interference.

Keywords:- Data Mining Title, Cloud Computing Title, Mobile Computing Title.