Gugrajah_Yuvaan_ Ramesh_2003.pdf

More documents

Recommendations

Info

Introduction Chapter I load approximation can be adapted to evaluate the blocking probability in ad hoc networks. Analytical methods of solving blocking probability can potentially generate results orders of magnitude faster than simulation and can be used for network sensitivity analysis, design and optimisation. 1.4. Dissertation Outline This dissertation focuses on the routing aspects of ad hoc networking. Chapter 1 has introduced the concept of ad hoc networking and described the application areas and technologies that have been associated with the expected deployment of ad hoc networks. The problems facing the development of ad hoc networks as well as the genealogy of the routing protocols for ad hoc networks have been discussed. The general methods for evaluating the blocking probability in wired and wireless networks were briefly mentioned. In Chapter 2, the routing protocols that have been proposed in the literature are reviewed. The different types of proactive and reactive routing protocols are described together with the hybrid, multiscope and hierarchical routing protocols. Some of the comparative simulations that have been published are examined. The concept of multicasting is also discussed. Chapter 3 is a description of a load balancing routing protocol and the modifications made in order to reduce traffic congestion and improve signal quality. The protocol is compared to other protocols using a custom built simulator. The physical layer model, medium access control model and mobility model used in the simulator are described. Results for packet delivery ratio and average end-to-end delay are presented. The results obtained show that the implementation of load balancing in the routing protocols for ad hoc networks is beneficial when the offered traffic is high. Chapter 4 is a review of the methods used to evaluate blocking probability in wired networks and wireless networks employing CDMA. The Erlang Loss Formula is first discussed which introduces fundamental concepts in loss network modelling. Loss 1-7
Introduction Chapter J networks and the fixed-point approximation are then described. Chapter 4 concludes with a discussion on the Erlang capacity of cellular CDMA systems. In Chapter 5 an analytical model to evaluate the blocking probability of ad hoc networks employing CDMA is presented. CDMA systems offer high spectrum efficiency, multipath resistance, inherent frequency diversity and interference rejection and the potential use of advanced antenna and receiver structures. The analytical model is based on a modification of the reduced load approximation proposed by Liu [LiuOO] and combines it with the Erlang Capacity for cellular CDMA systems for adaptation to the ad hoc network scenario. Reasons for the difficulties in including mobility in the analysis are also mentioned. Analytical results for the blocking probability in an ad hoc network are presented. Chapter 6 summarises the thesis and briefly discusses the work performed in each chapter. Some future directions for further work are also discussed. 1.5. Original Contributions In Chapter 3 new extensions to enhance load balancing routing protocols for ad hoc networks are proposed. The Dynamic Load Aware Routing (DLAR) protocol [GerlaOO] is modified with a fourth scheme which takes into account signal quality and load at nodes along the route. Simulations are performed comparing the three original DLAR schemes and the Ad Hoc On-Demand Distance Vector (ADDV) routing protocol [Perkins99] to the newly proposed scheme. A new method of evaluating the blocking probability of calls in an ad hoc network is . . proposed in Chapter 5. This method combines loss network modelling for fixed infrastructure networks with the Erlang capacity evaluation of wireless CDMA networks. The evaluation methods for cellular networks are modified for multi-hop ad hoc networks. While methods for analysis of cellular networks employing CDMA have been proposed in the literature, there is no available literature on the approach proposed in this dissertation to evaluate wireless multi-hop ad hoc networks. 1-8
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 25 and 26: Routing Protocols for Ad Hoc Networ
Page 27: 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 60: Routing Protocolsfor Ad Hoc Network
Page 63: Simulation ofa Load Balancing Routi
Page 66: Simulation ofa Load Balancing Routi
Page 69 and 70: Simulation ofa Load Balancing Routi
Page 71:
Simulation ofa Load Balancing Routi
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?