This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
In this paper, Internet data collected via passive measurement are analyzed to obtain localization information on nodes by clustering (i.e., grouping together) nodes that exhibit s...
Elena Baralis, Andrea Bianco, Tania Cerquitelli, L...
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is present...
The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the...
Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints. Completely GPS free as well as GPS scarce positioning systems for ...