Algorithms for channel assignment in mobile wireless networks using temporal coloring

We model the problem of channel assignment in mobile networks as one of temporal coloring (T-coloring), that is, coloring a time-varying graph. In order to capture the impact of channel re-assignments due to mobility, we model the cost of coloring as C + αA, where C is the total number of colors used and A is the total number of color changes, and α is a user-selectable parameter reflecting the relative penalty of channel usage and re-assignments. Using these models, we present several novel algorithms for temporal coloring. We begin by analyzing two simple algorithms called SNAP and SMASH that take diametrically opposite positions on colors vs re-assignments, and provide theoretical results on the ranges of α in which one outperforms the other, both for arbitrary and random time-varying graphs. We then present six more algorithms that build upon each of SNAP and SMASH in different ways. Simulations on random geometric graphs with random waypoint mobility show that the relative cost of the algorithms depends upon the value of α and the transmission range, and we identify precise values at which the crossovers happen.

[1]  Subramanian Ramanathan,et al.  Efficient Distributed Algorithms for Channel Assignment in Multihop Radio Networks , 1993, J. High Speed Networks.

[2]  B. Bollobás.  The evolution of random graphs , 1984 .

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

[4]  Subramanian Ramanathan,et al.  On the complexity of distance-2 coloring , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

[5]  Aravind Srinivasan,et al.  Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.

[6]  Cecilia Mascolo,et al.  Evaluating Temporal Robustness of Mobile Networks , 2013, IEEE Transactions on Mobile Computing.

[7]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Béla Bollobás,et al.  The chromatic number of random graphs , 1988, Comb..

[9]  Fawaz S. Al-Anzi,et al.  Using mixed graph coloring to minimize total completion time in job shop scheduling , 2006, Appl. Math. Comput..

[10]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

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

[12]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[13]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[14]  Jean-Loup Guillaume,et al.  Temporal reachability graphs , 2012, Mobicom '12.

[15]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

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

[17]  Jie Chen,et al.  Distributed Channel Assignment and Routing in Multiradio Multichannel Multihop Wireless Networks , 2006, IEEE Journal on Selected Areas in Communications.

[18]  Jingjing Wang,et al.  Periodicity Based Next Place Prediction , 2012 .

[19]  Colin McDiarmid,et al.  On the chromatic number of random geometric graphs , 2011, Comb..

[20]  Limin Hu,et al.  Distributed code assignments for CDMA packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[21]  Errol L. Lloyd,et al.  An incremental algorithm for broadcast scheduling in packet radio networks , 1998, IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201).

[22]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[23]  Yiwei Thomas Hou,et al.  Bridging the Gap between Protocol and Physical Models for Wireless Networks , 2013, IEEE Transactions on Mobile Computing.

[24]  Béla Bollobás,et al.  Random Graphs , 1985 .

[25]  Ram Ramanathan,et al.  The DARPA WNaN network architecture , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[26]  Noga Alon,et al.  On the complexity of radio communication , 1989, STOC '89.

[27]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[28]  Vassilis Kostakos.  Temporal Graphs , 2014, Encyclopedia of Social Network Analysis and Mining.