GCF: Green Conflict Free TDMA scheduling for wireless sensor network
Pranav Mothabhau Pawar, Rasmus Hjorth Nielsen, Neeli Rashmi Prasad, Shingo Ohmori, Ramjee Prasad · 2012
The last few years have seen the promising growth in the application of wireless sensor networks (WSNs). The contribution of this paper is on a cluster-based time division multiple access (TDMA) scheduling algorithm to improve the performance of WSN applications in terms of energy efficiency, delay, throughput and scalability. Cluster-based scheduling improves the scalability by stabilizing the topology and it also improves the delay by increasing the reuse of slots. The paper proposes the Green Conflict Free (GCF) algorithm for finding a conflict free schedule across three-hop neighbours for inter- and intra-cluster communication. The algorithm is applied to a multi-hop cluster and uses a conflict graph to find the conflict free schedule. It helps to reduce the number of conflicts. Compared to state-of-the-art solutions, the algorithm shows better energy efficiency, average delay, scalability and better slot sharing through a reduced number of conflicts.