Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
