IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS On social delay tolerant networking aggregation, tie detection, and routing

•Download as DOCX, PDF•

0 likes•184 views

To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

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
On Social Delay-Tolerant Networking Aggregation, Tie
Detection, and Routing
Abstract
Social-based routing protocols have shown their promising capability to improve the message delivery
efficiency in Delay Tolerant Networks (DTNs). The efficiency greatly relies on the quality of the
aggregated social graph that is determined by the metrics used to measure the strength of social
connections. In this paper, we propose an improved metrics that leads to high-quality social graph by
taking both frequency and duration of contacts into consideration. Furthermore, to improve the
performance of social-based message transmission, we systematically study the community evolution
problem that has been little investigated in the literation. Distributed algorithms based on the obtained
social graph are developed such that the overlapping communities and bridge nodes (i.e., connecting
nodes between communities) can be dynamically detected in an evolutionary social network. Finally, we
take all the results above into our social-based routing design. Extensive trace-driven simulation results
show that our routing algorithm outperforms existing social-based forwarding strategies significantly.
Existing system
Social-based routing protocols have shown their promising capability to improve the message delivery
efficiency in Delay Tolerant Networks (DTNs). The efficiency greatly relies on the quality of the

aggregated social graph that is determined by the metrics used to measure the strength of social
connections.
Proposed system
In this paper, we propose an improved metrics that leads to high-quality social graph by taking both
frequency and duration of contacts into consideration. Furthermore, to improve the performance of
social-based message transmission, we systematically study the community evolution problem that has
been little investigated in the literation. Distributed algorithms based on the obtained social graph are
developed such that the overlapping communities and bridge nodes (i.e., connecting nodes between
communities) can be dynamically detected in an evolutionary social network. Finally, we take all the
results above into our social-based routing design. Extensive trace-driven simulation results show that
our routing algorithm outperforms existing social-based forwarding strategies significantly.
SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
SOFTWARE CONFIGURATION:-
 Operating System : Windows XP
 Programming Language : JAVA

This document discusses a proposed system for improving social-based routing in delay tolerant networks. The proposed system takes into account both the frequency and duration of contacts to generate a higher quality social graph. It also studies community evolution to dynamically detect overlapping communities and bridge nodes in social networks. Simulation results show the proposed routing algorithm outperforms existing strategies significantly.

2014 IEEE DOTNET PARALLEL DISTRIBUTED PROJECT Efficient data-query-in-intermi...

IEEEGLOBALSOFTSTUDENTSPROJECTS

This document discusses enabling efficient data queries in Mobile Ad-hoc SOcial Networks (MASONs). MASONs allow users with shared interests to connect via Bluetooth or WiFi to query localized data from each other's devices. The challenges of opportunistic connectivity, distributed storage, and unknown expertise are addressed. A centralized optimization model is proposed to minimize communication costs while supporting query rates within delay budgets. A distributed query protocol uses "reachable expertise" routing and controlled redundancy to improve query delivery rates. The protocol's feasibility and efficiency are evaluated through a testbed and simulations.

Predicting_new_friendships_in_social_networks

Anvardh Nanduri

This document discusses predicting new friendships in social networks using temporal information. It describes research on predicting new links in social networks over time using supervised learning models trained on temporal features from past network interactions. The researchers used anonymized Facebook data over 28 months to train decision tree and neural network classifiers to predict new relationships, finding models using temporal information performed better than those without it.

CS6010 Social Network Analysis Unit V

pkaviya

IEEE 2014 JAVA DATA MINING PROJECTS Multi comm finding community structure in...

IEEEFINALYEARSTUDENTPROJECTS

Social Network Analysis

Fred Stutzman

This document provides an overview of social network analysis, including key concepts, analytic techniques, and examples of classic studies. It discusses the basic components of social networks like actors, ties, and relationships. It also describes different types of networks and measures used in social network analysis, such as degree centrality and betweenness centrality. Finally, it highlights some influential early social network analysis studies and resources for further information.

Social network analysis

World Agroforestry (ICRAF)

This document discusses social network analysis (SNA), a tool used to analyze social relationships and networks. SNA elicits, analyzes, and visualizes how actors interact and resources move through a network. It represents actors as nodes and their relationships as ties. The document provides examples of SNA's application in education, health, and agriculture. It outlines the process of conducting SNA through workshops or surveys to collect node attribute and tie/link data, which is then analyzed using software to visualize the network. The document suggests opportunities to further develop SNA, such as presenting networks back to communities and measuring social capital.

An updated look at social network extraction system a personal data analysis ...

eSAT Publishing House

This document summarizes a study on analyzing personal social network data over time. The study extracted data from Facebook, calculated social network analysis metrics like degree distribution and betweenness centrality, and analyzed how the network changed dynamically over time. Key findings included identifying influential and non-influential users, detecting communities that formed within the network, and identifying the celebrity or most influential user within one person's local network. Analyzing how social networks and interactions change dynamically provides insights useful for applications like marketing and recommendations.

The document provides an overview of community detection in social networks. It discusses that networks are found everywhere where there are interactions between actors. It then motivates the importance of detecting communities by explaining that communities are groups of nodes that likely share properties and roles. Detecting communities has applications like improving recommendation systems and parallel computing. It also justifies the existence of communities in real networks using the concept of homophily where similar actors tend to connect. The document then discusses different approaches to detecting communities including Girvan-Newman algorithm based on edge betweenness and Louvain method which uses greedy modularity optimization.

It’s a “small world” after all

quanmengli

1. The document discusses the history and modeling of social networks, from early concepts like "six degrees of separation" to current models like scale-free networks. 2. It describes different models that have been used to represent social networks mathematically, including random graphs, small-world networks, and scale-free networks which have highly connected hubs. 3. Current research focuses on characterizing network topology, understanding dynamic processes on networks, and how networks respond to failures or attacks.

Social Network, Metrics and Computational Problem

Andry Alamsyah

The Mathematics of Social Network Analysis: Metrics for Academic Social Networks

Editor IJCATR

Social network analysis plays an important role in analyzing social relations and patterns of interaction among actors in a social network. Such networks can be casual, like those on social media sites, or formal, like academic social networks. Each of these networks is characterised by underlying data which defines various features of the network. Keeping in view the size and diversity of these networks it may not be possible to dissect entire network with conventional means. Social network visualization can be used to graphically represent these networks in a concise and easy to understand manner. Social network visualization tools rely heavily on quantitative features to numerically define various attributes of the network. These features also referred to as social network metrics used everyday mathematics as their foundations. In this paper we provide an overview of various social network analysis metrics that are commonly used to analyse social networks. Explanation of these metrics and their relevance for academic social networks is also outlined

Social Network Analysis (SNA)

Development Innovations

This document provides an overview of social network analysis (SNA). It defines social networks as sets of nodes (individuals) connected by links, with SNA having roots in sociology, economics, physics and mathematics emerging in the 1930s. The document discusses software used to perform SNA, and how networks can be analyzed by their shapes, types, and measures at the node and network levels. It provides examples of how SNA can be used across sectors and industries, and for organizations in Cambodia specifically. A case study example is also presented.

The Basics of Social Network Analysis

Rory Sie

Group and Community Detection in Social Networks

Kent State University

06 Community Detection

Duke Network Analysis Center

Community detection algorithms are used to identify densely connected groups of nodes in networks. Modularity optimization is commonly used, which detects communities as groups of nodes with more connections within groups than expected by chance. Parameters like resolution affect results. Multilayer networks model systems with multiple network layers over nodes. Multilayer modularity generalizes modularity to multilayer networks. Community detection in multilayer networks provides insights into structures across data types and applications.

FAST AND ACCURATE MINING THE COMMUNITY STRUCTURE: INTEGRATING CENTER LOCATING...

Nexgen Technology

TO GET THIS PROJECT COMPLETE SOURCE ON SUPPORT WITH EXECUTION PLEASE CALL BELOW CONTACT DETAILS MOBILE: 9791938249, 0413-2211159, WEB: WWW.NEXGENPROJECT.COM,WWW.FINALYEAR-IEEEPROJECTS.COM, EMAIL:Praveen@nexgenproject.com NEXGEN TECHNOLOGY provides total software solutions to its customers. Apsys works closely with the customers to identify their business processes for computerization and help them implement state-of-the-art solutions. By identifying and enhancing their processes through information technology solutions. NEXGEN TECHNOLOGY help it customers optimally use their resources.

Community detection in complex social networks

Aboul Ella Hassanien

Community Detection in Social Media

rezahk

This document summarizes two presentations about community detection in social media networks. The first presentation discusses using edge content, like image tags, to help identify communities in networks. The second focuses on leveraging interaction intensities on Twitter to detect communities that form around certain events over time. Both aim to improve on traditional methods that only consider network structure.

Hybrid sentiment and network analysis of social opinion polarization icoict

Andry Alamsyah

The rapid growth of social media and user generated contents (UGC) has provided a rich source of potentially relevant data. The problems arise on how to summarize those data to understand and transforming it into information. Twitter as one of the most popular social networking and micro-blogging service can be analyzed in terms of content produced with sentiment analysis. On the other hand, some types of networks can also be constructed to analyze the social network structure and network properties. This research intended to combine those content and structural approaches into hybrid approach for identifies social opinion polarization, this is in the form of conversation network. Sentiment analysis used to determine public sentiment, and social network analysis used to analyze the structure of the network, detecting communities and influential actors in the network. Using this hybrid approach, we have comprehensive understanding about social opinion polarization. As case study, we present real social opinion polarization about reclamation issue in Indonesia.

topol05

webuploader

The document discusses social networks and their applications. It provides an overview of social network properties like diameter, degree distributions, clustering, and small world models. It then discusses how e-markets can enable trading of information and provides examples like stock markets and price posting markets. It proposes a model of a social network where economic agents are connected based on trust and a seller can use the network to sell products by approaching recommenders and their friends. The system would update trustworthiness and connections based on purchase decisions.

Community detection in social networks

Francisco Restivo

18 Diffusion Models and Peer Influence

Duke Network Analysis Center

The document discusses network diffusion and peer influence. It begins by defining diffusion and compartment models used to model disease spread. It then discusses how network structure, including topology, timing of connections, and structural transmission, can impact diffusion. Simulation is proposed to test how network features like distance, clustering, redundancy, and high-degree nodes influence spread. The relationships between contact networks, exposure networks based on timing, and actual transmission networks are also introduced.

Social Network Analysis

Giorgos Cheliotis

This document provides an overview of social network analysis (SNA) including concepts, methods, and applications. It begins with background on how SNA originated from social science and network analysis/graph theory. Key concepts discussed include representing social networks as graphs, identifying strong and weak ties, central nodes, and network cohesion. Practical applications of SNA are also outlined, such as in business, law enforcement, and social media sites. The document concludes by recommending when and why to use SNA.

A comparative study of social network analysis tools

David Combe

This document compares several social network analysis tools based on their functionalities and benchmarks them using sample datasets. It finds that Pajek, Gephi, igraph, and NetworkX are mature tools that handle network representation, visualization, characterization with indicators, and community detection well. Gephi is interactive but community detection is experimental. NetworkX is attribute-friendly and handles large networks but lacks visualization. Igraph is optimized for clustering but not custom attributes. The best tool depends on the specific analysis needs.

00 Automatic Mental Health Classification in Online Settings and Language Emb...

Duke Network Analysis Center

Graph and language embeddings were used to analyze user data from Reddit to predict whether authors would post in the SuicideWatch subreddit. Metapath2vec was used to generate graph embeddings from subreddit and author relationships. Doc2vec was used to generate document embeddings based on language similarity between submissions and subreddits. Combining the graph and document embeddings in a logistic regression achieved 90% accuracy in predicting SuicideWatch posters, reducing both false positives and false negatives compared to using the embeddings separately. Next steps proposed using the embeddings to better understand similarities between related subreddits and predict risk factors in posts.

IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS Signature searching in a netwo...

IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS On social delay tolerant networking aggregation, tie detection, and routing

Recommended

Recommended

More Related Content

What's hot

What's hot (18)

Viewers also liked

Viewers also liked (8)

Similar to IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS On social delay tolerant networking aggregation, tie detection, and routing

Similar to IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS On social delay tolerant networking aggregation, tie detection, and routing (20)

More from IEEEMEMTECHSTUDENTPROJECTS

More from IEEEMEMTECHSTUDENTPROJECTS (20)

Recently uploaded

Recently uploaded (20)

IEEE 2014 DOTNET PARALLEL DISTRIBUTED PROJECTS On social delay tolerant networking aggregation, tie detection, and routing