Improving the connectivity of community detection-based hierarchical routing protocols in large-scale wsns

The recent growth in the use of wireless sensor networks (WSNs) in many applications leads to the raise of a core infrastructure for communication and data gathering in Cyber-Physical Systems (CPS). The communication strategy in most of the WSNs relies on hierarchical clustering routing protocols due to their ad hoc nature. In the bulk of the existing approaches some special nodes, named Cluster-Heads (CHs), have the task of assembling clusters and intermediate the communication between the cluster members and a central entity in the network, the Sink. Therefore, the overall efficiency of such protocols is highly dependent on the even distribution of CHs in the network. Recently, a community detection-based approach, named RLP, have shown interesting results with respect to the CH distribution and availability that potentially increases the overall WSN efficiency. Despite the better results of RLP regarding the literature, the adopted CH election algorithm may lead to a CH shortage throughout the network operation. In line with that, in this paper, we introduce an improved version of RLP, named HRLP. Our proposal includes a hybrid CH election algorithm which relies on a computationally cheap and distributed probabilistic-based CH recovery procedure to improve the network connectivity. Additionally, we provide a performance analysis of HRLP and its comparison to other protocols by considering a large-scale WSN scenario. The results evince the improvements achieved by the proposed strategy by means of the network connectivity and lifetime metrics. (C) 2016 The Authors. Published by Elsevier B.V.Federal University of São Paulo, Avenida Cesare Mansueto Giulio Lattes, 1201, Parque Tecnológico, 12247014, São José dos Campos-SP-BrazilFederal University of São Paulo, Avenida Cesare Mansueto Giulio Lattes, 1201, Parque Tecnológico, 12247014, São José dos Campos-SP-BrazilWeb of Scienc

Community detection by consensus genetic-based algorithm for directed networks

Finding communities in networks is a commonly used form of network analysis. There is a myriad of community detection algorithms in the literature to perform this task. In spite of that, the number of community detection algorithms in directed networks is much lower than in undirected networks. However, evaluation measures to estimate the quality of communities in undirected networks nowadays have its adaptation to directed networks as, for example, the well-known modularity measure. This paper introduces a genetic-based consensus clustering to detect communities in directed networks with the directed modularity as the fitness function. Consensus strategies involve combining computational models to improve the quality of solutions generated by a single model. The reason behind the development of a consensus strategy relies on the fact that recent studies indicate that the modularity may fail in detecting expected clusterings. Computational experiments with artificial LFR networks show that the proposed method was very competitive in comparison to existing strategies in the literature. (C) 2016 The Authors. Published by Elsevier B.V.Instituto de Ciência e Tecnologia, Universidade Federal de São Paulo (UNIFESP) Av. Cesare M. G. Lattes, 1201, Eugênio de Mello, São José dos Campos-SP, CEP: 12247-014, BrasilInstituto de Ciência e Tecnologia, Universidade Federal de São Paulo (UNIFESP) Av. Cesare M. G. Lattes, 1201, Eugênio de Mello, São José dos Campos-SP, CEP: 12247-014, BrasilWeb of Scienc