Throughput scaling in wireless networks with restricted mobility

In this paper, an alternative model of restricted mobility by considering nodes confined to overlapping neighborhoods is presented. The throughput per source-destination (S-D) pair can be kept constant as the number of nodes increases. For arbitrary assignment of nodes to neighborhoods, achievable orders of throughput per S-D pair as a function of properties of the node locations and neighborhood dimensions is obtained. The succession of neighborhoods that a packet crosses from sender to destination is predetermined by a routing algorithm resulting from establishing a correspondence between the traffic pattern through the neighborhoods in the wireless network and a 2-D mesh network of processing units.