Download (direct link):
The final part of the book, Case Study and Appendices, provides a detailed description of a case study and two Appendices.
Chapter 16 considers the problem of implementing a routing protocol in a competitive environment, in which voluntary, unselfish participation of the network nodes to the packet forwarding task cannot be taken for granted. After having described the problem (Section 16.1) and a reference application scenario (Section 16.2), the chapter presents solutions to the cooperative routing problem that do not integrate TC mechanisms (Section 16.5), and that integrate TC and routing (Section 16.6).
Finally, Appendix A introduces basic concepts and definitions of graph theory, and Appendix B introduces basic probability notions. Appendix B also provides a short overview of three applied probability theories that have been used in the analysis of the various topology control problems presented in the book: the geometric random graph theory (Section B.2), the occupancy theory (Section B.3), and the theory of continuum percolation (Section B.4).
How to Use This Book
The book is organized into six parts. Informally speaking, the first part of the book provides basic concepts and definitions related to topology control that will be used in the rest of the book. While a reader who is familiar with the field of wireless ad hoc and sensor networks can probably skip Chapter 1, he (or she) should probably not miss Chapter 2, which introduces the network model used in the book.
After the introductory material, the topology control problem is approached firstly from a theoretical viewpoint (Part II and Part III), and then from a more practical viewpoint (Part IV and V).
The last part of the book contains an interesting case study and two appendices. The appendices are intended to provide a unique reference point for the concepts of graph theory (Appendix A) and elementary and applied probability (Appendix B) used in the book: if the reader is not sure about a certain graph theory or probability theory notion mentioned somewhere in the text, he (or she) can refer to the appropriate appendix and get it clarified. With a similar purpose, I have included an exhaustive list of the many acronyms and abbreviations used in the book.
Although, in general, topology control techniques can be used both in ad hoc and in sensor networks, some of them are more useful for application in sensor networks (Chapters 4, 6, 7, 8, 10), and others for application in ad hoc networks (Chapters 5, 11, 12, 13, 14, 16).
A reader with a background in computer science will probably be more comfortable with Part II, Part III, and Part IV of this book, while a reader with a background in engineering will probably be more comfortable with Part IV and Part V of the book. A reader with a background in applied mathematics will probably be interested in Part II and Part III of this book and Section 12.1.
There are several persons without whose support and contribution this book would have not been possible.
A first thought is for Birgit Gruber of Wiley, who contacted me in San Diego when I was presenting a tutorial on topology control, and suggested to me the idea of writing a book on this topic. Her enthusiasm was fundamental to convince me of the idea, which resulted a year and half later in this book. I also wish to thank all the staff at Wiley (Joanna Tootill and Julie Ward - I hope not to have forgotten anybody) for their assistance during the writing and the production phase of the book.
I am deeply grateful to the colleagues who shared with me the exciting task of studying the realm of topology control in these years: Doug Blough, Giovanni Resta, Mauro Leoncini, Christian Bettstetter and Stephan Eidenbenz. Much of the material presented in this book is the fruit of our collaboration. Doug also first suggested to me the idea of writing a survey paper on topology control, which, as I have explained above, can be considered as the very origin of this book. Giovanni also provided me Figure 9.1 and Figure 15.2. Christian also read a draft version of Chapters 5, and gave me many useful suggestions to improve it. To all of them I am indebted.
List of Abbreviations
A.A.S. Asymptotically Almost Surely
AoA Angle of Arrival
AODV Ad hoc On-demand Distance Vector
BIP Broadcast Incremental Power
CBTC Cone-Based Topology Control
CCR Critical Coverage Range
CDMA Code Division Multiple Access
CLUSTERPOW CLUSTERed POWer
CNN Critical Neighbor Number
COMPOW COMmon POWer
CSMA-CA Carrier Sense Multiple Access-Collision Avoidance
CTR Critical Transmitting Range
CTS Clear To Send
DistRNG Distributed Relative Neighborhood Graph
DSDV Dynamic destination Sequenced Distance Vector
DSR Dynamic Source Routing
DT Delaunay Triangulation
EMST Euclidean Minimum Spanning Tree
FLSS Fault-tolerant Local Spanning Subgraph
GG Gabriel Graph
GPS Global Positioning System
GRG Geometric Random Graph