Ad hoc networking / Charles E. Perkins, editor.

Contributor(s): Perkins, Charles E, 1951-.

Material type: materialTypeLabel

BookPublisher: Boston ; London : Addison-Wesley, c2001Description: xii, 370 p. : ill. ; 25 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 0201309769; 9780201309768.Subject(s): Computer networks

| Mobile phone technology | Computer networking & communicationsDDC classification: 004.6 ADH

Holdings
Item type	Current library	Call number	Status	Barcode
General lending	MTU Kerry North Campus Library Ground Floor Main	004.6 ADH (Browse shelf(Opens below))	Available	38888000877849

Total holds: 0

Browsing MTU Kerry North Campus Library shelves, Shelving location: Ground Floor Main Close shelf browser (Hides shelf browser)

Previous						No cover image available		Next
Previous	004.36 SLO Network and distributed systems management /	004.56 BRI Smart cards : principles, practice, applications /	004.6 ADA TestPrep MCSE: networking essentials . Networking essentials /	004.6 ADH Ad hoc networking /	004.6 ANG CCNA certification all-in-one for dummies /	004.6 ARE Professional WAP /	004.6 BEA Computer communications /	Next

Enhanced descriptions from Syndetics:

Ad hoc networks are wireless, mobile networks that can be set up anywhere and anytime, outside the Internet or another preexisting network infrastructure. The 11 chapters in this book present algorithms and protocols for ad hoc networks, and consider issues of scalability, cost, bandwidth efficiency, power requirements, compatibility, quality of service and security. The authors also discuss potential applications, review networking concepts, and examine the various approaches that define emerging ad hoc networking technologies. Annotation copyrighted by Book News, Inc., Portland, OR

Includes bibliographical references and index.

Table of contents provided by Syndetics

Preface (p. xi)
1 Ad Hoc Networking: An Introduction (p. 1)
1.1 Model of Operation (p. 3)
1.1.1 Symmetric Links (p. 6)
1.1.2 Layer-2 Ad Hoc Solutions (p. 6)
1.1.3 Proactive versus Reactive Protocols (p. 7)
1.1.4 Multicast (p. 8)
1.2 Commercial Applications of Ad Hoc Networking (p. 8)
1.2.1 Conferencing (p. 9)
1.2.2 Home Networking (p. 9)
1.2.3 Emergency Services (p. 10)
1.2.4 Personal Area Networks and Bluetooth (p. 10)
1.2.5 Embedded Computing Applications (p. 11)
1.2.6 Sensor Dust (p. 12)
1.2.7 Automotive/PC Interaction (p. 13)
1.2.8 Other Envisioned Applications (p. 14)
1.3 Technical and Market Factors Affecting Ad Hoc Networks (p. 14)
1.3.1 Scalability (p. 15)
1.3.2 Power Budget versus Latency (p. 17)
1.3.3 Protocol Deployment and Incompatible Standards (p. 17)
1.3.4 Wireless Data Rates (p. 18)
1.3.5 User Education and Acculturation (p. 19)
1.3.6 Additional Security Exposure (p. 19)
1.3.7 Spotty Coverage (p. 20)
1.4 General Comments on Routing Protocols (p. 20)
1.5 Description of the Material Presented (p. 23)
2 A DoD Perspective on Mobile Ad Hoc Networks (p. 29)
2.1 Motivation (p. 30)
2.2 The Past (p. 33)
2.2.1 DARPA Packet Radio Network (p. 34)
2.2.2 Survivable Radio Networks (p. 35)
2.2.3 Other DoD Efforts in MANET (p. 36)
2.2.4 Other Efforts in MANET (p. 38)
2.3 The Present (p. 39)
2.3.1 Tactical Internet (p. 41)
2.3.2 ELB (p. 41)
2.3.3 GloMo (p. 42)
2.3.4 IETF MANET Working Group (p. 44)
2.4 The Future (p. 44)
2.4.1 Commercial Applications (p. 44)
2.4.2 DoD (p. 46)
2.4.3 Open Research Issues (p. 47)
2.5 Conclusion (p. 48)
3 DSDV: Routing over a Multihop Wireless Network of Mobile Computers (p. 53)
3.1 Introduction (p. 54)
3.2 Overview of Routing Methods (p. 55)
3.2.1 Link-State (p. 55)
3.2.2 Distance-Vector (p. 56)
3.3 Destination-Sequenced Distance Vector Protocol (p. 57)
3.3.1 Protocol Overview (p. 57)
3.3.2 Route Advertisements (p. 58)
3.3.3 Route Table Entry Structure (p. 58)
3.3.4 Responding to Topology Changes (p. 59)
3.3.5 Route Selection Criteria (p. 60)
3.3.6 Operating DSDV at Layer 2 (p. 61)
3.3.7 Extending Base Station Coverage (p. 62)
3.4 Examples of DSDV in Operation (p. 62)
3.4.1 Damping Fluctuations (p. 65)
3.5 Properties of the DSDV Protocol (p. 68)
3.6 Comparison with other Methods (p. 70)
3.7 Future Work (p. 71)
3.8 Summary (p. 72)
4 Cluster-Based Networks (p. 75)
4.1 Clustering for Transmission Management (p. 77)
4.1.1 Link-Cluster Architecture (p. 77)
4.2 Clustering for Backbone Formation (p. 81)
4.2.1 Near-Term Digital Radio Network (p. 81)
4.2.2 Virtual Subnet Architecture (p. 85)
4.3 Clustering for Routing Efficiency (p. 90)
4.3.1 Hierarchical Routing (p. 91)
4.3.2 Clustering (p. 127)
4.4 Conclusion (p. 135)
5 DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks (p. 139)
5.1 Assumptions (p. 141)
5.2 DSR Protocol Description--Overview and Important Properties (p. 143)
5.2.1 DSR Route Discovery (p. 144)
5.2.2 DSR Route Maintenance (p. 146)
5.2.3 Additional Route Discovery Features (p. 147)
5.2.4 Additional Route Maintenance Features (p. 151)
5.2.5 Support for Heterogeneous Networks and Mobile IP (p. 154)
5.2.6 Multicast Routing with DSR (p. 158)
5.2.7 Location of DSR Functions in the ISO Network Reference Model (p. 158)
5.3 DSR Evaluation (p. 159)
5.3.1 Simulation Summary (p. 159)
5.3.2 DSR Implementation and Testbed Summary (p. 162)
5.4 Related Work (p. 164)
5.5 Conclusion (p. 167)
6 The Ad Hoc On-Demand Distance-Vector Protocol (p. 173)
6.1 AODV Properties (p. 175)
6.2 Unicast Route Establishment (p. 176)
6.2.1 Route Discovery (p. 177)
6.2.2 Expanding Ring Search (p. 178)
6.2.3 Forward Path Setup (p. 179)
6.2.4 Route Maintenance (p. 180)
6.2.5 Local Connectivity Management (p. 181)
6.2.6 Actions after Reboot (p. 182)
6.3 Multicast Route Establishment (p. 182)
6.3.1 Route Discovery (p. 183)
6.3.2 Forward Path Setup (p. 184)
6.3.3 Multicast Route Activation/Deactivation (p. 184)
6.3.4 Multicast Tree Maintanence (p. 185)
6.3.5 Actions after Reboot (p. 190)
6.4 Broadcast (p. 190)
6.5 Simulations (p. 191)
6.5.1 Unicast Simulations (p. 192)
6.5.2 Multicast Simulations (p. 197)
6.6 Optimizations and Enhancements (p. 203)
6.6.1 Quality of Service (p. 204)
6.6.2 Subnet Routing (p. 204)
6.6.3 AODV and Mobile IP (p. 205)
6.7 Future Work (p. 206)
6.7.1 Security (p. 206)
6.7.2 Asymmetric Routing (p. 206)
6.8 Conclusion (p. 207)
Appendix A Message Formats (p. 209)
A.1 Route Request (p. 209)
A.2 Route Reply (p. 210)
A.3 Route Error (p. 211)
A.4 Multicast Activation (p. 212)
A.5 Group Hello (p. 213)
Appendix B Extension Formats (p. 214)
B.1 Hello Interval (p. 214)
B.2 Multicast Group Leader (p. 215)
B.3 Multicast Group Rebuild (p. 215)
B.4 Multicast Group Information (p. 216)
B.5 Maximum Delay (p. 216)
B.6 Minimum Bandwidth (p. 217)
Appendix C Configuration Parameters (p. 218)
7 ZRP: A Hybrid Framework for Routing in Ad Hoc Networks (p. 221)
7.1 Reconfigurable Wireless Networks (p. 221)
7.2 The Communication Environment and the RWN Model (p. 223)
7.3 The Zone Routing Protocol (p. 225)
7.3.1 Reactive versus Proactive Routing (p. 225)
7.3.2 Routing Zones and Intrazone Routing (p. 227)
7.3.3 Interzone Routing and the Zone Routing Protocol (p. 228)
7.4 ZRP--Formal Description (p. 232)
7.4.1 Neighbor Discovery Protocol (p. 232)
7.4.2 The Intrazone Routing Protocol (p. 234)
7.4.3 The Interzone Routing Protocol (p. 235)
7.5 Evaluation of ZRP (p. 240)
7.6 Performance Results (p. 244)
7.7 Conclusion (p. 249)
Appendix (p. 251)
8 Link Reversal Routing (p. 255)
8.1 General Approach (p. 255)
8.2 The Gafni-Bertsekas Algorithm (p. 258)
8.3 The Lightweight Mobile Routing Algorithm (p. 262)
8.3.1 Protocol Description (p. 265)
8.3.2 Properties of the Protocol (p. 273)
8.4 The Temporally Ordered Routing Algorithm (p. 275)
8.4.1 Protocol Description (p. 276)
8.4.2 Properties of the Protocol (p. 286)
8.5 Comparison of LRR Algorithms (p. 295)
8.6 Conclusion (p. 295)
9 The Effects of Beaconing on the Battery Life of Ad Hoc Mobile Computers (p. 299)
9.1 Motivation (p. 299)
9.2 Ad Hoc Wireless Networks (p. 300)
9.2.1 Power Issues (p. 301)
9.2.2 Smart Batteries and Battery Characteristics (p. 301)
9.3 Associativity Based Routing (p. 303)
9.3.1 ABR Protocol Description (p. 304)
9.3.2 ABR Route Discovery Phase (p. 304)
9.3.3 Handling Mobility in ABR (p. 305)
9.3.4 ABR Route Deletion Phase (p. 306)
9.4 Effects of Beaconing on Battery Life (p. 306)
9.4.1 Experimental Hardware (p. 307)
9.4.2 Experimental Software (p. 308)
9.5 Experimental Results and Observations (p. 310)
9.5.1 Standalone Beaconing at High Frequencies (p. 310)
9.5.2 Standalone Beaconing at Low Frequencies (p. 313)
9.5.3 Beaconing with Neighboring Nodes at High Frequencies (p. 314)
9.5.4 Beaconing with Neighboring Nodes at Low Frequencies (p. 317)
9.5.5 Deductions (p. 318)
9.6 Conclusion (p. 320)
10 Bandwidth-Efficient Link-State Routing in Wireless Networks (p. 323)
10.1 Updating Routes in Wireless Networks (p. 326)
10.2 STAR Description (p. 328)
10.2.1 Information Stored and Exchanged (p. 329)
10.2.2 Validating Updates (p. 330)
10.2.3 Exchanging Update Messages (p. 330)
10.2.4 Example (p. 336)
10.2.5 Impact of the Link Layer (p. 336)
10.3 Performance Evaluation (p. 338)
10.3.1 Comparison with Table-Driven Protocols (p. 339)
10.3.2 Comparison with On-Demand Routing Protocols (p. 340)
10.4 Conclusion (p. 347)
11 Summary and Future Work (p. 351)
11.1 Future Work (p. 351)
11.1.1 Scalability (p. 352)
11.1.2 Quality of Service (p. 352)
11.1.3 Is the Client-Server Model Viable? (p. 353)
11.1.4 Connecting to the Internet (p. 354)
11.1.5 Security (p. 355)
11.1.6 Power Control (p. 356)
11.2 Other Approaches (p. 357)
11.2.1 Location-Assisted Routing (p. 357)
11.2.2 Fisheye Routing (p. 357)
11.2.3 CEDAR (p. 358)
11.3 A Possible Vision of the Future (p. 358)
11.4 For More Information (p. 360)
Index (p. 363)

Excerpt provided by Syndetics

The field of ad hoc networking is reemerging amid unprecedented growth in the scale and diversity of computer networking. New horizons for wireless connectivity have come into view along with a new sense of the inevitability of wireless data transmission over IP, the Internet Protocol that patches the Internet together. With new wireless products and research have come a more widespread familiarity between network protocol engineers and wireless media and some recognition that wireless media are almost as good as wired media for transmitting data--as long as one can overlook the differences in transmission speed. Almost-- or perhaps even better-- because of the dramatically greater convenience promised by mobile computing. Unfortunately, there is another reason that mobile computing is often not truly as convenient as conventional computing. The Internet cannot yet handle mobile computers very well. Although this situation is changing quickly, almost no one would disagree that a fixed computer with wired media offers a better computing and communications environment than a mobile wireless computer--even more so for PDAs. The task set before today's network engineers is to eliminate the shortcomings of mobile computers and wireless media so that the inherent convenience of mobility will no longer suffer the burden of inadequate or inappropriate system design. Part of the inadequacy of current system design starts with the outdated assumptions made in the network and routing protocols deployed in the Internet today. Many efforts to repair these outdated assumptions rely on additional infrastructure elements for managing data related to mobile computers--for example, Mobile IP--and various proxy architectures. These efforts and others offer new design perspectives that either preserve the time-honored end-to-end model of Internet communications or that offer new models aimed at improving user experience. Perhaps naturally, the wide deployment of the Internet has provided additional impetus for exploring the benefits of computer internetworking even for situations in which neither the Internet per se nor any other internetwork is reachable. In such situations, one might still wish to use familiar network programs to carry on the same kinds of interactive computing with neighbors and associates in the area. Network programs can typically continue to work as long as they can identify the IP address of the desired destination and a path of one or more network links toward the destination. Finding such paths is the job of ad hoc network algorithms and protocols. Exploring that design space has been an increasingly active area of research in the last few years. It is our hope that the diverse algorithms and protocols described in this book will give the reader a good idea of the current state of the art in ad hoc networking. The authors of each chapter are among the foremost practitioners in the field, and each one will no doubt try to convince the reader that his or her approach is best. The result may be as confusing or as delightful as trying to order the best meal in a fabulous restaurant with a menu created by a crew of creative and distinctively different chefs. Bon Appetit! 0201309769P04062001 Excerpted from Ad Hoc Networking by Charles Perkins All rights reserved by the original copyright owners. Excerpts are provided for display purposes only and may not be reproduced, reprinted or distributed without the written permission of the publisher.

Author notes provided by Syndetics

Charles E. Perkins is a Research Fellow at Nokia Research Center investigating mobile wireless networking and dynamic configuration protocols. He is the editor for several ACM and IEEE journals for areas relating to wireless networking. Charles has served on the Internet Architecture Board (IAB) of the Internet Engineering Task Force (IETF) and on various committees for the National Research Council