naa a22 4500 510799086 CHVBK 20180411083347.0 cr unu---uuuuu 180411e20130901xx s 000 0 eng 10.1007/s11277-013-1052-9 doi (NATIONALLICENCE)springer-10.1007/s11277-013-1052-9 A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks [Elektronische Daten] [Hui Kang, Ya-nan Zhao, Fang Mei] Wireless sensor networks should provide with valuable service, which is called service-oriented requirement. To meet this need, a novel distributed graph coloring based time division multiple access scheduling algorithm (GCSA), considering real-time performance for clustering-based sensor network, is proposed in this paper, to determine the smallest length of conflict-free assignment of timeslots for intra-cluster transmissions. GCSA involves two phases. In coloring phase, networks are modeled using graph theory, and a distributed vertex coloring algorithm, which is a distance-2 coloring algorithm and can get colors near to $$(\updelta +1)$$ , is proposed to assign a color to each node in the network. Then, in scheduling phase, each independent set is mapped to a unique timeslot according to the set's priority which is obtained by considering network structure. The experimental results indicate that GCSA can significantly decrease intra-cluster delay and increase intra-cluster throughput, which satisfies real-time performance as well as communication reliability. Springer Science+Business Media New York, 2013 TDMA nationallicence Distributed nationallicence Graph coloring nationallicence Clustering nationallicence Real-time nationallicence Kang Hui College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, 130012, Changchun, Jilin, China aut Zhao Ya-nan College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, 130012, Changchun, Jilin, China aut Mei Fang College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, 130012, Changchun, Jilin, China aut Wireless Personal Communications Springer US; http://www.springer-ny.com 72/2(2013-09-01), 1005-1022 0929-6212 72:2<1005 2013 72 11277 https://doi.org/10.1007/s11277-013-1052-9 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11277-013-1052-9 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Kang Hui College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, 130012, Changchun, Jilin, China aut NATIONALLICENCE 700 1- Zhao Ya-nan College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, 130012, Changchun, Jilin, China aut NATIONALLICENCE 700 1- Mei Fang College of Computer Science and Technology, Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, 130012, Changchun, Jilin, China aut NATIONALLICENCE 773 0- Wireless Personal Communications Springer US; http://www.springer-ny.com 72/2(2013-09-01), 1005-1022 0929-6212 72:2<1005 2013 72 11277 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer