Juha-Matti Koljonen
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.
- Y. Akaiwa and H. Andoh. Channel segregation-a self-organized dynamic channel allocation method: Application to tdma/fdma microcellular system. IEEE J. Sel. Areas Comm., 11(6), Aug. 1993.Google Scholar
Digital Library
- I. F. Akyildiz, W. Y. Lee, M. C. Vuran, and S. Mohanty. Next generation / dynamic spectrum access / cognitive radio wireless networks: a survey. Computer Networks Journal, 50:2127--2159, Sept. 2006. Google ScholarDigital Library
- R. Anthony. Scalable and efficient graph colouring in 3 dimensions using emergence engineering principles. In Proc. 2nd IEEE Internat. Conf. Self-Adaptive and Self-Organizing Systems, pages 370--379, Oct. 2008. Google ScholarDigital Library
- K. Appel and W. Haken. Every Planar Map Is Four Colorable. American Mathematical Society, 1989.Google ScholarCross Ref
- L. Cao and H. Zheng. Distributed rule-regulated spectrum sharing. IEEE J. Sel. Areas Comm., 26(1):130--145, Jan. 2008. Google ScholarDigital Library
- P. Chaikin and T. Lubensky. Principles of Condensed Matter Physics. Cambridge University Press, 1995.Google ScholarCross Ref
- J. Degesys and R. Nagpal. Towards desynchronization of multi-hop topologies. In Proc. 2nd IEEE Internat. Conf. Self-Adaptive and Self-Organizing Systems, pages 129--138, Oct. 2008. Google ScholarDigital Library
- F. Dressler. Self-organization in sensor and actor networks. Chichester: John Wiley and Sons, 2007. Google ScholarDigital Library
- S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2(1):153--174, 1987.Google ScholarDigital Library
- C. Peng, H. Zheng, and B. Y. Zhao. Utilization and fairness in spectrum assignment for opportunistic spectrum access. Mobile Netw. Appl., 11(4):555--576, Aug. 2006. Google ScholarDigital Library
- C. Prehofer and C. Bettstetter. Self-organization in communication networks: Principles and design paradigms. IEEE Comm. Mag., 43(7):78--85, July 2005. Google ScholarDigital Library
- S. Redner. A Guide to First-Passage Processes. Cambridge University Press, 2001.Google ScholarCross Ref
- N. Robertson, D. Sanders, P. Seymour, and R. Thomas. Efficiently four-coloring planar graphs. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 571--575. ACM New York, NY, USA, 1996. Google ScholarDigital Library
- G. Stüber. Principles of Mobile Communications. Norwell, MA: Kluwer Academic Publishers, 1996. Google ScholarDigital Library
- R. W. Thomas, D. H. Friend, L. A. DaSilva, and A. B. MacKenzie. Cognitive networks: Adaptation and learning to achieve end-to-end performance objectives. IEEE Comm. Mag., pages 51--57, Dec. 2006. Google ScholarDigital Library
- G. Voronoi. Nouvelles applications des parametres continus a la theorie des formes quadratiques. J. Reine Angew. Math, 134:198--287, 1908.Google ScholarCross Ref
- F. Yu, T. Wu, and S. Biswas. Toward in-band self-organization in energy-efficient mac protocols for sensor networks. IEEE Trans. Mob. Comp., 7(2):156--170, Feb. 2008. Google ScholarDigital Library
- J. Zander. Radio resource management in future wireless networks: requirements and limitations. IEEE Comm. Mag., 35(8):30--36, 1997. Google ScholarDigital Library
Index Terms
- Inertia-based distributed channel allocation
Recommendations
Channel allocation algorithms for multi-carrier multiple-antenna systems
Special section: Advances in signal processing-assisted cross-layer designsDynamic channel resource allocation (DCA) exploiting wideband multiuser diversity can provide data transmission with very high spectral efficiency by scheduling at each dimension (time, frequency, space) the user with the best channel conditions. The ...
Performance Comparison of Two Channel Allocation Approaches: Channel Pre-allocation vs. Non-pre-allocation
ICWMC '07: Proceedings of the Third International Conference on Wireless and Mobile CommunicationsIn cellular networks, wireless channels are a scarce resource and therefore must be used efficiently. Allocation of channels to individual cells can be done either by a centralized method or a distributedmethod. Under both approaches, available channels ...
Adaptive channel and power allocation of downlink multi-user MC-CDMA systems
The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very attractive multiple access technique for high-rate data transmission in the future wireless communication systems. This paper is focused on the joint channel and power ...
Comments