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

DOI10.1016/J.JPDC.2007.12.006zbMATH Open1243.68056OpenAlexW2055078464MaRDI QIDQ436862FDOQ436862

Authors: Shashidhar Gandham, Milind Dawande, Ravi Prakash 

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

Recommendations

• Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
• Distributed \((\varDelta + 1)\)-coloring in the physical model
• Distance edge coloring and collision-free communication in wireless sensor networks
• Local Algorithms for Edge Colorings in UDGs
• Local algorithms for edge colorings in UDGs

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 algorithms (68W15) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• A constructive proof of Vizing's theorem
• Link scheduling in polynomial time
• Title not available (Why is that?)
• 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 (extended abstract)
• Multihop medium access control for WSNs: an energy analysis model
• 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
• Energy optimal data propagation in wireless sensor networks

Cited In (10)

• The backbone packet radio network coloring for time division multiple access link scheduling in wireless multihop networks
• Distributed colorings for collision-free routing in sink-centric sensor networks
• The minimum scheduling time for convergecast in wireless sensor networks
• Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
• Distributed edge coloration for bipartite networks
• Minimum multiplicity edge coloring via orientation
• Backbone colouring and algorithms for TDMA scheduling
• Local algorithms for edge colorings in UDGs
• Distance edge coloring and collision-free communication in wireless sensor networks
• Hypergraph-based data link layer scheduling for reliable packet delivery in wireless sensing and control networks with end-to-end delay constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436862)