Efficient Routing using Bubble Rap in Delay Tolerant Network Article Swipe
Patel Jaimini
,
R. B. Patel
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.5120/ijca2016908716
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.5120/ijca2016908716
Intermittently connected mobile ad-hoc networks are kind of wireless networks where end to end connectivity unlikely exists.Routing in such environment is carried out through the store-carry-forward mechanism.Thus, message delivery relies on node"s mobility, their contact opportunities and contact patterns.Intermittently connected mobile ad-hoc networks can be viewed as dynamic graph, where mobile nodes are vertices and contact between nodes are edges.Such graph constantly evolves as node"s connection, disconnection and reconnection and reveals the dynamic behaviour of the network.Detecting and dealing with congestion in delay tolerant networks is an important and challenging problem.Current DTN forwarding algorithms typically direct traffic towards particular nodes in order to maximize delivery ratios and minimize delays, but as traffic demands increase these nodes may become unusable.In this thesis we attempted to improve BUBBLE RAP algorithm performance by using congestion control, forwarded message exchange and message priority update mechanism.We proposed Congestion Control algorithm (CCA) to reduce the congestion occurring on highly social nodes and to improve the forwarding efficiency significantly compared to oblivious forwarding schemes.In CCA algorithm, the congestion level of node and message priority are utilized to construct a Congestion Metric (CM).In the forwarding process, the concept of message forwarding to lower CM valued nodes is added together with the BUBBLE RAP strategy to improve the delivery probability as well as together with that a try to reduce the congestion by dropping the messages over nodes having low centrality links with destination is also made.
Related Topics
Concepts
Computer science
Computer network
Network congestion
Wireless ad hoc network
Delay-tolerant networking
Distributed computing
Mobile ad hoc network
Node (physics)
Routing (electronic design automation)
Routing protocol
Wireless
Optimized Link State Routing Protocol
Network packet
Telecommunications
Engineering
Structural engineering
Metadata
- Type
- article
- Language
- en
- Landing Page
- http://doi.org/10.5120/ijca2016908716
- https://doi.org/10.5120/ijca2016908716
- OA Status
- bronze
- Cited By
- 2
- References
- 11
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2328820229
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2328820229Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.5120/ijca2016908716Digital Object Identifier
- Title
-
Efficient Routing using Bubble Rap in Delay Tolerant NetworkWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2016Year of publication
- Publication date
-
2016-03-17Full publication date if available
- Authors
-
Patel Jaimini, R. B. PatelList of authors in order
- Landing page
-
https://doi.org/10.5120/ijca2016908716Publisher landing page
- PDF URL
-
https://doi.org/10.5120/ijca2016908716Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
bronzeOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.5120/ijca2016908716Direct OA link when available
- Concepts
-
Computer science, Computer network, Network congestion, Wireless ad hoc network, Delay-tolerant networking, Distributed computing, Mobile ad hoc network, Node (physics), Routing (electronic design automation), Routing protocol, Wireless, Optimized Link State Routing Protocol, Network packet, Telecommunications, Engineering, Structural engineeringTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 1, 2018: 1Per-year citation counts (last 5 years)
- References (count)
-
11Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2328820229 |
|---|---|
| doi | https://doi.org/10.5120/ijca2016908716 |
| ids.doi | https://doi.org/10.5120/ijca2016908716 |
| ids.mag | 2328820229 |
| ids.openalex | https://openalex.org/W2328820229 |
| fwci | 0.29853518 |
| type | article |
| title | Efficient Routing using Bubble Rap in Delay Tolerant Network |
| biblio.issue | 5 |
| biblio.volume | 137 |
| biblio.last_page | 19 |
| biblio.first_page | 16 |
| topics[0].id | https://openalex.org/T11896 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Opportunistic and Delay-Tolerant Networks |
| topics[1].id | https://openalex.org/T11478 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9891999959945679 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Caching and Content Delivery |
| topics[2].id | https://openalex.org/T10246 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9797000288963318 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Mobile Ad Hoc Networks |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.8749085068702698 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C31258907 |
| concepts[1].level | 1 |
| concepts[1].score | 0.8251335024833679 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[1].display_name | Computer network |
| concepts[2].id | https://openalex.org/C195563490 |
| concepts[2].level | 3 |
| concepts[2].score | 0.593743622303009 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q180368 |
| concepts[2].display_name | Network congestion |
| concepts[3].id | https://openalex.org/C94523657 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5619816780090332 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q4085781 |
| concepts[3].display_name | Wireless ad hoc network |
| concepts[4].id | https://openalex.org/C53264328 |
| concepts[4].level | 5 |
| concepts[4].score | 0.5326240658760071 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q55320 |
| concepts[4].display_name | Delay-tolerant networking |
| concepts[5].id | https://openalex.org/C120314980 |
| concepts[5].level | 1 |
| concepts[5].score | 0.47013410925865173 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[5].display_name | Distributed computing |
| concepts[6].id | https://openalex.org/C91280400 |
| concepts[6].level | 3 |
| concepts[6].score | 0.4517469108104706 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q4085781 |
| concepts[6].display_name | Mobile ad hoc network |
| concepts[7].id | https://openalex.org/C62611344 |
| concepts[7].level | 2 |
| concepts[7].score | 0.44380900263786316 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1062658 |
| concepts[7].display_name | Node (physics) |
| concepts[8].id | https://openalex.org/C74172769 |
| concepts[8].level | 2 |
| concepts[8].score | 0.375749409198761 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[8].display_name | Routing (electronic design automation) |
| concepts[9].id | https://openalex.org/C104954878 |
| concepts[9].level | 3 |
| concepts[9].score | 0.28650933504104614 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1648707 |
| concepts[9].display_name | Routing protocol |
| concepts[10].id | https://openalex.org/C555944384 |
| concepts[10].level | 2 |
| concepts[10].score | 0.2609866261482239 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q249 |
| concepts[10].display_name | Wireless |
| concepts[11].id | https://openalex.org/C204739117 |
| concepts[11].level | 4 |
| concepts[11].score | 0.22219538688659668 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q1368373 |
| concepts[11].display_name | Optimized Link State Routing Protocol |
| concepts[12].id | https://openalex.org/C158379750 |
| concepts[12].level | 2 |
| concepts[12].score | 0.2167322337627411 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q214111 |
| concepts[12].display_name | Network packet |
| concepts[13].id | https://openalex.org/C76155785 |
| concepts[13].level | 1 |
| concepts[13].score | 0.08230292797088623 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[13].display_name | Telecommunications |
| concepts[14].id | https://openalex.org/C127413603 |
| concepts[14].level | 0 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[14].display_name | Engineering |
| concepts[15].id | https://openalex.org/C66938386 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q633538 |
| concepts[15].display_name | Structural engineering |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.8749085068702698 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/computer-network |
| keywords[1].score | 0.8251335024833679 |
| keywords[1].display_name | Computer network |
| keywords[2].id | https://openalex.org/keywords/network-congestion |
| keywords[2].score | 0.593743622303009 |
| keywords[2].display_name | Network congestion |
| keywords[3].id | https://openalex.org/keywords/wireless-ad-hoc-network |
| keywords[3].score | 0.5619816780090332 |
| keywords[3].display_name | Wireless ad hoc network |
| keywords[4].id | https://openalex.org/keywords/delay-tolerant-networking |
| keywords[4].score | 0.5326240658760071 |
| keywords[4].display_name | Delay-tolerant networking |
| keywords[5].id | https://openalex.org/keywords/distributed-computing |
| keywords[5].score | 0.47013410925865173 |
| keywords[5].display_name | Distributed computing |
| keywords[6].id | https://openalex.org/keywords/mobile-ad-hoc-network |
| keywords[6].score | 0.4517469108104706 |
| keywords[6].display_name | Mobile ad hoc network |
| keywords[7].id | https://openalex.org/keywords/node |
| keywords[7].score | 0.44380900263786316 |
| keywords[7].display_name | Node (physics) |
| keywords[8].id | https://openalex.org/keywords/routing |
| keywords[8].score | 0.375749409198761 |
| keywords[8].display_name | Routing (electronic design automation) |
| keywords[9].id | https://openalex.org/keywords/routing-protocol |
| keywords[9].score | 0.28650933504104614 |
| keywords[9].display_name | Routing protocol |
| keywords[10].id | https://openalex.org/keywords/wireless |
| keywords[10].score | 0.2609866261482239 |
| keywords[10].display_name | Wireless |
| keywords[11].id | https://openalex.org/keywords/optimized-link-state-routing-protocol |
| keywords[11].score | 0.22219538688659668 |
| keywords[11].display_name | Optimized Link State Routing Protocol |
| keywords[12].id | https://openalex.org/keywords/network-packet |
| keywords[12].score | 0.2167322337627411 |
| keywords[12].display_name | Network packet |
| keywords[13].id | https://openalex.org/keywords/telecommunications |
| keywords[13].score | 0.08230292797088623 |
| keywords[13].display_name | Telecommunications |
| language | en |
| locations[0].id | doi:10.5120/ijca2016908716 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210206007 |
| locations[0].source.issn | 0975-8887 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0975-8887 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | International Journal of Computer Applications |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | |
| locations[0].pdf_url | https://doi.org/10.5120/ijca2016908716 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | International Journal of Computer Applications |
| locations[0].landing_page_url | http://doi.org/10.5120/ijca2016908716 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5068481840 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Patel Jaimini |
| authorships[0].affiliations[0].raw_affiliation_string | Department of computer Engg. SPCE college, Visnagar GTU ,Gujarat ,India |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Patel Jaimini |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of computer Engg. SPCE college, Visnagar GTU ,Gujarat ,India |
| authorships[1].author.id | https://openalex.org/A5060221158 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-9983-028X |
| authorships[1].author.display_name | R. B. Patel |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Computer Engg SPCE college Engg Visnagar GTU, Gujarat , India |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Rajan Patel |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Computer Engg SPCE college Engg Visnagar GTU, Gujarat , India |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.5120/ijca2016908716 |
| open_access.oa_status | bronze |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Efficient Routing using Bubble Rap in Delay Tolerant Network |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11896 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Opportunistic and Delay-Tolerant Networks |
| related_works | https://openalex.org/W3035283282, https://openalex.org/W2768875466, https://openalex.org/W1591014886, https://openalex.org/W2551975114, https://openalex.org/W2025838880, https://openalex.org/W1511473871, https://openalex.org/W1581687089, https://openalex.org/W2003275014, https://openalex.org/W2083846791, https://openalex.org/W1932298562 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2018 |
| counts_by_year[1].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.5120/ijca2016908716 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210206007 |
| best_oa_location.source.issn | 0975-8887 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 0975-8887 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | International Journal of Computer Applications |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://doi.org/10.5120/ijca2016908716 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | International Journal of Computer Applications |
| best_oa_location.landing_page_url | http://doi.org/10.5120/ijca2016908716 |
| primary_location.id | doi:10.5120/ijca2016908716 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210206007 |
| primary_location.source.issn | 0975-8887 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0975-8887 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | International Journal of Computer Applications |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | |
| primary_location.pdf_url | https://doi.org/10.5120/ijca2016908716 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | International Journal of Computer Applications |
| primary_location.landing_page_url | http://doi.org/10.5120/ijca2016908716 |
| publication_date | 2016-03-17 |
| publication_year | 2016 |
| referenced_works | https://openalex.org/W2112316694, https://openalex.org/W2097625638, https://openalex.org/W1965396227, https://openalex.org/W2082674813, https://openalex.org/W2039157284, https://openalex.org/W1968213983, https://openalex.org/W2123030505, https://openalex.org/W54883737, https://openalex.org/W2498871114, https://openalex.org/W4234068324, https://openalex.org/W2161750835 |
| referenced_works_count | 11 |
| abstract_inverted_index.a | 181, 217 |
| abstract_inverted_index.CM | 195 |
| abstract_inverted_index.an | 86 |
| abstract_inverted_index.as | 46, 63, 110, 211, 213 |
| abstract_inverted_index.be | 44 |
| abstract_inverted_index.by | 129, 223 |
| abstract_inverted_index.in | 17, 81, 100 |
| abstract_inverted_index.is | 20, 85, 198, 235 |
| abstract_inverted_index.of | 7, 74, 172, 190 |
| abstract_inverted_index.on | 30, 151 |
| abstract_inverted_index.to | 12, 102, 123, 146, 156, 163, 179, 193, 206, 219 |
| abstract_inverted_index.we | 121 |
| abstract_inverted_index.CCA | 167 |
| abstract_inverted_index.DTN | 91 |
| abstract_inverted_index.RAP | 126, 204 |
| abstract_inverted_index.and | 36, 54, 67, 69, 77, 88, 106, 136, 155, 174 |
| abstract_inverted_index.are | 5, 52, 58, 177 |
| abstract_inverted_index.but | 109 |
| abstract_inverted_index.can | 43 |
| abstract_inverted_index.end | 11, 13 |
| abstract_inverted_index.low | 230 |
| abstract_inverted_index.may | 116 |
| abstract_inverted_index.out | 22 |
| abstract_inverted_index.the | 24, 71, 75, 148, 158, 169, 185, 188, 202, 208, 221, 225 |
| abstract_inverted_index.try | 218 |
| abstract_inverted_index.also | 236 |
| abstract_inverted_index.kind | 6 |
| abstract_inverted_index.node | 173 |
| abstract_inverted_index.over | 227 |
| abstract_inverted_index.such | 18 |
| abstract_inverted_index.that | 216 |
| abstract_inverted_index.this | 119 |
| abstract_inverted_index.well | 212 |
| abstract_inverted_index.with | 79, 201, 215, 233 |
| abstract_inverted_index.(CCA) | 145 |
| abstract_inverted_index.added | 199 |
| abstract_inverted_index.delay | 82 |
| abstract_inverted_index.graph | 60 |
| abstract_inverted_index.level | 171 |
| abstract_inverted_index.links | 232 |
| abstract_inverted_index.lower | 194 |
| abstract_inverted_index.made. | 237 |
| abstract_inverted_index.nodes | 51, 57, 99, 115, 154, 197, 228 |
| abstract_inverted_index.order | 101 |
| abstract_inverted_index.their | 33 |
| abstract_inverted_index.these | 114 |
| abstract_inverted_index.using | 130 |
| abstract_inverted_index.where | 10, 49 |
| abstract_inverted_index.BUBBLE | 125, 203 |
| abstract_inverted_index.Metric | 183 |
| abstract_inverted_index.ad-hoc | 3, 41 |
| abstract_inverted_index.become | 117 |
| abstract_inverted_index.direct | 95 |
| abstract_inverted_index.graph, | 48 |
| abstract_inverted_index.having | 229 |
| abstract_inverted_index.highly | 152 |
| abstract_inverted_index.mobile | 2, 40, 50 |
| abstract_inverted_index.node"s | 31, 64 |
| abstract_inverted_index.ratios | 105 |
| abstract_inverted_index.reduce | 147, 220 |
| abstract_inverted_index.relies | 29 |
| abstract_inverted_index.social | 153 |
| abstract_inverted_index.thesis | 120 |
| abstract_inverted_index.update | 139 |
| abstract_inverted_index.valued | 196 |
| abstract_inverted_index.viewed | 45 |
| abstract_inverted_index.(CM).In | 184 |
| abstract_inverted_index.Control | 143 |
| abstract_inverted_index.between | 56 |
| abstract_inverted_index.carried | 21 |
| abstract_inverted_index.concept | 189 |
| abstract_inverted_index.contact | 34, 37, 55 |
| abstract_inverted_index.dealing | 78 |
| abstract_inverted_index.delays, | 108 |
| abstract_inverted_index.demands | 112 |
| abstract_inverted_index.dynamic | 47, 72 |
| abstract_inverted_index.evolves | 62 |
| abstract_inverted_index.improve | 124, 157, 207 |
| abstract_inverted_index.message | 27, 134, 137, 175, 191 |
| abstract_inverted_index.reveals | 70 |
| abstract_inverted_index.through | 23 |
| abstract_inverted_index.towards | 97 |
| abstract_inverted_index.traffic | 96, 111 |
| abstract_inverted_index.compared | 162 |
| abstract_inverted_index.control, | 132 |
| abstract_inverted_index.delivery | 28, 104, 209 |
| abstract_inverted_index.dropping | 224 |
| abstract_inverted_index.exchange | 135 |
| abstract_inverted_index.increase | 113 |
| abstract_inverted_index.maximize | 103 |
| abstract_inverted_index.messages | 226 |
| abstract_inverted_index.minimize | 107 |
| abstract_inverted_index.networks | 4, 9, 42, 84 |
| abstract_inverted_index.priority | 138, 176 |
| abstract_inverted_index.process, | 187 |
| abstract_inverted_index.proposed | 141 |
| abstract_inverted_index.strategy | 205 |
| abstract_inverted_index.together | 200, 214 |
| abstract_inverted_index.tolerant | 83 |
| abstract_inverted_index.unlikely | 15 |
| abstract_inverted_index.utilized | 178 |
| abstract_inverted_index.vertices | 53 |
| abstract_inverted_index.wireless | 8 |
| abstract_inverted_index.algorithm | 127, 144 |
| abstract_inverted_index.attempted | 122 |
| abstract_inverted_index.behaviour | 73 |
| abstract_inverted_index.connected | 1, 39 |
| abstract_inverted_index.construct | 180 |
| abstract_inverted_index.forwarded | 133 |
| abstract_inverted_index.important | 87 |
| abstract_inverted_index.mobility, | 32 |
| abstract_inverted_index.oblivious | 164 |
| abstract_inverted_index.occurring | 150 |
| abstract_inverted_index.typically | 94 |
| abstract_inverted_index.Congestion | 142, 182 |
| abstract_inverted_index.algorithm, | 168 |
| abstract_inverted_index.algorithms | 93 |
| abstract_inverted_index.centrality | 231 |
| abstract_inverted_index.congestion | 80, 131, 149, 170, 222 |
| abstract_inverted_index.constantly | 61 |
| abstract_inverted_index.edges.Such | 59 |
| abstract_inverted_index.efficiency | 160 |
| abstract_inverted_index.forwarding | 92, 159, 165, 186, 192 |
| abstract_inverted_index.particular | 98 |
| abstract_inverted_index.schemes.In | 166 |
| abstract_inverted_index.challenging | 89 |
| abstract_inverted_index.connection, | 65 |
| abstract_inverted_index.destination | 234 |
| abstract_inverted_index.environment | 19 |
| abstract_inverted_index.performance | 128 |
| abstract_inverted_index.probability | 210 |
| abstract_inverted_index.unusable.In | 118 |
| abstract_inverted_index.connectivity | 14 |
| abstract_inverted_index.mechanism.We | 140 |
| abstract_inverted_index.reconnection | 68 |
| abstract_inverted_index.disconnection | 66 |
| abstract_inverted_index.opportunities | 35 |
| abstract_inverted_index.significantly | 161 |
| abstract_inverted_index.Intermittently | 0 |
| abstract_inverted_index.exists.Routing | 16 |
| abstract_inverted_index.mechanism.Thus, | 26 |
| abstract_inverted_index.problem.Current | 90 |
| abstract_inverted_index.network.Detecting | 76 |
| abstract_inverted_index.store-carry-forward | 25 |
| abstract_inverted_index.patterns.Intermittently | 38 |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.63644529 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |