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

POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India

Author

Listed:
  • Rahul Johari
  • Neelima Gupta
  • Sandhya Aneja

Abstract

We explore the application of partitioned network for providing health services in difficult terrain where fixed communication infrastructure is not cost-effective due to low population density and very high cost of setting up a permanent infrastructure. We propose a hybrid routing which is persistent, on-demand, scheduled, opportunistic, and predicted (POSOP) routing algorithm, that exploits various types of contacts existing in a partitioned, hybrid, and sparse network. Such networks may be used to provide guidance from specialist doctors to junior doctors working in primary health centres. We present a scenario from Uttarakhand (a state in hilly region of North India), where POSOP routing algorithm may be used to provide improved health services. Using simulations, we evaluate the performance of POSOP routing algorithm on three metrics, messages delivered, average delay suffered by the delivered messages, and average message traffic. We compare the performance of POSOP routing algorithm with two routing schemes, namely, epidemic and spray and wait on the three metrics. Our approach outperforms both the routing schemes.

Suggested Citation

  • Rahul Johari & Neelima Gupta & Sandhya Aneja, 2015. "POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India," International Journal of Distributed Sensor Networks, , vol. 11(6), pages 376861-3768, June.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:376861
    DOI: 10.1155/2015/376861
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/376861
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/376861?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:11:y:2015:i:6:p:376861. 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.