Stability of selfish route selections in wireless ad hoc networks

The capacity region of ad hoc networks with optimal routing or scheduling has been investigated. Since distributed network control algorithms can be applied without the centralized information, the resulting network can be scalable. On the other hand, selfish nodes can severely degrade network performances, for example the network capacity. We attempt to analyze the obtained network capacity region based upon distributed route selection by using game theory. In addition to this, we attempt to analyze the joint effect of the adaptive route selection scheme and transmit power control. Simulation results reveal that transmit power control may increase the throughput achieved by the adaptive route selection scheme as well as the network capacity assuming centralized control.