loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)
Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm
March 25-March 28
ISBN: 978-0-7695-3096-3
ASCII Text
x 
 
Ryouhei Kawano, Toshiaki Miyazaki, "Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm," Advanced Information Networking and Applications Workshops, International Conference on, pp. 934-940, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/WAINA.2008.106,
author = {Ryouhei Kawano and Toshiaki Miyazaki},
title = {Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm},
journal ={Advanced Information Networking and Applications Workshops, International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3096-3},
pages = {934-940},
doi = {http://doi.ieeecomputersociety.org/10.1109/WAINA.2008.106},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications Workshops, International Conference on
TI - Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm
SN - 978-0-7695-3096-3
SP934
EP940
A1 - Ryouhei Kawano,
A1 - Toshiaki Miyazaki,
PY - 2008
KW - Graph Coloring
KW - Multi-sink Sensor Networks
KW - Data Aggregation
VL - 0
JA - Advanced Information Networking and Applications Workshops, International Conference on
ER -
 
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.
Index Terms:
Graph Coloring, Multi-sink Sensor Networks, Data Aggregation
Citation:
Ryouhei Kawano, Toshiaki Miyazaki, "Distributed Data Aggregation in Multi-sink Sensor Networks Using a Graph Coloring Algorithm," ainaw, pp.934-940, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.