Dispersed information diffusion with level and schema-based coordination in mobile peer to peer networks

Abstract

Several open ended issues for high resource availability in mobile peer to peer networks have been examined in the recent past. Different approaches were conducted for supporting information distribution and availability, through guided or unguided packet diffusion. The majority of the recently proposed approaches try to benefit from the spatial characteristics of the dynamically varying topologies. In this work a directed information diffusion scheme is examined using a level and schema-based coordination, applied in mobile peer to peer networks. The prioritization degree of any requested advert is modeled and enables directed prioritized diffusions to end mobile users that are traversing a certain geographic region (location based advertisements). The proposed method is robust in disseminating redundant messages to users while maintaining connectivity through Gradual Energy Tree-based (GET) configuration. Simulation is performed for the examination and performance evaluation of the proposed scheme, taking into account the modeled prioritization as well as the diffusion accuracy by using the Hierarchical and Non-hierarchical GET configuration.

Community Oriented Neighboring Feedback for Efficient End-to-End Delay-Sensitive MP2P Streaming via Temporal Relay-Based Replication

“…Cluster network formation works as follows: each cluster is responsible to host newly added nodes and measures (Cluster Head (CH) responsibility) whether these nodes can host new file chunks. If the new node entered the cluster i has available remaining capacity greater than the existing CH, then the Gradual Energy Tree-based (GET) is formed [8] for maintaining connectivity through the node's remaining energy. GET is used to form a tree having as a root, the node with the least remaining energy, and as children the nodes with the higher residual energy.…”

“…GET is used to form a tree having as a root, the node with the least remaining energy, and as children the nodes with the higher residual energy. GET configuration is applied only locally, on a 2-hops basis onto each node to prevent huge information delivery onto nodes which are located far from source node, and to maintain 2-hops recursive network topology formation as in the scenario proposed in [8]. No CH has a restriction to directly communicate with any other CH.…”

“…cluster N). In this way the connectivity can be adequately formed and nodes can transfer data and file chunks by temporarily cache them onto intermediate nodes (as in [8]) by using the neighboring mechanisms explored in the following section. The complexity of the constructed clusters reached the Max (O(n 2 ) where the created clusters can be expanded into…”

“…Then, according to the contact and the downloading rate within the streaming community, a tree can be constructed as shown in Figure 1.2. Figure 1.2 shows that on a triggered dynamic basis -as in [8]-the tree-based communication can be constructed taking into consideration the eigenvector centrality [25] which is a measure for the connectedness of the nodes. Let a network topology exist at a given time and denote by A the corresponding adjacency matrix.…”

“…The extracted simulation results are of major significance since there is a comparison of the performance of the proposed method with the non-feedback oriented techniques [8,18,21,24]. The statistical significance of the simulation results is primarily the well behaved -balanced-values according to the simulation results outcomes.…”