Link scheduling in wireless sensor networks: distributed edge-coloring revisited
type: Item
instance of: scholarly article
title: Link scheduling in wireless sensor networks: distributed edge-coloring revisited
zbMATH Open document ID: 1243.68056
author: Shashidhar Gandham
author: Milind Dawande
author: Ravi Prakash
published in: Journal of Parallel and Distributed Computing
publication date: 2012-07-26T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6059810
zbMATH Keywords: wireless sensor networks
zbMATH Keywords: distributed edge-coloring
zbMATH Keywords: link scheduling
MaRDI profile type: Publication
full work available at URL: j.jpdc.2007.12.006
OpenAlex ID: W2055078464
cites work: Q5668821
cites work: Nearly optimal distributed edge coloring in O(log log n) rounds
cites work: Link scheduling in polynomial time
cites work: Multihop medium access control for WSNs: an energy analysis model
cites work: Models and approximation algorithms for channel assignment in radio networks
cites work: An experimental study of a simple, distributed edge-coloring algorithm
cites work: A constructive proof of Vizing's theorem
cites work: Fast randomized algorithms for distributed edge coloring
cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
cites work: A routing algorithm for wireless ad hoc networks with unidirectional links
cites work: Energy optimal data propagation in wireless sensor networks
cites work: Q4319638
DOI: 10.1016/J.JPDC.2007.12.006
description: scientific article; zbMATH DE number 6059810