• DocumentCode
    678928
  • Title

    Comparative study of routing protocols for opportunistic networks

  • Author

    Alajeely, Majeed ; Ahmad, Ayaz ; Doss, Robin

  • Author_Institution
    Sch. of Inf. Technol., Deakin Univ., Melbourne, VIC, Australia
  • fYear
    2013
  • fDate
    3-5 Dec. 2013
  • Firstpage
    209
  • Lastpage
    214
  • Abstract
    Opportunistic networks or OppNets refer to a number of wireless nodes opportunistically communicating with each other in a form of “Store-Carry-Forward”. This occurs when they come into contact with each other without proper network infrastructure. In OppNets there is no end-to-end connection between the source node and the destination node. OppNets grow from a single node (seed) to become large networks by inviting new nodes (helpers) to join the network. Due to these characteristics, OppNets are subject to real routing challenges. In this paper, we have presented an overview of the main available three families of OppNet routing protocols. Further, we have evaluated one protocol from each family (Epidemic, Direct Delivery and PRoPHET) in terms of complexity and scalability. Simulation results show that for small and medium complexity, the three protocols perform better than large complexity. As for scalability, simulation results show that Epidemic and PRoPHET perform better than Direct Delivery in terms of delivery rates and delays, but at a very high cost while Direct Delivery achieved lower delivery rates with a low cost.
  • Keywords
    routing protocols; Direct Delivery protocol; Epidemic protocol; OppNet routing protocols; PRoPHET protocol; opportunistic networks; store-carry-forward communication; wireless nodes; Complexity theory; Delays; Peer-to-peer computing; Routing; Routing protocols; Vectors; Complexity; Opportunistic Networks; Routing Protocols; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sensing Technology (ICST), 2013 Seventh International Conference on
  • Conference_Location
    Wellington
  • ISSN
    2156-8065
  • Print_ISBN
    978-1-4673-5220-8
  • Type

    conf

  • DOI
    10.1109/ICSensT.2013.6727644
  • Filename
    6727644