Routing Protocols in Opportunistic Networks - A Survey

Opportunistic networks (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 a proper network infrastructure. OppNets are designed to operate in an en...

Full description

Saved in:
Bibliographic Details
Published inTechnical review - IETE Vol. 35; no. 4; pp. 369 - 387
Main Authors Alajeely, Majeed, Doss, Robin, Ahmad, Asma'a
Format Journal Article
LanguageEnglish
Published Taylor & Francis 04.07.2018
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Opportunistic networks (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 a proper network infrastructure. OppNets are designed to operate in an environment characterized by high delay, high error rate, intermittent connectivity, and non-availability of end-to-end route between the source and destination. OppNets use wireless technologies, such as IEEE 802.11, WiMAX, Bluetooth, and other short-range radio communication, and grow from a single node (seed) to become large networks by inviting new nodes (helpers) to join the network. Nodes have the ability to store and carry data and also forward it to other nodes in order to achieve different tasks. In OppNets, there is no end-to-end connection between the source and the destination nodes. Further, due to their inherent features, OppNets suffer from frequent partitions and long delays, while also being subject to serious security challenges. This survey includes an overview of the available OppNets routing protocols, their classification, and an evaluation of six routing protocols (Epidemic routing, PRoPHET, MaxProp, Spray and Wait, Direct Delivery, and First Contact) in terms of complexity/robustness and scalability. Detailed simulation results show that as the load on the network increases, the performance of protocols decrease in terms of delivery delay and network overhead. As for scalability, simulation results show that Epidemic routing and PRoPHET achieved high delivery rates, but with a very high network overhead. MaxProp and Spray and Wait achieved lower delivery rates, but with a low network overhead. First Contact and Direct Delivery achieved low delivery rates with high delivery delays. Results vary depending on the buffer size, contact times, and speed. The results indicate that trams have the capacity to carry and exchange information faster, and improve connectivity in OppNets.
AbstractList Opportunistic networks (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 a proper network infrastructure. OppNets are designed to operate in an environment characterized by high delay, high error rate, intermittent connectivity, and non-availability of end-to-end route between the source and destination. OppNets use wireless technologies, such as IEEE 802.11, WiMAX, Bluetooth, and other short-range radio communication, and grow from a single node (seed) to become large networks by inviting new nodes (helpers) to join the network. Nodes have the ability to store and carry data and also forward it to other nodes in order to achieve different tasks. In OppNets, there is no end-to-end connection between the source and the destination nodes. Further, due to their inherent features, OppNets suffer from frequent partitions and long delays, while also being subject to serious security challenges. This survey includes an overview of the available OppNets routing protocols, their classification, and an evaluation of six routing protocols (Epidemic routing, PRoPHET, MaxProp, Spray and Wait, Direct Delivery, and First Contact) in terms of complexity/robustness and scalability. Detailed simulation results show that as the load on the network increases, the performance of protocols decrease in terms of delivery delay and network overhead. As for scalability, simulation results show that Epidemic routing and PRoPHET achieved high delivery rates, but with a very high network overhead. MaxProp and Spray and Wait achieved lower delivery rates, but with a low network overhead. First Contact and Direct Delivery achieved low delivery rates with high delivery delays. Results vary depending on the buffer size, contact times, and speed. The results indicate that trams have the capacity to carry and exchange information faster, and improve connectivity in OppNets.
Author Alajeely, Majeed
Ahmad, Asma'a
Doss, Robin
Author_xml – sequence: 1
  givenname: Majeed
  orcidid: 0000-0001-9934-2868
  surname: Alajeely
  fullname: Alajeely, Majeed
  organization: School of Information Technology, Deakin University
– sequence: 2
  givenname: Robin
  surname: Doss
  fullname: Doss, Robin
  organization: School of Information Technology, Deakin University
– sequence: 3
  givenname: Asma'a
  surname: Ahmad
  fullname: Ahmad, Asma'a
  organization: School of Information Technology, Deakin University
BookMark eNqFkM1KAzEUhYNUsK0-gjAvMPUmM5PM4MZS_INixZ91yNwmEp0mJUmVvr1TWjcudHXP4nwH7jciA-edJuScwoRCDRfAKl5yYBMGVExoAWVdlEdkCI0o86oRdNDnvpPvSidkFOM7AC9ZRYeEP_lNsu4teww-efRdzKzLFuu1D2njbEwWswedvnz4iFmeTbPnTfjU21NybFQX9dnhjsnrzfXL7C6fL27vZ9N5jgWFlCO2XKhW10ZBKwzFphDAUQuoBS8UM2gqprARTVNzyuslAOMMebvEGkvOizG53O9i8DEGbSTapJL1LgVlO0lB7hTIHwVyp0AeFPR09YteB7tSYfsvd7XnrDM-rFT_fbeUSW07H0xQDm2Uxd8T30LZdDQ
CitedBy_id crossref_primary_10_32604_csse_2022_019557
crossref_primary_10_1109_TITS_2020_3044328
crossref_primary_10_3390_app12189240
crossref_primary_10_1016_j_dcan_2022_07_002
crossref_primary_10_3390_a11080119
crossref_primary_10_1145_3543146_3543173
crossref_primary_10_1016_j_eswa_2024_124527
crossref_primary_10_1080_02564602_2021_1929521
crossref_primary_10_1007_s12596_024_02290_2
crossref_primary_10_1080_02564602_2022_2049903
crossref_primary_10_1038_s41598_025_86608_5
crossref_primary_10_1155_2018_6462826
crossref_primary_10_1002_ett_4828
crossref_primary_10_3390_cryptography8010005
crossref_primary_10_1016_j_procs_2020_04_271
crossref_primary_10_1109_ACCESS_2021_3071309
crossref_primary_10_1155_2020_8505280
crossref_primary_10_1002_dac_5741
crossref_primary_10_3390_electronics14061187
crossref_primary_10_1016_j_procs_2022_04_054
Cites_doi 10.1145/605397.605408
10.5772/53997
10.1145/1282427.1282422
10.1145/1030194.1015484
10.1049/iet-com.2010.0422
10.1016/j.jnca.2011.05.005
10.1109/TMC.2008.107
10.1109/SURV.2012.042512.00053
10.1109/TNET.2002.801403
10.1109/TPDS.2008.218
10.1016/j.adhoc.2011.05.007
10.1109/TMC.2013.33
10.1109/TNET.2007.897962
10.1109/TNET.2007.897964
10.1145/961268.961272
10.1109/TVT.2015.2476703
10.1109/TMC.2007.1060
ContentType Journal Article
Copyright 2017 IETE 2017
Copyright_xml – notice: 2017 IETE 2017
DBID AAYXX
CITATION
DOI 10.1080/02564602.2017.1304834
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 0974-5971
EndPage 387
ExternalDocumentID 10_1080_02564602_2017_1304834
1304834
Genre Article
GroupedDBID .DC
0BK
0R~
29Q
2WC
30N
4.4
5GY
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGFS
ACTIO
ADCVX
ADGTB
AEISY
AENEX
AEYOC
AGDLA
AHDZW
AIDUJ
AIJEM
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
AWYRJ
BLEHA
CCCUG
DGEBU
DKSSO
DU5
E3Z
EAP
EBS
EJD
ESX
GTTXZ
H13
HZ~
IAO
IEA
IPNFZ
KYCEM
M4Z
M~E
O9-
P2P
RIG
RMW
RNANH
RNS
ROSJB
RTWRZ
SC5
SNACF
TAJZE
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TR2
TTHFI
TUROJ
ZGOLN
AAGDL
AAHIA
AAYXX
ADYSH
AFRVT
AIYEW
AMPGV
CITATION
ID FETCH-LOGICAL-c310t-ccb67abe8fa0b7f1c93706ce708763a2fcf52ac979986168d00262c6bdc8c4663
ISSN 0256-4602
IngestDate Thu Apr 24 23:09:50 EDT 2025
Tue Jul 01 03:59:19 EDT 2025
Wed Dec 25 09:09:27 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c310t-ccb67abe8fa0b7f1c93706ce708763a2fcf52ac979986168d00262c6bdc8c4663
ORCID 0000-0001-9934-2868
PageCount 19
ParticipantIDs informaworld_taylorfrancis_310_1080_02564602_2017_1304834
crossref_primary_10_1080_02564602_2017_1304834
crossref_citationtrail_10_1080_02564602_2017_1304834
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2018-07-04
PublicationDateYYYYMMDD 2018-07-04
PublicationDate_xml – month: 07
  year: 2018
  text: 2018-07-04
  day: 04
PublicationDecade 2010
PublicationTitle Technical review - IETE
PublicationYear 2018
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References cit0034
cit0032
cit0051
cit0052
Vahdat A. (cit0022) 2000
Chaintreau A. (cit0005) 2005
(cit0018) 2004
cit0019
Wood L. (cit0016) 2011
Spyropoulos T. (cit0023) 2004
Poonguzharselvi B. (cit0039) 2012
cit0017
cit0015
Keränen A. (cit0070) 2007
cit0038
Fall K. (cit0003) 2007
cit0013
cit0036
cit0058
cit0044
cit0020
cit0021
cit0043
cit0041
cit0060
Tang L. (cit0068) 2012; 8
Butler L. (cit0014) 1987
Liu Q. (cit0045) 2013; 10
cit0009
cit0004
cit0049
cit0002
cit0046
References_xml – ident: cit0009
  doi: 10.1145/605397.605408
– ident: cit0013
– ident: cit0052
  doi: 10.5772/53997
– ident: cit0060
  doi: 10.1145/1282427.1282422
– ident: cit0034
  doi: 10.1145/1030194.1015484
– ident: cit0017
– ident: cit0046
  doi: 10.1049/iet-com.2010.0422
– ident: cit0015
– ident: cit0044
  doi: 10.1016/j.jnca.2011.05.005
– volume-title: USAF Airborne Network Special Interest Group
  year: 2004
  ident: cit0018
– volume-title: Tech. Rep., CS-200006, Duke University
  year: 2000
  ident: cit0022
– ident: cit0038
  doi: 10.1109/TMC.2008.107
– volume: 10
  start-page: 621
  issue: 2
  year: 2013
  ident: cit0045
  publication-title: J. Comput. Inf. Sys.
– ident: cit0004
– ident: cit0021
  doi: 10.1109/SURV.2012.042512.00053
– start-page: 425
  year: 2012
  ident: cit0039
  publication-title: CS and IT-CSCP
– ident: cit0032
  doi: 10.1109/TNET.2002.801403
– volume-title: IETF RFC 4838
  year: 2007
  ident: cit0003
– volume-title: Amateur Radio
  year: 1987
  ident: cit0014
– ident: cit0043
  doi: 10.1109/TPDS.2008.218
– ident: cit0051
  doi: 10.1016/j.adhoc.2011.05.007
– volume-title: Tech. Rep., UCAM-CL-TR-617, University of Cambridge
  year: 2005
  ident: cit0005
– volume-title: Network Working Group, IETF
  year: 2011
  ident: cit0016
– ident: cit0049
  doi: 10.1109/TMC.2013.33
– volume: 8
  start-page: 5149
  issue: 12
  year: 2012
  ident: cit0068
  publication-title: J. Comput. Inf. Sys.
– ident: cit0036
  doi: 10.1109/TNET.2007.897962
– volume-title: Tech. Report, Helsinki University of Technology
  year: 2007
  ident: cit0070
– ident: cit0002
  doi: 10.1109/TNET.2007.897964
– ident: cit0058
  doi: 10.1145/961268.961272
– ident: cit0041
  doi: 10.1109/TVT.2015.2476703
– ident: cit0020
– ident: cit0019
  doi: 10.1109/TMC.2007.1060
– volume-title: Tech. Rep., CENG-2004-12, USC
  year: 2004
  ident: cit0023
SSID ssj0064251
Score 2.2477672
Snippet Opportunistic networks (OppNets) refer to a number of wireless nodes opportunistically communicating with each other in a form of "Store-Carry-Forward". This...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 369
SubjectTerms Complexity
DTN
OppNets
Opportunistic networks
Robustness
Routing protocols
Scalability
Title Routing Protocols in Opportunistic Networks - A Survey
URI https://www.tandfonline.com/doi/abs/10.1080/02564602.2017.1304834
Volume 35
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NbtQwELaW9gIHBG0RpYB86K1ylcRZOzlGULQg9Udiq1a9BNtxRFG7W22zHHriHXhDnoSZ2DEJVIVyiawotpPMeDwznvmGkG0EXMnHiWWiyiOWCp0zxXnFDDRNPTZSRpicvH8gJsfph9Px6Wj0qRe1tGz0rrm5Na_kf6gK94CumCV7D8qGQeEGtIG-cAUKw_WfaIzhPGjqHy3mzRwo2sa2Hl6hSo2n1IjFeuDCvK93uqgGDqLg43LxdXie23rYW3r5XBa2835vGrIUigv1xVpXlHofm1VQgH3V9TaPLDz--dJxTnF9CcqpVH3fQpy1cahpTwSBQgQEjJy8tN5xKFMGZkjcl6EOcsTzStoTiNwVYvF7K3eb6x9i28c5wmw4GQbcSSxTHRydA5js37avEFQYd2infpgShyn9MA_IagKGBEjC1WLy9uyk263B_GpLdIYv7bK8EH_9tvcZ6C8DdNueXjJ9Qh57g4IWjjuekpGdrZFHPZjJdZJ5PqGBT-j5jA74hHZ8Qn98-04L6jhkgxy_25u-mTBfMYMZUNMbZowWUmmb1SrSso4NKJ-RMFa2wIMqqWH5JcrgUW4mYpFVaIInRujKZLA6BX9GVmbzmX1OKOdc8lQKGWuV1pXReW54rqpxDSpkwtUmSbv_UBoPJ49VTS7KO-mwSXZDtyuHp_K3Dnn_J5dN68iqXdWZkt_Z98V9J9siD38tg5dkpVks7StQOhv92vPNT2HMc3A
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8MwDLZgHIADb8SbHOCY0TZt0h44TMC0MTaQGBK30qSthEAb2jrQ-Fn8Ff4QcR9oQwIOaAdukSpHbhzHdmJ_BjhAwBXPsSLKQ8-gNpceDRgLqdJDFTtKCAOLk5stXruxz2-d2yl4K2phMK0SY-g4A4pIz2pUbryMLlLijtBO2zytozIF9jPGG7E8sbIRDV902NY_rp9qGR9aVvWsfVKjeWcBqrQ7k1ClJBeBjNw4MKSITaWNtMFVJFKAtsCKNZtWoPDJy-Umd0MMVSzFZahc_Rec6XmnYcbxuEDdYkarOP21O5-2fEQWKfJYVA19x_aYPRxDSx2xc9VFeC9WKEtveSgPEllWr1_AI__XEi7BQu52k0qmJ8swFXVWYH4EjHEVOCZH6RG56nWTrtaPPrnvkMsnDFDwzV9TklaWNN8nlFTI9aD3HA3X4GYijK9DqdPtRBtAGGOC2YILUwZ2HCrpeYp5QejE2s2yWLAJdiFbX-WQ69j549E3C2TWXAw-isHPxbAJ5U-ypwxz5DcCb3Tj-El62RNnnVl89iPt1h9o92G21m5e-Bf1VmMb5vQnN81ktneglPQG0a721xK5lyoIgbtJb6cP0SU-tw
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8MwDLZ4SAgOvBHjmQMcM9qmS9oDh4kxAYOBBJN2K03aSAi0TVsHgn_FX-EXEfeBBhJwQDtwi1Q5cuM4thP7M8AeAq74FSemPPIt6nLp05CxiCozVLqihLCwOPmiyU9a7lm70p6A16IWBtMqMYbWGVBEelajcvciXWTEHaCZdnlaRmULbGeMF2J5XmUjfn4yUdvg8LRmRLzvOPXjm6MTmjcWoMp4MwlVSnIRytjToSWFtpWx0RZXsUjx2UJHGy6dUOGLl8dt7kUYqTiKy0h55ic4M_NOwjTHwk6sGrGaxeFvvPm04yOySJHHomjoO7Y_mcNPYKkjZq6-AG_FAmXZLfflYSLL6uULduS_WsFFmM-dblLNtGQJJuLOMsyNQDGuAMfUKDMiV_1u0jXaMSB3HXLZw_AEX_wNJWlmKfMDQkmVXA_7j_HzKrTGwvgaTHW6nXgdCGNMMFdwYcvQ1ZGSvq-YH0YVbZwsh4UlcAvRBioHXMe-Hw-BXeCy5mIIUAxBLoYSlD_IehniyG8E_ui-CZL0qkdnfVkC9iPtxh9od2HmqlYPzk-bjU2YNV-8NI3Z3YKppD-Mt42zlsidVD0I3I57N70DeT89Ww
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Routing+Protocols+in+Opportunistic+Networks+%E2%80%93+A+Survey&rft.jtitle=Technical+review+-+IETE&rft.au=Alajeely%2C+Majeed&rft.au=Doss%2C+Robin&rft.au=Ahmad%2C+Asma%27a&rft.date=2018-07-04&rft.issn=0256-4602&rft.eissn=0974-5971&rft.volume=35&rft.issue=4&rft.spage=369&rft.epage=387&rft_id=info:doi/10.1080%2F02564602.2017.1304834&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_02564602_2017_1304834
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0256-4602&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0256-4602&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0256-4602&client=summon