The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Computer Networks
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks
IEEE/ACM Transactions on Networking (TON)
Efficient communication strategies for ad-hoc wireless networks (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
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
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
An Optimal Channel Access Protocol with Multiple Reception Capacity
IEEE Transactions on Computers
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
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
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Topology-transparent scheduling for MANETs using orthogonal arrays
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
An integrated platform for quality-of-service support in mobile multimedia clustered ad hoc networks
The handbook of ad hoc wireless networks
Cover-Free Families and Topology-Transparent Scheduling for MANETs
Designs, Codes and Cryptography
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
Wireless mesh networks based on CDMA
Computer Communications
Rateless forward error correction for topology-transparent scheduling
IEEE/ACM Transactions on Networking (TON)
Distributed scheduling algorithms for channel access in TDMA wireless mesh networks
The Journal of Supercomputing
Slot synchronized topology-transparent scheduling for sensor networks
Computer Communications
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing
Access scheduling on the control channels in TDMA wireless mesh networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
ACM Transactions on Algorithms (TALG)
Access scheduling on the control channels in TDMA wireless mesh networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
A virtual subnet scheme on clustering algorithms for mobile ad hoc networks
Expert Systems with Applications: An International Journal
On scalability and mobility management of hierarchical large-scale ad hoc networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
An interference-aware multichannel media access control protocol for wireless sensor networks
The Journal of Supercomputing
Distributed scheduling algorithms for channel access in TDMA wireless mesh networks
The Journal of Supercomputing
Distributed scheduling schemes for wireless mesh networks: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 14.99 |
This paper proposes a solution to providing a collision free channel allocation in a multihop mobile radio network. An efficient solution to this problem provides spatial reuse of the bandwidth whenever possible. A robust solution maintains the collision free property of the allocation under any combination of topological changes. The node organization algorithm presented in this paper provides a completely distributed, maximally localized execution of collision free channel allocation. It allows for parallel channel allocation in stationary and mobile networks with provable spatial reuse properties. A simpler version of the algorithm provides also a highly localized distributed coloring algorithm of dynamic graphs.