Inertia-based distributed channel allocation

Authors:
Juha-Matti Koljonen;Matti Peltomäki;Mikko Alava;Olav Tirkkonen
Affiliations:
Helsinki University of Technology, FIN, TKK, Finland;Helsinki University of Technology, FIN, TKK, Finland;Helsinki University of Technology, FIN, TKK, Finland;Helsinki University of Technology, FIN, TKK, Finland and Nokia Research Center, FIN, Nokia Group, Finland
Venue:
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Year:
2009

Citing 12
Cited 0

Efficiently four-coloring planar graphs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Principles of Mobile Communication

Principles of Mobile Communication
Utilization and fairness in spectrum assignment for opportunistic spectrum access

Mobile Networks and Applications
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-organization in Autonomous Sensor and Actuator Networks

Self-organization in Autonomous Sensor and Actuator Networks
Toward In-Band Self-Organization in Energy-Efficient MAC Protocols for Sensor Networks

IEEE Transactions on Mobile Computing
Towards Desynchronization of Multi-hop Topologies

SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Scalable and Efficient Graph Colouring in 3 Dimensions Using Emergence Engineering Principles

SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Radio resource management in future wireless networks: requirements and limitations

IEEE Communications Magazine
Self-organization in communication networks: principles and design paradigms

IEEE Communications Magazine
Cognitive networks: adaptation and learning to achieve end-to-end performance objectives

IEEE Communications Magazine
Distributed Rule-Regulated Spectrum Sharing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider distributed channel allocation on planar conflict graphs describing interference couplings of wireless networks. We observe that the corresponding graph colouring problem is riddled by topologic defects that are annihilated when they meet the network boundary, or possibly another defect. Greedy algorithms lead to random walk -like motion of these defects. To increase the probability for them to meet the network boundary, we impose rules that add inertia to the motion of these defects. These rules give rise to a self-organizing resource allocation algorithm on the network which is cognicient of the motion of the defects. The example case of four-colouring a regular triangular lattice is considered. The median convergence time is found to be less than quadratic in the network size.