Link scheduling in wireless sensor networks: distributed edge-coloring revisited

DOI10.1016/j.jpdc.2007.12.006zbMath1243.68056OpenAlexW2055078464MaRDI QIDQ436862

Ravi Prakash, Shashidhar Gandham, Milind W. Dawande

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.12.006

zbMATH Keywords

wireless sensor networksdistributed edge-coloringlink scheduling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Distributed edge coloration for bipartite networks ⋮ Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ Minimum multiplicity edge coloring via orientation ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Local algorithms for edge colorings in UDGs ⋮ The minimum scheduling time for convergecast in wireless sensor networks

Cites Work

• Unnamed Item
• Unnamed Item
• Energy optimal data propagation in wireless sensor networks
• A constructive proof of Vizing's theorem
• Multihop medium access control for WSNs: an energy analysis model
• Link scheduling in polynomial time
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Nearly optimal distributed edge coloring in O(log log n) rounds
• Fast randomized algorithms for distributed edge coloring
• An experimental study of a simple, distributed edge-coloring algorithm
• Models and approximation algorithms for channel assignment in radio networks
• A routing algorithm for wireless ad hoc networks with unidirectional links

This page was built for publication: Link scheduling in wireless sensor networks: distributed edge-coloring revisited