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/

EFFICIENT GROUP COMMUNICATION IN LOCATION AWARE MOBILE AD HOC NETWORKS

• The highly dynamic and uncertain character of mobile ad-hoc networks poses significant challenges for group management. 
• Node mobility often changes the multicast tree, and therefore, frequent updates from group members are required to refresh the multicast tree at the source node. 
• This paper presents Courier, a group communications algorithm that uses the location and velocity of roaming nodes to provide bandwidth efficient multicast between a source and its destinations (i.e., group members) in location aware mobile environments. 
• Toward that end, Courier offers (1) a bandwidth efficient method for location updates from group members, (2) a mobility prediction model for predicting the movement of mobile group members, and (3) an overlay multicast data distribution tree (OMDDT) construction algorithm that is guided by the mobility prediction model. 
• Comparisons of Courier to related multicast algorithms indicate an increase in data transmission success and a decrease in overall bandwidth consumption.

DOMAIN : MOBILE COMPUTING

CONTACT INFORMATION 
 http://www.nanosoftwares.com/

Ph.no : 7200555526

e-mail : info.nanosoftwares@gmail.com

Add caption

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