Principles of Ad-Hoc Networking

Description

Principles of Ad Hoc Networking presents a systematic introduction to the fundamentals of ad hoc networks. 

An ad-hoc network is a small network, especially one with wireless or temporary plug-in connections. Typically, some of the network devices are part of the network only for the duration of a communications session or, in the case of mobile or portable devices, while in some close proximity to the rest of the network. These networks can range from small and static systems with constrained power resources to larger-scale dynamic and mobile environments. Wireless ad hoc networks facilitate numerous and diverse applications for establishing survivable dynamic systems in emergency and rescue operations, disaster relief and intelligent home settings.

 Principles of Ad Hoc Networking:

• Introduces the essential characteristics of ad hoc networks such as: physical layer, medium access control, Bluetooth discovery and network formation, wireless network programming and protocols.
• Explains the crucial components involved in ad-hoc networks in detail with numerous exercises to aid understanding.
• Offers key results and merges practical methodologies with mathematical considerations.

Principles of Ad Hoc Networking will prove essential reading for graduate students in Computer Science, Electrical Engineering, Applied Mathematics and Physics as well as researchers in the field of ad hoc networking, professionals in wireless telecoms, and networking system developers.

Check out  www.scs.carleton.ca/~barbeau/pahn/index.htm for further reading, sample chapters, a bibliography and lecture slides!

 

PREFACE.

1 INTRODUCTION.

2 WIRELESS DATA COMMUNICATIONS.

2.1 Signal representation.

2.2 Analog to digital conversion.

2.3 Digital to analog conversion.

2.4 Architecture of an SDR application.

2.5 Quadrature modulation and demodulation.

2.6 Spread spectrum.

2.7 Antenna.

2.8 Propagation.

2.9 Ultra wide band.

2.10 Energy management.

3 MEDIUM ACCESS CONTROL.

3.1 Fundamentals of probability and statistics.

3.1.1 General concepts.

3.1.2 Specific random variables.

3.1.3 Counting processes.

3.2 Modeling traffic.

3.2.1 Delay models.

3.2.2 Queueing models.

3.2.3 Birth-death processes.

3.2.4 M/M/1/1 queuing system.

3.2.5 M/M/m/1 queue: m servers.

3.2.6 Queues for channel allocation.

3.2.7 Queues with reserved channels for handoffs.

3.3 Multiple access.

3.3.1 Uncoordinated access.

3.3.2 Contention-based access.

3.4 Demand assigned multiple access.

3.4.1 Bit-Map.

3.4.2 Binary Countdown.

iv CONTENTS.

3.4.3 Splitting Algorithms.

3.5 Carrier sense multiple access.

3.5.1 Persistence.

3.5.2 Collision avoidance.

3.6 Medium access control in ad hoc networks.

3.6.1 Neighbor aware contention resolution.

3.6.2 Multiple access protocols.

3.6.3 Throughput analysis.

3.7 Bibliographic Comments.

3.8 Exercises.

4 AD HOC WIRELESS ACCESS.

4.1 Management of bluetooth networks.

4.1.1 Architecture.

4.1.2 The bluetooth asymmetric protocol.

4.1.3 Bluetooth protocol architecture (IEEE 802.15).

4.2 Model for node discovery in bluetooth.

4.2.1 Protocols for node discovery.

4.2.2 Multiple nodes competing for air-time.

4.3 Bluetooth formation algorithms.

4.3.1 Topology construction and scatternet formation algorithms.

4.4 Ad hoc mode of WiFi/802.11.

4.5 Mesh mode of WiMax/802.16.

4.5.1 Sleep mode.

4.6 Optical wireless links.

4.7 Bibliographic comments.

4.8 Exercises.

5 WIRELESS NETWORK PROGRAMMING.

5.1 Structure of information.

5.2 Socket.

5.3 Parameters and control.

5.4 Receiving frames.

5.5 Sending frames.

6 AD HOC NETWORK PROTOCOLS.

6.1 How does work normal IP routing?.

6.2 The reactive approach.

6.3 The proactive approach.

6.4 The hybrid approach.

6.4.1 Neighbor Discovery Protocol.

6.4.2 Intrazone Routing Protocol.

6.4.3 Interzone Routing Protocol.

6.5 Clustering.

6.5.1 Ad hoc network model.

6.5.2 Cluster formation.

CONTENTS v.

6.6 Quality of service.

6.7 Broadcasting and multicasting.

7 SENSOR NETWORK PROTOCOLS.

8 LOCATION AWARENESS.

8.1 Geographic Proximity.

8.1.1 Neighborhood graphs.

8.1.2 Relation between the neighborhood graphs.

8.2 Constructing Spanners of Ad hoc Networks.

8.2.1 Gabriel test.

8.2.2 Morelia test.

8.2.3 Half space proximal test.

8.2.4 Spanner for hosts with irregular transmission ranges.

8.3 Information Dissemination.

8.3.1 Routing in undirected planar graphs.

8.3.2 Traversal of quasi planar graphs.

8.3.3 Routing in directed planar graphs.

8.3.4 Routing in outerplanar graphs.

8.4 Random Unit Disc Graphs.

8.4.1 Poisson distribution in the plane.

8.4.2 Connectivity and k-Connectivity.

8.4.3 Euclidean MST.

8.4.4 NNG and k-NNG.

8.4.5 Delaunay triangulations.

8.4.6 Planar graphs and width of faces.

8.5 Geographic Location Determination.

8.5.1 Radiolocation techniques.

8.5.2 Computing the Geographic Location.

8.5.3 Three/Two neighbor algorithm.

8.5.4 Beyond distance one neighborhood.

8.6 Bibliographic Comments.

8.7 Exercises.

9 AD HOC NETWORK SECURITY.

9.1 Key Establishment.

9.2 Authentication.

9.3 Confidentiality.

9.4 Secure routing.

Bibliography.

References.