Java on exploiting transient social contact patterns for data forwarding in delay-tolerant networks

Jul 28, 20130 likes51 views

This document discusses exploiting transient social contact patterns to improve data forwarding in delay-tolerant networks. It proposes analyzing contact distribution, network connectivity, and social community structure to develop analytical formulations of these transient patterns. Forwarding metrics are then developed based on these patterns to select better relays for forwarding data within short time periods, improving performance over existing schemes.

ON EXPLOITING TRANSIENT SOCIAL CONTACT PATTERNS FOR DATA
FORWARDING IN DELAY-TOLERANT NETWORKS
ABSTRACT:
Unpredictable node mobility, low node density, and lack of global information make it
challenging to achieve effective data forwarding in Delay-Tolerant Networks (DTNs). Most of
the current data forwarding schemes choose the nodes with the best cumulative capability of
contacting others as relays to carry and forward data, but these nodes may not be the best relay
choices within a short time period due to the heterogeneity of transient node contact
characteristics.
In this paper, we propose a novel approach to improve the performance of data forwarding with a
short time constraint in DTNs by exploiting the transient social contact patterns. These patterns
represent the transient characteristics of contact distribution, network connectivity and social
community structure in DTNs, and we provide analytical formulations on these patterns based on
experimental studies of realistic DTN traces.
We propose appropriate forwarding metrics based on these patterns to improve the effectiveness
of data forwarding. When applied to various data forwarding strategies, our proposed forwarding
metrics achieve much better performance compared to existing schemes with similar forwarding
cost.
ECWAY TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
OUR OFFICES @ CHENNAI / TRICHY / KARUR / ERODE / MADURAI / SALEM / COIMBATORE
CELL: +91 98949 17187, +91 875487 2111 / 3111 / 4111 / 5111 / 6111
VISIT: www.ecwayprojects.com MAIL TO: ecwaytechnologies@gmail.com

Java on exploiting transient social contact patterns for data forwarding in delay-tolerant networks

The document presents a proposed algorithm for routing messages in delay tolerant networks (DTNs) like mobile social networks. It evaluates a new social pressures metric (SPM) to detect the quality of friendships between nodes for determining the best routing paths. Prior work on multicopy, single-copy, and erasure-coding routing approaches in DTNs is reviewed. The proposed algorithm routes messages along paths containing nodes in the destination's friendship communities. Simulations show it performs better than three previous benchmark algorithms in terms of delivery ratio, cost, and efficiency.

Wanted: a larger, different kind of boxLina Martinsson Achi

To have the ability to “think outside the box” is generally regarded as something positive. At a moment in time when resources are scarce, and the problems facing us are many, innovation and professional excellence becomes a requirement, rather than a matter of choice. At the core of our attempts to come up with new, and better solutions are the digital technologies. Within the structural engineering context, the different types of off-the-shelf packages for finite element analysis play a central role. These “black-box” types of software packages exemplify how user-friendliness may have harmful consequences within a field where knowledge and the successful mastery of relevant skills is key, and consequently- ignorance may lead to fatal results. These tools make any effort “venturing outside” difficult to achieve. A technical paradigm shift is called for- that places learning and creative, informed exploration at the heart of the user experience. Presented during the Knowledge Based Engineering session of the 19th IABSE congress entitled "Challenges in Design and Construction of an Innovative and Sustainable Built Environment" held in Stockholm, September 21-23, 2016.

A Neighbourhood-Based Trust Protocol for Secure Collaborative Routing in Wire...IJCSIS Research Publications

Heterogeneous Device-to-Device mobile networks are characterised by frequent network disruption and unreliability of peers delivering messages to destinations. Trust-based protocols has been widely used to mitigate the security and performance problems in D2D networks. Despite several efforts made by previous researchers in the design of trust-based routing for efficient collaborative networks, there are fewer related studies that focus on the peers’ neighbourhood as a routing metrics’ element for a secure and efficient trust-based protocol. In this paper, we propose and validate a trust-based protocol that takes into account the similarity of peers’ neighbourhood coefficients to improve routing performance in mobile HetNets environments. The results of this study demonstrate that peers’ neighbourhood connectivity in the network is a characteristic that can influence peers’ routing performance. Furthermore, our analysis shows that our proposed protocol only forwards the message to the companions with a higher probability of delivering the packets, thus improving the delivery ratio and minimising latency and mitigating the problem of malicious peers ( using packet dropping strategy).

Social network analysisEmma Brear

This document discusses using social network analysis to analyze a network of individuals involved in updating tuition fee information on a university webpage. It defines social networks and social network analysis. It presents a network diagram of the individuals and relationships involved in the tuition fee update process. The document discusses how social network analysis can visualize information flow and connections to identify ways to improve efficiency. However, it also notes limitations, such as not accounting for roles, effectiveness of relationships, or barriers to communication.

On optimizing overlay topologies for searchIMPULSE_TECHNOLOGY

The document discusses optimizing search performance in unstructured peer-to-peer networks by improving the overlay topology. Existing approaches organize peers based on similarity but do not provide performance guarantees. The proposed approach presents a novel overlay construction algorithm that exploits the power-law file sharing pattern exhibited in P2P networks. It provides rigorous guarantees including searching in O(logN) hops with high probability and progressively exploiting peer similarity. Simulations show it outperforms competing algorithms in reducing query hops, improving success ratio, and minimizing messaging overhead.

Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS

The document discusses transfer reliability and congestion control strategies in opportunistic networks. It begins by stating that opportunistic networks have unpredictable node contacts and rarely have complete end-to-end paths. It then discusses how modified TCP protocols are ineffective for these networks and they require different approaches than intermittently connected networks. The document surveys proposals for transfer reliability using hop-by-hop custody transfer and end-to-end receipts. It also categorizes storage congestion control based on single or multiple message copies. It identifies open research issues including replication management and drop policies for multiple copies.

Microtemporality: At The Time When Loading-in-progressAarhus University

Microtemporality refers to the deep internal operations and structures of digital networks that are invisible to users. Data transmission involves chopping streams into packets and adding control information, with packets arriving out of order and needing to be buffered and reassembled at the receiving end. Computational processes make micro-level decisions about data in transmission that reconfigure network temporality by discarding absent data. This invisible microtemporal level of analysis shifts focus from visible screens to the background computational events that drive digital communication.

Master Thesis AbstractBruno Dzogovic

Wireless mesh networks allow nodes to communicate directly with each other. However, implementing mesh networks in practice is challenging due to heterogeneity and the large number of users in cities requiring automatic organization. This thesis investigates using principles from the human immune system and pheromone signaling to address problems with routing, channel assignment, and quality of service in mesh networks. Specifically, it proposes adapting mate selection mechanisms between animals to network interconnection and models this using genetic algorithms and simulations in MATLAB.

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.

SPIRIT: A TREE KERNEL-BASED METHOD FOR TOPIC PERSON INTERACTION DETECTIONNexgen 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:[email protected] 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.

Social Trust-aware Recommendation System: A T-Index ApproachNima Dokoohaki

"Social Trust-aware Recommendation System: A T-Index Approach" Workshop on Web Personalization, Reputation and Recommender Systems (WPRRS09) Held in conjunction with 2009 IEEE/ WIC/ ACM International Conference on Web Intelligence (WI 2009) and Intelligent Agent Technology, http://www.wprrs.scitech.qut.edu.au/ Università degli Studi di Milano Bicocca, Milano, Italy September 15–18, 2009

Network FlowRoyi Itzhak

The document discusses interactome networks that combine measurements from multiple sources to represent interaction networks without node details. It notes that most such networks contain redundant data and proposes algorithms to identify important nodes and information flow. The algorithms analyze network topology, centrality measures, and betweenness to identify hierarchical relationships and validate results. The algorithms performed well on sample networks, identifying meaningful information pathways rather than random connections.

Scale-Free Networks to Search in Unstructured Peer-To-Peer NetworksIOSR Journals

This document discusses using scale-free networks to improve search efficiency in unstructured peer-to-peer networks. It proposes the EQUATOR architecture, which creates an overlay network topology based on the scale-free Barabasi-Albert model. Simulation results show that EQUATOR achieves good lookup performance comparable to the ideal Barabasi-Albert network, with low message overhead even under node churn. The scale-free topology allows random walks to efficiently locate resources by directing searches to high-degree "hub" nodes with greater knowledge of the network.

Semantometrics in Coauthorship Networks: Fulltext-based Approach for Analysin...Dasha Herrmannova

To date, many studies of scientific citation, collaboration and coauthorship networks have focused on the concept of cross-community ties. In this article we explore how Semantometrics can help to characterise the types of research collaboration in scholarly publication networks and the nature of the cross-community ties, and how this information can be utilised in aiding research evaluation. In contrast to the existing research evaluation metrics such as Bibliometrics, Altmetrics or Webometrics, which are based on measuring the number of interactions in the scholarly network, Semantometrics build on the premise that fulltext is needed to understand the value of publications. Using the CORE dataset as a case study, this paper looks at the relation between the semantic distance of authors and their research endogamy value. We identify four potential types of collaboration in a coauthorship network. The results suggest similar measures can be used to provide meaningful information about the nature of collaboration in scholarly publication networks.

P2P DOMAIN CLASSIFICATION USING DECISION TREE ijp2p

The increasing interest in Peer-to-Peer systems (such as Gnutella) has inspired many research activities in this area. Although many demonstrations have been performed that show that the performance of a Peer-to-Peer system is highly dependent on the underlying network characteristics, much of the evaluation of Peer-to-Peer proposals has used simplified models that fail to include a detailed model of the underlying network. This can be largely attributed to the complexity in experimenting with a scalable Peer-to-Peer system simulator built on top of a scalable network simulator. A major problem of unstructured P2P systems is their heavy network traffic. In Peer-to-Peer context, a challenging problem is how to find the appropriate peer to deal with a given query without overly consuming bandwidth? Different methods proposed routing strategies of queries taking into account the P2P network at hand. This paper considers an unstructured P2P system based on an organization of peers around Super-Peers that are connected to Super-Super-Peer according to their semantic domains; in addition to integrating Decision Trees in P2P architectures to produce Query-Suitable Super-Peers, representing a community of peers where one among them is able to answer the given query. By analyzing the queries log file, a predictive model that avoids flooding queries in the P2P network is constructed after predicting the appropriate Super-Peer, and hence the peer to answer the query. A challenging problem in a schemabased Peer-to-Peer (P2P) system is how to locate peers that are relevant to a given query. In this paper, architecture, based on (Super-)Peers is proposed, focusing on query routing. The approach to be implemented, groups together (Super-)Peers that have similar interests for an efficient query routing method. In such groups, called Super-Super-Peers (SSP), Super-Peers submit queries that are often processed by members of this group. A SSP is a specific Super-Peer which contains knowledge about: 1. its Super-Peers and 2. The other SSP. Knowledge is extracted by using data mining techniques (e.g. Decision Tree algorithms) starting from queries of peers that transit on the network. The advantage of this distributed knowledge is that, it avoids making semantic mapping between heterogeneous data sources owned by (Super-)Peers, each time the system decides to route query to other (Super-) Peers. The set of SSP improves the robustness in queries routing mechanism, and the scalability in P2P Network. Compared with a baseline approach,the proposal architecture shows the effect of the data mining with better performance in respect to response time and precision.

A QUERY LEARNING ROUTING APPROACH BASED ON SEMANTIC CLUSTERSijait

Peer-to-peer systems have recently a remarkable success in the social, academic, and commercial communities. A fundamental problem in Peer-to-Peer systems is how to efficiently locate appropriate peers to answer a specific query (Query Routing Problem). A lot of approaches have been carried out to enhance search result quality as well as to reduce network overhead. Recently, researches focus on methods based on query-oriented routing indices. These methods utilize the historical information of past queries and query hits to build a local knowledge base per peer, which represents the user's interests or profile. When a peer forwards a given query, it evaluates the query against its local knowledge base in order to select a set of relevant peers to whom the query will be routed. Usually, an insufficient number of relevant peers is selected from the current peer's local knowledge base thus a broadcast search is investigated which badly affects the approach efficiency. To tackle this problem, we introduce a novel method that clusters peers having similar interests. It exploits not only the current peer's knowledge base but also that of the others in the cluster to extract relevant peers. We implemented the proposed approach, and tested (i) its retrieval effectiveness in terms of recall and precision, (ii) its search cost in terms of messages traffic and visited peers number. Experimental results show that our approach improves the recall and precision metrics while reducing dramatically messages traffic.

Improving Online Deliberation with Argument Network Visualization Anna De Liddo

The Mathematics of Social Network Analysis: Metrics for Academic Social NetworksEditor 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

CoCoWa A Collaborative Contact-BasedBen Paul

CoCoWa is a collaborative approach to detecting selfish nodes in mobile ad-hoc networks (MANETs) and delay tolerant networks (DTNs) that improves upon local watchdog approaches. It combines local watchdog detections with the dissemination of information about detected selfish nodes between nodes during contacts. This reduces the time and increases the precision of detecting selfish nodes by reducing the effects of false positives and negatives generated by local watchdogs. The paper presents an analytical model and experimental evaluation using mobility traces showing CoCoWa provides significantly faster and more accurate detection of selfish nodes with reduced overhead compared to traditional watchdog approaches.

50120140506002IAEME Publication

The document discusses sampling techniques for online social networks. It proposes using an outlier indexing algorithm to sample large datasets from social networks. The key advantages of this approach are that random samples can be used for a wide range of analytical tasks and outlier detection. The paper also reviews related literature on estimating search tree sizes and sampling nodes in social networks. It then presents the proposed outlier indexing sampling algorithm for compressing social network structure and interest correlations across users.

Modelling and Analyzing Complex Networks"butest

The keynote presentation at the 2nd Jordan International Conference on Computer Science and Engineering discusses three examples of modeling complex networks using computer science techniques: 1) Analyzing the link structure of websites using link structure graphs to understand site organization and user experience. 2) Studying messages exchanged in online social networks using machine learning to determine levels of agreement and disagreement. 3) Modeling complex biological systems like gene networks using stochastic pi-calculus to study multi-component system interactions. The presenter is Dr. Natasa Milic-Frayling, a senior researcher at Microsoft Research Cambridge who leads research on information retrieval, machine learning, and user-centered design.

efficient data query in intermittently-connected mobile ad hoc social networksswathi78

This document discusses efficient data query in intermittently connected mobile ad hoc social networks (MASONs). It proposes a centralized optimization model and distributed data query protocol to address challenges like opportunistic connectivity and unknown data providers. A testbed experiment using 25 tablets for 15 days demonstrated feasibility and efficiency. Simulations under various network settings provided additional performance insights not possible through lab experiments alone. The goal is to determine an optimal transmission strategy that supports the desired query rate within a delay budget while minimizing communication costs.

Vehicular Ad Hoc Network Message Dissemination Thesis TopicsNetwork Simulation Tools

TRUST MANAGEMENT FOR DELAY TOLERANT NETWORKIAEME Publication

Delay Tolerant Networks (DTNs) have high end-to-end latency, which is often faces disconnection, and unreliable wireless connections. It does not mean a delay service instead DTNs provides a service where network imposes disruption or delay. It operates in challenged networks with extremely limited resources such as memory size, CPU processing power etc. This paper presents an efficient trust managing mechanism for providing secure environment. The proposed dynamic trust management protocol uses a dynamic threshold updating which overcomes the problems with time changing dynamic characteristics by dynamically updating the criteria in response to changing network conditions. This reduces overheads and increases the efficient use of routing network even in conditions change. Also the dynamic threshold update reduces the false detection probability of the malicious nodes. To show the effectiveness of the proposed system, a detailed simulation in the presence of selfish and malicious nodes is performed with ONE simulator. Finally a comparative analysis of our proposed routing with previous routing protocols is also performed. The results demonstrate that presented algorithm deals effectively with selfish behavior with providing significant gain on effective delivery ratio in trade off with message overhead and delay

TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal

A COMPREHENSIVE STUDY ON WILLINGNESS MAXIMIZATION FOR SOCIAL ACTIVITY PLANNIN...Nexgen Technology

Secure erasure code based distributed storage system with secure data forwardingAli Habeeb

This document proposes a secure distributed storage system that uses erasure coding and threshold proxy re-encryption. The system allows for robust, confidential storage and forwarding of encrypted data across storage servers without a central authority. It consists of four main modules: 1) System setup which generates keys for users and storage servers, 2) Data storage where a user's message is encrypted and dispersed across storage servers, 3) Data forwarding which allows a user to delegate access to another user via re-encryption of the stored data, and 4) Data retrieval where a user can retrieve their encrypted data from the storage servers.

Secure routing in wsn-attacks and countermeasuresMuqeed Abdul

1) The document discusses security issues in wireless sensor networks, specifically focusing on attacks against routing protocols and potential countermeasures. It outlines common attacks like spoofing, selective forwarding, sinkhole attacks, Sybil attacks, wormholes, and HELLO flood attacks. 2) The document then discusses countermeasures against each type of attack, such as link layer security, identity verification, verification of link bidirectionality, multipath routing, and better protocol design. 3) Finally, the document emphasizes that routing protocols for wireless sensor networks must be designed with security in mind to effectively defend against both insider and outsider adversaries.

Idea(international data encryption algorithm)SAurabh PRajapati

The document discusses the International Data Encryption Algorithm (IDEA). It was developed in 1990 as a replacement for the Data Encryption Standard. IDEA is a symmetric block cipher that uses a 128-bit key to encrypt 64-bit blocks of plaintext into ciphertext. The key is divided into 52 subkeys that are used in 8 rounds of encryption/decryption operations involving XOR, addition, and multiplication. IDEA was used in PGP v2.0 and can encrypt sensitive data for applications like financial services, broadcasting, and government use.

Secure erasure code based cloud storage system with secure data forwardingPriyank Rupera

The document describes a presentation on implementing threshold proxy re-encryption and decentralized erasure code for distributed storage systems. The proposed system uses threshold proxy re-encryption and decentralized erasure coding to improve security and reliability compared to traditional general encryption schemes. Key components include storage servers, key servers, and flexible adjustment of parameters between servers. Diagrams are included showing the system architecture, workflow, use cases and sequences.

More Related Content

What's hot (18)