Journal ArticleDOI
Distributed Online Frequency Assignment in Cellular Networks
Reads0
Chats0
TLDR
This paper presents the first distributed online algorithms for this problem with proven bounds on their competitive ratios, and shows a series of algorithms that use at each vertex information about increasingly larger neighborhoods of the vertex, and that achieve better competitive ratios.About:
This article is published in Journal of Algorithms.The article was published on 2000-08-01. It has received 67 citations till now. The article focuses on the topics: Online algorithm & Frequency assignment.read more
Citations
More filters
Journal ArticleDOI
An Experimental Study of the Coloring Problem on Human Subject Networks
TL;DR: Network generated by preferential attachment made solving the coloring problem more difficult than did networks based on cyclical structures, and “small worlds” networks were easier still, and it was showed that providing more information can have opposite effects on performance, depending on network structure.
Journal ArticleDOI
Review: A survey on interference management techniques in femtocell self-organizing networks
TL;DR: A survey on the different interference and resource management techniques in Self-Organizing Network according to specifics classification criteria is provided to lessen the interference and increase the user capacity.
Journal ArticleDOI
A multifrequency MAC specially designed for wireless sensor network applications
TL;DR: This article proposes MMSN, which takes advantage of multifrequency availability while, at the same time, takes into consideration the restrictions of wireless sensor networks, and exhibits the prominent ability to utilize parallel transmissions among neighboring nodes.
Journal ArticleDOI
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
Petra Šparl,Janez Žerovnik +1 more
TL;DR: This paper presents a distributed algorithm for multicoloring hexagonal graphs using only the local clique numbers ω1( v) and ω2(v) at each vertex v of the given hexagonal graph, which can be computed from local information available at the vertex.
References
More filters
Journal ArticleDOI
Competitive snoopy caching
TL;DR: This work presents new on-line algorithms to be used by the caches of snoopy cache multiprocessor systems to decide which blocks to retain and which to drop in order to minimize communication over the bus.
Journal ArticleDOI
A Hybrid Channel Assignment Scheme in Large-Scale, Cellular-Structured Mobile Communication Systems
T. Kahwa,N. Georganas +1 more
TL;DR: This paper considers the problem of channel assignment in mobile communication systems, where the service area is divided in hexagonal cells, and a Hybrid Channel Assignment Scheme is studied.
Journal ArticleDOI
An on-line graph coloring algorithm with sublinear performance ratio
TL;DR: The First-Fit algorithm has performance function n /4 and an algorithm with sublinear performance function is exhibited that is the maximum over all graphs G on n vertices of the ratio of the number of colors used by A to color G to the chromatic numbers of G .
Journal ArticleDOI
Performance analysis of cellular networks
TL;DR: The author aims at estimating the minimal blocking probability for some simple cellular networks, some dynamic channel allocation strategies are analyzed, the optimal performance of some very simple networks is computed, and simple bounds on optimal performance are presented.
Journal ArticleDOI
Static Frequency Assignment in Cellular Networks
Lata Narayanan,Sunil M. Shende +1 more
TL;DR: This work describes an efficient algorithm to multicolor optimally any weighted even or odd length cycle representing a cellular network, and demonstrates an approximation algorithm which guarantees that no more than 4/3 times the minimum number of required colors are used.