Multi-level star is a widely adopted topology in many telecommunication systems, including wireless and wired networks. The optimization of this network topology, however, is not trivial, especially in the presence of obstacles. In this paper, we employ the well-known k-means clustering method but, instead of using a distance metric that neglects obstacles, we use the A* algorithm to find trajectories that allow circumventing obstacles. To assess the feasibility of the proposed approach, we apply it to 25 users arbitrarily located in a 20×20 uniform grid. This example indicates that by adopting A* to find obstacleaware trajectories, the mean distance between the users and their associated centroids is sensibly reduced.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.