Find shortest path tree by bellman-ford-dijkstra algorithm

Assignment Help Data Structure & Algorithms
Reference no: EM1362622

1) Multiaccess communications:
a) Explain multi-access techniques used in these technologies

i) Wi-Fi
ii) WiMax

b) Give an intuitive explanation of why the maximum throughput, for small β, is approximately the same for CSMA slotted Aloha and FCFS splitting with CSMA.

c) Assume the number of packets n in a slotted Aloha system at a given time is a Poisson random variable with mean n ≥ 1. Suppose that each packet is independently transmitted in the next slot with probability 1/n.

i) Find the probability that the slot is idle.
ii) Show that the a posteriori probability that there were n packets in the system, given an idle slot, is Poisson with mean n-1.
iii) Find the probability that the slot is successful.

2) Routing in data networks;
a) What is the difference between Dijkstra's algorithm and Bellman-Ford's algorithm (explain based on a graph which shows simple network topology)

b) Find the shortest path tree from every node to node 1for the graph of following figure using Bellman-Ford and Dijkstra algorithm.

c) Assume that there is a wireless mesh network (IEEE 802.16) with few base stations and certain coverage area;

i) Highlight four main routing challenges, which are needed to solve by implementing routing algorithm.

ii) Select one of the challenges based on your answer in part "i", and then give a solution in a pseudocode format.

d) Answer to one of the following questions:

i) Categorise routing protocols based on at least three criterions and disclose a sample for each category.

ii) List and explain at least three characteristics of routing algorithms.

Reference no: EM1362622

Questions Cloud

Describing nutritional habits : How could these habits improve one's health? Identify and describe three nutritional habits?
Determining performance evaluation-residual income : Calculate net operating income and residual income for each division. Compare the two divisions and discuss the usefulness of ROI and residual income for the purpose of comparing the divisions.
What mass of water lost an electron to the lightning : A certain freely falling object requires 1.10s to travel the last 32 m before it hits the ground. From what height above the ground did it fall.
Determine short and long term effects of on decision : If you had a business and your accountant told you to either expense it all, or to capitalize it all, what would your response be? Make a decision and create an argument for it
Find shortest path tree by bellman-ford-dijkstra algorithm : Find the shortest path tree from every node to node 1for the graph of following figure using Bellman-Ford and Dijkstra algorithm.
News release for red cross pr : News Release for Red Cross PR - Draft a news release that you will use in your public relations campaign for Red Cross and describe in detail how the content
What would be the braking distance : The train on the right accelerates leftward at 0.82 m/s2.How far does train on the left travel before the front ends of the trains pass.
When customer anticipated : Consider a perfectly competitive market with many homogenous exercise gyms. Exercise gyms have learned that customers tend to use the gym less often than the customer anticipated when she signed up.
Show product and process layout : Explain what is the difference between product layout and process layout? Which product and process layout represents your organization's current layout?

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Algorithm to minimize average difference between height

The problem is to assign each skier a ski to minimize the average difference between height of a skier and his/her ski. Give pseudocode and write its asymptotic running time.

  Calculate worst-case run-time complexity of algorithm

Calculate the worst-case run-time complexity of your algorithm and prove optimality of the solution it gives. Suppose that the road is a straight line with a western end and an eastern end.

  Creating algorithm broken into sequence of words

Katt wishes you to create an algorithm that, given a string X, determines efficiently how many ways X can be broken up into sequence of words.

  Factors-principles considering indecency regulation issues

What factors and principles should the federal government take into account when considering indecency regulation issues?

  List of common data structures

Make a list of some of the common data structures provided by C#. You should have a minimum of 4 different data types.

  Algorithm to read arbitrary number of data records

Write the algorithm to read arbitrary number of data records, each comprising name, age, and code.

  Create long queue-customers dequeue to next counter

Write a program to simulate a grocery store checkout counter. Construct one long queue from which customers dequeue to the next available counter.

  Determine computational complexity of algorithm

Describe the algorithm in psuedo-code. You should give thought to what data structures(s) make sense for e client implementation. Determine computational complexity of your algorithm.

  Algorithm for string of numbers recognize all the substrings

Write down algorithm, using pseudocode, to perform the following task, Given a string of numbers, recognize all of the substrings that form numbers that are divisible by 3.

  Efficient algorithm to achieve goal using few base stations

Certain points along the road, so that every house is within four miles of one of the base stations. Give an efficient algorithm that achieves this goal using as few base stations as possible.

  Writing algorithm which ?nds xbest

Provide an O(n) algorithm which ?nds xbest such that distbest:= ∑i=1 to n|xbest - xi| is as small as possible.

  Write algorithm using pseudo code consensus algorithm

Write an algorithm, using pseudo code, "Consensus algorithm": A group of ten people need to decide which one flavor of ice cream they will all order, out of three options.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd