Muutke küpsiste eelistusi

E-raamat: Hierarchical Topology Control for Wireless Networks: Theory, Algorithms, and Simulation

, , ,
  • Formaat: 451 pages
  • Ilmumisaeg: 05-Feb-2018
  • Kirjastus: CRC Press Inc
  • Keel: eng
  • ISBN-13: 9781482298703
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 58,49 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Hierarchical Topology Control for Wireless Networks: Theory, Algorithms, and SimulationSuurem pilt
  • Formaat: 451 pages
  • Ilmumisaeg: 05-Feb-2018
  • Kirjastus: CRC Press Inc
  • Keel: eng
  • ISBN-13: 9781482298703
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book discusses hierarchical topology control for wireless networks with an emphasis on theories and algorithms. It includes chapters on the basic concept consisting of architecture and applications on wireless ad hoc networks and wireless sensor networks, the basic concept of topology control, the clustering algorithm in topology control and the virtual backbone construction algorithms, focusing on connected dominating set construction, which includes various transformations for dominating sets. The final chapter gives two comprehensive simulation examples.

Preface xi
Acknowledgments xv
Authors xvii
1 Wireless Networks 1(56)
1.1 Introduction
1(10)
1.1.1 Introduction to Wireless Networks
1(6)
1.1.1.1 Development History of Wireless Networks
1(5)
1.1.1.2 Standards for Wireless Networks
6(1)
1.1.2 Classification of Wireless Networks
7(4)
1.2 Wireless Ad Hoc Network
11(9)
1.2.1 Introduction to Wireless Ad Hoc Networks
11(3)
1.2.2 Characteristics of Ad Hoc Networks
14(2)
1.2.3 The Structure of the Nodes in Ad Hoc Networks
16(1)
1.2.4 The Architecture of Ad Hoc Networks
17(3)
1.2.5 The Application of Ad Hoc Networks
20(1)
1.3 Wireless Sensor Network
20(35)
1.3.1 Introduction to the WSN
20(1)
1.3.2 The Structure of Nodes in WSNs
21(3)
1.3.3 The Architecture of WSNs
24(8)
1.3.4 Technologies of WSNs
32(4)
1.3.5 Applications of the WSN
36(15)
1.3.5.1 Military Application
36(1)
1.3.5.2 Agricultural Application
37(2)
1.3.5.3 Industrial Application
39(3)
1.3.5.4 Environmental Observation and Forecasting System
42(2)
1.3.5.5 Building Condition Monitoring
44(2)
1.3.5.6 Medical Nursing
46(3)
1.3.5.7 Smart Home
49(1)
1.3.5.8 Space and Ocean Exploration
49(2)
1.3.6 Characteristics and Challenges of WSNs
51(4)
References
55(2)
2 Topology Control of Wireless Networks 57(22)
2.1 Introduction of Topology Control
57(6)
2.2 The Classification of Topology Control
63(13)
2.2.1 Power Control
63(12)
2.2.1.1 Minimize the Maximum Transmit Power
64(2)
2.2.1.2 Common Power Allocation
66(1)
2.2.1.3 Direction-Based Power Control
67(1)
2.2.1.4 Power Control Based on Node Degree
67(3)
2.2.1.5 Power Control Based on Proximity Graph
70(5)
2.2.2 Hierarchical Topology Control
75(1)
References
76(3)
3 Clustering Algorithms 79(162)
3.1 Clustering Routing Protocols in Wireless Ad Hoc Networks
79(6)
3.1.1 Outline
79(2)
3.1.2 Classic Clustering Algorithms in Wireless Ad Hoc Networks
81(4)
3.1.2.1 Minimum ID Clustering Algorithm
81(1)
3.1.2.2 Maximum Degree Clustering Algorithm
81(1)
3.1.2.3 Motion-Based Clustering Algorithm
82(1)
3.1.2.4 Weight-Based Clustering Algorithm
83(1)
3.1.2.5 Clustering Algorithm Based on Geographical Location
84(1)
3.2 Clustering Routing Protocol in a WSN
85(147)
3.2.1 Outline
85(2)
3.2.2 The Advantages and Goals of Clustering Algorithms
87(3)
3.2.3 The Classification of Clustering Algorithms
90(8)
3.2.3.1 The Characteristics of Clusters
91(3)
3.2.3.2 The Characteristics of Cluster Heads
94(1)
3.2.3.3 The Process of Clustering
95(3)
3.2.3.4 The Whole Process of the Algorithms
98(1)
3.2.4 Classic Clustering Algorithms and Related Works in WSNs
98(143)
3.2.4.1 LEACH
98(8)
3.2.4.2 Centralized and Hybrid Clustering Algorithms (LEACH-C)
106(7)
3.2.4.3 Iterative Clustering Algorithms
113(8)
3.2.4.4 Chain Clustering Algorithms (PEGASIS)
121(10)
3.2.4.5 Energy Heterogeneous Clustering Algorithms
131(7)
3.2.4.6 Self-Adaptive Clustering Algorithms
138(9)
3.2.4.7 Uneven Clustering Algorithms
147(29)
3.2.4.8 Energy-Driven Clustering Algorithms
176(9)
3.2.4.9 Grid Clustering Algorithms
185(4)
3.2.4.10 Responsive Hybrid Clustering Algorithms
189(3)
3.2.4.11 Multilayer Clustering Algorithms
192(11)
3.2.4.12 Clustering Algorithms Based on Fuzzy Logic Control
203(12)
3.2.4.13 Other Clustering Algorithms
215(17)
Bibliography
232(9)
4 Dominating Set Theory and Algorithms 241(110)
4.1 Basic Concept and Models of the Dominating Set
241(2)
4.1.1 Basic Concept
241(1)
4.1.2 Network Model
241(3)
4.1.2.1 Unit Disk Graph
242(1)
4.1.2.2 Quasi Unit Disk Graph
242(1)
4.1.2.3 Unit Ball Graph
243(1)
4.2 The Function of the Dominating Set
243(1)
4.3 The Classification of Dominating Set Algorithms
244(92)
4.3.1 The Maximal Independent Set Algorithm
244(8)
4.3.1.1 Related Works of MIS
245(1)
4.3.1.2 Classical MIS Algorithm
246(6)
4.3.2 Minimum Connected Dominating Set
252(6)
4.3.2.1 Related Works of the Minimum Connected Dominating Set
252(2)
4.3.2.2 MCDS Distributed Algorithms with Good Performance
254(4)
4.3.3 Weakly Connected Dominating Sets
258(8)
4.3.3.1 The Related Works of Weakly Connected Dominating Sets
259(1)
4.3.3.2 The Distributed WCDS Algorithm
260(6)
4.3.4 Extended Weakly Dominating Sets
266(14)
4.3.4.1 Classical Extended Dominating Set Algorithm
266(2)
4.3.4.2 Three Novel EWCDS Algorithms
268(12)
4.3.5 The Edge Dominating Set
280(3)
4.3.5.1 Related Works of the Edge Dominating Set
280(1)
4.3.5.2 The Classical Edge Dominating Set Algorithm
281(2)
4.3.6 The Dominating Set Algorithm under the Mobile Model
283(10)
4.3.6.1 The Introduction of a Mobile Model
283(2)
4.3.6.2 DETM-CDS
285(8)
4.3.7 The Dominating Set Algorithm under the Interference Model
293(11)
4.3.7.1 The Physical Interference Model
293(1)
4.3.7.2 The Protocol Interference Model
294(6)
4.3.7.3 The Dominating Set Construction Algorithm Based on Interference
300(4)
4.3.8 k-Dominating Set
304(7)
4.3.8.1 k-Dominating Set and k-Connected Dominating Set
304(3)
4.3.8.2 The k-Connected m-Dominating Set
307(4)
4.3.9 Domatic Partition
311(25)
4.3.9.1 The Research Meaning of Domatic Partition
311(1)
4.3.9.2 The Definition and Classification of the Domatic Partition Problem
312(1)
4.3.9.3 Domatic Partition on the Special Graph in Graph Theory
313(4)
4.3.9.4 The Research Status of Domatic Partition Problem
317(4)
4.3.9.5 k-Domatic Partition
321(15)
4.3.9.6 Public Problems
336(1)
4.4 Distributed Algorithm in the Wireless Network
336(7)
4.4.1 Introduction
337(1)
4.4.2 The Distributed Algorithm
338(5)
4.4.2.1 The Classic Problem in the Distributed Computing-Maximal Independent Set Problem
339(1)
4.4.2.2 Finding a Fast Distributed Maximal Independent Set Algorithm
340(1)
4.4.2.3 Local Algorithms
341(2)
4.4.3 Conclusion
343(1)
Bibliography
343(8)
5 Simulation and Example 351(74)
5.1 Simulation
351(3)
5.1.1 Computer Simulation Technology
351(1)
5.1.2 Simulation Tools of Wireless Networks
351(3)
5.2 Simulation Based on NS2 and Examples
354(43)
5.2.1 Introduction to NS2
354(1)
5.2.2 Characteristics and Structure of NS2
354(3)
5.2.2.1 Characteristics of NS2
354(1)
5.2.2.2 The Hierarchical Structure of NS2
355(1)
5.2.3 The General Methods and Processes of NS2 Simulation
356(1)
5.2.4 Installation of NS2
357(1)
5.2.5 LEACH Protocol and Its Simulation Process
358(32)
5.2.5.1 The Details of the LEACH Algorithm
359(4)
5.2.5.2 The Installation of the LEACH Protocol
363(5)
5.2.5.3 Simulation of LEACH Protocol
368(22)
5.2.6 The EDUC Simulation Example
390(3)
5.2.7 EADC Simulation Examples
393(4)
5.2.7.1 Cluster Head Distribution
394(1)
5.2.7.2 Network Lifetime
395(2)
5.3 Simulation and Example Based on C++
397(14)
5.3.1 Introduction to VC++
397(1)
5.3.2 The Development Environment of VC++
398(1)
5.3.2.1 VC++ 6.0
398(1)
5.3.2.2 VS2005
399(1)
5.3.3 Simulation Example of the EWCDS Algorithm
399(12)
5.3.3.1 Simulation Results
400(6)
5.3.3.2 The Specific Implementation Process of Simulation
406(5)
5.4 Simulation and Example Based on Java
411(12)
5.4.1 Introduction to Java
411(2)
5.4.1.1 Download and installation of the Java Development Kit package
412(1)
5.4.2 Simulation Example of the EDCDS Algorithm
413(10)
5.4.2.1 Algorithm Description
413(1)
5.4.2.2 Simulation Analysis and Results
414(9)
Bibliography
423(2)
Index 425
Jiguo Yu received the PhD degree in School of mathematics from Shandong University in 2004. From 2007, he has been a professor in the School of Computer Science, Qufu Normal University, Shandong, China. He is currently a professor in the School of Information Science and Engineering, Qufu Normal University. His main research interests include wireless networks, privacy-aware computing, distributed algorithms, peer-to-peer computing and graph theory. In particular, he is interested in designing and analyzing algorithms for many computationally hard problems in networks. He has published 100+ papers on top journals and conferences such as IEEE/ACM Transactions on Networking, IEEE Transactions on vehicular Technology, IEEE Internet of Things Journal, IEEE Transactions on Big Data, IEEE Transaction on Cloud Computing, IEEE INFOCOM, IEEE ICDCS and so on. He is an editor of Journal of Network and Computer Applications and International Journal of Sensor Networks, a senior member of IEEE and CCF (China Computer Federation).
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97814822987032e.html
Märksõnad: