Stochastic Geometric Distances in Multi-Hop Wireless Ad Hoc Networks
Buch in deiner Nähe kaufen
Beschreibung
This thesis provides a novel solution to the fundamental problem of establishing an analytical relationship between the number of hops required to reach a given distance under a certain routing policy in wireless ad hoc networks, both for linear and planar cases. In contrast to hop count distributions known to date, the expressions offered in this thesis are uniform, general, closed-form and mathematically tractable which partly owe to a self-imposed confinement to the case of connected networks, defined formally in stochastic-geometric terms. In order to demonstrate the applicability of the analytical expressions an optimized multi-hop localization algorithm is presented in which nodes need not to measure and disclose their mutual distances to perform position estimation.
This thesis provides a novel solution to the fundamental problem of establishing an analytical relationship between the number of hops required to reach a given distance under a certain routing policy in wireless ad hoc networks, both for linear and planar cases. In contrast to hop count distributions known to date, the expressions offered in this thesis are uniform, general, closed-form and mathematically tractable which partly owe to a self-imposed confinement to the case of connected networks, defined formally in stochastic-geometric terms. In order to demonstrate the applicability of the analytical expressions an optimized multi-hop localization algorithm is presented in which nodes need not to measure and disclose their mutual distances to perform position estimation.
Autor*in
Golaleh Oehlsen