2007
DOI: 10.1155/2007/34716
|View full text |Cite
|
Sign up to set email alerts
|

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

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 separate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…If the number of users is large and multi-hop transmissions are necessary, the problem is complex and needs to be treated separately. Related works on this subject include [30]- [33]. But the focus here is on a single-hop multi-user wireless network, where every user is within a single transmission range of any other user.…”
Section: B Multi-user Casementioning
confidence: 99%
“…If the number of users is large and multi-hop transmissions are necessary, the problem is complex and needs to be treated separately. Related works on this subject include [30]- [33]. But the focus here is on a single-hop multi-user wireless network, where every user is within a single transmission range of any other user.…”
Section: B Multi-user Casementioning
confidence: 99%
“…The principle of D-SAM differs from that of a distributed and cooperative link scheduling (DCLS) algorithm shown in [21]. The former is based on the distance information of neighboring nodes.…”
Section: Throughputmentioning
confidence: 99%
“…In link scheduling, the links between the nodes are scheduled, such that a transmission from a node is intended for a particular neighbor, and should be received free of collisions by the intended destination. Examples of broadcast scheduling is presented in [73,74,95,124,131,133,176,181,219,239] whereas link scheduling examples have been studied in [75,88,104,121,128,212,278].…”
Section: Tdma Schedulingmentioning
confidence: 99%