IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v17y2021i9p15501477211041272.html
   My bibliography  Save this article

Activity-based routing algorithm in opportunistic mobile social networks

Author

Listed:
  • Sheng Zhang
  • Houzhong Liu
  • Caisen Chen
  • Zhaojun Shi
  • William Wei Song

Abstract

In opportunistic mobile social networks, nodes are clustered according to their interests or hobbies and take part in different activities regularly. We delve into the temporal and spatial mobility characteristics of network nodes and put forward an activity-based message opportunistic forwarding algorithm. The main idea of the algorithm is that we choose different message forwarding methods according to the situation of nodes participating in activities. If the source node and the destination node are both attend in the same activities, we select the best relay node which has the biggest delivery probability. While the source node and the destination node are not in the same activities at the same time, we need to find the optimal path which owns highest indirect delivery probability, and messages will be transmitted through the optimal path. The simulation results show that the proposed routing algorithm can not only improve the successful delivery ratio of messages but also reduce the network delay and the network overhead obviously, in comparison with the classical opportunistic routing algorithms, such as community-aware message opportunistic transmission algorithm, community-based message transmission scheme algorithm, PRoPHET, Epidemic algorithm, and interest characteristic probability prediction algorithm.

Suggested Citation

  • Sheng Zhang & Houzhong Liu & Caisen Chen & Zhaojun Shi & William Wei Song, 2021. "Activity-based routing algorithm in opportunistic mobile social networks," International Journal of Distributed Sensor Networks, , vol. 17(9), pages 15501477211, September.
    • Handle: RePEc:sae:intdis:v:17:y:2021:i:9:p:15501477211041272
    DOI: 10.1177/15501477211041272
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501477211041272
    Download Restriction: no
    File URL: https://libkey.io/10.1177/15501477211041272?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:17:y:2021:i:9:p:15501477211041272. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.