论文信息 - Distributed Coloring Algorithm for Wireless Sensor Networks and Its Applications

Distributed Coloring Algorithm for Wireless Sensor Networks and Its Applications

In this paper, we propose a distributed coloring algorithm that is commonly applicable to many optimization problems to realize wireless sensor networks (WSNs). After describing the algorithm in detail, two applications, namely sensing function allocation and time-slot allocation in the time division multiple access (TDMA) communication, are introduced. The experimental results for the applications show that the proposed algorithm effectively solves the problems in the applications.

Toshiaki Miyazaki | Ryouhei Kawano

[1] Pravin Varaiya,et al. Scheduling Algorithms for Sensor Networks , 2005 .

[2] Yannis Kotidis,et al. Snapshot queries: towards data-centric sensor networks , 2005, 21st International Conference on Data Engineering (ICDE'05).

[3] Matt Welsh,et al. Decentralized, adaptive resource allocation for sensor networks , 2005, NSDI.

[4] Gaetano Borriello,et al. Next century challenges: data-centric networking for invisible computing: the Portolano project at the University of Washington , 1999, MobiCom.

[5] Ranjeet Kumar Patro,et al. Mobile agent based TDMA slot assignment algorithm for wireless sensor networks , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[6] Isabel Méndez-Díaz,et al. A Branch-and-Cut algorithm for graph coloring , 2006, Discret. Appl. Math..

[7] Stephen Fitzpatrick,et al. Soft, Real-Time, Distributed Graph Coloring using Decentralized, Synchronous, Stochastic, Iterative-Repair, Anytime Algorithms , 2001 .

[8] Makoto Yokoo,et al. The distributed breakout algorithms , 2005, Artif. Intell..

[9] Robin Thomas,et al. Efficiently four-coloring planar graphs , 1996, STOC '96.

[10] Injong Rhee,et al. Distributed scalable TDMA scheduling algorithm , 2004 .

[11] Wu Xiao-bei. Survey on sensor deployment problem in wireless sensor networks , 2008 .