Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Blog Article

A distributed and cooperative link-scheduling (DCLS) algorithm is introduced for large-scale multihop wireless networks.With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots.This schedule is whole wheat phyllo dough such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other.The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame.Following the DCLS algorithm, a distributed and cooperative power control (DCPC) algorithm can be applied to each subnetwork to ensure a desired data rate for each link here with minimum network transmission power.

As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings.The power savings also imply an increased feasible region of averaged link data rates for the entire network.