CSE 963: Computer Networks I Homework-3
\nDue date: Friday 03\/03\/2024
\nPROCEDURE:
\n1. (20 points) Write a program (in any language) that generates an ??-bit frame for transmission from a k-bit data block D and a (??-??+1) bit CRC divisor P. Compile and run the program with at least two set of inputs to confirm that this program is generating CRC patterns correctly.
\nNow, modify the program that performs the following steps:
\n(a) Generates a message of ?? =10 bits.
\n(b) Uses the previous code with P=110101 to generate the corresponding 15-bit frame T for transmission.
\n(c) Generates transmission errors at any bit positions of T.
\n(d) Applies CRC to the received frame (i.e. frame T after introducing errors) to determine if the frame should be accepted or discarded.
\nAttach your code with your report, and also put comments stating the instructions of how to run it.
\n2. (20 points) (a). In a CRC error-detecting scheme, choose P(x) = X4 + X + 1. Encode the bits 10010011011.
\n(b). Suppose the channel introduces an error pattern 100010000000000 (i.e., a flip from 1 to 0 or from 0 to 1 in position 1 and 5). What is received? Can the error be detected?
\n(c). Repeat part (b) with error pattern 100110000000000.<\/p>\n
__________________________________________
\nCRC (Cyclic Redundancy Check) is an error-detecting technique widely used in digital networks and storage devices to detect accidental changes to raw data. This technique involves treating the message as an enormous binary number, dividing it by a fixed binary number, and appending the remainder to the message. The receiver divides the complete transmitted message by the same fixed binary number, and if the remainder is non-zero, the message is assumed to be corrupt [1].<\/p>\n
(20 points) The program generates an n-bit frame for transmission from a k-bit data block D and a (n-k+1) bit CRC divisor P. The modified program performs the following steps:
\n(a) Generates a message of n = 10 bits.
\n(b) Uses the previous code with P = 110101 to generate the corresponding 15-bit frame T for transmission.
\n(c) Generates transmission errors at any bit positions of T.
\n(d) Applies CRC to the received frame (i.e., frame T after introducing errors) to determine if the frame should be accepted or discarded.<\/p>\n
The code is attached with comments stating the instructions on how to run it.<\/p>\n
(20 points) (a) For the CRC error-detecting scheme with P(x) = X^4 + X + 1, the encoded bits for the data 10010011011 are calculated as follows:
\nData: 10010011011
\nDivisor: P(x) = X^4 + X + 1 = 10011<\/p>\n
The data is first padded with 4 zeros to make it divisible by the divisor length.
\nPadded Data: 1001001101100000<\/p>\n
Divide Padded Data by Divisor using modulo-2 division:
\n10011 ) 100100110110000
\n100110
\n———–
\n11100000
\n11000
\n——-
\n1100000
\n1001
\n——
\n101000
\n100110
\n——-
\n10010 (Remainder)<\/p>\n
The encoded bits are: 1001001101110010<\/p>\n
(b) If the channel introduces an error pattern 100010000000000 (i.e., a flip from 1 to 0 or from 0 to 1 in position 1 and 5), the received frame becomes:<\/p>\n
Transmitted frame: 1001001101110010
\nError pattern: 100010000000000
\n——————
\nReceived frame: 1101011101110010<\/p>\n
Divide the received frame by the divisor P(x) using modulo-2 division:<\/p>\n
10011 ) 110101110111001
\n110110
\n———–
\n10001000
\n10011
\n——-
\n1010000
\n1001
\n——
\n101000
\n100110
\n——-
\n10010 (Non-zero remainder)<\/p>\n
Since the remainder is non-zero, the error can be detected.<\/p>\n
(c) If the error pattern is 100110000000000 (i.e., a flip from 1 to 0 or from 0 to 1 in position 1, 3, and 5), the received frame becomes:<\/p>\n
Transmitted frame: 1001001101110010
\nError pattern: 100110000000000
\n——————
\nReceived frame: 1101111101110010<\/p>\n
Divide the received frame by the divisor P(x) using modulo-2 division:<\/p>\n
10011 ) 110111110111001
\n110110
\n———–
\n10001000
\n10011
\n——-
\n1010000
\n1001
\n——
\n101000
\n100110
\n——-
\n10010 (Non-zero remainder)<\/p>\n
Again, since the remainder is non-zero, the error can be detected.<\/p>\n
In summary, the CRC error-detecting scheme with P(x) = X^4 + X + 1 can detect the given error patterns in both cases.<\/p>\n
References:<\/p>\n
[1] Forouzan, B. A. (2007). Data communications and networking (4th ed.). McGraw-Hill.<\/p>\n
[2] Tanenbaum, A. S., & Wetherall, D. J. (2011). Computer networks (5th ed.). Pearson.<\/p>\n
[3] Peterson, W. W., & Brown, D. T. (1961). Cyclic codes for error detection. Proceedings of the IRE, 49(1), 228-235. https:\/\/doi.org\/10.1109\/JRPROC.1961.287814<\/p>\n
[4] Lin, S., & Costello, D. J. (2004). Error control coding: Fundamentals and applications (2nd ed.). Pearson Prentice Hall.<\/p>\n
[5] Schwartz, M. (1980). Computer-communication network design and analysis. Prentice-Hall.<\/p>\n
++++++
\nCSE 963: Computer Networks I
\nHomework 1 (50 points)
\nThe goals of this homework are to develop an understanding a communications model, data communications, networks, protocol architecture as well as the basic concepts of data transmissions, data rate, bandwidth and channel capacity.
\n1. (10 points) Briefly explain the advantages and disadvantages of using layered architecture in computer networks.
\n2. (10 points) What tasks are performed by the data link layer and the transport layer?
\n3. (10 points) Draw (by hand) the spectrum of the signal s(t) = 4sin(2pt) + 2sin(6pt) +
\n). Also identify the absolute and effective bandwidths.
\n4. (10 points) What is the channel capacity for a teleprinter channel with a 300-Hz bandwidth and a signal-to-noise ratio of 3 dB, where the noise is a white thermal noise?
\n5. (10 points) A digital signaling system is required to operate at 9600 bps. If the signal encodes a 4-bit word, what is the minimum required bandwidth of that channel?<\/p>\n","protected":false},"excerpt":{"rendered":"
CSE 963: Computer Networks I Homework-3 Due date: Friday 03\/03\/2024 PROCEDURE: 1. (20 points) Write a program (in any language) that generates an ??-bit frame for transmission from a k-bit data block D and a (??-??+1) bit CRC divisor P. Compile and run the program with at least two set of inputs to confirm that […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2127,5018,358],"tags":[5870,5878,5869],"class_list":["post-17074","post","type-post","status-publish","format-standard","hentry","category-computer-and-information-assignment-help","category-computer-science-asssignment","category-it-computer-science-assignment-help","tag-computer-networks","tag-cse-963-computer-networks-i","tag-cse-963-computer-networks-i-homework-3"],"_links":{"self":[{"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/posts\/17074","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/comments?post=17074"}],"version-history":[{"count":2,"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/posts\/17074\/revisions"}],"predecessor-version":[{"id":17090,"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/posts\/17074\/revisions\/17090"}],"wp:attachment":[{"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/media?parent=17074"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/categories?post=17074"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.colapapers.com\/uk\/wp-json\/wp\/v2\/tags?post=17074"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}