Effective Sensing Function Allocation Using a Distributed Graph Coloring and a Slot Allocation Algorithm in Wireless Sensor Networks

In this paper, we propose a sensing function allocation method that is based on a distributed graph coloring and a slot allocation algorithm. By using this method, a dynamic function allocation can be carried out in order to balance the distribution of each sensing function in a target monitoring area. The experimental results show that the proposed algorithm can allocate sensing functions such that 92% of the target monitoring area is covered and the actual sensing time is reduced by approximately 57% when many sensor nodes are deployed in the target area.

[1]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[2]  Matt Welsh,et al.  Decentralized, adaptive resource allocation for sensor networks , 2005, NSDI.

[3]  Ranjeet Kumar Patro,et al.  Mobile agent based TDMA slot assignment algorithm for wireless sensor networks , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[4]  Toshiaki Miyazaki,et al.  Distributed Coloring Algorithm for Wireless Sensor Networks and Its Applications , 2007, 7th IEEE International Conference on Computer and Information Technology (CIT 2007).

[5]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[6]  Milind Dawande,et al.  Link scheduling in sensor networks: distributed edge coloring revisited , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Tommy R. Jensen,et al.  Graph Coloring Problems: Jensen/Graph , 1994 .

[8]  Lin Zhang,et al.  CP-TDMA: Coloring- and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks , 2008, IEICE Trans. Commun..

[9]  Makoto Yokoo,et al.  The distributed breakout algorithms , 2005, Artif. Intell..