The main idea behind the Global System Mobile (GSM) cellular radio system is frequency reuse. Due to the increasing demand in the cellular radio, there is a need to increase the capacity of the system. Consider a case where initially, a cluster size of N=7 hexagonal cells is employed by the network planning engineer in Batu Pahat in year 2000. The area is covered by 6 clusters to support full coverage in Batu Pahat area. The allocated spectrum is 35 MHz and the traffic intensity of each subscriber is estimated to be 0.1 Erlang. Calculate the number of users that can communicate simultaneously in Batu Pahat area. (b) Given a Grade of Service (GOS) of 2%, calculate the number of users that can be supported in the Batu Pahat area.

The main idea behind the Global System Mobile (GSM) cellular radio system is frequency reuse. Due to the increasing demand in the cellular radio, there is a need to increase the capacity of the system. Consider a case where initially, a cluster size of N=7 hexagonal cells is employed by the network planning engineer in Batu Pahat in year 2000. The area is covered by 6 clusters to support full coverage in Batu Pahat area. The allocated spectrum is 35 MHz and the traffic intensity of each subscriber is estimated to be 0.1 Erlang. Calculate the number of users that can communicate simultaneously in Batu Pahat area. (b) Given a Grade of Service (GOS) of 2%, calculate the number of users that can be supported in the Batu Pahat area.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter8: Network Models

Section8.6: Minimum Spanning Tree Problems

Problem 4P

See similar textbooks

Similar questions

Q5. A given ad hoc network consists of 100 nodes, and the mobility of the nodes is such that every second, two existing radio connections are broken, while two new radio links are established. Assuming each node is connected to exactly four adjacent nodes, find the total number of communications links in the network.
Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 5.1. I am in need of help solving this problem and figuring out how to come up with the values in the table.
Verizon decides to use a cell planning scheme that endures a worst case SIR of 15dB. Find the optimal value of the cluster size N assuming a path loss exponent of 2, for each of the following cases:a) Omnidirectional antennas.b) 30 degree sectoring.c) 45 degree sectoring.d) Which option would you recommend?
Consider Pastry network that uses DHT, in which m=4 and b=2. Currently the network has 7 nodes, N01, N03, N11, N12, N20, N23, and N33, and 4 keys, K10, K13, K21, and K30. Although it is unrealistic, assume that the proximity metric between each two nodes is based on numerical closeness. The following path is the node N12’s routing response to the query asking for the key K30: A. N12 ► N33. B. N12 ► N33 ► N23. C. N12 ► N03 ► N33. D. None of the above.
Q3 Consider a wireless cellular network with one base station and two mobile users. The base station has 10 MHz bandwidth to allocate to the two users. The SNR of user 1 is 15, and the SNR of user 2 is 3. The link capacities are determined by Shannon capacity. Find the optimal resource (bandwidth) allocation for the following criteria: (A) maximizing total throughput; (B) max-min fairness; (C) proportional fairness. Show how you derive the answers.
Computer Science This problem illustrates some of the difficulties facing network planners when they have to use OADMs that are constrained in what channels they can add and drop. Consider a four-node linear network with nodes A, B, C, and D in that order. We have three wavelengths lambda-1, lambda-2, and lambda-3 available. The OADMs given to us can drop two fixed channels i.e., we can put OADMs that drop either (lambda-1, lambda-2), or (lambda-2, lambda-3), or (lambda-1, lambda-3). Now consider the situation where we need to set up the following light paths – AB, BC, CD, AC, and BD. A) What OADMs would you deploy at each node? B) At a later point, the light path traffic changes and we need to replace light paths AC and BD with AD and BC. What changed would you have to make in order to support the new traffic.
With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from D to all network nodes. Show how the algorithm works by filling in the following table, where d(x) is the cost of the least-cost path from the source node D to destination x as of the current iteration of the algorithm, p(x) is the previous node (neighbor of x) along the current least-cost path from the source D to x, N’ is the subset of nodes whose shortest path from the source D has definitely been known. According to the table computed in 1), show the shortest path tree rooted at D. According to the results from 1) and 2), create the forwarding table, in which each row consists of two fields, destination and next hop.
HereHere in question distances between nodes in an eight-node network is presented in the from-to distance table below. What is the shortest distance between node 1 to node 8?.
Consider the following network: (a) Which of the following most accurately describes the connectedness of this network? Strongly Weakly Disconnected None of the above (b) When discussing path lengths on a weighted graph, one must first define how the weights are related to the length of a path between two nodes is then the sum of the distances of the links in that path. Consider the previous network and assume that the link weights represent distances. Using this distance metric, what is the shortest path between nodes 1 and 6? (c) A common way to define the distance between two nodes is the inverse (or reciprocal) of the link weight. Consider the previous network and assume that the distance between two adjacent nodes is defined as the reciprocal of the link weight. Using this distance metric, what is the shortest path between node 1 and 6?
Consider the following tele-traffic scenario faced by the Nizwa Firq Telephone Exchange. On a particular day from 6am to 6.15am, the exchange handles 8 calls of average call duration 1 mins. The number of calls and the average call duration both doubles (from its values in previous time slot) every 15 mins untill 7am. Calculate the total traffic handled by the telephone exchange for the time duration 6am to 7am.
P3. Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 5.1 .
In order to function optimally, what are the three conditions that must be true for each given network? Spend a minute or so explaining what one is like in your own words.