What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...