Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/334815
Title: | An investigation of maximizing multiple mobile sinks data collection speed and data dissemination of sensors in wsn |
Researcher: | Senthil Kumar, V |
Guide(s): | Prasanth, K |
Keywords: | Wireless Sensor Networks Energy Consumption Sensor |
University: | Anna University |
Completed Date: | 2020 |
Abstract: | In Wireless Sensor Networks (WSNs), Mobile Sinks (MSs) are deployed for minimizing the nodeand#8223;s energy utilization during data transmission. For delay-aware applications, a Weighted Rendezvous Planning (WRP) approach has been proposed to reduce the energy utilization in which the Mobile Sink (MS) only visits Rendezvous Points (RPs) instead of all sensor nodes. In this approach, an optimal tour was found by assigning a weight to each node according to the amount of data packets that it transmits to the neighbouring RP and their hop distance from the tour. This WRP was performed based on the Steiner Minimum Tree (SMT) and Shortest Path Tree (SPT) for single MS case. Conversely, this is not suitable for multiple MS with different delay constraints. Hence, the major objective of this research is enhancing an energy-efficient MS node selection approach in WSNs. This research work consists of four contributions and they are as follows: In the first contribution of this research, a WRP with Q-learning based Adaptive Zone Partition (WRP-QAZP) approach is proposed for multiple MSs in WSN to handle different delay requirements. Initially, QAZP is applied to split an entire network into a number of regions for multiple MSs. In each region, the location and residual energy of each sensor node including MSs are collected by the Mobile Anchor (MA) node. MA node is a centralized node consisting of the highest amount of all available resources than other nodes. Based on this information, each region is adjusted to the neighboring MS. Then, WRP is applied in each region to assign the weight of each node based on their hop distance from the tour and the total amount of data packets sent to the adjacent RP. The nodes with the highest weights are selected as RPs to transmit the data to the MS at different delay requirements. Thus, the number of multihop communication and energy consumption are iv reduced in multiple MS cases. However, it is difficult to maintain each RPs position at each time by each MSs. Also, the collaboration of |
Pagination: | xx,156 p. |
URI: | http://hdl.handle.net/10603/334815 |
Appears in Departments: | Faculty of Information and Communication Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 24.69 kB | Adobe PDF | View/Open |
02_certificates.pdf | 187.53 kB | Adobe PDF | View/Open | |
03_vivaproceedings.pdf | 472.22 kB | Adobe PDF | View/Open | |
04_bonafidecertificate.pdf | 285.18 kB | Adobe PDF | View/Open | |
05_abstracts.pdf | 122.57 kB | Adobe PDF | View/Open | |
06_acknowledgements.pdf | 387.44 kB | Adobe PDF | View/Open | |
07_contents.pdf | 356.95 kB | Adobe PDF | View/Open | |
08_listoftables.pdf | 9.71 kB | Adobe PDF | View/Open | |
09_listoffigures.pdf | 183.94 kB | Adobe PDF | View/Open | |
10_listofabbreviations.pdf | 10.27 kB | Adobe PDF | View/Open | |
11_chapter1.pdf | 222.97 kB | Adobe PDF | View/Open | |
12_chapter2.pdf | 450.56 kB | Adobe PDF | View/Open | |
13_chapter3.pdf | 919.31 kB | Adobe PDF | View/Open | |
14_chapter4.pdf | 792.65 kB | Adobe PDF | View/Open | |
15_chapter5.pdf | 929.97 kB | Adobe PDF | View/Open | |
16_chapter6.pdf | 970.56 kB | Adobe PDF | View/Open | |
17_chapter7.pdf | 962.66 kB | Adobe PDF | View/Open | |
18_conclusion.pdf | 126.77 kB | Adobe PDF | View/Open | |
19_references.pdf | 150.44 kB | Adobe PDF | View/Open | |
20_listofpublications.pdf | 120.51 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 61.9 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: