| Input: A wireless network has channels and base |
| stations. Initially, each BS is assigned
an equal number of |
| channels. |
| Output: Based on the blocking probabilities of ECG and non-ECG |
| calls, channels are
dynamically assigned among BSs. |
| Channels are allocated to reduce the blocking
and dropping |
| probability of ECG data calls. |
| begin |
| 1: for each base station, do |
| 2: base station first computes the blocking prob- |
| abilities of
ECG and non-ECG calls and sends this |
| information along with the list of
occupied channels |
| to the neighboring base stations. |
| 3: Using the information of blocking
probabilities in the |
| local and the neighboring base stations, base station |
| decides whether a request should be made to |
| move an appropriate free channel from neighboring |
| base stations, and then
implements its decision. |
| 4: if (number of free
channels under base station, |
| TFC) and (a neighboring base station requests |
| a free channel) then |
| 5: An appropriate free
channel is moved from base |
| station to the neighboring base station requesting |
| a
free channel. |
| 6: else if (an ECG-data call
arrives) then |
| 7: if (a free channel is available) then |
| 8: Assign a free channel to the ECG-data
call. |
| 9: end if |
| 10: else if (a non-ECG-data call
arrives) then |
| 11: if (number of free channels under
base station) |
| then |
| 12: Assign a free channel to the new call. |
| 13: end if |
| 14: end if |
| 15: end for |
| end |
