SlideShare a Scribd company logo

DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routing in mobile social network

•Download as DOCX, PDF•
•
I
IEEEGLOBALSOFTTECHNOLOGIES

This document proposes a Community-Aware Opportunistic Routing (CAOR) algorithm for mobile social networks. It models communities as "homes" that nodes frequently visit. The CAOR algorithm computes optimal relay sets for each home to minimize message delivery delays. It represents an improvement over existing social-aware algorithms by achieving optimal routing performance between homes rather than relying on locally optimal node characteristics.

Related slideshows

Content Sharing over Smartphone-Based Delay-Tolerant Networks
Content Sharing over Smartphone-Based Delay-Tolerant NetworksContent Sharing over Smartphone-Based Delay-Tolerant Networks
Content Sharing over Smartphone-Based Delay-Tolerant Networks
 
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
 
Effect of multipath routing in autonomous mobile mesh networks
Effect of multipath routing in autonomous mobile mesh networksEffect of multipath routing in autonomous mobile mesh networks
Effect of multipath routing in autonomous mobile mesh networks
 
1 of 7
Community-Aware Opportunistic Routing in Mobile Social Networks ABSTRACT Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. However, these algorithms tend to forward messages to the nodes with locally optimal social characteristics, and thus cannot achieve the optimal performance. In this paper, we propose a distributed optimal Community-Aware Opportunistic Routing (CAOR) algorithm. Our main contributions are that we propose a home-aware community model, whereby we turn an MSN into a network that only includes community homes. We prove that, in the network of community homes, we still can compute the minimum expected delivery delays of nodes through a reverse Dijkstra algorithm and achieve the optimal opportunistic routing performance. Since the number of communities is far less than the number of nodes in magnitude, the computational cost and maintenance cost of contact information are greatly reduced. We demonstrate how our algorithm significantly outperforms the previous ones through extensive simulations, based on a real MSN trace and a synthetic MSN trace. EXISTING SYSTEM: In existing Social-aware algorithms assume that each node has some social characteristics (such as community, centrality, and similarity, etc.) and then exploits the knowledge to direct the routing decision, so as to improve GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
the delivery ratio. Unlike existing community models, each community home in our model is assumed to have a throwbox to store and transmit messages. Compared with the CAOR algorithm, these algorithms just exploit the social characteristics of nodes to improve the probability of meeting the destination for each message. However, this is still unpredictable, and thus cannot achieve the optimal result. PROPOSED SYSTEM: In this paper, we focus on the single-copy routing problem in MSNs. In many real MSNs, mobile users that have a common interest generally will visit some (real or virtual) location that is related to this interest. For instance students with a common study interest will visit the same classrooms to take part in the same courses; customers with the same shopping interests often visit the same shops; friends generally share some resources through facebook, and so on. Based on this basic social characteristic, we propose a home-aware community model. Mobile users with the common interest autonomously form a community, in which the frequently visited location is their common “home”. Moreover, like we assume that each home supports a real or virtual throw box a local device that can temporarily store and transmit messages. Under the home-aware community model, we propose a distributed optimal Community-Aware Opportunistic Routing algorithm (CAOR). We first turn the routing between lots of nodes to the routing between a few community homes. Then, we adopt the optimal opportunistic routing scheme by maintaining an optimal relay set for each home. Each home only forwards its message to the node in its optimal relay set and ignores other relays. Since this scheme solves the problem of whether a home should select a visited node as the relay of message delivery or ignore this visited node to wait for those better relays, it can achieve the optimal performance. MODULE DESCRIPTION:
Number of Modules After careful analysis the system has been identified to have the following modules: 1. Mobile Social Network Module. 2. Building Home Aware Community Module. 3. Delay Tolerant Network Module. 4. Opportunistic Routing Module. 1. Mobile Social Network Module: Mobile social networks (MSNs) are a special kind of delay tolerant network (DTN), in which mobile users move around and communicate with each other via their carried short-distance wireless communication devices. Recently, some social-aware routing algorithms that are based on social network analysis have been proposed. Two key concepts in social network analysis are: (i) community, which is a group of people with social relations; (ii) centrality, which indicates the social relations between a node and other nodes in a community. Based on the two concepts, these algorithms detect the communities and compute the centrality value for each node. Messages are delivered via the nodes with good centralities. 2. Building Home Aware Community Module: A home-aware community is a community of nodes that frequently visit a given home. The frequently visited home is the common home of the community members, i.e., the community home. Moreover, if a node visits several homes frequently, it can belong to multiple communities and have multiple homes. The whole network is composed of some overlapped star-topology communities, as community can easily be detected. Each community exactly contains a group of nodes that have the common interest to the community home. 3.Delay Tolerant Network Module:
A Delay-Tolerant Network (DTN) is a general-purpose over- lay network that operates on top of varying regional net- works, including the Internet. DTNs allow regional net- works with varying delay characteristics to interoperate by providing mechanisms to translate between their respective network parameters. Therefore, the underlying protocols and technologies for these regional networks may differ con- siderably, but the flexibility of the DTN architecture allow s them to be connected to each other. 4. Opportunistic Routing Module: We adopt the optimal opportunistic routing scheme by maintaining an optimal relay set for each home. Each home only forwards its message to the node in its optimal relay set and ignores other relays. Since this scheme solves the problem of whether a home should select a visited node as the relay of message delivery or ignore this visited node to wait for those better relays, it can achieve the optimal performance. The optimal opportunistic routing scheme means that each message sender delivers messages via its optimal relay set (i.e., delivers messages via the first encountered relay in this set). The key problem is to determine whether a relay belongs to the optimal relay set for each message sender. SOFTWARE REQUIREMENTS: Operating System : Windows Technology : Java and J2EE Web Technologies : Html, JavaScript, CSS IDE : My Eclipse Web Server : Tomcat Tool kit : Android Phone Database : My SQL Java Version : J2SDK1.5
HARDWARE REQUIREMENTS: Hardware : Pentium Speed : 1.1 GHz RAM : 1GB Hard Disk : 20 GB Floppy Drive : 1.44 MB Key Board : Standard Windows Keyboard Mouse : Two or Three Button Mouse Monitor : SVGA Flow Diagram:
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routing in mobile social network
CLOUING DOMAIN: WIRELESS NETWORK PROJECTS

More Related Content

DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routing in mobile social network

  • 1. Community-Aware Opportunistic Routing in Mobile Social Networks ABSTRACT Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. However, these algorithms tend to forward messages to the nodes with locally optimal social characteristics, and thus cannot achieve the optimal performance. In this paper, we propose a distributed optimal Community-Aware Opportunistic Routing (CAOR) algorithm. Our main contributions are that we propose a home-aware community model, whereby we turn an MSN into a network that only includes community homes. We prove that, in the network of community homes, we still can compute the minimum expected delivery delays of nodes through a reverse Dijkstra algorithm and achieve the optimal opportunistic routing performance. Since the number of communities is far less than the number of nodes in magnitude, the computational cost and maintenance cost of contact information are greatly reduced. We demonstrate how our algorithm significantly outperforms the previous ones through extensive simulations, based on a real MSN trace and a synthetic MSN trace. EXISTING SYSTEM: In existing Social-aware algorithms assume that each node has some social characteristics (such as community, centrality, and similarity, etc.) and then exploits the knowledge to direct the routing decision, so as to improve GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
  • 2. the delivery ratio. Unlike existing community models, each community home in our model is assumed to have a throwbox to store and transmit messages. Compared with the CAOR algorithm, these algorithms just exploit the social characteristics of nodes to improve the probability of meeting the destination for each message. However, this is still unpredictable, and thus cannot achieve the optimal result. PROPOSED SYSTEM: In this paper, we focus on the single-copy routing problem in MSNs. In many real MSNs, mobile users that have a common interest generally will visit some (real or virtual) location that is related to this interest. For instance students with a common study interest will visit the same classrooms to take part in the same courses; customers with the same shopping interests often visit the same shops; friends generally share some resources through facebook, and so on. Based on this basic social characteristic, we propose a home-aware community model. Mobile users with the common interest autonomously form a community, in which the frequently visited location is their common “home”. Moreover, like we assume that each home supports a real or virtual throw box a local device that can temporarily store and transmit messages. Under the home-aware community model, we propose a distributed optimal Community-Aware Opportunistic Routing algorithm (CAOR). We first turn the routing between lots of nodes to the routing between a few community homes. Then, we adopt the optimal opportunistic routing scheme by maintaining an optimal relay set for each home. Each home only forwards its message to the node in its optimal relay set and ignores other relays. Since this scheme solves the problem of whether a home should select a visited node as the relay of message delivery or ignore this visited node to wait for those better relays, it can achieve the optimal performance. MODULE DESCRIPTION:
  • 3. Number of Modules After careful analysis the system has been identified to have the following modules: 1. Mobile Social Network Module. 2. Building Home Aware Community Module. 3. Delay Tolerant Network Module. 4. Opportunistic Routing Module. 1. Mobile Social Network Module: Mobile social networks (MSNs) are a special kind of delay tolerant network (DTN), in which mobile users move around and communicate with each other via their carried short-distance wireless communication devices. Recently, some social-aware routing algorithms that are based on social network analysis have been proposed. Two key concepts in social network analysis are: (i) community, which is a group of people with social relations; (ii) centrality, which indicates the social relations between a node and other nodes in a community. Based on the two concepts, these algorithms detect the communities and compute the centrality value for each node. Messages are delivered via the nodes with good centralities. 2. Building Home Aware Community Module: A home-aware community is a community of nodes that frequently visit a given home. The frequently visited home is the common home of the community members, i.e., the community home. Moreover, if a node visits several homes frequently, it can belong to multiple communities and have multiple homes. The whole network is composed of some overlapped star-topology communities, as community can easily be detected. Each community exactly contains a group of nodes that have the common interest to the community home. 3.Delay Tolerant Network Module:
  • 4. A Delay-Tolerant Network (DTN) is a general-purpose over- lay network that operates on top of varying regional net- works, including the Internet. DTNs allow regional net- works with varying delay characteristics to interoperate by providing mechanisms to translate between their respective network parameters. Therefore, the underlying protocols and technologies for these regional networks may differ con- siderably, but the flexibility of the DTN architecture allow s them to be connected to each other. 4. Opportunistic Routing Module: We adopt the optimal opportunistic routing scheme by maintaining an optimal relay set for each home. Each home only forwards its message to the node in its optimal relay set and ignores other relays. Since this scheme solves the problem of whether a home should select a visited node as the relay of message delivery or ignore this visited node to wait for those better relays, it can achieve the optimal performance. The optimal opportunistic routing scheme means that each message sender delivers messages via its optimal relay set (i.e., delivers messages via the first encountered relay in this set). The key problem is to determine whether a relay belongs to the optimal relay set for each message sender. SOFTWARE REQUIREMENTS: Operating System : Windows Technology : Java and J2EE Web Technologies : Html, JavaScript, CSS IDE : My Eclipse Web Server : Tomcat Tool kit : Android Phone Database : My SQL Java Version : J2SDK1.5
  • 5. HARDWARE REQUIREMENTS: Hardware : Pentium Speed : 1.1 GHz RAM : 1GB Hard Disk : 20 GB Floppy Drive : 1.44 MB Key Board : Standard Windows Keyboard Mouse : Two or Three Button Mouse Monitor : SVGA Flow Diagram: