The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
|
|
Author(s): Can Umut Ileri (Ege University, Turkey & International Computer Institute, Turkey), Yasin Yigit (Ege University, Turkey & International Computer Institute, Turkey), Ozkan Arapoglu (Ege University, Turkey & International Computer Institute, Turkey), Hüseyin Tolga Evcimen (Ege University, Turkey & International Computer Institute, Turkey), Mustafa Asci (Ege University, Turkey & International Computer Institute, Turkey)and Orhan Dagdeviren (Ege University, Turkey & International Computer Institute, Turkey)
Copyright: 2019
Pages: 36
Source title:
Handbook of Research on the IoT, Cloud Computing, and Wireless Network Optimization
Source Author(s)/Editor(s): Surjit Singh (Thapar Institute of Engineering and Technology, India)and Rajeev Mohan Sharma (National Institute of Technology Kurukshetra, India)
DOI: 10.4018/978-1-5225-7335-7.ch017
Purchase
|
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.
Related Content
|
Dina Darwish.
© 2024.
43 pages.
|
|
Kassim Kalinaki, Musau Abdullatif, Sempala Abdul-Karim Nasser, Ronald Nsubuga, Julius Kugonza.
© 2024.
23 pages.
|
|
Yogita Yashveer Raghav, Ramesh Kait.
© 2024.
17 pages.
|
|
Renuka Devi Saravanan, Shyamala Loganathan, Saraswathi Shunmuganathan.
© 2024.
21 pages.
|
|
Veera Talukdar, Ardhariksa Zukhruf Kurniullah, Palak Keshwani, Huma Khan, Sabyasachi Pramanik, Ankur Gupta, Digvijay Pandey.
© 2024.
30 pages.
|
|
Dharmesh Dhabliya, Sukhvinder Singh Dari, Nitin N. Sakhare, Anish Kumar Dhablia, Digvijay Pandey, Balakumar Muniandi, A. Shaji George, A. Shahul Hameed, Pankaj Dadheech.
© 2024.
9 pages.
|
|
Avtar Singh, Shobhana Kashyap.
© 2024.
11 pages.
|
|
|