Decreasing the normalized reuse distance will decrease the capacity and decrease the interface- F.

Mobile Evaluated Handover (MEHO) means that the mobile sends measurements to the network, and the network
decides whether a handover should be initiated or not- F. Signal-to-interference ratio and received signal strength are two common decision variables for handover- T. The Erlang loss and the Erlang delay formula are
the same- ?. In a cognitive network, except the channel conditions we can utilize the statistics of the traffic of the users to allow a more efficient operation by predicting traffic patterns- T. In a wireless transmission
the channel remains static- F. Increasing the handover margin increases the handover decision delay and have negative impact on interference.- T. The correspondent node (CN) in Mobile IP does not need to be
aware of the location of the mobile node (MN)-T. Mobile evaluated handover (MEHO) requires an associated signalling channel to report measurements from the mobile terminal to the network-F. ALOHA is a
protocol that provides access to the channel through frequency division-F. Software Defined Radio is a way to create network equipment that can be updated with enhanced features without changing the hardware-
T. The throughput in packets per slot for the slotted ALOHA can be 1.01 depending on the conditions of the network-F. Increasing the normalized reuse distance will reduce the capacity and the interference- T.
Reducing cell sizes is a common way to increase the capacity in a network-T. Increasing the transmission power of a base station will increase the coverage of that cell, but also increase the interference of
neighbouring cells-T. If the call holding time and dwell time are exponentially distributed then the channel holding time follows the Poisson distribution-F. In a Cognitive network, except the channel conditions we
can utilize the statistics of the traffic of the users to allow a more efficient operation by predicting traffic patterns-T. In pure ALOHA, the users transmit any time they want thus, the throughput is always higher than
slotted ALOHA-F.

[1] Assume the probability of handoff is 𝑃ℎ and the probability of handoff dropping is 𝑃ℎ𝑓 . The probability of first handoff dropping = 𝑃ℎ *𝑃ℎ𝑓 . The probability
of second handoff dropping = 𝑃ℎ (1 − 𝑃ℎ𝑓 ) ∗ 𝑃ℎ *𝑃ℎ𝑓 = 𝑃ℎ ^2*(1- 𝑃ℎ𝑓 )* 𝑃ℎ𝑓 . Then the probability of third handoff dropping = 𝑃ℎ (1 − 𝑃ℎ𝑓 ) ∗ 𝑃ℎ (1 − 𝑃ℎ𝑓 ) ∗
2 𝑛−1
𝑃ℎ ∗ (𝑃ℎ𝑓 ) = 𝑃ℎ3 ∗ (1 − 𝑃ℎ𝑓 ) ∗ 𝑃ℎ𝑓 . So, the probability of nth handoff dropping is 𝑃ℎ𝑛 ∗ (1 − 𝑃ℎ𝑓 ) ∗ 𝑃ℎ𝑓 the probability of forced-termination is: [2]

𝐶 𝑢 = 5 ∗ 𝐶 𝑃 = 1 , α = 0.05 U = [4u;3u;7u;u], Becouse there is no users moving from cell 1 to cell 4 the cell configuration is like this: (en liten bild) [3]. When
on always update scheme is applied the 4 cells are in the different Tas, so Sij = [1 0 0 0; 0 1 0 0; 0 0 1 0; 0 0 0 1] handoff means users being called move from
one cell to another so H = α * M overall signaling overhead for an always update scheme = 𝐶 𝑢 ∗ α (2.5m + 3m + 3m + m + 1.5m + 2.5m + m + 2m +
2m + 1.5m), when never update scheme is applied Sij = [0 1 1 1; 1 0 1 1; 1 1 0 1; 1 1 1 0] and α *[4u+3u+7u+u]*3*𝐶 𝑃 = 45* α*𝐶 𝑃 *u = 9/20 u. when 9/20<
m, u < 20/9m, never update scheme is better than always update scheme, when u< 20/9m the cost in never update scheme is less than that in always
update scheme.