Distance edge coloring and collision-free communication in wireless sensor networks

DOI10.1002/NET.21491MaRDI QIDQ5326804zbMATH OpenOpenAlexFDO

Authors Kaouther Drira, Hamida Seba, Brice Effantin, H. Kheddouci

Publication date 6 August 2013

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21491

zbMATH Keywords

distance edge coloringgridshypercubeslink schedulingpower graphssensor networks

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing and Combinatorics
• Algorithms for finding distance-edge-colorings of graphs
• Link scheduling in wireless sensor networks: distributed edge-coloring revisited
• Local algorithms for edge colorings in UDGs
• Local Algorithms for Edge Colorings in UDGs

Cites work

• L(2,1)-labelling of generalized prisms
• Algorithms for finding distance-edge-colorings of graphs
• Chromatic graph theory
• Distance edge coloring of the Kronecker product of some graphs
• Labelling Graphs with a Condition at Distance 2
• Link scheduling in polynomial time
• Link scheduling in wireless sensor networks: distributed edge-coloring revisited
• Local structures in plane maps and distance colourings
• Nearly optimal distributed edge coloring in O(log log n) rounds
• On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
• On distance edge-colourings and matchings
• Radio labelings of graphs
• Radio number for trees
• Some complexity results about packet radio networks (Corresp.)
• Some maximum multigraphs and adge/vertex distance colourings
• The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
• The local nature of \(\Delta\)-coloring and its algorithmic applications

Cited in

(4)

• Link scheduling in wireless sensor networks: distributed edge-coloring revisited
• Distributed colorings for collision-free routing in sink-centric sensor networks
• Eigenvalue bounds for distance-edge colourings
• Edge coloring of multigraphs with very high multiplicities

This page was built for publication: Distance edge coloring and collision-free communication in wireless sensor networks

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