Notice of RetractionInvulnerability of colored networks: A survey

It is the rule rather than the exception that practical network systems possess heterogeneous components. Thus, network invulnerability has been better investigated with colored networks. This survey firstly discusses the basic idea of applying coloring theory to network invulnerability, and then systematically reviews the researches on invulnerability of colored networks in three aspects, including the modeling, analysis, and optimization of colored networks invulnerability. Finally, some future research prospects of colored network invulnerability is presented and discussed.

[1]  Florian Huc,et al.  The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks , 2012, Discret. Math. Algorithms Appl..

[2]  Yi-Kuei Lin,et al.  Quantifying the Impact of Correlated Failures on Stochastic Flow Network Reliability , 2012, IEEE Transactions on Reliability.

[3]  Tao Jiang,et al.  Novel 2-hop coloring algorithm for time-slot assignment of newly deployed sensor nodes without ID in wireless sensor and robot networks , 2012, Comput. Commun..

[4]  Pascale Minet,et al.  Node coloring in wireless networks: Complexity results and grid coloring , 2011, 2011 4th Joint IFIP Wireless and Mobile Networking Conference (WMNC 2011).

[5]  Louis Esperet,et al.  Dynamic list coloring of bipartite graphs , 2010, Discret. Appl. Math..

[6]  Wu Jun,et al.  Natural Connectivity of Complex Networks , 2010 .

[7]  Susan Khor,et al.  Application of Graph Coloring to Biological Networks , 2009, IET systems biology.

[8]  S. Akbari,et al.  On the list dynamic coloring of graphs , 2009, Discret. Appl. Math..

[9]  Felipe Maia Galvão França,et al.  Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs , 2009, Networking.

[10]  Milind Dawande,et al.  Link scheduling in wireless sensor networks: Distributed edge-coloring revisited , 2008, J. Parallel Distributed Comput..

[11]  Edward W. Knightly,et al.  Distance-1 Constrained Channel Assignment in Single Radio Wireless Mesh Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[12]  Pangfeng Liu,et al.  Generalized Edge Coloring for Channel Assignment in Wireless Networks , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[13]  Siddharth Suri,et al.  An Experimental Study of the Coloring Problem on Human Subject Networks , 2006, Science.

[14]  Hong-Jian Lai,et al.  Conditional colorings of graphs , 2006, Discret. Math..

[15]  Madhav V. Marathe,et al.  Strong edge coloring for channel assignment in wireless radio networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[16]  Jason P. Jue,et al.  Minimum-color path problems for reliability in mesh networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Rajiv Gandhi,et al.  Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks , 2004, FSTTCS.

[18]  Howard A. Peelle,et al.  Graph coloring in J: an introduction , 2000, APL '01.

[19]  Hitoshi Furuta,et al.  Reliability assessment and assurance of infrastructure systems , 1998 .

[20]  Richard A. Brualdi,et al.  Incidence and strong edge colorings of graphs , 1993, Discret. Math..

[21]  Hans L. Bodlaender,et al.  On the Complexity of Some Coloring Games , 1991, Int. J. Found. Comput. Sci..

[22]  Yehoshua Perl,et al.  Heuristics for finding a maximum number of disjoint bounded paths , 1984, Networks.

[23]  Bryan L. Deuermeyer,et al.  A New Approach for Network Reliability Analysis , 1982, IEEE Transactions on Reliability.

[24]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[25]  Yong Jin Park,et al.  Reliability Evaluation of a Network with Delay , 1979, IEEE Transactions on Reliability.

[26]  V. G. Vizing.  SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .

[27]  Sen Nie,et al.  Modeling and Optimization of Train Scheduling Network Based on Invulnerability Analysis , 2013 .

[28]  Tan Yue-jin,et al.  Cascading failure model of complex networks based on tunable load redistribution , 2013 .

[29]  Tan Yue-jin,et al.  Status and Prospects on Network Reliability , 2011 .

[30]  Zhaohui Wu,et al.  Infrastructure and Reliability Analysis of Electric Networks for E-Textiles , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[31]  Vincenzo Mancuso,et al.  A Heuristic for Fast Convergence in Interference-free Channel Assignment Using D1EC Coloring , 2010, ISCIS.

[32]  Tan Yue,et al.  Invulnerability of Complex Networks:A Survey , 2006 .

[33]  Marina Papatriantafilou,et al.  Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks , 2002, Wirel. Networks.

[34]  Liu Xi.  The fractional coloring and fractional chromatic numbers of graphs , 2001 .