| |
| |
About the Author | |
| |
| |
Preface | |
| |
| |
Acknowledgments | |
| |
| |
List of Abbreviations | |
| |
| |
List of Figures | |
| |
| |
List of Tables | |
| |
| |
| |
Introduction | |
| |
| |
| |
Ad Hoc and Sensor Networks | |
| |
| |
| |
The Future of Wireless Communication | |
| |
| |
| |
Challenges | |
| |
| |
| |
Modeling Ad Hoc Networks | |
| |
| |
| |
The Wireless Channel | |
| |
| |
| |
The Communication Graph | |
| |
| |
| |
Modeling Energy Consumption | |
| |
| |
| |
Mobility Models | |
| |
| |
| |
Asymptotic Notation | |
| |
| |
| |
Topology Control | |
| |
| |
| |
Motivations for Topology Control | |
| |
| |
| |
A Definition of Topology Control | |
| |
| |
| |
A Taxonomy of Topology Control | |
| |
| |
| |
Topology Control in the Protocol Stack | |
| |
| |
| |
The Critical Transmitting Range | |
| |
| |
| |
The CTR for Connectivity: Stationary Networks | |
| |
| |
| |
The CTR in Dense Networks | |
| |
| |
| |
The CTR in Sparse Networks | |
| |
| |
| |
The CTR with Different Deployment Region and Node Distribution | |
| |
| |
| |
Irregular Radio Coverage Area | |
| |
| |
| |
The CTR for Connectivity: Mobile Networks | |
| |
| |
| |
The CTR in RWPMobile Networks | |
| |
| |
| |
The CTR with Bounded, Obstacle-free Mobility | |
| |
| |
| |
Other Characterizations of the CTR 63 | |
| |
| |
| |
The CTR for k-connectivity | |
| |
| |
| |
The CTR for Connectivity with Bernoulli Nodes | |
| |
| |
| |
The Critical Coverage Range | |
| |
| |
| |
Topology Optimization Problems | |
| |
| |
| |
The Range Assignment Problem | |
| |
| |
| |
Problem Definition | |
| |
| |
| |
The RA Problem in One-dimensional Networks | |
| |
| |
| |
The RA Problem in Two- and Three-dimensional Networks | |
| |
| |
| |
The Symmetric Versions of the Problem | |
| |
| |
| |
The Energy Cost of the Optimal Range Assignment | |
| |
| |
| |
Energy-efficient Communication Topologies | |
| |
| |
| |
Energy-efficient Unicast | |
| |
| |
| |
Energy-efficient Broadcast | |
| |
| |
| |
Distributed Topology Control | |
| |
| |
| |
Distributed Topology Control: Design Guidelines | |
| |
| |
| |
Ideal Features of a Topology Control Protocol | |
| |
| |
| |
The Quality of Information | |
| |
| |
| |
Logical and Physical Node Degrees | |
| |
| |
| |
Location-based Topology Control | |
| |
| |
| |
The R&M Protocol | |
| |
| |
| |
The LMST Protocol | |
| |
| |
| |
Direction-based Topology Control | |
| |
| |
| |
The CBTC Protocol | |
| |
| |
| |
The DistRNG Protocol | |
| |
| |
| |
Neighbor-based Topology Control | |
| |
| |
| |
The Number of Neighbors for Connectivity | |
| |
| |
| |
The KNeigh Protocol | |
| |
| |
| |
The XTC Protocol | |
| |
| |
| |
Dealing with Node Mobility | |
| |
| |
| |
TC Design Guidelines with Mobility | |
| |
| |
| |
TC in Mobile Networks: an Example | |
| |
| |
| |
The Effect of Mobility on the CNN | |
| |
| |
| |
Distributed TC in Mobile Networks: Existing Solutions | |
| |
| |
| |
Toward an Implementation of Topology Control | |
| |
| |
| |
Level-based Topology Control | |
| |
| |
| |
Level-based TC:Motivations | |
| |
| |
| |
The COMPOW Protocol | |
| |
| |
| |
The CLUSTERPOW Protocol | |
| |
| |
| |
The KNeighLev Protocol | |
| |
| |
| |
Comparing CLUSTERPOW and KneighLev | |
| |
| |
| |
Open Issues | |
| |
| |
| |
TC for Interference | |
| |
| |
| |
More-realistic Models | |
| |
| |
| |
Mobility and Topology Control | |
| |
| |
| |
Considering MultiHop Data Traffic | |
| |
| |
| |
Implementation of TC | |
| |
| |
| |
Case Study and Appendices | |
| |
| |
| |
Case Study: TC and Cooperative Routing in Ad hoc Networks | |
| |
| |
| |
Cooperation in Ad hoc Networks | |
| |
| |
| |
Reference Application Scenario | |
| |
| |
| |
Modeling Routing as a Game | |
| |
| |
| |
A Practical Interpretation of Truthfulness | |
| |
| |
| |
Truthful Routing without TC | |
| |
| |
| |
Truthful Routing with TC | |
| |
| |
| |
Conclusion | |
| |
| |
| |
Elements of Graph Theory | |
| |
| |
| |
Basic Definitions | |
| |
| |
| |
Proximity Graphs | |
| |
| |
| |
Elements of Applied Probability | |
| |
| |
Bibliography | |
| |
| |
Index | |