Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
1. What is the value of R when the generator G: = 1001 and the data D = 11000111010? 2. In Section 6.3, the efficiency of slotted ALOHA was roughly derived. Complete the derivation process in this problem. a. Given N active nodes, the efficiency of slotted ALOHA is Np(1 - p) N-1. Find the value of p that maximizes this expression. b. Using the value of p found in (a), determine the efficiency of slotted ALOHA as N approaches infinity. (Hint: (1 - 1/N) approaches 1/e as N approaches infinity.) 3. In the CSMA/CD protocol, an adapter waits for 536K bit times after a collision (where K is chosen randomly). When K = 115, how long does the adapter wait before returning to step 2 on a 10 Mbps broadcast channel? How long does it wait on a 100 Mbps broadcast channel? 4. Consider the CDMA example with one transmitter as shown in Figure 7.5. If the transmitter's CDMA code is (1, 1, −1, 1, 1, −1, − 1, 1), what is the transmitter's output for the two data bits in Figure 7.5? 5. If two CDMA transmitters have codes (1, 1, 1, −1, 1, −1, −1, −1) and (1, −1, 1, 1, 1, 1, 1, 1), respectively, can a receiver correctly interpret the data? 6. Suppose an 802.11b station is set to always use RTS/CTS to reserve the channel. If this station suddenly transmits 1,000 bytes of data and all other stations are idle, calculate the time it takes to send the frame and receive an ACK as a function of SIFS and DIFS. Assume the transmission rate is 12 Mbps, propagation delay is negligible, and there are no bit errors.

1. What is the value of R when the generator G: = 1001 and the data D = 11000111010? 2. In Section 6.3, the efficiency of slotted ALOHA was roughly derived. Complete the derivation process in this problem. a. Given N active nodes, the efficiency of slotted ALOHA is Np(1 - p) N-1. Find the value of p that maximizes this expression. b. Using the value of p found in (a), determine the efficiency of slotted ALOHA as N approaches infinity. (Hint: (1 - 1/N) approaches 1/e as N approaches infinity.) 3. In the CSMA/CD protocol, an adapter waits for 536K bit times after a collision (where K is chosen randomly). When K = 115, how long does the adapter wait before returning to step 2 on a 10 Mbps broadcast channel? How long does it wait on a 100 Mbps broadcast channel? 4. Consider the CDMA example with one transmitter as shown in Figure 7.5. If the transmitter's CDMA code is (1, 1, −1, 1, 1, −1, − 1, 1), what is the transmitter's output for the two data bits in Figure 7.5? 5. If two CDMA transmitters have codes (1, 1, 1, −1, 1, −1, −1, −1) and (1, −1, 1, 1, 1, 1, 1, 1), respectively, can a receiver correctly interpret the data? 6. Suppose an 802.11b station is set to always use RTS/CTS to reserve the channel. If this station suddenly transmits 1,000 bytes of data and all other stations are idle, calculate the time it takes to send the frame and receive an ACK as a function of SIFS and DIFS. Assume the transmission rate is 12 Mbps, propagation delay is negligible, and there are no bit errors.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

인터넷 공학이라는 과목의 해당 문제들인데 어떻게 풀어야되는지 모르겠어 
쉽게 설명해줘

1. What is the value of R when the generator G: = 1001 and the data D = 11000111010? 2. In Section 6.3, the efficiency of slotted ALOHA was roughly derived. Complete the derivation process in this problem. a. Given N active nodes, the efficiency of slotted ALOHA is Np(1 - p) N-1. Find the value of p that maximizes this expression. b. Using the value of p found in (a), determine the efficiency of slotted ALOHA as N approaches infinity. (Hint: (1 - 1/N) approaches 1/e as N approaches infinity.) 3. In the CSMA/CD protocol, an adapter waits for 536K bit times after a collision (where K is chosen randomly). When K = 115, how long does the adapter wait before returning to step 2 on a 10 Mbps broadcast channel? How long does it wait on a 100 Mbps broadcast channel? 4. Consider the CDMA example with one transmitter as shown in Figure 7.5. If the transmitter's CDMA code is (1, 1, −1, 1, 1, −1, − 1, 1), what is the transmitter's output for the two data bits in Figure 7.5? 5. If two CDMA transmitters have codes (1, 1, 1, −1, 1, −1, −1, −1) and (1, −1, 1, 1, 1, 1, 1, 1), respectively, can a receiver correctly interpret the data? 6. Suppose an 802.11b station is set to always use RTS/CTS to reserve the channel. If this station suddenly transmits 1,000 bytes of data and all other stations are idle, calculate the time it takes to send the frame and receive an ACK as a function of SIFS and DIFS. Assume the transmission rate is 12 Mbps, propagation delay is negligible, and there are no bit errors.
Transcribed Image Text:1. What is the value of R when the generator G: = 1001 and the data D = 11000111010? 2. In Section 6.3, the efficiency of slotted ALOHA was roughly derived. Complete the derivation process in this problem. a. Given N active nodes, the efficiency of slotted ALOHA is Np(1 - p) N-1. Find the value of p that maximizes this expression. b. Using the value of p found in (a), determine the efficiency of slotted ALOHA as N approaches infinity. (Hint: (1 - 1/N) approaches 1/e as N approaches infinity.) 3. In the CSMA/CD protocol, an adapter waits for 536K bit times after a collision (where K is chosen randomly). When K = 115, how long does the adapter wait before returning to step 2 on a 10 Mbps broadcast channel? How long does it wait on a 100 Mbps broadcast channel? 4. Consider the CDMA example with one transmitter as shown in Figure 7.5. If the transmitter's CDMA code is (1, 1, −1, 1, 1, −1, − 1, 1), what is the transmitter's output for the two data bits in Figure 7.5? 5. If two CDMA transmitters have codes (1, 1, 1, −1, 1, −1, −1, −1) and (1, −1, 1, 1, 1, 1, 1, 1), respectively, can a receiver correctly interpret the data? 6. Suppose an 802.11b station is set to always use RTS/CTS to reserve the channel. If this station suddenly transmits 1,000 bytes of data and all other stations are idle, calculate the time it takes to send the frame and receive an ACK as a function of SIFS and DIFS. Assume the transmission rate is 12 Mbps, propagation delay is negligible, and there are no bit errors.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS