| dc.date.accessioned |
2014-10-27T10:12:05Z |
und |
| dc.date.accessioned |
2017-10-24T12:23:54Z |
|
| dc.date.available |
2014-10-27T10:12:05Z |
und |
| dc.date.available |
2017-10-24T12:23:54Z |
|
| dc.date.issued |
2014-10-27T10:12:05Z |
|
| dc.identifier.uri |
http://radr.hulib.helsinki.fi/handle/10138.1/4239 |
und |
| dc.identifier.uri |
http://hdl.handle.net/10138.1/4239 |
|
| dc.title |
Information search in mobile opportunistic networks : extensions to seeker assisted search |
en |
| ethesis.department.URI |
http://data.hulib.helsinki.fi/id/225405e8-3362-4197-a7fd-6e7b79e52d14 |
|
| ethesis.department |
Institutionen för datavetenskap |
sv |
| ethesis.department |
Department of Computer Science |
en |
| ethesis.department |
Tietojenkäsittelytieteen laitos |
fi |
| ethesis.faculty |
Matematisk-naturvetenskapliga fakulteten |
sv |
| ethesis.faculty |
Matemaattis-luonnontieteellinen tiedekunta |
fi |
| ethesis.faculty |
Faculty of Science |
en |
| ethesis.faculty.URI |
http://data.hulib.helsinki.fi/id/8d59209f-6614-4edd-9744-1ebdaf1d13ca |
|
| ethesis.university.URI |
http://data.hulib.helsinki.fi/id/50ae46d8-7ba9-4821-877c-c994c78b0d97 |
|
| ethesis.university |
Helsingfors universitet |
sv |
| ethesis.university |
University of Helsinki |
en |
| ethesis.university |
Helsingin yliopisto |
fi |
| dct.creator |
Chen, Yiping |
|
| dct.issued |
2014 |
|
| dct.language.ISO639-2 |
eng |
|
| dct.abstract |
The purpose of this thesis is to elaborate how to implement Search-assisted Search (SAS) scheme on the ONE simulator and analyze whether it has better performance compared with other protocols (such as, Spray and Wait Routing Protocol). SAS is a search scheme that is designed for Delay- tolerant networks (DTN). The main characteristic of DTN is intermittent connectivity. There are two popular routing protocols, called Epidemic Routing Protocol and Spray and Wait Routing Protocol. Epidemic Routing Protocol is the one that floods an unlimited number of messages towards the desired destination. On the other hand, Spray and Wait Routing Protocol sprays a limited number of messages and delivers them to several nodes. When those nodes with a copy of the message encounter the desired destination, they will inform the one which initializes the search that the destination has been found. To improve search performance, SAS has several new properties: improvement of the number of contents' carriers and community. SAS contains the benefit of Spray and Wait scheme, which sprays a limited number of messages to the encountered nodes. This method accelerates the searching node to locate the content. However, only depending on spraying a number of messages is not enough. SAS increases the number of nodes carrying contents. Theoretically, this design improves the probability of locating the desired content. For making implementation of SAS on the ONE simulator easier, I involve a concept of geo-community. Geo-community represents the nodes having the similar interest are gathered together within geographical community. |
en |
| dct.language |
en |
|
| ethesis.language.URI |
http://data.hulib.helsinki.fi/id/languages/eng |
|
| ethesis.language |
English |
en |
| ethesis.language |
englanti |
fi |
| ethesis.language |
engelska |
sv |
| ethesis.thesistype |
pro gradu-avhandlingar |
sv |
| ethesis.thesistype |
pro gradu -tutkielmat |
fi |
| ethesis.thesistype |
master's thesis |
en |
| ethesis.thesistype.URI |
http://data.hulib.helsinki.fi/id/thesistypes/mastersthesis |
|
| ethesis.degreeprogram |
Networking and Service |
en |
| dct.identifier.urn |
URN:NBN:fi-fe2017112251002 |
|
| dc.type.dcmitype |
Text |
|
