Abstract
Wireless sensor networks (WSNs) are now widely used in many applications. However, routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks. The concept of hierarchical routing is widely used to perform energy-efficient routing in WSNs. Thus, a Connected Dominating Set (CDS) has been recommended to serve as a virtual backbone for a WSN to reduce routing overhead. Fault tolerance and routing flexibility are necessary for routing since nodes in WSNs are prone to failures. Hence, it is important to maintain a certain degree of redundancy in a CDS. Therefore, the concept of k-connected m-dominating sets (kmCDS) is used to provide these redundancies. In this chapter, we present CDS based routing protocols and focus on how to construct CDS and kmCDS, including both centralized and distributed algorithms.
Related Journals
Recent Patents on Computer Science
Current E-Learning
Current Computer Science
International Journal of Sensors, Wireless Communications and Control
Recent Advances in Computer Science and Communications
Journal of Fuzzy Logic and Modeling in Engineering
The Chinese Journal of Artificial Intelligence
Current Chinese Computer Science
Recent Advances in Communications and Networking Technology (Discontinued)
Related Books
Computational Intelligence For Data Analysis
Applied Machine Learning and Multi-Criteria Decision-Making in Healthcare
A First Course in Artificial Intelligence
Artificial Intelligence: Models, Algorithms and Applications
Advanced Computing Techniques: Implementation, Informatics and Emerging Technologies
Handbook of Mobile Application Development: A Guide to Selecting the Right Engineering and Quality Features
Applications of Modern High Performance Networks
Arduino Meets Matlab: Interfacing, Programs and Simulink
Arduino and SCILAB based Projects
Application of Chaos and Fractals to Computer Vision