1

Supplement to the paper

A New Approach to Fast Near-Optimal Channel

Assignment in Cellular Mobile Networks
!

In Section I of this note, we provide the detailed specications of the three additional benchmark problems
9 11. In Section II, the resulting frequency assignment
given by our proposed algorithm for all the benchmark
problems (problems 1-11) have been shown in detail.
In Section III, we compute the worst-case deviation of
bandwidth (as required by our algorithm) from optimality. In Section IV, we include the proofs of Lemmas 4-9
along with the related examples.

2 D ETAILED F REQUENCY
ALL THE B ENCHMARKS

TABLE 1
Frequency separation matrix for problem 9

C =

A DDITIONAL B ENCHMARK P ROBLEMS

Apart from the Philadelphia benchmarks described in

the paper, we also consider a practical assignment
problem from Helsinki, Finland [8, 12]. We term this
benchmark instance as problem 9. The problem 9 has
been formulated on a 25-cell network, whose frequency
separation matrix C and demand vector D3 are shown in
Tables 1 and 2, respectively. The entry corresponding to
the i-th row and j-th column of Table 1, i.e., cij , represents
the minimum frequency separation requirement between
a call in cell i and a call in cell j (0 i, j 24). The
column-i of the row D3 in Table 2 indicates the channel
demand from cell i.
Other than the Philadelphia benchmarks and the 25-cell
benchmark discussed above, we have also considered
two other benchmarks dened on the 55 node cellular
network [8] shown in Fig. A. These two benchmarks
also have been dened on a 2-band buffering system
where s0 , s1 and s2 are given as 7, 1 and 1, respectively.
The demand vectors of these two problems (we term as
Problems 10 and 11) are given by D4 and D5 respectively,
as shown in Table 3.

FOR

We have simulated our proposed algorithm on all the

Philadelphia benchmarks dened in the Introduction
of the paper and also problems 9, 10 and 11 dened
above. The resulting frequency assignment for all the
benchmark problems have been shown below.

A SSIGNMENT

2
1
1
0
1
0
1
1
1
1
0
1
1
1
1
0
0
0
0
0
0
0
0
0
0

1
2
1
0
1
0
1
1
0
1
0
1
1
1
1
0
0
0
0
0
0
0
0
0
0

1
1
2
1
1
1
1
1
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0

0
0
1
2
0
0
1
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0
1
1
1

1
1
1
0
2
0
0
0
0
1
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0

0
0
1
0
0
2
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

0
6

14
21
29

22

38

1
1
1
1
1
1
1
1
1
2
1
1
1
1
1
1
0
0
0
0
0
1
0
1
0

0
0
1
1
1
0
1
1
1
1
2
0
1
1
1
1
0
1
1
1
1
1
1
1
1

1
1
1
1
1
0
1
1
1
1
0
2
1
1
0
0
0
0
0
0
0
0
0
0
0

1
1
0
0
1
0
0
0
0
1
1
0
1
1
2
1
1
1
1
1
1
1
0
0
0

0
0
0
0
0
0
0
0
0
0
1
0
1
1
1
1
1
2
1
1
0
0
0
0
0

0
0
0
0
0
0
0
0
0
0
1
0
1
1
1
1
1
1
2
1
1
1
1
0
0

0
0
0
0
0
0
0
0
0
1
1
0
0
0
1
0
0
0
1
1
1
2
1
1
1

0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
1
1
1
2
1
1

20
28
36

35

37
45

44
52

0
0
0
1
0
0
0
0
1
0
1
0
0
0
0
0
0
0
0
0
0
1
1
1
2

13

27

43

0
0
0
1
0
0
0
1
1
1
1
0
0
0
0
0
0
0
0
0
0
1
1
2
1

19

34

51

0
0
0
0
0
0
0
0
0
0
1
0
0
0
1
0
0
0
1
1
2
1
1
0
0

12

26

42

0
0
0
0
0
0
0
0
0
0
1
0
1
1
1
1
0
1
1
2
1
1
1
0
0

18

33

50

0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
1
2
1
1
0
0
0
0
0
0

11

25

41

0
0
0
0
1
0
0
0
0
1
1
0
1
1
1
2
1
1
1
1
0
0
0
0
0

17

32

49

1
1
1
0
1
0
0
0
0
1
1
1
1
2
1
1
1
1
1
1
0
0
0
0
0

10

24

40

1
1
1
1
1
0
1
1
0
1
1
1
2
1
1
1
1
1
1
1
0
0
0
0
0

16

31

48

1
0
1
1
0
1
1
1
2
1
1
1
0
0
0
0
0
0
0
0
0
0
0
1
1

23

39
47

1
1
1
1
0
1
1
2
1
1
1
1
1
0
0
0
0
0
0
0
0
0
0
1
0

15

30

1
1
1
1
0
1
2
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
0

53

46
54

Fig. A: The cellular graph corresponding to the cellular

network of 55-node benchmark.

TABLE 2
The demand vector for problem 9
Cell nos.
D3

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
10 11 9 5 9 4 5 7 4 8 8 9 10 7 7 6 4 5 5 7 6 4 5 7 5

TABLE 3
Two different demand vectors for 55-node benchmark problems
Cell nos.
D4
D5
Cell nos.
D4
D5
Cell nos.
D4
D5

0
5
10
22
5
5
44
20
7

1
5
11
23
5
7
45
25
6

2
5
9
24
5
5
46
8
4

3
8
5
25
5
10
47
5
5

4
12
9
26
5
11
48
5
7

5
25
4
27
5
9
49
5
5

6
30
5
28
8
5
50
25
6

7
25
7
29
12
9
51
8
4

8
30
4
30
25
4
52
5
5

9
40
8
31
30
5
53
5
7

10
40
8
32
25
7
54
5
5

11
45
9
33
30
4

12
20
10
34
40
8

13
30
7
35
40
8

14
25
7
36
45
9

15
15
6
37
20
10

16
15
4
38
30
7

17
30
5
39
25
7

18
20
5
40
15
6

19
20
7
41
15
4

20
25
6
42
30
5

21
8
4
43
20
5

TABLE 4
Derived channel assignment for problem 1
Cells 0
263
268
273
278
283
288
293
298

Demands 8

10

11

12

13

14

15

16

17

18

19

20

260
265
270
275
280
285
290
295
300
305
310
315
320
325
330
335
340
345
350
355
360
365
370
375
380

262
267
272
277
282
287
292
297

263
268
273
278
283
288
293
298

4
9
14
19
24
29
34
39

1
6
11
16
21
26
31
36
41
46
51
56
61
66
71

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
79
84
89

2
7
12
17
22
27
32
37
42
47
52
57
62
67
72
77
82
87
92
97
102
107
112
117
122
127
132
137
142
147
152
157
162
167
172
177
182
187
192
197
202
207
212
217
222
227
232
237
242
247
252
257

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120
125
130
135
140
145
150
155
160
165
170
175
180
185
190
195
200
205
210
215
220
225
230
235
240
245
250
255
261
266
271
276
281
286
291
296
301
306
311
316
321
326
331
336
341
346
351
356
361
366
371
376
381

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73
78
83
88
93
98
103
108
113
118
123
128
133
138

1
6
11
16
21
26
31
36
41
46
51
56
61

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120
125
130
135
140
145
150

260
265
270
275
280
285
290
295
300
305
310
315
320
325
330

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73
78
83
88
93
98
103
108
113
118
123
128
133
138
143
148
153
158
163
168
173
178

1
6
11
16
21
26
31
36
41
46
51
56
61
66
71
76
81
86
91
96
101
106
111
116
121
126
131
136
141
146
151
156
161
166
171
176
181
186
191
196
201
206
211
216
221
226
231
236
241
246
251
256
264
269
274
279
284

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
79
84
89
94
99
104
109
114
119
124
129
134
139

2
7
12
17
22
27
32
37

262
267
272
277
282
287
292
297
302
307

260
265
270
275
280
285
290
295
300
305
310
315
320

263
268
273
278
283
288
293
298

25

15

18

52

77

28

13

15

31

15

36

57

28

10

13

TABLE 5
Derived channel assignment for problem 2
Cells 0
230
236
242
248
254
260
266
393

Demands 8

10

11

12

13

14

15

16

17

18

19

20

272
279
286
293
300
307
314
321
328
335
342
349
356
363
370
377
384
391
399
407
415
423
431
439
447

228
234
240
246
252
258
264
389

129
134
139
144
149
154
159
164

2
7
12
17
22
27
32
37

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73

1
6
11
16
21
26
31
36
41
46
51
56
61
66
71
76
81
86

127
132
137
142
147
152
157
162
167
172
177
182
187
192
197
202
207
212
217
222
227
233
239
245
251
257
263
269
276
283
290
297
304
311
318
325
332
339
346
353
360
367
374
381
388
396
404
412
420
428
436
444

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120
125
130
135
140
145
150
155
160
165
170
175
180
185
190
195
200
205
210
215
220
225
231
237
243
249
255
261
267
274
281
288
295
302
309
316
323
330
337
344
351
358
365
372
379
386
394
402
410
418
426
434
442

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73
78
83
88
93
98
103
108
113
118
123
270
277
284

126
131
136
141
146
151
156
161
166
171
176
181
186

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120
128
133
138
143
148
153

126
131
136
141
146
151
156
161
166
171
176
181
186
191
196

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
79
84
89
94
99
104
109
114
119
124
129
134
139
144
149
154
159
164
169
174
179

2
7
12
17
22
27
32
37
42
47
52
57
62
67
72
77
82
87
92
97
102
107
112
117
122
229
235
241
247
253
259
265
271
278
285
292
299
306
313
320
327
334
341
348
355
362
369
376
383
390
398
406
414
422
430
438
446

128
133
138
143
148
153
158
163
168
173
178
183
188
193
198
203
208
213
218
223
392
400
408
416
424
432
440
448

1
6
11
16
21
26
31
36

226
232
238
244
250
256
262
268
275
282

126
131
136
141
146
151
156
161
166
171
176
181
186

4
9
14
19
24
29
34
39

25

15

18

52

77

28

13

15

31

15

36

57

28

10

13

TABLE 6
Derived channel assignment for problem 3
Cells 0
483
490
497
504
511
518
525
532

Demands 8

10

11

12

13

14

15

16

17

18

19

20

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103
110
117
124
131
138
145
152
159
166
173

6
13
20
27
34
41
48
55

483
490
497
504
511
518
525
532

4
11
18
25
32
39
46
53

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170
177
184
191
198
205
212
219
226
233
240
247
254
261
268
275
282
289
296
303
310
317
324
331
338
345
352
359

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
245
252
259
266
273
280
287
294
301
308
315
322
329
336
343
350
357
364
371
378
385
392
399
406
413
420
427
434
441
448
455
462
469
476
484
491
498
505
512
519
526
533

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171
178
185
192

1
8
15
22
29
36
43
50
57
64
71
78
85

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171
178
185
192
199
206
213
220
227
234
241
248

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204
211
218
225
232
239
246
253
260
267
274
281
288
295
302
309
316
323
330
337
344
351
358
365
372
379
386
393

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
144
151
158
165
172
179
186
193

2
9
16
23
30
37
44
51

6
13
20
27
34
41
48
55
62
69

5
12
19
26
33
40
47
54
61
68
75
82
89

483
490
497
504
511
518
525
532

25

15

18

52

77

28

13

15

31

15

36

57

28

10

13

TABLE 7
Derived channel assignment for problem 4
Cells 0
367
374
381
388
395
402
409
416

Demands 8

10

11

12

13

14

15

16

17

18

19

20

364
371
378
385
392
399
406
413
420
427
434
441
448
455
462
469
476
483
490
497
504
511
518
525
532

368
375
382
389
396
403
410
417

6
13
20
27
34
41
48
55

2
9
16
23
30
37
44
51

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
144
151
158
165
172
179
186
193
200
207
214
221
228
235
242
249
256
263
270
277
284
291
298
305
312
319
326
333
340
347
354
361

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
245
252
259
266
273
280
287
294
301
308
315
322
329
336
343
350
357
366
373
380
387
394
401
408
415
422
429
436
443
450
457
464
471
478
485
492
499
506
513
520
527
534

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171
178
185
192

364
371
378
385
392
399
406
413
420
427
434
441
448

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101

6
13
20
27
34
41
48
55
62
69
76
83
90
97
104
111
118
125
132
139
146
153
160
167
174
181
188
195
202
209
216
223
230
237
244
251

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170
177
184
191
198
205
212
219
226
233
240
247
254
261
268
275
282
289
296
303
310
317
324
331
338
345
352
359
369
376
383
390
397

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103
110
117
124
131
138
145
152
159
166
173
180
187
194

1
8
15
22
29
36
43
50

367
374
381
388
395
402
409
416
423
430

364
371
378
385
392
399
406
413
420
427
434
441
448

368
375
382
389
396
403
410
417

25

15

18

52

77

28

13

15

31

15

36

57

28

10

13

TABLE 8
Derived channel assignment for problem 5
Cells 0
125
130
135
140
145

Demands 5

10

11

12

13

14

15

16

17

18

19

20

1
6
11
16
21

0
5
10
15
20

129
134
139
144
149
154
159
164

4
9
14
19
24
29
34
39
44
49
54
59

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
79
84
89
94
99
104
109
114
119
124

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120
127
132
137
142
147

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73
78
83
88
93
98
103
108
113
118
123

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
79
84
89
94
99
104
109
114
119
124
200
205
210
215
220

2
7
12
17
22
27
32
37
42
47
52
57
62
67
72
77
82
87
92
97
102
107
112
117
122
127
132
137
142
147
152
157
162
167
172
177
182
187
192
197

1
6
11
16
21
26
31
36
41
46
51
56
61
66
71
76
81
86
91
96
101
106
111
116
121
126
131
136
141
146
151
156
161
166
171
176
181
186
191
196

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120
125
130
135
140
145
150
155
160
165
170
175
180
185
190
195
200
205
210
215
220

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73
78
83
88
93
98

1
6
11
16
21
26
31
36
41
46
51
56
61
66
71
76
81
86
91
96
101
106
111
116
121
128
133
138
143
148

2
7
12
17
22
27
32
37
42
47
52
57
62
67
72
77
82
87
92
97
102
107
112
117
122

126
131
136
141
146
151
156
161
166
171
176
181
186
191
196

128
133
138
143
148
153
158
163
168
173
178
183
188
193
198

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73
78
83
88
93
98
103
108
113
118
123
201
206
211
216
221

125
130
135
140
145
150
155
160
165
170
175
180
185
190
195
201
206
211
216
221

1
6
11
16
21
26
31
36
41
46
51
56
61
66
71
76
81
86
91
96

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120

12

25

30

25

30

40

40

45

20

30

25

15

15

30

20

20

25

TABLE 9
Derived channel assignment for problem 6
Cells 0
103
108
113
118
123

Demands 5

10

11

12

13

14

15

16

17

18

19

20

75
80
85
90
95

191
199
207
215
223

104
109
114
119
124
246
255
264

102
107
112
117
122
185
193
201
209
217
225
233

77
82
87
92
97
102
107
112
117
122
130
136
142
148
154
160
166
172
178
184
192
200
208
216
224

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
79
84
89
94
99
186
194
202
210
218
226
234
243
252
261

3
8
13
18
23
28
33
38
43
48
53
58
63
68
73
188
196
204
212
220
228
236
241
250
259

1
6
11
16
21
26
31
36
41
46
51
56
61
66
71
77
82
87
92
97
185
193
201
209
217
225
233
245
254
263

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
101
106
111
116
121
128
134
140
146
152
158
164
170
176
182
187
195
203
211
219
227
235
242
251
260

2
7
12
17
22
27
32
37
42
47
52
57
62
67
72
78
83
88
93
98
126
132
138
144
150
156
162
168
174
180
189
197
205
213
221
229
237
244
253
262

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
105
110
115
120
129
135
141
147
153
159
165
171
177
183
191
199
207
215
223
231
239
247
256
265

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
100
105
110
115
120

2
7
12
17
22
27
32
37
42
47
52
57
62
67
72
128
134
140
146
152
158
164
170
176
182
189
197
205
213
221

76
81
86
91
96
101
106
111
116
121
126
132
138
144
150
156
162
168
174
180
191
199
207
215
223

104
109
114
119
124
129
135
141
147
153
159
165
171
177
183

79
84
89
94
99
190
198
206
214
222
230
238
247
256
265

76
81
86
91
96
103
108
113
118
123
130
136
142
148
154
160
166
172
178
184
192
200
208
216
224
232
240
249
258
267

4
9
14
19
24
29
34
39
44
49
54
59
64
69
74
187
195
203
211
219

2
7
12
17
22
27
32
37
42
47
52
57
62
67
72
102
107
112
117
122

0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
127
133
139
145
151
157
163
169
175
181

12

25

30

25

30

40

40

45

20

30

25

15

15

30

20

20

25

TABLE 10
Derived channel assignment for problem 7
Cells 0
5
12
19
26
33

Demands 5

10

11

12

13

14

15

16

17

18

19

20

1
8
15
22
29

0
7
14
21
28

5
12
19
26
33
40
47
54

4
11
18
25
32
39
46
53
60
67
74
81

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
144
151
158
165
172

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
144
151
158
165
172
179
186
193
200
207

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170
177
184
191
198
205
212
219
226
233
240
247
254
261
268
275

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204
211
218
225
232
239
246
253
260
267
274

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
245
252
259
266
273
280
287
294
301
308

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170

210
217
224
231
238
245
252
259
266
273
280
287
294
301
308

6
13
20
27
34
41
48
55
62
69
76
83
90
97
104

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171
178
185
192
199
206

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103
110
117
124
131
138

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168

12

25

30

25

30

40

40

45

20

30

25

15

15

30

20

20

25

10

TABLE 11
Derived channel assignment for problem 8
Cells 0
145
152
159
166
173

Demands 5

10

11

12

13

14

15

16

17

18

19

20

3
10
17
24
31

141
148
155
162
169

248
255
262
269
276
284
291
298

5
12
19
26
33
40
47
54
61
68
75
82

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103
110
117
124
131
138
246
253
260
267
274

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
142
149
156
163
170
177
184
191
198
205

140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
245
252
259
266
273
280
287
294
301
308

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
247
254
261
268
275
282
289
296
303
310

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
144
151
158
165
172
179
186
193
200
207
214
221
228
235
242
250
257
264
271
278

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170
177
184
191
198
205
212
219
226
233
240
280
287
294
301
308

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
245
252
259
266
273
282
289
296
303
310

140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
249
256
263
270
277

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
144
151
158
165
172
179
186
193
200
207

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
248
255
262
269
276

143
150
157
164
171
178
185
192
199
206
213
220
227
234
241

146
153
160
167
174
181
188
195
202
209
216
223
230
237
244

6
13
20
27
34
41
48
55
62
69
76
83
90
97
104
111
118
125
132
139
246
253
260
267
274
283
290
297
304
311

141
148
155
162
169
176
183
190
197
204
211
218
225
232
239
246
253
260
267
274

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
248
255
262
269
276

12

25

30

25

30

40

40

45

20

30

25

15

15

30

20

20

25

TABLE 12
Derived channel assignment for problem 9
Cells 0

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

1
4
10
17
25
33
41
49
57
65

0
2
5
11
18
26
34
42
50
58
66

6
12
19
27
35
43
51
59
67

5
11
18
26
34

7
13
20
28
36
44
52
60
68

0
2
4
10

20
28
36
44
52

7
13
24
32
40
48
56

9
16
23
31

14
21
29
37
45
53
61
69

0
2
4
10
17
25
33
41

8
15
22
30
38
46
54
62
70

3
9
16
23
31
39
47
55
63
71

24
32
40
48
56
64
72

6
12
19
27
35
43
51

5
11
18
26
34
42

0
2
4
10

8
15
22
30
38

13
20
28
36
44

1
7
14
21
29
37
45

3
5
11
18
26
34

9
16
22
30

6
12
19
27
35

1
3
8
15
20
28
36

7
13
21
29
37

Demands 10

11

10

231
238
245
252
259

232
239
246
253
260

4
11
18
25
32

233
240
247
254
261
268
275
282

12

232
239
246
253
260
267
274
281
288
295
302
309

25

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171

30

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204

25

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171

30

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203

40

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170
177
184
191
198
205
212
219
226
235
242
249
256
263
270
277

40

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204
211
218
225
234
241
248
255
262
269
276

10

45

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
245
252
259
266
273
280
287
294
301
308

11

20

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137

12

30

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204

13

25

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
144
151
158
165
172

14

15

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103

15

15

6
13
20
27
34
41
48
55
62
69
76
83
90
97
104

16

30

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171
178
185
192
199
206

17

20

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103
110
117
124
131
138

18

20

6
13
20
27
34
41
48
55
62
69
76
83
90
97
104
111
118
125
132
139

19

25

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170

20

6
13
20
27
34
41
48
55

233
240
247
254
261

21 22

231
238
245
252
259

23

232
239
246
253
260

24

236
243
250
257
264

25

235
242
249
256
263

26

234
241
248
255
262

27

5
12
19
26
33
40
47
54

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170

12 25

5
12
19
26
33
40
47
54
61
68
75
82

28 29 30

30

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203

31

25

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169

32

30

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137
144
151
158
165
172
179
186
193
200
207

33

40

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170
177
184
191
198
205
212
219
226
233
240
247
254
261
268
275

34

40

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204
211
218
225
232
239
246
253
260
267
274

35

TABLE 13
Derived Channel Assignment for Problem 10
36

45

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203
210
217
224
231
238
245
252
259
266
273
280
287
294
301
308

37

20

4
11
18
25
32
39
46
53
60
67
74
81
88
95
102
109
116
123
130
137

38

30

1
8
15
22
29
36
43
50
57
64
71
78
85
92
99
106
113
120
127
134
141
148
155
162
169
176
183
190
197
204

39

25

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171

40

15

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103

41

15

6
13
20
27
34
41
48
55
62
69
76
83
90
97
104

42

30

0
7
14
21
28
35
42
49
56
63
70
77
84
91
98
105
112
119
126
133
140
147
154
161
168
175
182
189
196
203

43

20

5
12
19
26
33
40
47
54
61
68
75
82
89
96
103
110
117
124
131
138

44

20

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136

45

25

2
9
16
23
30
37
44
51
58
65
72
79
86
93
100
107
114
121
128
135
142
149
156
163
170

4
11
18
25
32

231
238
245
252
259

46 47 48
1
8
15
22
29
36
43
50

25

3
10
17
24
31
38
45
52
59
66
73
80
87
94
101
108
115
122
129
136
143
150
157
164
171

49 50
2
9
16
23
30

51

231
238
245
252
259
266
273
280

6
13
20
27
34

5
12
19
26
33

52 53 54
4
11
18
25
32

11

0
7
14
21
28
35
42
49
56
63
70

1
8
15
22
29
36
43
50
57
64

2
9
16
23
30
37
45
52
59

10 11 9

44
51
58
66
73

0
7
14
21
28
35
47
54
61

2
9
16
23

0
7
14
21
28

2
9
16
23
30
37
45

44
51
58
66

4
11
18
25
32
39
48
55

5
12
19
26
33
40
64
71

3
10
17
24
31
38
46
53
60

4
11
18
25
32
39
48

10 7

1
8
15
22
29
36
43
50
57
65

3
10
17
24
31
38
46

5
12
19
26
33
40

47
54
61
68

43
50
57
65
72

42
49
56
63
70

6
13
20
27
34
41
68

5
12
19
26
33
40

6
13
20
27

42
49
56
63
70

0
7
14
21
28
35
64

6
13
20
27
34

0
7
14
21
28
35
44
51
58
66
73

2
9
16
23
30
37
47
54
61

10 11 9

1
8
15
22
29
36
45
52
59
67

42
49
56
63
70

0
7
14
21
28
35
44
51
58

43
50
57
65

4
11
18
25
32

2
9
16
23
30
37
44

46
53
60
69

4
11
18
25
32
39
48
55

3
10
17
24
31
38
64
71

1
8
15
22
29
36
45
52
59

2
9
16
23
30
37
45

10 7

0
7
14
21
28
35
43
50
57
65

1
8
15
22
29
36
46

3
10
17
24
31
38

43
50
57
65

42
49
56
63
70

6
13
20
27
34

5
12
19
26
33
40
67

4
11
18
25
32
39

6
13
20
27

6
13
20
27
34

0
7
14
21
28
35
42

5
12
19
26
33

1
8
15
22
29
36

44
51
58
66

0
7
14
21
28

2
9
16
23
30
37
46

3
10
17
24
31

10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54

TABLE 14
Derived Channel Assignment for Problem 11

12

13

W ORST- CASE D EVIATION

O PTIMALITY

OF

BANDWIDTH

Case 1: When s2 s1 2s2 .

FROM

As discussed in the paper, in the worst-case when all

nodes have equal demands (h ), the greedy algorithm
requires a bandwidth B = max[(2s1 + 6s2 ) + (h
1)s0 , (2s1 + 6s2 ) + (h 1)(3s1 + 6s2 )]. That is, B =
(2s1 +6s2 )+(h 1)(3s1 +6s2 ) when s0 (3s1 +6s2 ) and
B = (2s1 +6s2 )+(s0 1)(3s1 +6s2 ) when s0 (3s1 +6s2 ).
The lower bound on the bandwidth requirement for a
single frequency assignment of the entire cellular network having homogeneous demands of h channels per
node can be found from the results (Theorems 1 and 2
in [10]) reported in [10] which have been shown below
for the sake of completeness.
Result 1 (Theorem 1 in [10]): The minimum bandwidth
required for a single frequency assignment to a hexagonal
cellular network with homogeneous demand h and 2-band
buffering with frequency separation s2 s1 2s2 , is
1) (2s1 + 5s2 ) + (h 2)(s0 + 6s2 ) + 6s2 , when s1 s0
(2s1 s2 ),
2) (h 1)(2s1 + 5s2 ) + 6s2 , when (2s1 s2 ) s0 6s2 ,
3) (h 1)(2s1 + 5s2 ) + s0 , when 6s2 s0 (s1 + 5s2 ),
4) (h 1)(2s1 + 5s2 ) + (s1 + 5s2 ), when (s1 + 5s2 )
s0 (2s1 + 5s2 ), and
5) (h 1)s0 + (s1 + 5s2 ), when s0 (2s1 + 5s2 ).
Result 2 (Theorem 2 in [10]): The minimum bandwidth
required for a single frequency assignment to a hexagonal
cellular network with homogeneous demand h and 2-band
buffering with frequency separation s1 2s2 , is
1)

2)
3)
4)
5)

a) (3s1 + 3s2 ) + (h 2)(s0 + 6s2 ) + 6s2 , when

s1 s0 3s2 ,
b) (3s1 + 3s2 ) + (h 2)(3s0 ) + 2s0 , when 3s2
s0 (s1 + s2 ),
(h 1)(3s1 + 3s2 ) + (2s1 + 2s2 ), when (s1 + s2 )
s0 (2s1 + 2s2 ),
(h 1)(3s1 + 3s2 ) + s0 , when (2s1 + 2s2 ) s0
(2s1 + 3s2 ),
(h 1)(3s1 + 3s2 ) + (2s1 + 3s2 ), when (2s1 + 3s2 )
s0 (3s1 + 3s2 ), and
(h 1)s0 + (2s1 + 3s2 ), when s0 (3s1 + 3s2 ).

Let F be the factor by which the bandwidth required

by the proposed greedy algorithm is away from the
lower bound, as given Results 1 and 2 above. We now
consider the following cases:

2s1 +6s2 +(h 1)(3s1 +6s2 )

1) F
=
(2s1 +5s2 )+(h 2)(s0 +6s2 )+6s2 ,
s1 s0 (2s1 s2 ) = F 53 .

when

+6s2 +(h 1)(3s1 +6s2 )

2) F = 2s1(
, when (2s1 s2 )
h 1)(2s1 +5s2 )+6s2
s0 6s2 = F 53 .
+6s2 +(h 1)(3s1 +6s2 )
3) F = 2s1(
, when 6s2 s0
h 1)(2s1 +5s2 )+s0
(s1 + 5s2 ) = F 53 .
2s1 +6s2 +(h 1)(3s1 +6s2 )
4) F
=
(h 1)(2s1 +5s2 )+(s1 +5s2 ) ,
(s1 + 5s2 ) s0 (2s1 + 5s2 ) = F 10
7 .

5)

when

2s1 +6s2 +(h 1)(3s1 +6s2 )

a) F
=
, when
(h 1)s0 +(s1 +5s2 )
(2s1 + 5s2 ) s0 (3s1 + 6s2 ) = F 10
7 .
1 +6s2 +(h 1)(s0 )
b) F = 2s
(h 1)s0 +(s1 +5s2 ) , when s0 (3s1 +
6s2 ) = F 10
7 .

Case 2: When s1 2s2 .

1)

2)
3)
4)
5)

1 +6s2 +(h 1)(3s1 +6s2 )

a) F = (3s2s
, when s1
1 +3s2 )+(h 2)(s0 +6s2 )+6s2
5
s0 3s2 = F 3 .
2s1 +6s2 +(h 1)(3s1 +6s2 )
, when 3s2
b) F = (3s
1 +3s2 )+(h 2)(3s0 )+2s0
5
s0 (s1 + s2 ) = F 3 .
2s1 +6s2 +(h 1)(3s1 +6s2 )
, when (s1 +s2 ) s0
F = (
h 1)(3s1 +3s2 )+(2s1 +2s2 )
(2s1 + 2s2 ) = F 53 .
+6s2 +(h 1)(3s1 +6s2 )
, when (2s1 + 2s2 )
F = 2s1(
h 1)(3s1 +3s2 )+s0
s0 (2s1 + 3s2 ) = F 53 .
2s1 +6s2 +(h 1)(3s1 +6s2 )
, when (2s1 + 3s2 )
F = (
h 1)(3s1 +3s2 )+(2s1 +3s2 )
s0 (3s1 + 3s2 ) = F 10
7
+6s2 +(h 1)(3s1 +6s2 )
a) F = 2s1(
, when (3s1
h 1)s0 +(2s1 +3s2 )
3s2 ) s0 (3s1 + 6s2 ) = F 10
7 .
2s1 +6s2 +(h 1)(s0 )
b) F = (h 1)s0 +(2s1 +3s2 ) , when s0 (3s1
6s2 ) = F 10
7 .

+
+

Considering all the cases, we conclude that the ratio

of the bandwidth required by the proposed greedy algorithm to the optimal bandwidth is always less than
or equal to 5/3. However, for the cases where 1) s0
(s1 + 5s2 ) with s2 s1 2s2 , and 2) s0 (2s1 + 3s2 )
with s1 2s2 , this ratio becomes 10/7. The benchmark
problems 3, 4, 7, 8, 10 and 11 all fall under one of these
two cases.

14

P ROOFS

OF

L EMMAS 4-9

Lemma 4: The results stated in lemmas 2 and 3 can

be extended to assign w channels to each node in an
assignment path as follows: To assign the i-th channel
(1 i w) to each of the nodes in this assignment path,
add an offset (i 1)s0 to the channel number assigned
to the node concerned for single channel assignment as
stated in lemma 2 or 3, as the case may be.
Proof of Lemma 4 : When s1 = 1 or s0 and s1 are coprime, then by lemma 2, we generate the rst sequence
of distinct s0 numbers < 0, s1 , 2s1 (s0 1)s1 >, and
assign to two consecutive lengths of s0 nodes occurring in P = a0 a1 a2 an1 . The assignment looks as
< 0, s1 , 2s1 (s0 1)s1 , 0, s1 , 2s1 (s0 1)s1 >. To
satisfy the second demand form the nodes, we generate the second sequence of distinct s0 numbers <
s0 , s0 + s1 , s0 + 2s1 (2s0 1)s1 >. We assign the second
round of channels by following the same ordering of
the nodes and the assignment looks as < s0 , s0 + s1 , s0 +
2s1 (2s0 1)s1 , s0 , s0 + s1 , s0 + 2s1 (2s0 1)s1 >.
It is seen that the frequency s0 s1 assigned in the
rst round and the frequency s0 assigned in the second
round are separated by s1 , and they do not interfere each
other. We next assign the remaining w 2 channels to
each of the nodes by following the same ordering of
the nodes and nally end up the assignment with the
channel ws0 1, which is the required bandwidth of
the assignment. Similarly, when s0 = ms1 (m 3) and
s1 2), we can assign the i-th channel, 1 i w, to each
node by adding (i 1)s0 to the corresponding channel
in the sequences stated in lemma 3.

Example X1: Let s0 = 7, s1 = 2, s2 = 1 and
each node of the assignment path in Fig. 2 (b) has
a uniform demand w = 2. By lemmas 1 and 2,
we generate the rst sequence of seven frequencies
< 0, 2, 4, 6, 1, 3, 5 >. We assign them to every sequence of
s0 nodes occurring in the assignment path and the assignment looks as < 0, 2, 4, 6, 1, 3, 5, 0, 2, 4, 6, 1, 3, 5, >.
Similarly, the second sequence of s0 frequencies <
7, 9, 11, 15, 8, 10, 12 > are generated and assigned as
< 7, 9, 11, 13, 8, 10, 12, 7, 9, 11, 13, 8, 10, 12, > following
the same ordering of the nodes, without any interference,
as stated in lemma 2.
Lemma 5: For s0 , s1 being co-prime and s0 4, a
pair of assignment paths P1 = a1 a2 a3 an and P2 =
b1 b2 b3 bn forming a set of sparse assignment paths,

we can assign w frequencies to each of the nodes with a

bandwidth of ws0 .
Proof of Lemma 5: The single frequency assignment of
the set of sparse assignment paths in Fig. 4 requires
at least four distinct frequency channels. By lemma 2,
at least the rst four consecutive integers 0, 1, 2 and
3 can be assigned repeatedly to every sequence of s0
nodes along the assignment paths, such that the frequency assigned to a node ak , k = 0, 1, 2, , in P1
is reused for the node ak+2 in P2 . Under such condition, it is seen that the same frequency assigned to ak
in P1 is also reused for ak+s0 , ak+2s0 , ak+3s0 , in P1
and ak+2+s0 , ak+2+2s0 , ak+2+3s0 , in P2 . To assign the
remaining w 1 channels to each of the nodes of the
subnetwork, we apply lemma 4 to generate subsequent
sequences of s0 frequencies and assign them round
by round repeatedly following the same ordering of
the nodes. We nally end up the assignment with the
frequency ws0 1, which is the required bandwidth of
the assignment.

Note: For the set of sparse assignment paths in Fig. 5, we
can similarly prove that the consecutive sequences of s0
channels assigned round by round repeatedly on every
set of s0 nodes occurring in both the assignment paths
P1 and P2 require a bandwidth of ws0 1, for s0 6.
Example X2: Let s0 = 5, s1 = 2, s2 = 1 and
each node of the subgraph in Fig. 4 has a demand
w = 2. By lemmas 2 and 4, we generate the sequence < 0, 2, 4, 1, 3 >. Then, the rst round of the
assignment will look as < 0, 2, 4, 1, 3, 0, 2, 4, 1, 3 >
in P1 and < 1, 3, 0, 2, 4, 1, 3, 0, 2, 4, > in P2 . It is
seen that the frequency assigned to a node ak in P1
is reused for the nodes ak+s0 , ak+2s0 , ak+3s0 , along
the same assignment path. Also, the frequency assigned to the node ak+2 in P2 , is reused for the
nodes ak+2+s0 , ak+2+2s0 , ak+2+3s0 , in P2 . Proceeding
similarly, the second round of the assignment with
the next sequence of frequencies < 5, 7, 9, 6, 8 > will
look as < 5, 7, 9, 6, 8, 5, 7, 9, 6, 8, > in P1 and <
6, 8, 5, 7, 9, 6, 8, 5, 7, 9, > in P2 .
Lemma 6: For a triangle ai aj ai+1 ai with homogeneous
demand w from each of the nodes, we can assign
frequencies to all nodes in such a subgraph with a
bandwidth of (3w 1)s1 , when 2s1 + s2 s0 3s1
and (w 1)s0 + 2s1 , when s0 > 3s1 .
Proof of Lemma 6 : We start with assigning the fre-

15

quency integer 0 to the node ai of the triangle in Fig.

6. We next assign the frequency s1 to the node ai+1
which is distance one apart from ai . The next node aj
is at a distance one from both ai and ai+1 . We assign
the frequency 2s1 to aj , avoiding interference with the
frequencies assigned to both ai and ai+1 . We next start
with assigning the second frequency to the node ai . ai is
already assigned with the frequency 0 in the rst round
and at a distance one from aj , that is assigned with the
frequency 2s1 . To avoid any interference, the minimum
frequency that can be assigned to ai are i) 3s1 , when
2s1 + s2 s0 3s1 and ii) s0 , when s0 > 3s1 . We then
have the following two cases:
Case 1 : When 2s1 + s2 s0 3s1 : The second round of
the assignment starts with assigning the frequency 3s1 to
ai . We next end up the second round of the assignment
by assigning frequencies 4s1 and 5s1 to the nodes ai+1
and aj , respectively, without any conict. Proceeding
similarly for third, fourth wth round, we nally end
up the assignment by assigning the node aj with the
frequency (3w 1)s1 which is the required bandwidth
of the assignment.
Case 2 : When s0 > 3s1 : We assign second round of
frequencies s0 , s0 + s1 and s0 + 2s1 to the nodes ai , ai+1
and aj , respectively satisfying all the frequency separation criteria. To assign the remaining w 2 channels to
each of the nodes, we follow the same ordering of the
nodes and nally end up at node aj with the frequency
(w 1)s0 + 2s1 which is the required bandwidth of the
assignment.

Example X3: Let s0 = 5, s1 = 2, s2 = 1 and w = 3.
Then, we have 2s1 + s2 = 5, 3s1 = 6 and 2s1 + s2
s0 3s1 . Also, (3w 1)s1 = 16, which is last frequency
and the required bandwidth of the assignment. Then,
the frequencies s1 , 2s1 , 3s1 , 4s1 , 5s1 , 6s1 , 7s1 and 8s1
will have values 2, 4, 6, 8, 10, 12, 14 and 16, respectively.
We assign frequencies < 0, 2, 4 >, < 6, 8, 10 > and <
12, 14, 16 > in three consecutive rounds of assignment
to the nodes ai ai+1 aj (Fig. 6), respectively. For case 2, let
s0 = 7, s1 = 2, s2 = 1 and w = 3. Then, 3s1 = 6 and
hence s0 > 3s1 . Also, the last channel and the required
bandwidth (w 1)s0 + 2s1 = 18. The frequencies s1 , 2s1 ,
s0 , s0 + s1 , s0 + 2s1 , 2s0 , 2s0 + s1 and 2s0 + 2s1 will have
values 2, 4, 7, 9, 11, 14, 16 and 18, respectively. We assign
frequencies < 0, 2, 4 >, < 7, 9, 11 > and < 14, 16, 18 > in
three consecutive rounds of the assignment to the nodes
ai ai+1 aj , respectively.

Lemma 7: For s1 2s2 , for a subgraph consisting of

an assignment path P = a0 a1 a2 ai ai+1 ai+2 an1
augmented with two consecutive triangles ai aj ai+1 ai ,
/ P , having homogeneous
ai+2 aj+1 ai+3 ai+2 and aj , aj+1
demand w, we can assign channels to all nodes in such
a subgraph with a bandwidth of (w 1)6s2 + 5s2 , when
2s1 + s2 s0 6s2 and (w 1)s0 + 5s2 , when s0 > 6s2 .
Proof of Lemma 7: We start with assigning frequency
integer 0 to the node ai of the subgraph shown in Fig.
7. We next assign the frequency s2 to the node ai+2
which is at a distance two from ai . Node aj is at a
distance two from ai+2 and one from ai . Since s1 2s2 ,
frequency 2s2 is assigned to aj to avoid any interference.
ai+3 is at a distance two from aj and one from ai+2 ,
and assigned the frequency 3s2 to avoid any conict. By
similar arguments, we assign frequencies 4s2 and 5s2 to
the nodes ai+1 and aj+1 , respectively without causing
any interference. We next start with assigning second
frequency to ai which is already assigned with channel
0, and at a distance three from aj+1 and one from ai+1 .
To avoid any interference, the minimum frequency that
can be assigned to ai are i) 6s2 , when 2s1 + s2 s0 6s2
and ii) s0 , when s0 > 6s2 . We then have the following
two cases:
Case 1 : When 2s1 + s2 s0 6s2 : The second round
of the assignment starts with assigning frequency 6s2 to
the node ai . By following similar arguments as in the
rst round of the channel assignment, we next assign
frequencies 7s2 , 8s2 , 9s2 , 10s2 and 11s2 to the nodes
ai+2 , aj , ai+3 , ai+1 and aj+1 , respectively and end up the
second round of the assignment without any conict.
Proceeding similarly for the third, fourth wth rounds,
we nally end up the assignment at the node aj+1 with
the frequency (w 1)6s2 + 5s2 , which is the required
bandwidth of the assignment.
Case 2 : When s0 > 6s2 : We assign the second round
of frequencies s0 , s0 + s2 , s0 + 2s2 , s0 + 3s2 , s0 + 4s2
and s0 + 5s2 to the nodes ai , ai+2 , aj , ai+3 , ai+1 and
aj+1 , respectively without any conict. To assign the
remaining w 2 channels to each of the nodes, we follow
the same ordering of the nodes and nally end up at
node aj+1 with the frequency (w 1)s0 + 5s2 , which is
the required bandwidth for the assignment.

Lemma 8: Given that s1 2s2 , for a subgraph consisting
of an assignment path P = a0 a1 a2 ai ai+1 ai+2 an1
augmented with two consecutive triangles ai aj ai+1 ai ,

16

ai+2 aj+1 ai+3 ai+2 and aj , aj+1

/ P , with homogeneous
demand w, we can assign frequency channels to all
nodes in such a subgraph with a bandwidth of (w
1)3s1 + 2s1 + s2 , when 2s1 + s2 s0 3s1 and
(w 1)s0 + 2s1 + s2 , when s0 > 3s1 .
Proof of Lemma 8: Similar to lemma 7, we assign frequency integers 0 and s2 to the nodes ai and ai+2 of the
subgraph in Fig. 7, respectively. Node aj is at a distance
two from ai+2 and one from ai . We assign frequency s1
to aj to avoid any interference, as s1 > 2s2 . By similar
arguments as in lemma 7, we assign frequencies s1 + s2 ,
2s1 and 2s1 + s2 to the nodes ai+3 , ai+1 and aj+1 , respectively and complete the rst round of the assignment
without any conict. Proceeding similar to lemma 7, the
minimum frequency that can be assigned for the second
channel to ai are i) 3s1 , when 2s1 + s2 s0 3s1 and
ii) s0 , when s0 > 3s1 . We then have the following two
cases:
Case 1 : When 2s1 + s2 s0 3s1 : We assign second
round of frequency channels 3s1 , 3s1 + s2 , 4s1 , 4s1 +
s2 , 5s1 and 5s1 + s2 to the node ai , ai+2 , aj , ai+3 , ai+1
and aj+1 , respectively without any conict. To assign
the remaining w 2 channels to each of the nodes, we
follow the same ordering of the nodes and nally end
up at node aj+1 with the frequency (w 1)3s1 + 2s1 + s2
which is the required bandwidth for the assignment.
Case 2 : When s0 > 3s1 : We assign second round of
frequency channels s0 , s0 + s2 , s0 + s1 , s0 + s1 + s2 ,
s0 +2s1 and s0 +2s1 +s2 to the nodes ai , ai+2 , aj , ai+3 , ai+1
and aj+1 , respectively without any conict. Proceeding
similarly for the third, fourth wth rounds, we nally
end up at node aj+1 with the frequency (w1)s0 +2s1 +s2
which is the required bandwidth for the assignment. 
Remark R1: The sequence of integers derived in lemmas
7 and 8 can be repeatedly used if the path is augmented
with further sets of two consecutive triangles.
Example X4: Let s0 = 5, s1 = 2, s2 = 1 and each node
of the subgraph in Fig. 7 has a demand w = 2. Then
2s1 +s2 = 5, 6s2 = 6 and 2s1 +s2 s0 6s2 . By lemma 7,
the frequencies s2 , 2s2 , 3s3 , 4s2 and 5s2 will have values
1, 2, 3, 4 and 5, respectively. We assign the frequencies
< 0, 1, 2, 3, 4, 5 > for the rst rounds of the assignment
to the nodes ai ai+2 aj ai+3 ai+1 aj+1 . Similarly, we have the
next sequence of frequencies < 6, 7, 8, 9, 10, 11 > which
are assigned following the same ordering of the nodes
for the second round of the assignment. The required

bandwidth of the assignment is 11.

Lemma 9: For a quadrilateral ai ai+1 ak aj ai with homogeneous demand w from each of the nodes, we can
assign frequencies to all nodes in such a subgraph with
a bandwidth of (4w 1)s1 , when 2s1 + s2 s0 4s1 and
(w 1)s0 + 3s1 when s0 > 4s1 .
Proof of Lemma 9: We start with assigning frequency
integer 0 to the node ai of the quadrilateral in Fig. 8.
Any two consecutive nodes in the order ai , ai+1 , ak ,
aj are distance one apart. We assign frequencies s1 ,
2s1 and 3s1 to the nodes ai+1 , ak and aj , respectively,
without any conict. We next start with assigning the
second channel to ai and to avoid any interference, the
minimum frequency that can be assigned to ai are i) 4s1 ,
when 2s1 + s2 s0 4s1 and ii) s0 , when s0 > 4s1 . We
then have the following two cases:
Case 1 : When 2s1 + s2 s0 4s1 : We complete the
second round of the assignment by assigning frequencies
4s1 , 5s1 , 6s1 and 7s1 to the nodes ai , ai+1 , ak and aj , respectively, without any conict. To assign the remaining
w 2 channels to each of the nodes, we follow the same
ordering of the nodes and nally end up at node aj with
the frequency (4w1)s1 which is the required bandwidth
for the assignment.
Case 2 : When s0 > 4s1 : We complete the second round
of the assignment by assigning frequencies s0 , s0 + s1 ,
s0 + 2s1 and s0 + 3s1 to the nodes ai , ai+1 , ak and aj ,
respectively, without any conict. Proceeding similarly
up to w rounds, we nally end up by assigning aj
with the frequency number (w 1)s0 + 3s1 which is the
required bandwidth for the assignment.

Example X5: Let s0 = 7, s1 = 2, s2 = 1 and each node
of the subgraph in Fig. 8 has a demand w = 2. Then
2s1 + s2 = 5, 4s1 = 8 and 2s1 + s2 s0 4s1 . The
frequencies 0, s1 , 2s1 , 3s1 , 4s1 , 5s1 , 6s1 and 7s1 will
have values 0, 2, 4, 6, 8, 10, 12, 14, respectively. We assign
the frequencies < 0, 2, 4, 6 > and < 8, 10, 12, 14 > for
two consecutive rounds of the assignment to the nodes
ai ai+2 aj ai+3 ai+1 aj+1 with a bandwidth of 14.