Dissemination Tree Research Articles

Identification of Traditional Culture Communication in Social Media Based on Information Dissemination Tree

In the era of social media platforms like Douyin, preserving the essence of traditional Chinese culture while adapting it to contemporary trends is crucial for its continued relevance and vitality. This paper delves into the practical implications of leveraging social media for cultural communication, emphasizing communication strategies tailored to platforms like Douyin. It introduces two novel algorithms for generating Douyin information dissemination trees: one based on retweeting relationships and another optimized for rapid dissemination. Comparative experiments assess the performance of these algorithms and analyze the node distribution within dissemination trees, aiming to enhance the dissemination power of traditional culture and foster its inheritance and innovation.

Go-Sharing: A Blockchain-Based Privacy-Preserving Framework for Cross-Social Network Photo Sharing

The evolution of social media has led to a trend of posting daily photos on online Social Network Platforms (SNPs). The privacy of online photos is often protected carefully by security mechanisms. However, these mechanisms will lose effectiveness when someone spreads the photos to other platforms. In this paper, we propose Go-sharing, a blockchain-based privacy-preserving framework that provides powerful dissemination control for cross-SNP photo sharing. In contrast to security mechanisms running separately in centralized servers that do not trust each other, our framework achieves consistent consensus on photo dissemination control through carefully designed smart contract-based protocols. We use these protocols to create platform-free dissemination trees for every image, providing users with complete sharing control and privacy protection. Considering the possible privacy conflicts between owners and subsequent re-posters in cross-SNP sharing, we design a dynamic privacy policy generation algorithm that maximizes the flexibility of re-posters without violating formers' privacy. Moreover, Go-sharing also provides robust photo ownership identification mechanisms to avoid illegal reprinting. It introduces a random noise black box in a two-stage separable deep learning process to improve robustness against unpredictable manipulations. Through extensive real-world simulations, the results demonstrate the capability and effectiveness of the framework across a number of performance metrics.

Design and Analysis of Distributed Tree Growing Algorithms

Tree-based systems rely on real-time dissemination trees to deliver information to nodes. In order to offer good services, two fundamental aspects should guide the real-time growth process: low node degree and short distances to the server. In this paper, we propose a growth process to construct trees and make a detailed study on modeling and performance analysis of these tree-based systems. Our generative mechanism is based on the preferential attachment principle, where preference is given in terms of node quality. The proposed growth mechanism has a single parameter to weigh the relative importance of node degree and node distance on assessing node quality. We aim at understanding this mechanism when considering the local aspect of the node’s degree and the global aspect of the distance to a source. With this goal, we investigate our model through simulations and compare it to other growth processes. Our results indicate that the proposed model is capable of self-organizing nodes into good trees under six metrics of interest.

Multi-attribute profile-cast in mobile opportunistic networks

Profile-cast provides a novel data dissemination paradigm in mobile opportunistic networks, allowing messages to be disseminated to nodes based on their profiles rather than network identities. Profile-cast has attracted increasing attention, but most of existing algorithms cannot account for some scenarios where multiple attributes need to be considered simultaneously in a profile. We focus on the multi-attribute profile-cast (MapCast) paradigm, where the node’s profile is represented by a multi-dimensional vector, which may contain multiple attributes of the node such as its behavior, interest, social information, etc. First, we consider a scenario with a fixed source node. We construct a message dissemination tree using the node encounter history. Then we propose a dissemination tree based MapCast algorithm, which adapts a heuristic search algorithm to select relay nodes so that the destination node can receive the message as soon as possible and the network has a low overhead. Second, we consider a more complex scenario with unfixed source nodes. In this scenario, the concept of group profile is defined, and a new high-efficient algorithm, group-profile based MapCast (G-MapCast), is proposed to limit the scope of message forwarding to the nodes whose profile or group profile satisfies certain delivery conditions. To further reduce the network overhead, we propose a network coding based MapCast algorithm on the basis of G-MapCast. Finally, we provide simulation results based on two real human contact datasets and verify the effectiveness and superiority of our algorithms.

A novel negative feedback information dissemination model based on online social network

Due to the existing social network information dissemination model does not consider the influencing factors of node feedback information. The characteristics of social networks and the social attributes of the disseminators are analyzed; we propose a new social network information dissemination with negative feedback NFSIR (negative feedback susceptible infected removed) model combined with traditional epidemiological models The model first introduces attenuation coefficients and noise coefficients to describe the different effects of information transmission among different users. The feedback function is defined in order to describe the information feedback mechanism. Then, according to the mechanism of information interaction evolution, an information dissemination tree is constructed, and a differential equation of propagation dynamics is established. It reveals the complex interactions and interactions between user relationships, social communities, and cyberspace information in social networks. Finally, the model is applied to two typical real social networks to carry out simulation experiments and compared with the traditional model. Experimental results show that, the intensity of information feedback has a significant impact on the process of information dissemination. It can be seen that the Twitter and Sina microblog networks are significantly different through the analysis of the transmission time and propagation life cycle indicators. The comparison of experimental results shows that the proposed NFSIR model can better reflect the characteristics of real social networks. It proves that the proposed mathematical propagation model is objective, reasonable, and effective. The proposed model not only has strong scalability, but also has application value. It also provides theoretical support for research in related fields.

Information Dissemination Analysis Using a Time-Weight Null Model: A Case Study of Sina Micro-Blog

Information dissemination in a social network is constrained by the underlying structure of the network and interaction between the users, and different dissemination patterns are exhibited over time. In this paper, first, information dissemination trees (IDTs) are constructed by tracking the Sina micro-blog information dissemination path (i.e., message forwarding and @), and an empirical analysis of their time characteristics is conducted. Second, the time-weight shuffle null model is established based on the null model in statistics, including the equal time-weight edge shuffle null model and the node time-weight shuffle null model, which are utilized to analyze the temporal properties and the corresponding information dissemination pattern. Thus, we further analyze the dynamics of the IDTs, which contain the burstiness of the information dissemination, the dissemination scale, and the effect of the network structure on the information dissemination. Finally, the experimental results indicate that the information dissemination in Sina micro-blog has a 5-h-effect and the network structure has a positive effect on the dissemination of information. The latter contrasts sharply with the scenarios of the European mobile phone network and e-mail communication network, and the burstiness of the information dissemination is suppressed while the network structure is destroyed.

The data-driven null models for information dissemination tree in social networks

For the purpose of detecting relatedness and co-occurrence between users, as well as the distribution features of nodes in spreading path of a social network, this paper explores topological characteristics of information dissemination trees (IDT) that can be employed indirectly to probe the information dissemination laws within social networks. Hence, three different null models of IDT are presented in this article, including the statistical-constrained 0-order IDT null model, the random-rewire-broken-edge 0-order IDT null model and the random-rewire-broken-edge 2-order IDT null model. These null models firstly generate the corresponding randomized copy of an actual IDT; then the extended significance profile, which is developed by adding the cascade ratio of information dissemination path, is exploited not only to evaluate degree correlation of two nodes associated with an edge, but also to assess the cascade ratio of different length of information dissemination paths. The experimental correspondences of the empirical analysis for several SinaWeibo IDTs and Twitter IDTs indicate that the IDT null models presented in this paper perform well in terms of degree correlation of nodes and dissemination path cascade ratio, which can be better to reveal the features of information dissemination and to fit the situation of real social networks.

Giải pháp hiệu quả đảm bảo nhất quán dữ liệu chia sẻ phân tán trên nền tảng P2P có cấu trúc

There are certain difficulties in ensuring the consistency of data sharing and distribution on structured P2P substrate because of the requirements of simultaneous processing interacted by many users and peer's input/output or updated speed. This paper presents a high effective solution which is proposed for structured P2P substrate, uses the updated dissemination tree and proposes a method using buffer and index vectors in order to "condition" between the requests and processes of updating. The experimental results conducted on Oversim are aimed at comparing the efficiency of new proposed solution with that of Nakashima. The experimental results indicate that the new proposed is highly effective in ensuring the consistency (over 90%) and satisfies the requirements of latency of update propagation. Especially, in case the peer’s input/output or updated speed is high, the new proposed also achieve greater efficiency.

Sink-oriented tree based data dissemination protocol for mobile sinks wireless sensor networks

Data dissemination toward static sinks causes the nearby nodes to deplete their energy quicker than the other nodes in the field (i.e., this is referred to as the hotspot problem). Accordingly, topology disruptions will occur and no data will be delivered to the sink. Mobile sinks are proposed to solve the hotspot problem in wireless sensor networks; they provide a load balancing and an energy consumption balancing for the whole network. However, sink mobility introduces new challenges (e.g., frequent location updates and packets delay). In this paper, we proposed a distributed sink-oriented dissemination protocol called Sink-oriented Tree based Data Dissemination (STDD). STDD constructs just one main dissemination tree for each mobile sink. When the access node is changed, the main tree will be updated and maintained to guarantee the shortest path to the mobile sinks. The updated and maintained tree is not a new tree; however, it is just a new version with only a few changes in a few levels of the main tree itself. Simulations show that STDD achieves a significant performance in terms of latency, network lifetime, delivery rate, and energy consumption compared with the state-of-the-art approaches.

CoolConferencing: Enabling Robust Peer-to-Peer Multi-Party Video Conferencing

Multi-party video conferencing (MPVC) is the next big opportunity for Internet streaming. Commercial MPVC solutions are either server-based or peer-to-peer (P2P)-based, which both have performance limitations. P2P technology is expected to dominate the MPVC platform. There are four requirements for a robust MPVC system: 1) realistic network assumptions; 2) realistic system settings; 3) multi-rate support; and 4) any-view support. Existing academic works study the problem from a theoretical perspective, and none of them meets all four requirements simultaneously. We design CoolConferencing, an overlay network for robust P2P MPVC. The core operations follow the easy-to-implement, robust, and resilient data-driven principle, which does not maintain complex global structures such as dissemination trees and can adapt to network dynamic distributedly and quickly. CoolConferencing is a robust system that meets all four requirements simultaneously. In addition, to the best of our knowledge, there is no existing work which examines its MPVC approach under various realistic network environments. We have evaluated CoolConferencing via an event-driven simulation. Compared with state-of-the-art video conferencing solutions, CoolConferencing achieves around 25% gain than Mutualcast and around 9% gain than Celerity in performance. Moreover, when the helper mechanism is enabled, CoolConferencing can easily exploit all available bandwidth to get optimal video transmission performance.

Duty‐cycle SN‐multi‐point relay algorithm for mobile sink wireless sensor networks

In wireless sensor networks, transceiver's utilisation should be minimised as it is the largest power consuming component of a wireless sensor node. In this study, the authors propose a distributive topology-control algorithm which minimises network's power consumption by allowing the non-relay nodes in the data dissemination tree to switch-off their respective transceivers when communication is not desired. In this algorithm, named duty-cycle SN-multi-point relay (MPR), the sink follows a sojourn-based mobility model and it uses MPR broadcast algorithm for broadcasting its periodic sink location update packets to the network which results in a tree consisting of relay/MPR and non-relay/non-MPR nodes. Duty-cycle SN-MPR algorithm minimises power consumption by allowing the non-relay nodes to switch-off their transceivers in each sink sojourn round. Moreover, all nodes switch-off their transceivers when the sink starts moving to its next sojourn position. Performance evaluation through simulations in network simulator 2 show that the proposed algorithm efficiently minimises the network's power consumption and also offers a better load distribution which helps in increasing the network lifetime.

QoS aware orthogonal routing protocol for WSN using directional antennas

In this paper, we propose a QoS aware ORRP (Q-ORRP) routing protocol to minimise the energy consumption by reducing overhead and delay. The method of intersection of signals is used for transferring the data with improved QoS. Sink is enabled with orthogonal transmission, in which it sends an interest request message to all neighbouring nodes in all orthogonal directions. This process continues until the interest request matches with intended data. Then, the node sends the interest acknowledgement back to the sink through the reverse path. The intersection point of these two messages is considered as the rendezvous point (RP). When the RP receives these packets, it changes their direction and sends them toward destination node. Finally, sink establishes data dissemination tree towards the source through RP nodes. RPs with high residual energy and queue lengths are selected for establishing tree, so that the data transmission will be energy efficient and robust.

Fast Message Dissemination Tree and Balanced Data Collection Tree for Wireless Sensor Network

Topology control is a fundamental technique in Wireless Sensor Network (WSN), which forms the underlying topology for routing and other protocols by power control and neighbor selection. In recent years, various topology control algorithms with very different design goals have been proposed, and all of them try to form one optimized topology for all types of communications. Such solution makes a serious mistake by neglecting the fact that different communications have very different requirements. The most common communications in WSN are broadcast and data collection. For broadcast or message dissemination, the first priority is to spread the message throughout the network as quickly as possible. As for data collection, multi-factors should be taken into account, such as link length, hops to base station, node degree. With the very different goals, it is not possible to solve all those problems simultaneously with just one topology. In this paper, we propose a approach, which contains a Fast Dissemination Tree (FDT) and a Balanced Data Collection Tree (BDCT) to fulfill the requirements of the above two communications, i.e. message dissemination and data collection. And analysis and simulation proves that our method has a better performance when compared to the existed ones.

Maintaining Data Consistency in Structured P2P Systems

A fundamental challenge of supporting mutable data replication in a Peer-to-Peer (P2P) system is to efficiently maintain consistency. This paper presents a framework for Balanced Consistency Maintenance (BCoM) in structured P2P systems with heterogeneous node capabilities and various workload patterns. Replica nodes of each object are organized into a tree structure for disseminating updates, and a sliding window update protocol is developed for consistency maintenance. We present an analytical model to optimize the window size according to the dynamic network conditions, workload patterns and resource limits. In this way, BCoM balances the consistency strictness, object availability for updates, and update propagation performance for various application requirements. On top of the dissemination tree, two enhancements are proposed: (1) a fast recovery scheme to strengthen the robustness against node and link failures, and (2) a node migration policy to remove and prevent bottlenecks allowing more efficient update delivery. Simulations are conducted using P2PSim to evaluate BCoM in comparison to SCOPE [1]. The experimental results demonstrate that BCoM outperforms SCOPE with lower discard rates. BCoM achieves a discard rate as low as 5 percent in most cases while SCOPE has almost 100 percent discard rate.

A density-driven publish subscribe service for mobile ad-hoc networks

This paper studies a density driven virtual topography based publish/subscribe service for mobile ad hoc networks. Two variants of the service are presented and evaluated by extensive simulations; the first is very communication frugal while the latter trades a higher message overhead for faster latency. Both variants are also being compared to two other representative approaches for publish/subscribe in ad hoc networks, a dissemination tree based scheme and an efficient flooding based scheme. It is shown that the density-driven approach outperforms the others in most tested scenarios.

Multi-tier Grid Routing to Mobile Sink in Large-scale Wireless Sensor Networks

Improving the efficiency of data dissemination algorithms and protocols to mobile sink remains as an interesting research and engineering issue, especial for large-scale wireless sensor network. As the node energy and resources are limited, theses protocols should meet energy-efficiency, low delay and high delivery ratio requirements. Although an energy-efficient dissemination tree (d-tree) can be constructed with sink mobility, the delayed handoff could lead to suboptimal routing trees for a substantial amount of time as the network grows larger, and also the efficiency heavily relied on the location of the sink, thus it may offset the load balance resulting from hierarchical tree structure. In this paper, we propose an energy efficient routing protocol MGRP (Multi-tier Grid Routing Protocol) which introduces a special hybrid multi-tier structure for data dissemination. MGRP divides the observation areas into square grids, could be different size. Within each grid, we form an optimized cluster which transmit reliable data to its higher tier cluster head, the uppermost cluster head from neighbor grids further negotiate to construct the data d-tree from which the mobile sink can access and send query. Through intensive simulation in a given mobile sink experiment, MGRP performs better in terms of energy consumption and average delay respectively compared to previous protocols such as TTDD (grid-based), SEAD (tree-based) and COSEN (chain-based), under practical conditions, where sensors may die out, but with initial large size.

Efficient and Reliable Dissemination in Mobile Ad Hoc Networks by Location Extrapolation

Data dissemination is an important service in mobile ad hoc networks (MANETs). The main objective of this paper is to present a dissemination protocol, calledlocBcast, which utilizes positioning information to obtain efficient dissemination trees with low-control overhead. This paper includes an extensive simulation study that compares locBast with selfP, dominantP, fooding, and a couple of probabilistic-/counter-based protocols. It is shown that locBcast behaves similar to or better than those protocols and is especially useful in the following challenging environments: the message sizes are large, the network is dense, and nodes are highly mobile.

Multi-objective optimization of multicast overlays for collaborative applications

Current real-time collaborative application implementations use dedicated infrastructure to carry out all communication and synchronization activities. Specifically, they require all end nodes to communicate directly with and through the central server. In this paper, we investigate scenarios in which the most resource intensive functionality of continuous communication among collaborators to disseminate changes is decentralized, utilizing the end users themselves as relays. We observe that communication characteristics of real-time collaboration makes use of existing multicast mechanisms unsuitable. As collaborative editing sessions are typically long and repeated, it is possible to gather and leverage node behavior (their instabilities and frequency of sending updates) and communication links (latencies and average costs). Several criteria to determine the quality of a multicast tree can be identified: cost, latency and instability. In this paper, we analyze the complexity of the problem of finding optimal communication topologies, and propose approximate algorithms to optimize the same. We also consider the multiobjective problem in which we search for a topology that provides good trade-off between these sometimes conflicting measures. Validation of our proposed algorithms on numerous graphs shows that it is important to consider the multiobjective problem, as optimal solutions for one performance measure can be far from optimal for the other metrics. Finally, we briefly present an implementation of a communication library that uses the proposed algorithms to periodically adjust the dissemination tree.

Routing algorithms for content-based publish/subscribe systems

In content-based publish/subscribe systems, messages target a dynamic group of participants whose expressed interests match the contents of the messages. In this generalization of multicasting communication, also dubbed content-based networking, naming, binding and communication are intertwined in the same substrate. Optimal content-based routing uses dissemination trees dynamically pruned to only cover the matching subscribers. It is a complex problem that has motivated significant research efforts. This paper presents a compilation of the main algorithms for routing messages in distributed content-based publish-subscribe systems proposed and published in the last decade. Discussion is focused on the content-based routing problem in respect to optimality, complexity and applicability. Moreover, whenever it is appropriate, the algorithms covered are also matched to similar algorithms familiar to the networking community, setting this paper apart from other surveys on the broad topic of publish/subscribe systems.

In search of simplicity: a self‐organizing group communication overlay

AbstractGroup communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support these primitives while accounting for volatile end‐nodes and variable network characteristics. Most solutions proposed to date rely on complex algorithms or on global information, thus limiting the scale of deployments and acceptance outside the academic realm. This article introduces a low‐complexity, self‐organizing solution for building and maintaining data dissemination trees, which we refer to as Unstructured Multi‐source Overlay (UMO). UMO uses traditional distributed systems techniques: layering, soft‐state, and passive data collection to adapt to the dynamics of the physical network and maintain data dissemination trees. The result is a simple, adaptive system with lower overheads than more complex alternatives. We implemented UMO and evaluated it on a 100‐node PlanetLab testbed and on up to 1024‐node emulated ModelNet networks. Extensive experimental evaluations demonstrate UMOs low overhead, efficient network usage compared with alternative solutions, and the ability to quickly adapt to network changes and to recover from failures. Copyright © 2009 John Wiley & Sons, Ltd.