Title :
Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm
Author :
Kawano, Ryouhei ; Miyazaki, Toshiaki
Author_Institution :
Univ. of Aizu, Fukushima
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.
Keywords :
graph colouring; telecommunication network routing; time division multiple access; wireless sensor networks; distributed data aggregation; graph coloring algorithm; multiple sink nodes shortest path problem; multisink sensor networks; time division multiple access communication; wireless sensor networks; Application software; Computer science; Data engineering; Resource management; Sensor phenomena and characterization; Sensor systems; Shortest path problem; Spread spectrum communication; Time division multiple access; Wireless sensor networks; Data Aggregation; Graph Coloring; Multi-sink Sensor Networks;
Conference_Titel :
Advanced Information Networking and Applications - Workshops, 2008. AINAW 2008. 22nd International Conference on
Conference_Location :
Okinawa
Print_ISBN :
978-0-7695-3096-3
DOI :
10.1109/WAINA.2008.106
