10,164 research outputs found

    Data Dissemination And Information Diffusion In Social Networks

    Get PDF
    Data dissemination problem is a challenging issue in social networks, especially in mobile social networks, which grows rapidly in recent years worldwide with a significant increasing number of hand-on mobile devices such as smart phones and pads. Short-range radio communications equipped in mobile devices enable mobile users to access their interested contents not only from access points of Internet but also from other mobile users. Through proper data dissemination among mobile users, the bandwidth of the short-range communications can be better utilized and alleviate the stress on the bandwidth of the cellular networks. In this dissertation proposal, data dissemination problem in mobile social networks is studied. Before data dissemination emerges in the research of mobile social networks, routing protocol of finding efficient routing path in mobile social networks was the focus, which later became the pavement for the study of the efficient data dissemination. Data dissemination priorities on packet dissemination from multiple sources to multiple destinations while routing protocol simply focus on finding routing path between two ends in the networks. The first works in the literature of data dissemination problem were based on the modification and improvement of routing protocols in mobile social networks. Therefore, we first studied and proposed a prediction-based routing protocol in delay tolerant networks. Delay tolerant network appears earlier than mobile social networks. With respect to delay tolerant networks, mobile social networks also consider social patterns as well as mobility patterns. In our work, we simply come up with the prediction-based routing protocol through analysis of user mobility patterns. We can also apply our proposed protocol in mobile social networks. Secondly, in literature, efficient data dissemination schemes are proposed to improve the data dissemination ratio and with reasonable overhead in the networks. However, the overhead may be not well controlled in the existing works. A social-aware data dissemination scheme is proposed in this dissertation proposal to study efficient data dissemination problem with controlled overhead in mobile social networks. The data dissemination scheme is based on the study on both mobility patterns and social patterns of mobile social networks. Thirdly, in real world cases, an efficient data dissemination in mobile social networks can never be realized if mobile users are selfish, which is true unfortunately in fact. Therefore, how to strengthen nodal cooperation for data dissemination is studied and a credit-based incentive data dissemination protocol is also proposed in this dissertation. Data dissemination problem was primarily researched on mobile social networks. When consider large social networks like online social networks, another similar problem was researched, namely, information diffusion problem. One specific problem is influence maximization problem in online social networks, which maximize the result of information diffusion process. In this dissertation proposal, we proposed a new information diffusion model, namely, sustaining cascading (SC) model to study the influence maximization problem and based on the SC model, we further plan our research work on the information diffusion problem aiming at minimizing the influence diffusion time with subject to an estimated influence coverage

    Routing in a many-to-one communication scenario in a realistic VDTN

    Get PDF
    In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.Peer ReviewedPostprint (author's final draft

    Orion Routing Protocol for Delay-Tolerant Networks

    Full text link
    In this paper, we address the problem of efficient routing in delay tolerant network. We propose a new routing protocol dubbed as ORION. In ORION, only a single copy of a data packet is kept in the network and transmitted, contact by contact, towards the destination. The aim of the ORION routing protocol is twofold: on one hand, it enhances the delivery ratio in networks where an end-to-end path does not necessarily exist, and on the other hand, it minimizes the routing delay and the network overhead to achieve better performance. In ORION, nodes are aware of their neighborhood by the mean of actual and statistical estimation of new contacts. ORION makes use of autoregressive moving average (ARMA) stochastic processes for best contact prediction and geographical coordinates for optimal greedy data packet forwarding. Simulation results have demonstrated that ORION outperforms other existing DTN routing protocols such as PRoPHET in terms of end-to-end delay, packet delivery ratio, hop count and first packet arrival
    • …
    corecore