A Reinforcement Learning Network based Novel Adaptive Routing Algorithm for Wireless Ad-Hoc Network (eBook, PDF) - Solanki, Jagrut
0,00 €
inkl. MwSt.
Sofort per Download lieferbar
  • Format: PDF

Scientific Essay from the year 2015 in the subject Engineering - Communication Technology, , language: English, abstract: Mobile communication has enjoyed an incredible rise in quality throughout the last decade. Network dependability is most important concern in wireless Ad-hoc network. a serious challenge that lies in MANET (Mobile Ad-hoc network) is that the unlimited mobility and lots of frequent failure because of link breakage. Standard routing algorithms are insufficient for Ad-hoc networks. as a results of major drawback in MANET is limited power provide, dynamic networking. In MANET…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
Scientific Essay from the year 2015 in the subject Engineering - Communication Technology, , language: English, abstract: Mobile communication has enjoyed an incredible rise in quality throughout the last decade. Network dependability is most important concern in wireless Ad-hoc network. a serious challenge that lies in MANET (Mobile Ad-hoc network) is that the unlimited mobility and lots of frequent failure because of link breakage. Standard routing algorithms are insufficient for Ad-hoc networks. as a results of major drawback in MANET is limited power provide, dynamic networking. In MANET each node works as a router and autonomously performs mobile practicality. The link connectivity changes ceaselessly because of mobility to reflect this routing information additionally needs to get changed ceaselessly. AODV protocol is projected for this extraordinarily mobile network. In ancient AODV if any node fails in middle of transmission the method starts from the source node but in our propose scheme the transmission starts from the closest neighbor node therefore shows very important reduction in delay and improvement in packet delivery ratio are achieved. It also reduces the routing overhead by reducing the frequency of route discovery process.