Gugrajah_Yuvaan_ Ramesh_2003.pdf

More documents

Recommendations

Info

As the candidate's supervisor I have approved this dissertation for submission. Signed: Name: Date: Prof. Fambirai Takawira 13 January 2003
ABSTRACT An ad hoc network is a multi-hop wireless network in which mobile nodes communicate over a shared wireless channel. The network is formed cooperatively without specific user administration or configuration and is characterised by a distributed network management system and the absence of a wired backbone. Military, law enforcement, and disaster relief operations are often carried out in situations with no pre-existing network infrastructure and can benefit from such networks because base stations, which are single points of failure, are undesirable from a reliability standpoint. The rising popularity of mobile computing has also created a potentially large commercial market for multimedia applications applied over wireless ad hoc networks. This dissertation focuses on the routing aspects of ad hoc networking. The multi-hop routes between nodes constantly change as the mobile nodes migrate. Ad hoc network routing algorithms must therefore adapt to the dynamic and unpredictable topology changes, the random radio propagation conditions and portable power sources. Various routing protocols have been proposed in the literature for ad hoc networks. These protocols together with comparative simulations are discussed and a new protocol based on load balancing and signal quality determination is proposed .and the simulation results are presented. Currently the proposed routing protocols are compared using simulation packages which are often time consuming. This dissertation proposes a mathematical model for evaluating the routing protocols and the resultant end-to-end blocking probabilities. The mathematical model is based on a derivation of the reduced load approximation for analysing networks modelled as loss networks and the evaluation incorporates and adapts models that have been used for the analysis of cellular Code Division Multiple Access (CDMA) systems. While analytical methods of solving blocking probability can potentially generate results orders of magnitude faster than simulation, they are more importantly essential to network sensitivity analysis, design and optimisation. (ii)
Page 1: Routing Performance In Ad Hoc Netwo
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 and 24: Introduction Chapter J networks and
Page 25 and 26: Routing Protocols for Ad Hoc Networ
Page 27: Routing Protocols for Ad Hoc Networ
Page 35: Routing Protocols for Ad Hoc Networ
Page 38 and 39: Routing Protocolsfor Ad Hoc Network
Page 50 and 51: Routing Protocolsfor Ad Hoc Network
Page 52 and 53:
Routing Protocols for Ad Hoc Networ
Page 57:
Routing Protocols for Ad Hoc Networ
Page 60:
Routing Protocolsfor Ad Hoc Network
Page 63:
Simulation ofa Load Balancing Routi
Page 66:
Page 69 and 70:
Page 71:
Page 75 and 76:
Page 77:
Simulationofa Load Balancing Routin
Page 87 and 88:
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?