1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Irina-Kira [14]
4 years ago
10

1. Consider a city of 10 square kilometers. A macro cellular system design divides the city up into square cells of 1 square kil

ometer, where each cell can accommodate 100 users. Find the total number of users that can be accommodated in the system and the length of time it takes a mobile user to traverse a cell (approximate time needed for a handover) when moving at 30 Km/hour. If the cell size is reduced to 100 square meters and everything in the system scales so that 100 users can be accommodated in these smaller cells, and the total number of users the system can accommodate and the length of time it takes to traverse a cell.
Engineering
1 answer:
kakasveta [241]4 years ago
8 0

Answer:

a) n = 1000\,users, b)\Delta t_{min} = \frac{1}{30}\,h, \Delta t_{max} = \frac{\sqrt{2} }{30}\,h, \Delta t_{mean} = \frac{1 + \sqrt{2} }{60}\,h, c) n = 10000000\,users, \Delta t_{min} = \frac{1}{3000}\,h, \Delta t_{max} = \frac{\sqrt{2} }{3000}\,h, \Delta t_{mean} = \frac{1 + \sqrt{2} }{6000}\,h

Explanation:

a) The total number of users that can be accomodated in the system is:

n = \frac{10\,km^{2}}{1\,\frac{km^{2}}{cell} }\cdot (100\,\frac{users}{cell} )

n = 1000\,users

b) The length of the side of each cell is:

l = \sqrt{1\,km^{2}}

l = 1\,km

Minimum time for traversing a cell is:

\Delta t_{min} = \frac{l}{v}

\Delta t_{min} = \frac{1\,km}{30\,\frac{km}{h} }

\Delta t_{min} = \frac{1}{30}\,h

The maximum time for traversing a cell is:

\Delta t_{max} = \frac{\sqrt{2}\cdot l }{v}

\Delta t_{max} = \frac{\sqrt{2} }{30}\,h

The approximate time is giving by the average of minimum and maximum times:

\Delta t_{mean} = \frac{1+\sqrt{2} }{2}\cdot\frac{l}{v}

\Delta t_{mean} = \frac{1 + \sqrt{2} }{60}\,h

c) The total number of users that can be accomodated in the system is:

n = \frac{10\times 10^{6}\,m^{2}}{100\,m^{2}}\cdot (100\,\frac{users}{cell} )

n = 10000000\,users

The length of each side of the cell is:

l = \sqrt{100\,m^{2}}

l = 10\,m

Minimum time for traversing a cell is:

\Delta t_{min} = \frac{l}{v}

\Delta t_{min} = \frac{0.01\,km}{30\,\frac{km}{h} }

\Delta t_{min} = \frac{1}{3000}\,h

The maximum time for traversing a cell is:

\Delta t_{max} = \frac{\sqrt{2}\cdot l }{v}

\Delta t_{max} = \frac{\sqrt{2} }{3000}\,h

The approximate time is giving by the average of minimum and maximum times:

\Delta t_{mean} = \frac{1+\sqrt{2} }{2}\cdot\frac{l}{v}

\Delta t_{mean} = \frac{1 + \sqrt{2} }{6000}\,h

You might be interested in
Why might construction crews want to install pipes before the foundation is poured?
denpristay [2]
I’m a concrete mason myself and I can tell you it is a pain in the butt to Roto hammer a hole into the concrete to put the pipe in it’s a lot easier to just pour the concrete around it
6 0
3 years ago
(40 points) Program the following sorting algorithms: InsertionSort, MergeSort, and QuickSort. There are 9 test les uploaded for
babunello [35]

Answer:

Explanation:

MERGE SORT

#include<stdlib.h>

#include<stdio.h>

#include<string.h>

void merge(int arr[], int l, int m, int r)

{

int i, j, k;

int n1 = m - l + 1;

int n2 = r - m;

 

int L[n1], R[n2];

for (i = 0; i < n1; i++)

L[i] = arr[l + i];

for (j = 0; j < n2; j++)

R[j] = arr[m + 1+ j];

i = 0;

j = 0;

k = l;

while (i < n1 && j < n2)

{

if (L[i] <= R[j])

{

arr[k] = L[i];

i++;

}

else

{

arr[k] = R[j];

j++;

}

k++;

}

while (i < n1)

{

arr[k] = L[i];

i++;

k++;

}

while (j < n2)

{

arr[k] = R[j];

j++;

k++;

}

}

void mergeSort(int arr[], int l, int r)

{

if (l < r)

{

int m = l+(r-l)/2;

mergeSort(arr, l, m);

mergeSort(arr, m+1, r);

merge(arr, l, m, r);

}

}

void printArray(int A[], int size)

{

int i;

for (i=0; i < size; i++)

printf("%d ", A[i]);

printf("\n");

}

int main()

{

int arr[1000] = {0};

int arr_size =0;

int data;

char file1[20];

strcpy(file1,"data.txt");

FILE *fp;

fp = fopen(file1,"r+");

if (fp == NULL) // if file not opened return error

{

perror("Unable to open file");

return -1;

}

else

{

fscanf (fp, "%d", &data);    

arr[arr_size]=data;

arr_size++;

while (!feof (fp))

{  

fscanf (fp, "%d", &data);  

arr[arr_size]=data;

arr_size++;    

}

}

printf("Given array is \n");

printArray(arr, arr_size);

mergeSort(arr, 0, arr_size - 1);

printf("\nSorted array Using MERGE SORT is \n");

printArray(arr, arr_size);

return 0;

}

3 0
3 years ago
3. (a) (5 points) Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queue
Bezzdna [24]

Answer:

(N-1) × (L/2R) = (N-1)/2

Explanation:

let L is length of packet

R is rate

N is number of packets

then

first packet arrived with 0 delay

Second packet arrived at = L/R

Third packet arrived at = 2L/R

Nth packet arrived at = (n-1)L/R

Total queuing delay = L/R + 2L/R + ... + (n - 1)L/R = L(n - 1)/2R

Now

L / R = (1000) / (10^6 ) s = 1 ms

L/2R = 0.5 ms

average queuing delay for N packets = (N-1) * (L/2R) = (N-1)/2

the average queuing delay of a packet = 0 ( put N=1)

4 0
3 years ago
a) find the state-space representation of the system. b) is the system controllable? why? c) is the system observable? why
mart [117]

If a controlled input can transfer (alter) the control system's initial states to some other desired states in a finite amount of time, the control system is said to be controllable.

Using Kalman's test, we can determine whether a control system is controllable. The evolution model for the state variables (time-varying unknowns) and the observation model, which connects the observations to the state variables, make up the state space representation of a dynamical system. The capacity to move a system about in its full configuration space using just specific permitted actions is generally referred to as controllability. The precise definition changes slightly depending on the model type or framework used.

Learn more about control here-

brainly.com/question/28540307

#SPJ4

5 0
1 year ago
Unlike expendable molds, permanent molds do not collapse, so the mold must be opened before appreciable cooling contraction occu
Pani-rosa [81]

Answer: True

Explanation:

Permanent molds do not collapse, unlike expendable molds so the mold must be opened before appreciable cooling contraction occurs in order to prevent cracks from developing in the casting.

The metal casting becomes solid inside the mold after it has been poured. But during the process of manufacture, before the would cools any further, they usually remove the metal cast in order to stop excess contractions of the solid metal casting in the mold. This is done to prevent prevent cracks from developing in the casting since permanent mold do not collapse.

8 0
3 years ago
Other questions:
  • List four reasons why we need aceuracy in machined parts.
    8·1 answer
  • A Service Schedule is...
    8·2 answers
  • A fatigue test was conducted in which the mean stress was 90 MPa (13050 psi), and the stress amplitude was 190 MPa (27560 psi).
    14·1 answer
  • While discussing VIN numbers, Technician A says that the first digit of the VIN identifies the country where the vehicle was man
    15·1 answer
  • • Differentiate between laboratory and industrial reactors​
    11·1 answer
  • Your new team is working hard, but they are all less experienced than you and don't complete their tasks as quickly.What would y
    8·1 answer
  • How do you solve this. I dont know how so I need steps if you dont mind
    13·1 answer
  • if when you put your shirt in your pants, your shirt is tucked, does that mean when your shirt is over your pants, your pants ar
    6·2 answers
  • How does a rudder help maneuver an airplane?
    7·1 answer
  • 50.38
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!