An adaptive scheduling scheme for inhomogeneously distributed wireless ad hoc networks

Abstract

An efficient scheduling strategy guarantees the simultaneous transmission and successful reception by thescheduled nodes even inside a congested wireless ad hoc network. Owing to the dispersed nature of ad hoc networks, thenode packing algorithm needs to be implementable without having network-wide channel state information and shouldadditionally be able to pack the optimum number of successful transmissions. The proposed algorithm, for a networkwith nonhomogeneously distributed nodes, makes the decision to either inhibit or permit an active interferer around anactive receiver based on the interferer’s transmission power. The analysis evidenced that the suggested scheme providesan estimated 100 times superior transmission capacity when equated to the random aloha scheme. Moreover, theproposed strategy proved its vitality by demonstrating substantial improvement in transmission and transport capacityin comparison to the preexisting renowned scheduling schemes for distributed networks. The final results present aclosed-form formula for the best possible exclusion-zone size multiplier factor in terms of the network parameters, i.e.the network’s path-loss exponent, spreading gain, SINR threshold, outage constraint, and Tx-Rx separation.