Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/199677
Title: | An Approach Towards Stable and Secure Routing Strategy in Ad Hoc Wireless Networks |
Researcher: | Bhatt Nirav |
Guide(s): | Kathiriya Dhaval |
Keywords: | Ad hoc Networks Energy Consumption Faulty Node |
University: | RK University |
Completed Date: | 2016 |
Abstract: | An ad hoc network is wireless network, where nodes are moving freely without having any stable infrastructure. Such networks are built for serving some specific purpose and also specific time duration only. As there is no any stable infrastructure, nodes can roam anywhere in the network the topology of such networks may change dynamically. As every node are not within the range of each other so instead of direct transmission, data packets from originator node to final destination node are transmitted through intermediate nodes as multi-hop routing within a store and forward manner. Nodes are mobile and having limited amount of battery. As dynamic topology, lack of infrastructure and limited amount of battery at each node, effective routing is a very crucial task in such networks. Lots of traditional routing protocols are available for ad hoc wireless networks. But majority of them are able to find shortest path between pair of nodes, which want to communicate with each other. As such protocols are not considered some of the crucial parameters into their account like energy level, location of nodes, reliability of nodes etc. so it will get poor performance with respect to packet delivery ratio, life time of node/route, security of route etc. In last decade, lots of strategies have been found for ad hoc wireless networks for selecting stable route but the definition of stability may vary in each routing protocol. For this research, DSR is considered as a base routing protocol. DSR is source-initiated routing protocol, as for finding path between originator and targeted DSR broadcasts route request packets in the network which are received by all the neighbors of source. Neighboring nodes also known as intermediate node again rebroadcast the same request packets towards destination node. Each node has forward route request only once. After it arrived at destination, destination node will take hop count and responds with route reply packets to the source. |
Pagination: | 92 |
URI: | http://hdl.handle.net/10603/199677 |
Appears in Departments: | Faculty of Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
abstract.pdf | Attached File | 12.2 kB | Adobe PDF | View/Open |
acknowledgements.pdf | 7.14 kB | Adobe PDF | View/Open | |
appendices.pdf | 6.05 kB | Adobe PDF | View/Open | |
certificate.pdf | 387.81 kB | Adobe PDF | View/Open | |
chepter_1 introduction.pdf | 63.03 kB | Adobe PDF | View/Open | |
chepter_2 review of literature.pdf | 230.54 kB | Adobe PDF | View/Open | |
chepter_3 proposed work.pdf | 622.4 kB | Adobe PDF | View/Open | |
chepter_5 conclusion and future work.pdf | 31.44 kB | Adobe PDF | View/Open | |
declaration.pdf | 41.79 kB | Adobe PDF | View/Open | |
list of abbrevitions.pdf | 8.1 kB | Adobe PDF | View/Open | |
list of figures.pdf | 7.21 kB | Adobe PDF | View/Open | |
list of tables.pdf | 5.05 kB | Adobe PDF | View/Open | |
table of contents.pdf | 5.93 kB | Adobe PDF | View/Open | |
title page.pdf | 42.18 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: