Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks

Pirmais vāks
Jie Wu
CRC Press, 2005. gada 8. aug. - 896 lappuses
The availability of cheaper, faster, and more reliable electronic components has stimulated important advances in computing and communication technologies. Theoretical and algorithmic approaches that address key issues in sensor networks, ad hoc wireless networks, and peer-to-peer networks play a central role in the development of emerging network

No grāmatas satura

Saturs

Chapter 2 Routing Scalability in MANETs
17
Chapter 3 Uniformly Distributed Algorithm for Virtual Backbone Routing in Ad Hoc Wireless Networks
35
Chapter 4 Maximum Necessary Hop Count for Packet Routing in MANETs
43
Chapter 5 Efficient StrategyProof Multicast in Selfish Wireless Networks
53
Chapter 6 Geocasting in Ad Hoc and Sensor Networks
79
Present Solutions and Open Issues
99
Chapter 8 MinimumEnergy Topology Control Algorithms in Ad Hoc Networks
115
An Overview
133
Chapter 27 Models and Algorithms for Coverage Problems in Wireles Sensor Networks
441
Chapter 28 Maintaining Sensing Coverage and Connectivity in Large Sensor Networks
453
Chapter 29 Advances in Target Tracking and Active Surveillance Using Wireless Sensor Networks
475
Chapter 30 EnergyEfficient Detection Algorithms for Wireless Sensor Networks
491
Chapter 31 Comparison of CellBased and TopologyControlBased Energy Conservation in Wireless Sensor Networks
507
Chapter 32 QoS Support for Delay Sensitive Applications in Wireless Networks of UAVs
529
Chapter 33 A Scalable Solution for Securing Wireless Sensor Networks
547
Chapter 34 Antireplay Protocols for Sensor Networks
561

Chapter 10 A Survey of Algorithms for Power Assignment in Wireless Ad Hoc Networks
147
Chapter 11 Energy Conservation for Broadcast and Multicast Routings in Wireless Ad Hoc Networks
159
Chapter 12 Linear Programming Approaches to Optimization Problems of Energy Efficiency in Wireless Ad Hoc Networks
177
Chapter 13 Wireless Networks World and Security Algorithms
193
Chapter 14 Reliable Computing in Ad Hoc Networks
219
Problems and Solutions
231
Chapter 16 On Using Ad Hoc Relaying in NextGeneration Wireless Networks
251
A Flexible and Robust Data Communication
267
Chapter 18 Adaptive CycleControlled ELimited Polling in Bluetooth Piconets
283
Chapter 19 Scalable Wireless Ad Hoc Network Simulation
297
Sensor Networks
313
State of the Art and Future Challenges
317
Initializing Ad Hoc and Sensor Networks
347
Chapter 22 SelfOrganization of Wireless Sensor Networks
369
Chapter 23 SelfStabilitizing Distributed Systems and Sensor Networks
393
Chapter 24 Time Synchronization in Wireless Sensor Networks
403
Chapter 25 Routing and Broadcasting in Hybrid Ad Hoc and Sensor Networks
415
Chapter 26 Distributed Algorithms for Deploying Mobile Sensors
427
Chapter 35 Low Power Consumption Features of the IEEE 802154 WPAN Standard
575
PeertoPeer Networks
587
A Technique Perspective
591
Chapter 37 Searching Techniques in PeertoPeer Networks
617
Chapter 38 Semantic Search in PeertoPeer Systems
643
Chapter 39 An Overview of Structured P2P Overlay Networks
665
Chapter 40 Distributed Data Structures for PeertoPeer Systems
685
Chapter 41 State Management in DHT with LastMile Wireless Extension
701
Chapter 42 Topology Constructuon and Resource Discovery in PeertoPeer Networks
733
Chapter 43 PeertoPeer Overlay Optimization
753
Analysis and Enhancement
767
Highly Reliable and Efficient Networks of True Peers
787
Chapter 46 Scalable and Secure P2P Overlay Networks
813
Chapter 47 PeertoPeer Overlay Abstractions in MANETs
845
Index
863
Back cover
875
Autortiesības

Citi izdevumi - Skatīt visu

Bieži izmantoti vārdi un frāzes

Populāri fragmenti

310. lappuse - David B. Johnson and David A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks.
101. lappuse - The remainder of the chapter is organized as follows. In the next section...
249. lappuse - J. Broch, DA Maltz, DB Johnson, YC Hu, and J Jetcheva, A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols...
279. lappuse - In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom -98), October 25-30, 1998, Dallas, Texas, USA.
280. lappuse - Y.-B. Ko and NH Vaidya. Location-Aided Routing (LAR) in Mobile Ad Hoc Networks. In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom'98), Dallas, TX, 1998.
41. lappuse - J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks.
230. lappuse - In Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'99), pages 207-218, August 1999. 22. M. Shivanajay, CK Tham, and D. Srinivasan. Mobile Agents Based Routing Protocol for Mobile Ad Hoc Networks.
167. lappuse - To obtain the multicast tree, the broadcast tree is pruned by eliminating all transmissions that are not needed to reach the members of the multicast group. More specifically, nodes with no downstream destinations do not transmit, and some nodes may be able to reduce their transmitted power.
280. lappuse - S. Murthy and JJ Garcia-Luna-Aceves. A Routing Protocol for Packet Radio Networks.
281. lappuse - Toh. A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing.

Par autoru (2005)

Jie Wu

Bibliogrāfiskā informācija