Abstract
Given a set of points P, a conflict-free coloring of P is an assignment of colors to points of P, such that there exist a point p in any subset of P whose color is distinct from all other points in that subset of P. This notion is motivated by frequency assignment in wireless cellular networks: one would like to minimize the number of frequencies (colors) assigned to base stations (points), such that within any range, there is no interference. Also base stations in cellular networks are often not reliable. Some base station may fail to function properly or get faulted. This leads us to study fault-tolerant CF-colorings: colorings that remain conflict-free even after some objects are deleted from P. We provide a strong fault-tolerant conflict-free coloring (Strong-FTCF coloring) framework for intervals of points such that if some colors gets faulted, the whole system will remain working. We can say that the system is working properly if some of the colors are deleted. Our algorithm uses O(log n) colors with high probability.
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 callMore From: International Journal of Research Studies in Computing
Disclaimer: 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.
