Distributed data aggregation in multi-sink sensor networks using a graph coloring algorithm

Proceedings - International Conference on Advanced Information Networking and Applications, AINA

Volumn , Issue , 2008, Pages 934-940

  Kawano, Ryouhei ^a   Miyazaki, Toshiaki ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AGGLOMERATION; AIR TRAFFIC CONTROL; ALGORITHMS; CELLULAR TELEPHONE SYSTEMS; COLORING; COMMUNICATION; ROUTING ALGORITHMS; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION EQUIPMENT; TIME DIVISION MULTIPLE ACCESS; WIRELESS TELECOMMUNICATION SYSTEMS;

COLORING ALGORITHMS; DISTRIBUTED DATA; GRAPH COLORINGS; INFORMATION NETWORKING; INTERNATIONAL CONFERENCES; MULTI-HOP ROUTING; MULTIPLE ACCESS; PACKET COLLISIONS; SENSOR NODE; SHORTEST PATH PROBLEM; SINK NODES; TIME DIVISION; TIME SLOT; TIME SLOT ALLOCATION;

WIRELESS SENSOR NETWORKS;

EID: 50249163726     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WAINA.2008.106     Document Type: Conference Paper

References (17)

1. B. Krishnamachari, D. Estrin, and S. Wicker, "Impact of Data Aggregation in Wireless Sensor Networks," Proc. DEBS'02, pp 575-578, July 2002.
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. A. Das and D. Dutta, "Data Acquisition in Multiple Sink Sensor Networks," Proc. 2nd International Conference on Embedded Sensor Systems, pp. 271-272, November 2004.
5. W.Ye, J.Heidemann and D.Estrin, "An Energy-Efficient MAC Protocol for Wireless Sensor Networks," Proc. IEEE Infocom, vol. 3, pp. 1567 - 1576, 2002.
6. G. Mainland, D.C. Parkes, and M. Welsh, "Decentralized, Adaptive Resource Allocation for Sensor Networks," Proc. NSDI2005, pp. 315-328, 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," Proc. ACM/IEEE MOBICOM'99, pp. 256-262, 1999.
9. Y. Kotidis, "Snapshot Queries: Towards Data-centric Sensor Networks," Proc. IEEE ICDE'05, pp. 131-142, 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.
12. R. Kawano, and T. Miyazaki, "Distributed Coloring Algorithm for Wireless Sensor Networks and Its Applications," Proc. 7th IEEE International Conference on Computer and Information Technology (CIT2007), Oct. 2007.
13. P. Ciciriello and L. Mottola: "Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks," Proc. 4th European Conference on Wireless Sensor Networks (EWSN 2007), pp. 36-50, January 2007.
14. E. I. Oyman and C. Ersoy: "Multiple sink network design problem in large scale wireless sensor networks," Proc. International Conference on Communications, vol. 6, pp. 3663 - 3667, June 2004.
15. P.Bahl and V.Padmanabhan, "RADAR: AN In-Building RF-Based User Location and Racking System," Proc. IEEE Infocom, 2000.
16. N.B. Priyantha, A.K.L. Miu, H. Balakrishnan, and S. Teller, "The Cricket Compass for Context-aware Mobile Applications," Proc. ACM/IEEE Mobicom, July 2001.
17. S. Gandham, M. Dawande, and R. Prakash, "Link Scheduling in Sensor Networks: Distributed Edge Coloring Revisited", IEEE INFOCOM, 2005, vol. 4, pp 2492-2501, March 2005.