EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 7, Problem P3P
Program Plan Intro
CDMA:
- It is known as “Code-Division Multiple Access”.
- Many radio communication technologies use the CDMA.
- It is an example of multiple accesses, where many transmitters can send data concurrently in a single communication channel.
- It belongs to the family of channel partitioning protocols and it also prevent in WLAN and cellular technologies.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Suppose that a binary message – either 0 or 1 – must be transmitted by wire from location Ato location B. However, the data sent over the wire are subject to a channel noise disturbance,so to reduce the possibility of error, the value 2 is sent over the wire when the message is1, and the value −2 is sent when the message is 0. If X, X = {−2,2}, is the value sent atlocation A, the value received at location B, denoted as R, is given byR = X + N ,where N is the channel noise disturbance, which is independent of X. When the message isreceived at location B, the receiver decodes it according to the following rule:if R ≥.5, then conclude that message 1 was sentif R < .5, then conclude that message 0 was sentAssuming that the channel noise, N, is a unit normal random variable and that the message0 or 1 is sent with equal probability, what is the probability that we conclude that the wrongmessage was sent? This is the probability of error for this communication channel
Consider the following scenario:
Frames of 12000 bits are sent over a 400kbps channel using a satellite whose propagation delay is 270ms.
Acknowledgements are always piggybacked onto data frames. (That is, in the case of stop-and-wait, the next frame cannot be transmitted until the entire frame containing the acknowledgement is received.)
Five-bit sequence numbers are used.
What is the maximum achievable channel utilization for
(a) Stop-and-wait.
(b) Protocol 5 (i.e., Go Back N).
(c) Protocol 6 (i.e., Selective Repeat)
Suppose that a SW ARQ system with 1-bit sequence numbering has a time-out value
that is less than the time required to receive an ACK. Station A sends 5 frames to station
B. No errors occur during transmission of all 5 frames. One ACK is lost when it is
transmitted the first time (see the following table), and no
transmission of that ACK. No errors occur during transmission of the other 4 ACKS.
Sketch the sequence of frame exchanges that transpire between stations A and B.
(а)
error occurs in re-
Last digit of your student ID number
0, 1
2, 3
Lost ACK
1
4, 5
6, 7
8, 9
2
3
4
Chapter 7 Solutions
EBK COMPUTER NETWORKING
Ch. 7 - Prob. R1RQCh. 7 - Prob. R2RQCh. 7 - Prob. R3RQCh. 7 - Prob. R4RQCh. 7 - Prob. R5RQCh. 7 - Prob. R6RQCh. 7 - Prob. R7RQCh. 7 - Prob. R8RQCh. 7 - Prob. R9RQCh. 7 - Prob. R10RQ
Ch. 7 - Prob. R11RQCh. 7 - Prob. R12RQCh. 7 - Prob. R13RQCh. 7 - Prob. R14RQCh. 7 - Prob. R15RQCh. 7 - Prob. R16RQCh. 7 - Prob. R17RQCh. 7 - Prob. R18RQCh. 7 - Prob. R19RQCh. 7 - Prob. R20RQCh. 7 - Prob. R21RQCh. 7 - Prob. R22RQCh. 7 - Prob. R23RQCh. 7 - Prob. P1PCh. 7 - Prob. P2PCh. 7 - Prob. P3PCh. 7 - Prob. P5PCh. 7 - Prob. P6PCh. 7 - Prob. P7PCh. 7 - Prob. P8PCh. 7 - Prob. P10PCh. 7 - Prob. P11PCh. 7 - Prob. P12PCh. 7 - Prob. P13PCh. 7 - Prob. P14PCh. 7 - Prob. P15PCh. 7 - Prob. P16P
Knowledge Booster
Similar questions
- 2. Consider a bus-topology network with five stations. A reservation access method is used. Each station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1 microsecond = 106 second). For each station, one data transmission sends 1000 bits. The transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit "Mbps")?arrow_forwardQ3.Unless specified otherwise, use the free space propagation speed of light 3x108 m/s to calculate the propagation delay. For numerical calculations, the results must show the appropriate unit. Show me a complete solution NOT THE AI SOLUTION. Consider a digital multimedia transmission system. Separate audio and video coders are used to encode these signals. Audio and video bits are packed in packets together and transmitted over a transmission link. Each packet is 2,000 bytes long, which includes a 48-byte header. The system generates one packet every 40 ms. Calculate the following values:a. The minimum data transmission rate required to support the above system.b. The minimum signal-to-noise ratio (SNR) in dB required to transmit the above audio and video information. Assume a 400-kHz transmission channel bandwidth is used.c. The end-to-end packet delay over a 50-km link, using answer in Part a).arrow_forwardFrames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). 1.1 What is the minimum number of bits (1) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.arrow_forward
- Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. NRZ-Iusing each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.arrow_forwardConsider an (n, k) block code with the following generator matrix. Find the following: * The values of n and k. * The detection and correction capacities of the code. * The codeword c for the message mF1001. 0 1 0 1 10 0 1 0 10 10 0 0 1 1 0 0 1 0 1 1 0 0 0 0 1 G = The syndrome for the received vector r= 1101011. Assume this code is used on a channel with Poe=0.01. What is the probability of receiving codeword free from error?arrow_forwardConsider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…arrow_forward
- Consider a sender having an infinite number of frames to send, which we index as 0, 1, 2, .... Assume the transmission delay of each frame is 2t, the ACK transmission time is t, the propagation delay is 3t and symmetric on both directions, and the timeout value is T = 8 starting from the end of frame transmission onto the link. The first frame is sent out at time 0. Show Transcribed Text 3 Ĉ E. Explain what will happen if the sequence number space has exactly the same number of sequence numbers as the number of allowed maximum number of outstanding frames, e.g., when N = W = 10, and the sequence numbers available are only 0-9.arrow_forwardb) The distance between a sender and a receiver of a data communication system is 1400 km and the propagation speed is 2.5 x 10° m/s. The system uses 5-bit sequence numbers whenever possible. Ignore waiting and processing delays. Also ignore the overhead due to the header and the trailer and assume no data or control frame is lost or damages during transmission. If each packet carries 1000 bits of data how long does it take to send 7 million bits of data for the following cases: If Go-Back-N ARQ protocol is used. If Selective-Repeat ARQ protocol is used. ii.arrow_forwardQ3.Unless specified otherwise, use the free space propagation speed of light 3x108 m/s to calculate the propagation delay. For numerical calculations, the results must show the appropriate unit. Show a complete solution for each problem in your submission. Consider a digital multimedia transmission system. Separate audio and video coders are used to encode these signals. Audio and video bits are packed in packets together and transmitted over atransmission link. Each packet is 2,000 bytes long, which includes a 48-byte header. The system generates one packet every 40 ms. Calculate the following values:a. The minimum data transmission rate required to support the above system.b. The minimum signal-to-noise ratio (SNR) in dB required to transmit the above audio and video information. Assume a 400-kHz transmission channel bandwidth is used.c. The end-to-end packet delay over a 50-km link, using answer in Part a).arrow_forward
- b) The distance between a sender and a receiver of a data communication system is 1400 km and the propagation speed is 2.5 x 10° m/s. The system uses 5-bit sequence numbers whenever possible. Ignore waiting and processing delays. Also ignore the overhead due to the header and the trailer and assume no data or control frame is lost or damages during transmission. If each packet carries 1000 bits of data how long does it take to send 7 million bits of data for the following cases: i. If Go-Back-N ARQ protocol is used. ii. If Selective-Repeat ARQ protocol is used. c) Compare and contrast byte-stuffing and bit-stuffing, then demonstrate bit-stuffing the following frame payload shown in Figure 3(c). 111110 1011| 1 1 1 1|o0 1 10|O Figure 3(c)arrow_forwardNetworking question: Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. differential Manchester scheme using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.arrow_forwardConsider a half-duplex point-to-point link using a stop-and-wait scheme, in which a series of messages is sent, with each message segmented into a number of frames. Ignore errors and frame overhead. A. What is the effect on line utilization of increasing the message size so that fewer messages will be required? Other factors remain constant. B. What is the effect on line utilization of increasing the number of frames for a constant message size? C. What is the effect on line utilization of increasing frame size?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning