The networking paradigm uses new information vectors consisting of human carried devices is known as disruption-tolerant networks (DTN) or opportunistic networks. We identify the binary assertion issue in DTN. We notice how most DTNs mainly analyze nodes that are in contact. So all nodes that are not in contact are in intercontact. Nevertheless, when two nodes are not in contact, this does not mean that they are topologically far away from one another. We propose a formal definition of vicinities in DTNs and study the new resulting contact/intercontact temporal characterization. Then, we examine the internal organization of vicinities using the Vicinity Motion framework. We highlight movement types such as birth, death, and sequential moves. We analyze a number of their characteristics and extract vicinity usage directions for mobile networks. Based on the vicinity motion outputs and extracted directions, we build the TiGeR that simulates how pairs of nodes interact within their vicinities. Finally, we inquire about the possibilities of vicinity movement prediction in opportunistic networks. We expose a Vicinity Motion-based heuristic for pairwise shortest distance forecasting. We use two Vicinity Motion variants called AVM and SVM to collect vicinity information. We find that both heuristics perform quite well with performances up to 99% for SVM and around 40% for AVM.
| Identifer | oai:union.ndltd.org:CCSD/oai:tel.archives-ouvertes.fr:tel-00957864 |
| Date | 23 January 2014 |
| Creators | Phe-Neau, Tiphaine |
| Publisher | Université Pierre et Marie Curie - Paris VI |
| Source Sets | CCSD theses-EN-ligne, France |
| Language | English |
| Detected Language | English |
| Type | PhD thesis |
Page generated in 0.0019 seconds