Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On Resilience Challenges in Opportunistic Networks
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In opportunistic networks, due to node mobility and sporadic connectivity, disconnection and network partitioning are prevalent. Nonetheless, the network resilience against such sporadic connectivity can be provided through adapting store-carry-and-forward-based  routing protocols which exploit users’ mobility to flow the data in the network even in the absence of end-to-end connectivity. Opportunistic networks, however, are exposed to some other challenges such as jamming attacks or buffer limitations which limit the usage of node contacts or node behavior. The main objective of this thesis is to understand the impact of these challenges on the resilience of the network. The challenges are applied in different network topologies using different forwarding protocols.

Generally, we find that store-carry-and-forward  routing, by exploiting diversity in space-time paths, provides a high degree of resilience in the network, which depends on the network topology. The network resilience is maintained as long as significant number of nodes or node contacts are not affected. In the case of jamming, the studied routing protocols behave similarly with the exception of spray and wait routing which for some messages results in delay improvement while intensifying the challenge. For limited buffer sizes, spray and wait again shows different behavior in the low-traffic network where the average delay of delivered messages improves much more significantly compared to the other studied routing protocols, though with increasing the buffer size many more messages get delivered.

Place, publisher, year, edition, pages
2012.
Series
IT ; 12 044
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:uu:diva-182168OAI: oai:DiVA.org:uu-182168DiVA, id: diva2:558631
Educational program
Master Programme in Computer Science
Uppsok
Technology
Supervisors
Examiners
Available from: 2012-10-04 Created: 2012-10-04 Last updated: 2012-10-04Bibliographically approved

Open Access in DiVA

fulltext(692 kB)493 downloads
File information
File name FULLTEXT01.pdfFile size 692 kBChecksum SHA-512
609453600deb9eb95ee5ab7249240588657dc40e1fba07551baedfafa2fcc6c9e6bf9857b90852631cebdd9118582aec219443f7573266e70af72d3a8d7f542b
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 493 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 471 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf