01533nas a2200241   4500000000100000000000100001008004100002260001200043653001100055653001200066653001500078653001500093653001200108100002400120700004000144700002600184245006400210856009800274300001000372490000600382520088900388022001401277       2016                            d  c06/201610aMethod10aNetwork10aClustering10aAlgorithms10aRouting1 aS J Bolaños-Castro1 aGiovanny Mauricio Tarazona-Bermudez1 aJohn Petearson Anzola00aDesign Methodology for Self-organized Mobile Networks Based  uhttp://www.ijimai.org/journal/sites/default/files/files/2016/05/ijimai20163_7_7_pdf_10406.pdf  a46-530 v33 aThe methodology proposed in this article enables a systematic design of routing algorithms based on schemes of biclustering, which allows you to respond with timely techniques, clustering heuristics proposed by a researcher, and a focused approach to routing in the choice of clusterhead nodes. This process uses heuristics aimed at improving the different costs in communication surface groups called biclusters. This methodology globally enables a variety of techniques and heuristics of clustering that have been addressed in routing algorithms, but we have not explored all possible alternatives and their different assessments. Therefore, the methodology oriented design research of routing algorithms based on biclustering schemes will allow new concepts of evolutionary routing along with the ability to adapt the topological changes that occur in self-organized data networks.  a1989-1660