Gugrajah_Yuvaan_ Ramesh_2003.pdf

More documents

Recommendations

Info

Pr P, Pu Qi qrm qrms (r,m) p R w Wratio probability that k units of bandwidth are being used on linkj probability of an m-hop connection probability that k calls are in progress at node n received power transmit power received power of packet U percentage of node i's transmit buffer that is empty probability that route (r, m) will be used for call request probability that route (r, m) will be used for call request (r, s) mth route between node pair r probability of activity of a call total number of node pairs in a network average SIR of all packets received by node i from node k system is in state k threshold for buffer occupation in DLAR scheme 3 the probability of no more than k trunks being free on linkj monitoring time period mean call duration arrival rate ofclass s calls on linkj arrival rate ofcalls at node n maximum velocity weighting factor system bandwidth ratio of routing weighting factors maximum x-dimension of network area maximum y-dimension of network area noise plus interference in the CDMA system (xi)
ABR ACK AMRIS AMROUTE AODV BQ CAMP COMA CEDAR CGSR CLR CMU CSMNCA CTS DAG DBF DCF DIFS DLAR DREAM DSDV DSR DSSS EFPA FDMA FHSS FSR GPS GSR HID HSR IARP LIST OF ACRONYMS Associativity Based Routing Acknowledgement Ad Hoc Multicast Routing with Increasing ID numbers Ad Hoc Multicast Routing Ad Hoc On Demand Distance Vector Routing Broadcast Query Core-Assisted Mesh Protocol Code Division Multiple Access Core Extraction Distributed Ad Hoc Routing Cluster-head Gateway Switch Routing Route Clear Packet Carnegie Mellon University Carrier Sense Multiple Access with Collision Avoidance Clear To Send Directional Acyclic Graph Distributed Bellman Ford Distributed Coordination Function DCF Interframe Spacing Dynamic Load Aware Routing Distance Routing Effect Algorithm for Mobility Destination Sequenced Distance Vector Dynamic Source Routing Direct-Sequence Spread Spectrum Erlang Fixed Point Approximation Frequency Division Multiple Access Frequency-Hopping Spread Spectrum Fisheye State Routing Global Positioning System Global State Routing Hierarchical Identification number Hierarchical State Routing Intrazone Routing Protocol (xii)
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 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 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:
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?