question archive Existing ADDY routing algorithms are based on hop-count to route packets, which provides low complexity, but may not be optimal, especially when the wireless links are unreliable (some packets may be lost during the wireless transmissions]

Existing ADDY routing algorithms are based on hop-count to route packets, which provides low complexity, but may not be optimal, especially when the wireless links are unreliable (some packets may be lost during the wireless transmissions]

Subject:Computer SciencePrice: Bought3

Existing ADDY routing algorithms are based on hop-count to route packets, which provides low complexity, but may not be optimal, especially when the wireless links are unreliable (some packets may be lost during the wireless transmissions]. In this task, you will consider an extension that allows nodes to calculate the communication cost of an unreliable link by exchanging beacons (e.g., HELLO messages]. Hint, for a wireless link with p = 50% reliability, a sender needs to transmit the packet twice in average to achieve one successful packet delivery. Therefore, the communication cost of the link mayr be considered as 1/1: = 1f?.5 = 2. a. Propose an extension of the hop based ADDY routing algorithm that calculates the link cost between two neigbouring nodes based on the probability of a successful packet delivery. You may use pseudo-code to specify the algorithms. [25 marks] b. Show the bene?ts of the extended versions compared to the hop- based algorithms using carefully designed topologies- You need to ?rst identify potential bene?ts that are gained by extending the algorithm to link cost based, followed by showing them using carefully chosen routing scenarios. [25 marks] {2] [50 marks] To increase end-to-end transmission reliability, wireless communication protocols typically use hop-by-hop packet recovery. i.e.. a receiver will send an ACKnowledgement (ACK] packet to a sender after the receiver receives a packet successfully, and the sender will retransmit the packet if an 1-1in hasn't been received for a prede?ned duration. Therefore, the communication cost needs to take the quality of hi- directional links into account. in this task, you will consider an extension of Task [1} that allows nodes to calculate the Bl-DIRECTIONAL unreliable link communication cost, assuming the packet losses in the two links are independent. 3. Propose an extension of the routing algorithm developed in Task [1] that calculates the Bl-DIRECTIGNAL link cost between two neigbouring nodes based on the probability of a successful data packet AND ACK delivery. You may use pseudo-code to specify the algorithms. [25 marks] b. Show the bene?ts of the extended versions compared to the routing algorithm developed in Task [1] using carefully designed topologies. You need to ?rst identify potential bene?ts that are gained by extending the algolithm to bi-directional link cost based, followed by showing them using carefully chosen routing scenarios. [25 marks]

Individual Assignment COMP9332 Network Routing and Switching Analysis of Ad-hoc On Demand [AODV] Routing Algorithm Introduction AODV routing is veryr different from the conventional table-driven routing algorithms and protocols, such as RJP, OSPF and REP. 1n AODV routing, hosts are wireless devices that also act as routers to forward packets to each other using wireless communications. Week 7 lecture explains AODV routing algorithms used in Ad Hoc networks- The purpose of this assignment is to analyse these algorithms in more details and propose some extensions to improve their performance. It is expected that students will discuss any confusions or issues in the Discussion Forum [in WehCMS]. The lecturer will then address any major issues in a revised version. Learning Objectives By completing this assignment, students will 0 Learn AODV routing algorithms in more details. 0 Gain experience in analysing new forms of routing protocols that could be signi?cantly different than the mainstream Internet routing protocols. 0 Develop abilities to scrutinise important properties of routing from the algorithmic descriptions of the protocols.

pur-new-sol

Purchase A New Answer

Custom new solution created by our subject matter experts

GET A QUOTE

Related Questions