Gugrajah_Yuvaan_ Ramesh_2003.pdf

More documents

Recommendations

Info

Introduction The work has been published at the following conferences: • SATNAC 2001, Wild Coast, South Africa [GugrajahOl] • IEEE Africon 2002, George, South Africa [Gugrajah02a] • SATNAC 2002, Drakensburg, South Africa [Gugrajah02b] 1-9 Chapter I
Routing Protocols for Ad Hoc Networks Chapter 2 Chapter 2 ROUTING PROTOCOLS FOR AD HOC NETWORKS 2.1. Introduction Routing is the function of the network that detennines the path from a source to a destination for the establishment of viable communication. Ad hoc networking allows users to access the network independent of location and movement, but this mobility allows the topology of the network to change dynamically and unpredictably. The problem is amplified because routes often consist of multiple hops due to intentionally short transmission ranges that reduce interference and power consumption for nodes in the network. Several approaches have been proposed to provide routing for ad hoc networks by adapting techniques developed in wired networks. This chapter provides a survey of the existing schemes proposed for end-to-end routing in ad hoc networks. Section 2.2 introduces unicast protocols. The unicast protocols include traditional distance vector and link state routing, as well as newer path-finding routing protocols and on-demand routing protocols. Unicast protocols can be divided into proactive or table-driven protocols, described in Section 2.2.1 and the reactive or on-demand routing protocols described in Section 2.2.2. Modifications and hybrid varieties 'of the two types of unicast protocols have also been proposed and are discussed in Sections 2.2.3 to 2.2.7. Multicast routing protocols include variations on the shortest path tree algorithms, multicast trees and mesh-based protocols. In graph theory a tree is a path that does not contain any loops. Since this dissertation is focused on unicast routing protocols, multicasting is briefly reviewed in Section 2.3. 2-1
Page 1 and 2: Routing Performance In Ad Hoc Netwo
Page 3 and 4: ABSTRACT An ad hoc network is a mul
Page 5 and 6: ACKNOWLEDGEMENTS I would like to th
Page 7 and 8: 2.2.5. Routing with a Backbone 2-21
Page 9: Chapter 2 LIST OF FIGURES AND TABLE
Page 13 and 14: ABR ACK AMRIS AMROUTE AODV BQ CAMP
Page 15 and 16: SWAP Shared Wireless Access Protoco
Page 17 and 18: Introduction Chapter 1 There are a
Page 19: Introduction Chapter J The problems
Page 23: Introduction Chapter J networks and
Page 27: Routing Protocols for Ad Hoc Networ
Page 38 and 39: Routing Protocolsfor Ad Hoc Network
Page 40 and 41: Routing Protocols for Ad Hoc Networ
Page 50 and 51: Routing Protocolsfor Ad Hoc Network
Page 60: Routing Protocolsfor Ad Hoc Network
Page 63: Simulation ofa Load Balancing Routi
Page 69 and 70: Simulation ofa Load Balancing Routi
Page 75 and 76:
Simulation ofa Load Balancing Routi
Page 77:
Simulationofa Load Balancing Routin
Page 87 and 88:
Simulation ofa Load Balancing Routi
Page 89 and 90:
EvaLuation ofNetwork Blocking Proba
Page 96 and 97:
Evaluation ofNetwork Blocking Proba
Page 101 and 102:
Page 105 and 106:
Page 107 and 108:
Adaptation ofthe Fixed Point Approx
Page 110:
Adaptation ofthe Fixed Point Approx
Page 121:
Adaptation o/the Fixed Point Approx
Page 125 and 126:
Conclusion Chapter 6 While the reac
Page 127 and 128:
Conclusion 6.2. Future Work 6.2.1.
Page 129 and 130:
REFERENCES References [Basagni98] B
Page 131 and 132:
Angeles, Aug. 2000. References [Gil
Page 133 and 134:
References [Kelly94] Kelly, F. P, L
Page 135 and 136:
References Challenges and Direction
show all

Gugrajah_Yuvaan_ Ramesh_2003.pdf

Create successful ePaper yourself

Delete template?

Save as template?