Frequency assignment problem in networks with limited spectrum

doi:10.1007/s10100-016-0462-7

CORC > 北京大学 > 信息科学技术学院

	Frequency assignment problem in networks with limited spectrum
	Shao, Zehui ; Vesel, Aleksander ; Xu, Jin
刊名	CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH
	2017
关键词	Frequency assignment (s, t, r)-relaxed k-L (3,2,1)-labeling Hexagonal lattice Square lattice GRAPHS L(2,1)-LABELINGS
DOI	10.1007/s10100-016-0462-7
英文摘要	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 RefTarget Address="10.1007/s10878-014-9746-9" TargetType="DOI"). 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.; National Natural Science Foundation of China [61309015]; Ministry of Science of Slovenia [0101-P-297]; National Basic Research Program of China (973 Program) [2013CB329601, 2013CB329603]; SCI(E); ARTICLE; 3,SI; 699-723; 25
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/471235]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Shao, Zehui,Vesel, Aleksander,Xu, Jin. Frequency assignment problem in networks with limited spectrum[J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH,2017.
APA	Shao, Zehui,Vesel, Aleksander,&Xu, Jin.(2017).Frequency assignment problem in networks with limited spectrum.CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH.
MLA	Shao, Zehui,et al."Frequency assignment problem in networks with limited spectrum".CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2017).