Optimal frequency assignments of cycles and powers of cycles
by Hsun-Wen Chang, Hao-Wen Chen
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 1, No. 2, 2006

Abstract: To reduce the interfering among transmitters, any two 'close' transmitters, with distance no more than d2, must receive frequencies at least l2 apart, and any two 'very close' transmitters, with distance no more than d1, must receive channels at least l1 apart. The assignment problem is to assign a frequency to each transmitter such that total bandwidth of assigned frequencies can be minimised. In this paper, we present upper and lower bounds of the minimum bandwidth of cycles and powers of cycles. We also show the corresponding assignment functions. And then we partially solve the assignment problem of cycles Cn and their powers such as: (i) 3 ≤ n ≤ 2d1+1; (ii) 2d1 + 2 ≤ n ≤ 2d2 + 1, q1 ≠ 0 and l1 ≤ m1l2; (iii) 2d1 + 2 ≤ n ≤ 2d2 + 1, q1 ≡ 1(mod m1) and l1 > m1l2; (iv) 2d1 + 2 ≤ n ≤ 2d2 + 1, q1 = 0 and l1 ≥ (m1 + d1 − 1)l2 or l1 ≤ (m1 − 1)l2; (v) n ≥ 2d2 + 2 and l1 ≤ ⌊(d2 + ⌊q2/m2⌋)/(d1 + 1)⌋l2; and (vi) n ≥ 2d2 + 2, q1 ≡ 1(mod m1), and l1 > m1l2, where n = mi(di + 1) + qi and 0 ≤ qi ≤ di.

Online publication date: Tue, 05-Sep-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com