Distributed coloring algorithm for wireless sensor networks and its applications

CIT 2007: 7th IEEE International Conference on Computer and Information Technology

Volumn , Issue , 2007, Pages 997-1002

  Kawano, Ryouhei ^a   Miyazaki, Toshiaki ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING; TIME DIVISION MULTIPLE ACCESS; WIRELESS SENSOR NETWORKS;

DISTRIBUTED COLORING ALGORITHM; SENSING FUNCTION ALLOCATION;

ALGORITHMS;

EID: 38049064927     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIT.2007.4385215     Document Type: Conference Paper

References (11)

1. S. Fitzpatrick and L. Meertens, "Soft, Real-time, Distributed Graph Coloring using Decentralized, Synchronous, Stochastic, Iterative-Repair, Anytime Algorithms: A Framework", Technical Report KES.U.01.05, May 2001.
2. P. Rentala, R. Musunuri, S. Gandham, and U. Saxena, "Survey on Sensor Networks", Technical Report, UTDCS-33-02, University of Texas at Dallas, 2002.
3. S.C. Ergen and P. Varaiya, "TDMA Scheduling Algorithms for Sensor Networks", Technical Report, Department of Electrical Engineering and Computer Sciences University of California, Berkeley, July 2005.
4. I. Rhee and J. Lee "Distributed Scalable TDMA Scheduling Algorithm" Technical Report 20044-14, North Carolina State University, 2004.
5. R. K. Patro, and B.Mohan, "Mobile Agent Based TDMA Slot Assignment Algorithm for Wireless Sensor Networks", IEEE Computer Society, 2005.
6. G. Mainland, D.C. Parkes, and M. Welsh, "Decentralized, Adaptive Resource Allocation for Sensor Networks", NSDI2005, May 2005.
7. K. Hirayama, and M. Yokoo, "The Distributed Breakout Algorithm", Artificial Intelligence Journal, vol.161, No. 1-2, pp.89-116, 2005.
8. M. Elser, J. Hightower, T Anderson, and G. Borriello, "Next Century Challenges: Data-Centric Networking for Invisible Computing", ACM/IEEE Proc. MOBICOM' 99, pp. 256-262, 1999.
9. Y. Kotidis, "Snapshot Queries: Towards Data-centric Sensor Networks," IEEE Proc. ICDE'05, April 2005.
10. N. Robertson, and P. Seymour, "Efficiently four-coloring planar graphs", Annual ACM Symposium on Theory of Computing, pp 571-575, 1996.
11. P. Zabala, "A branch-and-cut algorithm for graph coloring", Discrete Applied Mathematics, pp. 826-847, 2006.