3,785 research outputs found

    Social-aware Opportunistic Routing Protocol based on User's Interactions and Interests

    Full text link
    Nowadays, routing proposals must deal with a panoply of heterogeneous devices, intermittent connectivity, and the users' constant need for communication, even in rather challenging networking scenarios. Thus, we propose a Social-aware Content-based Opportunistic Routing Protocol, SCORP, that considers the users' social interaction and their interests to improve data delivery in urban, dense scenarios. Through simulations, using synthetic mobility and human traces scenarios, we compare the performance of our solution against other two social-aware solutions, dLife and Bubble Rap, and the social-oblivious Spray and Wait, in order to show that the combination of social awareness and content knowledge can be beneficial when disseminating data in challenging networks

    On the Dynamics of Human Proximity for Data Diffusion in Ad-Hoc Networks

    Full text link
    We report on a data-driven investigation aimed at understanding the dynamics of message spreading in a real-world dynamical network of human proximity. We use data collected by means of a proximity-sensing network of wearable sensors that we deployed at three different social gatherings, simultaneously involving several hundred individuals. We simulate a message spreading process over the recorded proximity network, focusing on both the topological and the temporal properties. We show that by using an appropriate technique to deal with the temporal heterogeneity of proximity events, a universal statistical pattern emerges for the delivery times of messages, robust across all the data sets. Our results are useful to set constraints for generic processes of data dissemination, as well as to validate established models of human mobility and proximity that are frequently used to simulate realistic behaviors.Comment: A. Panisson et al., On the dynamics of human proximity for data diffusion in ad-hoc networks, Ad Hoc Netw. (2011

    Improving Delivery Probability in Mobile Opportunistic Networks with Social-Based Routing

    Get PDF
    There are contexts where TCP/IP is not suitable for performing data transmission due to long delays, timeouts, network partitioning, and interruptions. In these scenarios, mobile opportunistic networks (MONs) are a valid option, providing asynchronous transmissions in dynamic topologies. These architectures exploit physical encounters and persistent storage to communicate nodes that lack a continuous end-to-end path. In recent years, many routing algorithms have been based on social interactions. Smartphones and wearables are in vogue, applying social information to optimize paths between nodes. This work proposes Refine Social Broadcast (RSB), a social routing algorithm. RSB uses social behavior and node interests to refine the message broadcast in the network, improving the delivery probability while reducing redundant data duplication. The proposal combines the identification of the most influential nodes to carry the information toward the destination with interest-based routing. To evaluate the performance, RSB is applied to a simulated case of use based on a realistic loneliness detection methodology in elderly adults. The obtained delivery probability, latency, overhead, and hops are compared with the most popular social-based routers, namely, EpSoc, SimBet, and BubbleRap. RSB manifests a successful delivery probability, exceeding the second-best result (SimBet) by 17% and reducing the highest overhead (EpSoc) by 97%.info:eu-repo/semantics/publishedVersio

    A Neighborhood-Based Trust Protocol for Secure Collaborative Routing in Wireless Mobile D2D HetNets

    Get PDF
    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’ neighborhood 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 minimizing latency and mitigating the problem of malicious peers ( using packet dropping strategy)
    • …
    corecore