Topology clustering, constructing overlay graphs, adding relay nodes, or creating a “small-world” network by building some shortcuts etc, topology control schemes are able to achieve the scalability, resilience, and fault-tolerance for wireless communication networks. In this article, we take a different approach to reach such aim for heterogeneous integrated wireless networks by generating a topology such that the resulting network is “scale-free”. Thereby we propose a topology control algorithm based on the “scale-free” complex network concept and directed proximity graph theory for integrated wireless networks with non-uniform transmission ranges. In this algorithm, the topology is also generated by new nodes’ growth and preferential attachment procedure, but where each new node connects to the existing nodes in its directed attachable proximity in terms of certain probability at each time step. Each node’s directed attachable proximity graph is generated from its directed reachable proximity graph that is built by regulating its transmission power based on locally collected information. The simulation experiments are provided to validate our claims.
A realistic mobility model for wireless networks of scale-free node connectivity