Frequency assignment problem in networks with limited spectrum

Frequency assignment problem in networks with limited spectrum The frequency assignment problem (FAP) asks for assigning frequencies (channels) in a wireless network from the available radio spectrum to the transceivers of the network. One of the graph theoretical models of FAP is the L(3, 2, 1)-labeling of a graph, which is an abstraction of assigning integer frequencies to radio transceivers such that (i) transceivers that are one unit of distance apart receive frequencies that differ by at least three, (ii) transceivers that are two units of distance apart receive frequencies that differ by at least two, and (iii) transceivers that are three units of distance apart receive frequencies that differ by at least one. The relaxation of the L(3, 2, 1)-labeling called the (s, t, r)-relaxed k-L(3, 2, 1)-labeling is proposed in this paper. This concept is a generalization of the (s, t)-relaxed k-L(2, 1)-labeling (Lin in J Comb Optim 2016, doi: 10.1007/s10878-014-9746-9 ). Basic properties of (s, t, r)-relaxed k-L(3, 2, 1)-labeling are discussed and optimal (s, t, r)-relaxed k-L(3, 2, 1)-labelings for paths and some cycles as well as for the hexagonal lattice and the square lattice are determined. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Central European Journal of Operations Research Springer Journals

Frequency assignment problem in networks with limited spectrum

Loading next page...
 
/lp/springer_journal/frequency-assignment-problem-in-networks-with-limited-spectrum-i0qVCyV10Q
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Subject
Business and Management; Operations Research/Decision Theory
ISSN
1435-246X
eISSN
1613-9178
D.O.I.
10.1007/s10100-016-0462-7
Publisher site
See Article on Publisher Site

Abstract

The frequency assignment problem (FAP) asks for assigning frequencies (channels) in a wireless network from the available radio spectrum to the transceivers of the network. One of the graph theoretical models of FAP is the L(3, 2, 1)-labeling of a graph, which is an abstraction of assigning integer frequencies to radio transceivers such that (i) transceivers that are one unit of distance apart receive frequencies that differ by at least three, (ii) transceivers that are two units of distance apart receive frequencies that differ by at least two, and (iii) transceivers that are three units of distance apart receive frequencies that differ by at least one. The relaxation of the L(3, 2, 1)-labeling called the (s, t, r)-relaxed k-L(3, 2, 1)-labeling is proposed in this paper. This concept is a generalization of the (s, t)-relaxed k-L(2, 1)-labeling (Lin in J Comb Optim 2016, doi: 10.1007/s10878-014-9746-9 ). Basic properties of (s, t, r)-relaxed k-L(3, 2, 1)-labeling are discussed and optimal (s, t, r)-relaxed k-L(3, 2, 1)-labelings for paths and some cycles as well as for the hexagonal lattice and the square lattice are determined.

Journal

Central European Journal of Operations ResearchSpringer Journals

Published: Dec 10, 2016

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from
Google Scholar,
PubMed
Create lists to
organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off