Construction of Small Worlds in the Physical Topology of Wireless Networks

The concept of small worlds is introduced into the physical topology of wireless networks in this work. A. Helmy provided two con- struction schemes of small worlds for the wireless networks, link rewiring and link addition, but he mainly focused on the virtual topology. Based on the broadcasting nature of the radio transmission, we propose a con- struction scheme of small worlds for the physical topology of Multiple- Input Multiple-Output (MIMO) wireless networks. Besides the topology- related topics, we also evaluate the reduction of the power required by a request

Efficiency of Emergent Constraint Satisfaction in Small-world and Random Agent Networks

In this paper, we study the efficiency of emergent constraint satisfaction in small-world and random agent networks. We find that emergent constraint satisfaction in a small-world network is less efficient than in some other networks (e.g., regular networks). Further, we find that this finding holds in almost all random networks. Based on these observations, we study the relationship between the efficiency of emergent constraint satisfaction and the randomness of the corresponding network from which the constraint satisfaction problem is generated