Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs

Authors:
André C. Pinho;Alexandre A. Santos;Daniel R. Figueiredo;Felipe M. França
Affiliations:
PESC/COPPE, Universidade Federal Rio de Janeiro, Rio de Janeiro, Brazil 21941-972 and Information Technology Division, Centro Tecnológico do Exército, Rio de Janeiro, Brazil 23020-470;PESC/COPPE, Universidade Federal Rio de Janeiro, Rio de Janeiro, Brazil 21941-972 and Information Technology Division, Centro Tecnológico do Exército, Rio de Janeiro, Brazil 23020-470;PESC/COPPE, Universidade Federal Rio de Janeiro, Rio de Janeiro, Brazil 21941-972;PESC/COPPE, Universidade Federal Rio de Janeiro, Rio de Janeiro, Brazil 21941-972
Venue:
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Year:
2009

Citing 9
Cited 1

Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A study of energy consumption and reliability in a multi-hop sensor network

ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
WaveScheduling: energy-efficient data dissemination for sensor networks

DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited

Journal of Parallel and Distributed Computing
Energy efficiency in wireless sensor networks using sleep mode TDMA scheduling

Ad Hoc Networks
Randomized generation of acyclic orientations upon anonymous distributed systems

Journal of Parallel and Distributed Computing
Self-stabilizing deterministic TDMA for sensor networks

ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
A survey on sensor networks

IEEE Communications Magazine
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

A distributed dynamics for webgraph decontamination

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most important problems for Wireless Sensor Networks (WSNs) is energy consumption since it ultimately determines the lifetime of the system. Medium Access Control (MAC) protocols based on schedules (e.g., TDMA) play an important role, since collisions and idle listening can be avoided, effectively reducing energy consumption. The problem of determining good transmission schedules for WSNs can be mapped to the distance-2 edge coloring problem in graphs, where edge colors represent slots in a TDMA-based MAC protocol, for example. In this paper, we propose and evaluate two new probabilistic and distributed distance-2 edge coloring algorithms that require no global node identifiers. We obtain analytical results for the worst-case convergence time. Moreover, we use simulations to evaluate the performance of the algorithms with respect to several metrics. Our findings indicate a tradeoff between convergence time and message overhead versus number of colors used.