CAMF: Context-Aware Message Forwarding In Selfish Mobile Social Networks

ABSTRACT:

Nodes may exhibit selfish behaviors in mobile social networks (MSN) selfish nodes refuse to forward messages for all or some nodes in a network to conserve limited resources. Previous work mainly focuses on promoting selfish nodes transmit messages for others. In this paper, we consider selfishness from a different viewpoint; we regard selfishness as a basic requirement of systems and allow nodes to behave selfish behaviors. However, selfishness has a profound influence on routing performance. To achieve a good routing performance when node selfishness is considered, we first put forward a stateless approach which does not need collecting and storing state information to measure the similarity of nodes, and then evaluate the forwarding capability of nodes by combining the acquired similarity with node selfishness. We then quantify the receiving capability of nodes based on their available buffer size and energy. Incorporating forwarding and receiving capability, we present a forwarding set mechanism, which formulates the forwarding set optimization problem as a multiple knapsack problem to maximize the forwarding profit. Consequently, we take all the results above into our context-aware message forwarding design. Extensive trace-driven simulations show that our proposed algorithm achieves good routing performance with low transmission cost and resource consumption in selfish MSN.

AIM

The aims of this paper achieve a good routing performance when node selfishness is considered we first put forward a stateless approach which does not need collecting and storing state information to measure the similarity of nodes, and then evaluate the forwarding capability of nodes by combining the acquired similarity with node selfishness.

SCOPE

 The Scope of this project is Extensive trace-driven simulations show that our proposed algorithm achieves good routing performance with low transmission cost and resource consumption in selfish MSN.

EXISTING SYSTEM

In the real world, some or all individuals may exhibit various degrees of selfishness when forwarding messages, in particular when nodes are constrained with energy and storage space, e.g., a node may refuse to accept and store messages for others in order to conserve limited buffer and power resources. In general, node’s selfish behaviors are considered from two aspects: individual and social selfishness. For individual selfishness, a node exhibits the same forwarding willingness to any others. While, for social selfishness, nodes are more interested in receiving and forwarding messages for the nodes in the same community, but are less interested in receiving and forwarding messages for the nodes outside their communities.

DISADVANTAGES:

1. Selfish  nodes refuse to forward messages for all or some nodes in a network to conserve limited resources
2. Selfishness  has a profound influence on routing performance

PROPOSED SYSTEM

In this paper, to be consider node selfishness from a different perspective; we regard node selfishness as a basic requirement of applications or systems, and utilize the selfish characteristic of nodes to reduce resource consumption and extend the network lifetime. Nevertheless, it is difficult to achieve an acceptable routing performance when selfishness is considered. Because selfish nodes may refuse to accept or forward messages from others. Thus, our goal is to achieve high delivery performance with a low cost when nodes are allowed to exhibit selfish behaviors develop a context-aware message forwarding algorithm (CAMF), which exploits the context information to quantify the forwarding and receiving capability of nodes and to determine the forwarding set.

ADVANTAGES

1. CAMF achieves good routing performance with low transmission cost when nodes are allowed to exhibit selfish behaviors.
2. To design incentive schemes to stimulate selfish nodes to forward messages for other nodes to achieve a good routing performance.

 SYSTEM ARCHITECTURE:

 

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board                 -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System      : Windows  7                                     

·                Front End                  : ASP.NET and C#

·                Database                   : MSSQL

·                Tool                           :Visual Studio

REFERENCE:

Dong, M.  Ota, K.  Xu, K., Wei, K. “CAMF: CONTEXT-AWARE MESSAGE FORWARDING IN SELFISH MOBILE SOCIAL NETWORKS”, IEEE Transactions on Parallel and Distributed Systems, Volume 26 ,  Issue 8, AUGUST  2014.

Group Key Agreement with Local Connectivity

ABSTRACT:

In this paper, we study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocol, which demonstrates that our constructions are round efficient. Finally, we construct an actively secure protocol from a passively secure one.

AIM

The aim of this paper is study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary.

SCOPE

The Scope of this paper is to construct an actively secure protocol from a passively secure one.

EXISTING SYSTEM

Key pre-distribution system (KPS) (a.k.a. non-interactive conference distribution system) can be regarded as a non-interactive group key agreement. In this case, the shared key of a given group is fixed after the setup. If a group is updated, then the group key changes to the shared key of the new group. The drawback of KPS is that the user key size is combinatorial large in the total number of users (if the system is unconditionally secure). Another drawback is that the group key of a given group cannot be changed even if it is leaked unexpectedly (e.g., cryptanalysis of cipher texts bearing this key). The key size problem may be overcome if a computationally secure system is used, while the key leakage problem is not easy. Further, computationally secure KPS is only known for the two party case and the three-party case KPS with a group size greater than 3 is still open

DISADVANTAGES:

1. The user key size is combinatorial large  in the total number of users (if the system is unconditionally secure).
2. The group key of a given group can not be changed even if it is leaked unexpectedly

PROPOSED SYSTEM

The group key agreement with an arbitrary connectivity graph, where each user is only aware of his neighbors and has no information about the existence of other users. Further, he has no information about the network topology. Under this setting, a user does not need to trust a user who is not his neighbor. Thus, if one is initialized using PKI, then he need not trust or remember public-keys of users beyond his neighbors

 ADVANTAGES

1. To update the group key more efficiently than just running the protocol again, when user memberships are changing.
2. Two passively secure protocols with contributiveness and proved lower bounds on a round complexity, demonstrating that our protocols are round efficient

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board                 -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System      : Windows  7                                     

·                Front End                  : ASP.NET and C#

·                Database                   : MSSQL

·                Tool                           :Visual Studio

REFERENCE:

Jiang, S “Group Key Agreement with Local Connectivity” IEEE Transactions on Dependable and Secure Computing  Volume PP   Issue 99 FEBRUARY 2015.