Vertex coloring based distributed link scheduling for wireless sensor networks

This paper presents an energy-efficient distributed link scheduling protocol based on vertex coloring method for wireless sensor networks. In the protocol, we perform vertex coloring using maximum degree preferred scheme, and gather network information only by local message exchanges. Thus, our protocol can further reduce the maximum number of timeslots, and avoid long-distance multihop packet forwarding. To improve coloring success rate, two mechanisms are proposed in the protocol. The first is a broadcast guarantee mechanism for increasing broadcast message delivery rate; the second is a conflict processing mechanism for solving coloring conflicts. Simulation results show that the proposed distributed scheduling protocol has better performance than certain centralized scheduling protocols and a classical distributed protocol DRAND in energy efficiency, spatial reuse rate and packet loss rate.

[1]  Injong Rhee,et al.  DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks , 2009, IEEE Trans. Mob. Comput..

[2]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

[3]  Arunabha Sen,et al.  Broadcast scheduling algorithms for radio networks , 1995, Proceedings of MILCOM '95.

[4]  Yuanzhu Peter Chen,et al.  Mobility-assisted Hierarchy for Efficient Data Collection in Wireless Sensor Networks , 2010, J. Commun..

[5]  Dániel Marx,et al.  RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .

[6]  Daniel Minoli,et al.  Wireless Sensor Networks: Technology, Protocols, and Applications , 2007 .

[7]  D. West.  Introduction to Graph Theory , 1995 .

[8]  Jain-Shing Liu,et al.  Energy-efficiency clustering protocol in wireless sensor networks , 2005, Ad Hoc Networks.

[9]  Bhaskar Krishnamachari,et al.  Energy efficient joint scheduling and power control for wireless sensor networks , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[10]  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..

[11]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[12]  Shahrokh Valaee,et al.  Delay aware link scheduling for multi-hop TDMA wireless networks , 2009, TNET.

[13]  Liqi Shi,et al.  TDMA Scheduling with Optimized Energy Efficiency and Minimum Delay in Clustered Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.