Welcome to the InfoSci Platform
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things

Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things

Can Umut Ileri, Yasin Yigit, Ozkan Arapoglu, Hüseyin Tolga Evcimen, Mustafa Asci, Orhan Dagdeviren
Copyright: © 2019 |Pages: 36
ISBN13: 9781522573357|ISBN10: 1522573356|ISBN13 Softcover: 9781522590552|EISBN13: 9781522573364
DOI: 10.4018/978-1-5225-7335-7.ch017
Cite Chapter Cite Chapter

MLA

Ileri, Can Umut, et al. "Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things." Handbook of Research on the IoT, Cloud Computing, and Wireless Network Optimization, edited by Surjit Singh and Rajeev Mohan Sharma, IGI Global, 2019, pp. 347-382. https://doi.org/10.4018/978-1-5225-7335-7.ch017

APA

Ileri, C. U., Yigit, Y., Arapoglu, O., Evcimen, H. T., Asci, M., & Dagdeviren, O. (2019). Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things. In S. Singh & R. Mohan Sharma (Eds.), Handbook of Research on the IoT, Cloud Computing, and Wireless Network Optimization (pp. 347-382). IGI Global. https://doi.org/10.4018/978-1-5225-7335-7.ch017

Chicago

Ileri, Can Umut, et al. "Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things." In Handbook of Research on the IoT, Cloud Computing, and Wireless Network Optimization, edited by Surjit Singh and Rajeev Mohan Sharma, 347-382. Hershey, PA: IGI Global, 2019. https://doi.org/10.4018/978-1-5225-7335-7.ch017

Export Reference

Mendeley
Favorite

Abstract

Main components of internet of things such as wireless sensor networks (WSNs) are generally modeled as graphs. Matching, dominating set, spanning tree, and vertex cover are fundamental graph theoretical structures which are widely used to solve backup assignment, clustering, backbone formation, routing, link monitoring, and other important problems in WSNs. Capacitated versions of these graph theoretical problems restrict at least one feature of the original problem such as a capacity value assignment to restrict the number of cluster member that a cluster head can serve in capacitated dominating set problem, limiting the number of nodes in each subtree connected to the root in capacitated minimum spanning tree problem, etc. The general aim of these operations is to provide energy efficiency by balancing the load evenly across the nodes. In this chapter, the authors introduce important capacitated graph theoretical problems and explain both central (sequential) and distributed algorithms for constructing these structures. The operations of the algorithms are demonstrated by sample topologies.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.