000104126 001__ 104126
000104126 005__ 20180501105903.0
000104126 0247_ $$2doi$$a10.5075/epfl-thesis-3836
000104126 02470 $$2urn$$aurn:nbn:ch:bel-epfl-thesis3836-2
000104126 02471 $$2nebis$$a5361736
000104126 037__ $$aTHESIS_LIB
000104126 041__ $$aeng
000104126 088__ $$a3836
000104126 245__ $$aModeling and predicting mobility in wireless ad hoc networks
000104126 269__ $$a2007
000104126 260__ $$aLausanne$$bEPFL$$c2007
000104126 300__ $$a236
000104126 336__ $$aTheses
000104126 502__ $$aHannes Hartenstein, Jean-Yves Le Boudec, Mario Gerla
000104126 520__ $$aWireless Ad Hoc Networks are a particular paradigm where wireless devices communicate in a decentralized fashion, without any centralized infrastructure or decision. In order to avoid a situation where nodes chaotically try to communicate, distributed and localized structures (graphs, trees, etc.) need to be built. Mobility brings challenging issues to the maintenance and to the optimality of such structures. In conventional approaches, structures are adapted to the current topology by each node periodically sending beacon messages, which is a significant waste of network resources. If each node can obtain some a priori knowledge of future topology configurations, it could decide to send maintenance messages only when a change in the topology effectively requires updating the structure. In this Doctoral Thesis, we investigate this approach and define the Kinetic Graphs, a novel paradigm regrouping mobility predictions for a kinetic mobility management, and localized and distributed graph protocols to insure a high scalability. The Kinetic Graph framework is able to naturally capture the dynamics of mobile structures, and is composed of four steps: (i) a representation of the trajectories, (ii) a common message format for the posting of those trajectories, (iii) a time varying weight for building the kinetic structures, (iv) an aperiodic neighborhood maintenance. By following this framework, we show that any structure-based ad-hoc protocol may benefit from the kinetic approach. A significant challenge of Kinetic Graphs comes from prediction errors. In order to analyze them, we illustrate the relationship between the prediction model and the mobility model. We decompose the prediction errors into three metrics: the adequacy between the prediction and the mobility models, the predicability of the mobility model, and the mobility model's realism. Following the framework, we define a kinetic model for the modeling of the trajectories and then analyze the extents of the effects of each error metric and develop solutions in order to reduce them. We finally adapt the Multipoint Relaying (MPR) protocol, used by the Optimized Link State Routing protocol (OLSR), and show the significant improvements that may be obtained by using the Kinetic Graph Framework, even on the very challenging vehicular networks.
000104126 6531_ $$aKinetic graphs
000104126 6531_ $$amobility management
000104126 6531_ $$amobility modeling
000104126 6531_ $$amobility predictions
000104126 6531_ $$amultipoint relays (MPR)
000104126 6531_ $$aoptimized link state routing (OLSR)
000104126 6531_ $$abroadcasting
000104126 6531_ $$arouting
000104126 6531_ $$awireless ad hoc networks
000104126 6531_ $$avehicular networks
000104126 6531_ $$aGraphe Cinétique
000104126 6531_ $$agestion de mobilité
000104126 6531_ $$amodélisation de mobilité
000104126 6531_ $$aprédiction de mobilité
000104126 6531_ $$arelais multipoint (MPR)
000104126 6531_ $$aOLSR
000104126 6531_ $$adiffusion
000104126 6531_ $$aroutage
000104126 6531_ $$aréseaux ad-hoc sans fil
000104126 6531_ $$aréseaux véhiculaires
000104126 700__ $$0(EPFLAUTH)114078$$aHärri, Jérôme$$g114078
000104126 720_2 $$aBonnet, Christian$$edir.
000104126 8564_ $$s6231655$$uhttps://infoscience.epfl.ch/record/104126/files/EPFL_TH3836.pdf$$yTexte intégral / Full text$$zTexte intégral / Full text
000104126 909CO $$ooai:infoscience.epfl.ch:104126$$pthesis-bn2018$$pDOI2$$pDOI$$pthesis
000104126 918__ $$aIC$$bIC-SSC$$cEURECOM
000104126 920__ $$a2007-6-22$$b2007
000104126 970__ $$a3836/THESES
000104126 973__ $$aEPFL$$sPUBLISHED
000104126 980__ $$aTHESIS