A generalized implicit enumeration algorithm for graph coloring
Communications of the ACM - Lecture notes in computer science Vol. 174
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
New methods to color the vertices of a graph
Communications of the ACM
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Efficient use of radio spectrum in wireless networks with channel separation between close stations
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
L(2,1)-labeling of planar graphs
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Cellular channel assignment: a new localized and distributed strategy
Mobile Networks and Applications - Dial m for mobility: discrete algorithms and methods for mobile computing and communication
Journal of Parallel and Distributed Computing
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Distance Constrained Labeling of Precolored Trees
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Extremal Properties of Three-Dimensional Sensor Networks with Applications
IEEE Transactions on Mobile Computing
A characterisation of optimal channel assignments for cellular and square grid wireless networks
Mobile Networks and Applications
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
New bounds for the L(h, k) number of regular grids
International Journal of Mobile Network Design and Innovation
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing
On greedy graph coloring in the distributed model
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Distributed k-clustering algorithms for random wireless multihop networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Self-stabilizing algorithms for graph coloring with improved performance guarantees
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
On the complexity of distributed greedy coloring
DISC'07 Proceedings of the 21st international conference on Distributed Computing
How many wireless resources are needed to resolve the hidden terminal problem?
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In the Code Division Multiple Access (CDMA) framework, collisions that can occur in wireless networks are eliminated by assigning orthogonal codes to stations, a problem equivalent to that of coloring graphs associated to the physical network. In this paper we present new upper and lower bounds for two versions of the problem (hidden and primary collision avoidance – HP-CA – or hidden collision avoidance only – H-CA). In particular, optimal assignments for special topologies and heuristics for general topologies are proposed. The schemes show better average results with respect to existing alternatives. Furthermore, the gaps between the upper bound given by the heuristic solution, the lower bound obtained from the maximum-clique problem, and the optimal solution obtained by branch and bound are investigated in the different settings. A scaling law is then proposed to explain the relations between the number of codes needed in Euclidean networks with different station densities and connection distances. The substantial difference between the two versions HP-CA and H-CA of the problem is investigated by studying the probabilistic distribution of connections as a function of the distance, and the asymptotic size of the maximum cliques.