Scheduling algorithms for multihop radio networks

Ramanathan, S.; Lloyd, Errol L.

doi:10.1109/90.222924

Cited by 420 publications

(246 citation statements)

References 18 publications

Supporting

Mentioning

242

Contrasting

Unclassified

Order By: Relevance

“…A variety of centralized and decentralized approximation algorithms have been proposed and their quality analyzed for this kind of model [14,20,24,31,32]. Most recently, Brar et al [5] present a scheduling method that is based on a greedy assignment of weighted colors.…”

Section: Related Workmentioning

confidence: 99%

Complexity in geometric SINR

Goussevskaia

Oswald

Wattenhofer

2007

Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing

347

363

View full text Add to dashboard Cite

In this paper we study the problem of scheduling wireless links in the geometric SIN R model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We present the first NP-completeness proofs in such a model. In particular, we prove two problems to be NP-complete: Scheduling and One-Shot Scheduling. The first problem consists in finding a minimum-length schedule for a given set of links. The second problem receives a weighted set of links as input and consists in finding a maximum-weight subset of links to be scheduled simultaneously in one shot. In addition to the complexity proofs, we devise an approximation algorithm for each problem.

show abstract

Section: Related Workmentioning

confidence: 99%

Complexity in geometric SINR

Goussevskaia

Oswald

Wattenhofer

2007

Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing

347

363

View full text Add to dashboard Cite

show abstract

“…We derive our results in this section under the Distance-2 edge interference model (D2-model) [25,26,21].…”

Section: Unicast Routingmentioning

confidence: 99%

“…In [28], it was shown that even in the case of UDGs, it is NP-hard to minimize the number of colors used in the D2-coloring. However, for many restricted graph classes such as UDGs, several centralized approximation algorithms exist which use within O(1) times the number of colors used by an optimal D2-coloring [28,19,26]. In this paper, we present the first distributed algorithm for D2-vertex coloring in UDGs with O(∆ log 2 n) running time and which uses at most O(1) times the number of colors used by an optimal D2-coloring.…”

Section: Related Workmentioning

confidence: 99%

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

Parthasarathy

Gandhi

2004

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

View full text Add to dashboard Cite

Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of Unit Disk Graphs which are known to realistically model wireless networks. Our distributed algorithms take into account the loss of messages due to contention from simultaneous interfering transmissions in the wireless medium. We present randomized distributed algorithms for (conflict-free) Distance-2 coloring, dominating set construction, and connected dominating set construction in Unit Disk Graphs. The coloring algorithm has a time complexity of O(∆ log 2 n) and is guaranteed to use at most O(1) times the number of colors required by the optimal algorithm. We present two distributed algorithms for constructing the (connected) dominating set; the former runs in time O(∆ log 2 n) and the latter runs in time O(log 2 n). The two algorithms differ in the amount of local topology information available to the network nodes. Our algorithms are geared at constructing Well Connected Dominating Sets (WCDS) which have certain powerful and useful structural properties such as low size, low stretch and low degree. In this work, we also explore the rich connections between WCDS and routing in ad hoc networks. Specifically, we combine the properties of WCDS with other ideas to obtain the following interesting applications:-An online distributed algorithm for collision-free, low latency, low redundancy and high throughput broadcasting. -Distributed capacity preserving backbones for unicast routing and scheduling.

show abstract

“…The optimal STDMA of clusters can be modeled as a vertex-coloring problem [27]. Consider a cluster-interfering graph G = (C, E), where C represents the set of clusters in the network and E is a diagonal and symmetric matrix of size |C|, whose elements represent the interfering relation between any two clusters in C. For an element e i,j ∈ E, e i,j = 1 if the CH in cluster j can receive the signal from any SN in cluster i or the CH in cluster i can receive the signal from any SN in cluster i.…”

Section: Vertex-coloring For Clustersmentioning

confidence: 99%

Energy-efficient power/rate control and scheduling in hybrid TDMA/CDMA wireless sensor networks

Shu

Krunz

2009

Computer Networks

View full text Add to dashboard Cite

We consider a hybrid TDMA/CDMA wireless sensor network (WSN) and quantitatively investigate the energy efficiency obtained by combining adaptive power/rate control with time-domain scheduling. The energy efficiency improvement is carried out with respect to interfering-cluster scheduling, intra-cluster node scheduling, and transmission powers and times (durations) control (PTC) for individual nodes. The interfering-cluster scheduling is formulated as a vertex-coloring problem, which can be solved efficiently using existing numerical algorithms in graph theory. For the node scheduling problem, we present a heuristic algorithm, which iteratively searches for the best schedule in such a way that the energy consumption keeps decreasing after every iteration. Compared with the exponentially complicated exhaustive search algorithm, this heuristic algorithm has polynomial computing complexity and can provide optimal solutions in the most simulated cases. For the transmission power/time control, two simplified PTC schemes, namely, PTC-UT and PTC-USG, are proposed and studied based on our previous optimization work PTC-IPT. We show that PTC-UT and PTC-USG provide comparable energy efficiency to PTC-IPT at only half of its complexity. Numerical examples are used to validate our findings.

show abstract

Scheduling algorithms for multihop radio networks

Cited by 420 publications

References 18 publications

Complexity in geometric SINR

Complexity in geometric SINR

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

Energy-efficient power/rate control and scheduling in hybrid TDMA/CDMA wireless sensor networks

Contact Info

Product

Resources

About