PERFORMANCE EVALUATION OF DISTRIBUTED SYNCHRONOUS GREEDY GRAPH COLORING ALGORITHMS ON W IRELESS AD HOC AND SENSOR NETWORKS

Graph coloring is a widely used technique for allocation of time and frequency slots to nodes, for forming clusters, for constructing independent sets anddominating sets on wireless ad hoc and sensor networks. A good coloring approach should produce low color count as possible. Besides, since the nodes of a wireless ad hoc and sensor network operate with limited bandwidth, energy and computing resources, th should be computed with few message passing and computational steps. In this paper, we provide a performance evaluation of distributed synchronous greedy graph coloring algorithms on ad hoc and sensor networks. We provide both theoretical and pr actical evaluations of distributed largest first and the distributed version of Brelaz’s algorithm. We showed that although distributed version of Brelaz’s algorithm produces less color count, its resource consumption is worse than distributed largest firs t algorithm.

[1]  Orhan Dagdeviren,et al.  A DISTRIBUTED MUTUAL EXCLUSION ALGORITHM FOR MOBILE AD HOC NETWORKS , 2012 .

[2]  Mark T. Jones,et al.  A Parallel Graph Coloring Heuristic , 1993, SIAM J. Sci. Comput..

[3]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

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

[5]  Martin E. Dyer,et al.  The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.

[6]  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).

[7]  C. Scheideler,et al.  Distributed coloring in O~(⎷(log n)) bit rounds , 2006, IPDPS.

[8]  Ajay K. Sharma,et al.  PERFORMANCE TRADE OFF WITH MODULATION IN 802.15.4 WPAN FOR WIRELESS SENSOR NETWORKS , 2010 .

[9]  Adrian Kosowski,et al.  On Greedy Graph Coloring in the Distributed Model , 2006, Euro-Par.

[10]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[11]  Christian Scheideler,et al.  Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[12]  B. Reed,et al.  Channel Assignment and Weighted Coloring , 2000 .

[13]  Shukor Abd Razak,et al.  A Cross-Layer Approach for Minimizing Interference and Latency of Medium Access in Wireless Sensor Networks , 2010, ArXiv.

[14]  Jan M. Rabaey,et al.  Low power distributed MAC for ad hoc sensor radio networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[16]  Stefano Basagni,et al.  Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..

[17]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[18]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[19]  Roger Wattenhofer,et al.  A log-star distributed maximal independent set algorithm for growth-bounded graphs , 2008, PODC '08.

[20]  David Eppstein,et al.  3-Coloring in Time O(1.3289^n) , 2000, J. Algorithms.

[21]  Roger Wattenhofer,et al.  On the complexity of distributed graph coloring , 2006, PODC '06.

[22]  Injong Rhee,et al.  DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.

[23]  Ge Ma,et al.  An Efficient MAC Protocol Based on Hybrid Superframe for Wireless Sensor Networks , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.

[24]  Leonid Barenboim,et al.  Distributed (δ+1)-coloring in linear (in δ) time , 2009, STOC '09.

[25]  Jesper Makholm Byskov.  Enumerating maximal independent sets with applications to graph colouring , 2004, Oper. Res. Lett..

[26]  Sundar Vishwanathan,et al.  Locality based graph coloring , 1993, STOC.

[27]  Roger Wattenhofer,et al.  A new technique for distributed symmetry breaking , 2010, PODC '10.

[28]  Walter Klotz.  Graph Coloring Algorithms , 2002 .

[29]  J. J. Garcia-Luna-Aceves,et al.  A new approach to channel access scheduling for Ad Hoc networks , 2001, MobiCom '01.

[30]  Jonathan S. Turner,et al.  Almost All k-Colorable Graphs are Easy to Color , 1988, J. Algorithms.

[31]  David P. Dailey.  Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete , 1980, Discret. Math..

[32]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[33]  David W. Matula,et al.  Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms , 2009, WASA.

[34]  Arunita Jaekel,et al.  Optimal channel allocation with dynamic power control in cellular networks , 2011, ArXiv.

[35]  Alfredo Navarra,et al.  On the complexity of distributed graph coloring with local minimality constraints , 2009 .

[36]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[37]  Suman Banerjee,et al.  Distributed channel management in uncoordinated wireless environments , 2006, MobiCom '06.

[38]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[39]  Aravind Srinivasan,et al.  On the Complexity of Distributed Network Decomposition , 1996, J. Algorithms.

[40]  Adam Nadolski,et al.  Distributed Largest-First Algorithm for Graph Coloring , 2004, Euro-Par.

[41]  Fabian Kuhn.  Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time , 2009, STACS.

[42]  Andreas Björklund,et al.  Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..

[43]  Andrew V. Goldberg,et al.  Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..