This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Data captured from a live cellular network with the real users during their common daily routine help to understand how the users move within the network. Unlike the simulations wi...
There exist distributed scenarios in which the need for dynamism, mobility, and adaptivity, has to be addressed with highly dynamical approaches. These scenarios present different ...
Currently, there is no existing method for automatically tracking the location of burrowing animals when they are underground, consequently zoologists only have a partial view of ...
Andrew Markham, Niki Trigoni, Stephen A. Ellwood, ...