An intermittently connected network (ICN) is defined as a mobile network that
uses cooperation between nodes to facilitate communication. This cooperation consists
of nodes carrying messages from other nodes to help deliver them to their destinations.
An ICN does not require an infrastructure and routing information is not
retained by the nodes. While this may be a useful environment for message dissemination, it creates routing challenges. In particular, providing satisfactory delivery
performance while keeping the overhead low is difficult with no network infrastructure
or routing information. This dissertation explores solutions that lead to a high
delivery probability while maintaining a low overhead ratio. The efficiency of message
fragmentation in ICNs is first examined. Next, the performance of the routing
is investigated when erasure coding and network coding are employed in ICNs. Finally,
the use of social networking in ICNs to achieve high routing performance is
considered.
The aim of this work is to improve the better delivery probability while maintaining
a low overhead ratio. Message fragmentation is shown to improve the CDF of
the message delivery probability compared to existing methods. The use of erasure
coding in an ICN further improve this CDF. Finally, the use of network coding was
examined. The advantage of network coding over message replication is quantified in terms of the message delivery probability. Results are presented which show that
network coding can improve the delivery probability compared to using just message
replication. / Graduate / 0544 / 0984 / ahmedbdr@engr.uvic.ca
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/5711 |
| Date | 23 October 2014 |
| Creators | Altamimi, Ahmed B. |
| Contributors | Gulliver, T. Aaron |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web, http://creativecommons.org/licenses/by-nc-nd/2.5/ca/ |
Page generated in 0.0019 seconds