Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...
Compute-and-forward (CF) is a technique which exploits broadcast and superposition in wireless networks. In this paper, the CF energy benefit is studied for networks with unicast sessions and modeled by connected graphs. This benefit is defined as the rati ...
This thesis deals with the application of electromagnetic time reversal to locating transient disturbance sources and the use of the asymptotic theory for the modelling of their interaction with transmission lines. We demonstrate that the time-of-arrival, ...
OBJECTIVE Body mass index (BMI) may cluster in space among adults and be spatially dependent. Whether and how BMI clusters evolve over time in a population is currently unknown. We aimed to determine the spatial dependence of BMI and its 5-year evolution i ...
The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed ...
