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 SizeFormat 
01_title.pdfAttached File52.47 kBAdobe PDFView/Open
02_prelim pages.pdf1.54 MBAdobe PDFView/Open
03_content.pdf317.26 kBAdobe PDFView/Open
04_abstract.pdf301.33 kBAdobe PDFView/Open
05_chapter1.pdf527.25 kBAdobe PDFView/Open
06_chapter2.pdf913.97 kBAdobe PDFView/Open
07_chapter3.pdf522.49 kBAdobe PDFView/Open
08_chapter4.pdf393.02 kBAdobe PDFView/Open
09_chapter5.pdf889.02 kBAdobe PDFView/Open
10_chapter6.pdf1.11 MBAdobe PDFView/Open
11_annexures.pdf189.43 kBAdobe PDFView/Open
80_recommendation.pdf231.7 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: