EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 7, Problem P8P
a.
Program Plan Intro
Given scenario:
- The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
- If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
- If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
- The time is slotted, with a message transmission time taking exactly one time slot.
b.
Program Plan Intro
Given scenario:
- The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
- If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
- If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
- The time is slotted, with a message transmission time taking exactly one time slot.
c.
Program Plan Intro
Given scenario:
- The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
- If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
- If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
- The time is slotted, with a message transmission time taking exactly one time slot.
d.
Program Plan Intro
Given scenario:
- The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
- If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
- If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
- The time is slotted, with a message transmission time taking exactly one time slot.
e.
Explanation of Solution
- Maximum rate which a data message can be transferred from C to A with ACK:
- The maximum rate which a data message can be transferred from C to A is one message per four slots (1 message/ 4 slots), in slot 1 a message sends from A to B, in slot 2 a message sends from B to C, in slot 3 the ACK sends from C to B and in slot 4 the ACK sends from B to A.
- Combined maximum rate which a data message can be transferred from A to B and D to C with ACK:
- The combined maximum rate which a data message can be transferred from A to B and D to C are two ...
- The maximum rate which a data message can be transferred from C to A is one message per four slots (1 message/ 4 slots), in slot 1 a message sends from A to B, in slot 2 a message sends from B to C, in slot 3 the ACK sends from C to B and in slot 4 the ACK sends from B to A.
- The combined maximum rate which a data message can be transferred from A to B and D to C are two ...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Telemedicine is the ability to provide medical assistance from a distance using telecommunication. For this example, imagine that a platoon of soldiers might be out in the battlefield. While a medic might be with them, he/she cannot constantly monitor each soldier’s vital signs, but if various sensors were sewn into soldier uniforms, vital statistics could be monitored from a distance by a doctor at headquarters. That doctor may be able to identify a medical problem for one of the soldiers and relay that information and instructions for care back to a medic in the area. The doctor at headquarters should be able to select a given soldier and see that soldier’s vital signs on a portable computer device (e.g., iPad). Perhaps the medic in the field might even have a video camera so that the doctor may be able to view a wound. Design the interface that the HQ doctor would see. Using the display design principles design an interface mockup using graphics, photos, and/or text to show what…
Computer Network
LAN Network Topology Image. the image below
Use the image as a reference, if the values are A, B, C and D (3rd octet) with the following conditions:
Value A = 29
Value B = A + 1
Value C = A + 2
Value D = A + 3
x1, y1, z1 are the interfaces for the router gateway, while x2, x3, y2, y3, z2, z3 are for the router interface
a. Find the Routing Table R1, R2, and R3 using the following table!
Destination
Next hop
Interface
b. With the Routing Table that you have specified in point a, which path will PC1B take when communicating with PC2B and PC3B
c. In theory there is a routing table for Network Address 0.0.0.0 with a Subnet Mask of 0.0.0.0, explain the function of this routing table?
Suppose that there are three stations labelled A, B, and C, where A and C are transmitting while B is receiving. The stations are in a configuration such that the two transmitters A and C are not in the radio range of each other. Since station C is out of the radio range of A, it does not know the presence of A. That’s why C perceives that channel B is free and starts transmitting to B. Also ‘A’ transmit signal at the same time to Channel B. The frames are garbled and a collision occurs. This is shown in the following figure: I. What is the name of this problem? II. How can we overcome this problem?
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
- 7 Part 2 of 2 Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Find the shortest route (in distance) between computer centers in each of the pairs of cities in the communications network shown in the following image: San Francisco 957 Denver 1736 349 Los Angeles 1855 1235 Denver and New York Multiple Choice 908 & Dallas Chicago 10% 1372 860 722 Denver to Dallas to New York Boston Denver to Chicago to New York /191 Denver to Dallas to Chicago to New York New York Denver to Chicago to Dallas to New Yorkarrow_forwardConsider a world on which each individual belongs to a family of six, each family resides in its own home, each house has a specific address and every person in a certain house is given a unique name.Assume that this world has a postal service providing letters from source to destination. The postal service needs (1) the letter to be in an envelope and (2)that the address (and nothing else) of the destination house be clearly shown on the envelope. Suppose each family has a delegated member who receives letters for the other family members and distributes them. The letters do not actually give the receivers of the letters a hint. a. Would the postal service.ever have to open the envelope and inspect the letter and include the service under your protocol?arrow_forwardConsider a world on which each individual belongs to a family of six, each family resides in its own home, each house has a specific address and every person in a certain house is given a unique name. Assume that this world has a postal service providing letters from source to destination. The postal service needs (1) the letter to be in an envelope and (2) that the address (and nothing else) of the destination house be clearly shown on the envelope. Suppose each family has a delegated member who receives letters for the other family members and distributes them. The letters do not actually give the receivers of the letters a hint. a. Define a procedure used by delegates to deliver letters from the transmitting family member to a receiving family member using the approach R1 above.arrow_forward
- Consider a world on which each individual belongs to a family of six, each family resides in its own home, each house has a specific address and every person in a certain house is given a unique name.Assume that this world has a postal service providing letters from source to destination. The postal service needs (1) the letter to be in an envelope and (2)that the address (and nothing else) of the destination house be clearly shown on the envelope. Suppose each family has a delegated member who receives letters for the other family members and distributes them. The letters do not actually give the receivers of the letters a hint.a. Would the postal service.ever have to open the envelope and inspect the letter and include the service under your protocol?arrow_forwardIn a robotic laboratory of one university, the lab members are testing mobile robots. Each robot has a radio transmitter that it uses to communicate with a base station, and they find that if the robots get too close to one another, then there are problems with interference among the transmitters. So a problem arises: how to plan the motion of the robots in such a way that each robot gets to its intended destination, but in the process the robots don’t come close enough together to cause interference problems. This problem could be modeled as: suppose that we have an undirected graph G=(V,E), representing the floor plan of a building, and there are two robots initially located at nodes a and b in the graph. The robot at node a wants to travel to node c along a path in G, and the robot at node b wants to travel to node d. This is accomplished by means of a schedule: at each time step, the schedule specifies that one of the robots moves across a single edge, from one node to a…arrow_forwardA video is posted on a hosting site (like YouTube) and gets 4 views in the first hour. Each of these 4 viewers share the video with 4 of their contacts (who also view the video) and at the end of the second hour the video has a total of 4 + 4(4) = 20 views. Each of the new 16 viewers share the video with 4 of their contacts (who also view the video) and at the end of the third hour the video has a total of 20 + 4(16) = 84 views. This pattern continues such that every hour the video accumulates an additional four times the number of views that it received in the previous hour.1. How many views will the video have by the end of the 4th, 5th and 6th hour?2. Define a linear homogenous recurrence relation for the number of views, an, at the end of the nth hour and do not forget to specify the initial conditions. Hint: express it in terms of the 2 previous terms.3. Find a solution to the recurrence relation with the form an =α1rn+α2rn.4. How many views will the video have by the end of the…arrow_forward
- A messaging system reads message as 4-digit positive integer d1d2d3d4 and stores encoding of the message e1e2e3e4 for security reason. The encoding process is as follows: ei = (di+i) mod 3 For example, if message is 4590, the encoded message is 2101. Read any arbitrary message and display the encoded message in the following format: Original message = Encoded message = language : Carrow_forwardConsider an Information system, of a frame size of (5 million) bits are being sent on a path with (10 routers) each having a queuing time of (2 µs) and a processing time of (1 µs). The length of the path is (2000 Km). Acknowledgement frame size is (10 bytes) and the speed of light inside the link is (2 *10^8 m/s). Every link on the path has a bandwidth of (5 Mbps), then the total delay (latency) for this frame is........... O 0.000016 sec. O 0.000020 sec. O 0.000010 sec. O 1.020046 sec. O 0.01 sec.arrow_forwardWireless sensor networks (WSNs) are a specific sort of communication network. WSNs communicate with a central station through sensor nodes. A sensor node's memory and processing power are limited. The algorithm may be split down into simpler challenges. Divide & conquer or dynamic programming are your preferred methods for completing these sub-problems at various sensor nodes? Be succinct in your writing.arrow_forward
- Consider a set of mobile computing clients in a certain town who each need to be connected to one of several possible base stations. Suppose there are n clients, with the position of each client specified by its (x, y) coordinate in the plane. There are also k base stations; the position of each of these is also specified by its (x, y) coordinate in the plane. For each client, we wish to connect it to exactly one of the base stations. Our choice of connections is constrained in the following ways: (i) there is a range parameter r, and a client can only be connected to a base station that is within distance r, (ii) there is a load parameter L, and no more than L clients can be connected to any single base station. Your goal is to design a polynomial time algorithm for the following problem – given the above data, decide whether it is possible to assign every client to a base station subject to the two constraints.arrow_forwardHow many different channels are needed for six television stations (A, B, C, D, E, F) whose distances (in kilometers) from each other are shown in the following table? Assume that two stations cannot use the same channel when they are within 150 km of each other. You must show your graph to justify your answer. You will not receive credit if you simply state a number. A B с D E F A B 85 с DE F 175 100 50 100 125 85 175 125 100 175 100 50 100 200 100 130 250 - 175 100 130 100 200 250 210 220 100 210 220 100arrow_forwardTwo blue armies are each poised on opposite hills preparing to attack a single red army in the valley. The red army can defeat either of the blue armies separately but will fail to defeat both blue armies if they attack simultaneously. The blue armies communicate via an unreliable communications system (a foot soldier). The commander with one of the blue armies would like to attack at noon. His problem is this: If he sends a message to the other blue army, ordering the attack, he cannot be sure it will get through. He could ask for acknowledgment, but that might not get through. Is there a protocol that the two blue armies can use to avoid defeat?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education