Interconnection algorithms in multi-hop packet radio topologies

Consideration is given to a two-cluster system in multihop packet radio topologies. Each cluster deploys a limited sensing random-access algorithm and contains local users, who transmit their packets only via the algorithm in their own cluster. The system also contains marginal users, who may transmit their packets using either one of the algorithms in the two clusters. The author adopts a limited sensing random-access algorithm per cluster that has been previously studied. This algorithm utilizes binary, collision versus noncollision, feedback per slot, and in the presence of the limit Poisson user model and the absence of marginal users its throughput is 0.42. He considers a dynamic interconnection policy for the marginal users, and then studies the overall system performance in the presence of limit Poisson user populations. Specifically, the author studies the stability regions of the system and per packet expected delays. The interconnection policy accelerates the marginal users, presenting them with a significant delay advantage over the local users. This is desirable when the marginal users transmit high-priority data, for example.<>