In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
— We study by computer simulation a population of individuals playing the prisoner’s dilemma game. Each player has an invariable strategy (cooperate or defect) but the network ...
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan,...
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...