Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/565471
Title: | Hybrid energy optimization and trust aware routing for unattended wireless sensor networks |
Researcher: | Suresh Kumar, M |
Guide(s): | Sathish Kumar, G A |
Keywords: | Computer Science Computer Science Information Systems Engineering and Technology field of technology navigation sensor node Wireless Sensor Networks |
University: | Anna University |
Completed Date: | 2024 |
Abstract: | The growth of Wireless Sensor Networks (WSNs) has revolutionized newlinethe field of technology and it is used in different application frameworks. newlineUnmanned edges and other critical locations can be monitored using the newlinenavigation sensor node. The WSN required low energy consumption to newlineprovide a high network and guarantee the ultimate goal. A promising property newlineof WSN demands a larger network lifetime. The functionality of WSN is newlinerestricted by various factors like errors in sensors, exhaustion of power, newlinedisturbance in the deployed environment, etc. Energy management is a vital newlineissue in WSN as nodes have very limited and non - replacable battery along newlinewith them. These power sources cannot be recharged once they drain out. newlineThus, efficient management of the existing power sources becomes a newlinemandatory requirement in WSN. The solution for improving the network newlinelifetime is to design an efficient routing mechanism that utilizes very minimal newlinepower during the message exchange. It is a really tough task to achieve newlinestability between accuracy and energy conservation. newlineThis research work aims to formulate an enhanced ant colony newlineoptimization algorithm that helps find a suitable data route that improves newlineenergy efficiency and reduces the time consumption for the delivery of newlinepackets. Energy equations have been framed to analyze energy used at the newlinetransmitting, receiving, and relay nodes. The network is segmented into newlinesmaller virtual segments for easier analysis of the proposed algorithm. Each newlinesegment is assumed to have nodes with a cluster head. The sink gathers newlineinformation from different cluster heads as it moves from one segment to newlineanother. The nodes not in close connection with the network used the newlineoverhearing mechanism to share the information with the sink newline |
Pagination: | xv,129p. |
URI: | http://hdl.handle.net/10603/565471 |
Appears in Departments: | Faculty of Information and Communication Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 52.47 kB | Adobe PDF | View/Open |
02_prelim pages.pdf | 1.54 MB | Adobe PDF | View/Open | |
03_content.pdf | 317.26 kB | Adobe PDF | View/Open | |
04_abstract.pdf | 301.33 kB | Adobe PDF | View/Open | |
05_chapter1.pdf | 527.25 kB | Adobe PDF | View/Open | |
06_chapter2.pdf | 913.97 kB | Adobe PDF | View/Open | |
07_chapter3.pdf | 522.49 kB | Adobe PDF | View/Open | |
08_chapter4.pdf | 393.02 kB | Adobe PDF | View/Open | |
09_chapter5.pdf | 889.02 kB | Adobe PDF | View/Open | |
10_chapter6.pdf | 1.11 MB | Adobe PDF | View/Open | |
11_annexures.pdf | 189.43 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 231.7 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: