| dc.contributor.advisor | Fu, Xiaoming Prof. Dr. | |
| dc.contributor.author | Zhu, Konglin | |
| dc.date.accessioned | 2014-04-03T09:18:16Z | |
| dc.date.available | 2014-04-03T09:18:16Z | |
| dc.date.issued | 2014-04-03 | |
| dc.identifier.uri | http://hdl.handle.net/11858/00-1735-0000-0022-5E78-3 | |
| dc.identifier.uri | http://dx.doi.org/10.53846/goediss-4439 | |
| dc.language.iso | eng | de |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ | |
| dc.subject.ddc | 510 | de |
| dc.title | Social-Based Data Routing Strategies in Delay Tolerant Networks | de |
| dc.type | doctoralThesis | de |
| dc.contributor.referee | Fu, Xiaoming Prof. Dr. | |
| dc.date.examination | 2014-02-25 | |
| dc.description.abstracteng | Delay Tolerant networks (DTNs) are intermittently connected mobile networks in which the end-to-end paths do not exist. Data delivery in such networks relies upon the contacts that use "store-carry-and-forward" paradigm to forward message from one node to another. However, such intuitive methodology encounters low message delivery ratio and high data transmission delay when applying to different data routing strategies. The design of effective and efficient data routing strategies based on limited knowledge of mobile nodes in DTNs is challenging.
In this dissertation, we explore several aspects of social information that can be applied for data routing in DTNs. We discuss the problems of data routing in DTNs and study the using of different social information and network features to facilitate data routing in DTNs. Specifically, we propose three different data routing strategies relying on different types of social information obtained from mobile nodes: (a) a location-based social routing strategy applying different aspects of location-based social information; (b) an encounter-based social routing strategy relying on several encounter-based social factors of mobile nodes in the network; (c) a community-based routing strategy combining social and mobile factors as well as community structure.
The proposed location-based social routing strategy is motivated by the fact that location information can provide the geographic distance and the direction of information propagation, which can guide the data to the destination effectively. The proposed location-based social strategy considers both geographic distance and user mobility pattern as factors and combines them into one utility function for data forwarding.
We propose the encounter-based social routing strategy based on the fact that users in DTNs are interactively connected by encountering events. The design of encounter-based social strategy involves social centrality and social similarity. Compared to location-based social strategy, the usage of encounter-based social information is much less sensitive than location-based social information. By convoluting two social factors into utility function, the proposed algorithm can achieve competitive performance with location-based routing strategy.
The design of the community-based strategy is motivated by the observation that the mobility of people concentrates on a local area and the communication occurs in the form of communities. To apply such characteristics for elevating data routing performance in DTNs, we propose a Social and Mobile Aware Routing sTrategy (SMART). It exploits a distributed community partitioning algorithm to divide the DTN into communities regarding user locations and interaction routines. For intra-community communication, a decayed routing metric convoluting social similarity and social centrality is calculated, which is used to decide forwarding node efficiently while avoiding the newly identified blind spot and dead end problems. Meanwhile, to enable efficient inter-community communication, we choose the fringe nodes which travel remotely as relays, and propose the node-to-community utilities for routing decision across communities.
The major contribution of the thesis is to compose comprehensive routing metric to overcome the situation that is not addressed by using single routing metric, and then identify and tackle the blind spot and dead end problem, which are severe but not noticed in the existing studies. The proposed location-based strategy and encounter-based strategy are to construct comprehensively routing metric in geographic and encountering perspectives, and the proposed SMART is to tackle the blind spot and dead end problems.
Among all three strategies, the objective is to enhance the data delivery ratio, reduce the average delay and meanwhile maintain the low cost for data delivery. We present the simulation results regarding to the performance of the proposed routing strategies with the state-of-the-art data routing strategies in DTNs. By comprehensively consider multiple aspects of routing metrics, the proposed location-based and encounter-based routing strategies outperforms the previous studies around 10% in terms of different evaluation metrics. Through identifying and solve blind spot and dead end problems, the proposed SMART resolves both of them and thus outperforms previous studies over 20%. | de |
| dc.contributor.coReferee | Gerla, Mario Prof. Dr. | |
| dc.contributor.thirdReferee | Hogrefe, Dieter Prof. Dr. | |
| dc.contributor.thirdReferee | Grabowski, Jens Prof. Dr. | |
| dc.contributor.thirdReferee | Damm, Carsten Prof. Dr. | |
| dc.contributor.thirdReferee | Waack, Stephan Prof. Dr. | |
| dc.subject.eng | Social-based Data Routing | de |
| dc.subject.eng | Delay Tolerant Network | de |
| dc.subject.eng | Location-based Routing | de |
| dc.subject.eng | Encounter-based Routing | de |
| dc.subject.eng | Social and Mobile Aware Routing | de |
| dc.identifier.urn | urn:nbn:de:gbv:7-11858/00-1735-0000-0022-5E78-3-3 | |
| dc.affiliation.institute | Fakultät für Mathematik und Informatik | de |
| dc.subject.gokfull | Informatik (PPN619939052) | de |
| dc.identifier.ppn | 782353118 | |