Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm

  • Authors:
  • Ryouhei Kawano;Toshiaki Miyazaki

  • Affiliations:
  • -;-

  • Venue:
  • AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
  • Year:
  • 2008

Quantified Score

Hi-index 0.02

Visualization

Abstract

In this paper, we propose an algorithm to minimize the multihop route from each sensor node to a sink node in wireless sensor networks with multiple sink nodes. In addition to solving the shortest path problem, the algorithm solves a time slot problem to support TDMA (time division multiple access) communication. TDMA is effective for avoiding packet collisions; however, the time slot allocation itself is a difficult problem to solve. We introduce a distributed coloring algorithm to solve it. After describing the algorithm, some experimental results proving its effectiveness are presented.