Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A new model for scheduling packet radio networks
Wireless Networks
Colouring proximity graphs in the plane
Discrete Mathematics
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Geometric Spanners for Wireless Ad Hoc Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
OVSF-CDMA code assignment in wireless ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Online OVSF Code Assignment with Resource Augmentation
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Online Tree Node Assignment with Resource Augmentation
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
SIGACT news online algorithms column 14
ACM SIGACT News
A constant-competitive algorithm for online OVSF code assignment
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Online tree node assignment with resource augmentation
Journal of Combinatorial Optimization
Constant-competitive tree node assignment
Theoretical Computer Science
| Hi-index | 0.00 |
We present several distributed CDMA/OVSF code assignment algorithms for wireless ad hoc networks modelled by unit disk graph (UDG). We first give a distributed code assignment whose total throughput is within a constant factor of the optimum. Then we give a distributed method such that the minimum rate achieved is within a constant factor of the optimum. A distributed method that can approximate both the minimum rate and total throughput is also presented. All our methods use only O(n) total messages (each with O(log n) bits) for an ad hoc wireless network of n nodes modelled by UDG.