Distributed Code Assignment in Multihop Radio Networks: Object-Oriented Software Simulations

Code Assignment is one of the central problems in the management of mobile wireless networks, where a very precious resource (radio bandwidth) needs to be carefully shared among network nodes. As this problem has been shown to be NP-hard in every real world instance, no practical exact solution can be provided, and heuristic algorithms are being developed whose actual performance can hardly be calculated by theorical means; hence the development of heuristic schemes must always be accompanied by appropriate simulation software. In this paper we present a new distributed algorithm for code assignment in a multihop radio network. The algorithm is based on the Saturation-Degree coloring scheme proposed in [1], which has proved better than earlier attempts at solving the problem. A crucial parameter of the proposed algorithm is the depth of the neighborhood that must be considered when a local decision must be taken. By tuning this parameter one can obtain a tradeoff between the quality of the solution and the number of parallel passes and exchanged messages. We analyze the results of our C++ simulation programs where the proposed algorithm is compared with its sequential version and with competitive schemes proposed in the literature. Furthermore, to help analyzing the behavior of our distributed technique, we provide a graphical simulation environment written in Java.

[1]  Roberto Battiti,et al.  Assigning codes in wireless networks: bounds and scaling properties , 1999, Wirel. Networks.

[2]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[3]  Limin Hu.  Distributed code assignments for CDMA Packet Radio Network , 1993, TNET.

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

[5]  Imrich Chlamtac,et al.  Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.

[6]  Tarek Makansi,et al.  Transmitter-Oriented Code Assignment for Multihop Packet Radio , 1987, IEEE Trans. Commun..

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

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

[9]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[10]  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.

[11]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[12]  Marek Kubale,et al.  A generalized implicit enumeration algorithm for graph coloring , 1985, CACM.

[13]  Alan A. Bertossi,et al.  Code assignment for hidden terminal interference avoidance in multihop packet radio networks , 1995, TNET.