Abstract
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 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 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.
Highlights
In multihop wireless networks, there are three major functions that all directly affect the network throughput
We have presented a distributed and cooperative link scheduling (DCLS) algorithm which is especially useful for large-scale multihop wireless networks
This algorithm partitions a set of links into several subsets of links, where the sparseness of each subset is controlled by the parameters K and λ
Summary
There are three major functions that all directly affect the network throughput. Cross-layer optimization over routing, link scheduling, and power control to achieve the best possible network throughput may be ideal but is extremely complex even for a network of only (for example) ten nodes. There has been very little work on distributed link scheduling algorithms besides random access protocols such as ALOHA [11], carrier sense multiple access (CSMA) as in IEEE 802.11 [12], mesh mode distributed scheduling (MSH-DSCH) as in IEEE 802.16 [13], and their variations These random access protocols do not provide a flexible control of the spacing between concurrent cochannel transmissions for multihop networks. The entire time frame for link schedule, power control, and data transmission needs to be smaller than the channel coherence time Such a condition should be first verified for each application in practice. The power saving may imply a reduced dynamic power range of transceivers, which is important to ensure that power amplifiers can be operated in the linear region
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
