Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/301575
Title: | Design and Implementation of a Novel Approach for Efficient Route Discovery in Wireless Mobile Networks |
Researcher: | Kapila Vyas |
Guide(s): | Ajay Khunteta and Amit Chaturvedi |
Keywords: | Computer Science Engineering and Technology Telecommunications |
University: | Poornima University |
Completed Date: | 2019 |
Abstract: | Wireless mobile networks have grown significantly in the field of telecommunication networks, because of their ease and speed of deployment. With the advent of global business, the world came closer and needed to communicate freely, without constraints of time and space. Mobile wireless networks without dependence on infrastructure are popularly called as mobile ad- hoc networks or MANETs. MANETs give users a feel of having a free easily accessible network where, either there is little or no infrastructure, or the existing infrastructure is expensive or inconvenient to use. The routes in MANETs are solely decided by continuously moving constituent nodes which makes route discovery difficult. The current study is an attempt to provide an approach for efficient route discovery in the field of MANETs. newlineChapter 1 of the study begins with introduction to wireless networks and their classification. This is followed by small sections on history, characteristics, applications, challenges and routing strategies of MANETs. Motivation, problem statement, objectives and major contributions of the research are then individually discussed, before the chapter concludes with a brief outline of the rest of the study. newlineChapter 2 builds on chapter 1 and provides a detailed record of entire literature review done during the study. The literature review has been divided into three parts for easy representation. Each part provides available popular strategies and their critical comparison. newlineThe first part deals with methods and classification of routing in MANETs. Routing protocols in MANETs are popularly classified as (i) trees or mesh, depending on number of available paths;(ii) proactive or reactive, depending on time of route creation; and (iii) unicast or multicast, depending on whether data is replicated at the source or at a router in case of multiple transmissions. The section discusses few popular representative protocols for each class and ends with an elaborate critical analysis of available routing protocols. |
Pagination: | All pages |
URI: | http://hdl.handle.net/10603/301575 |
Appears in Departments: | Department of Computer Science |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
80_recommendation.pdf | Attached File | 5.5 MB | Adobe PDF | View/Open |
apendices.pdf | 5.5 MB | Adobe PDF | View/Open | |
certificates.pdf | 5.5 MB | Adobe PDF | View/Open | |
chapter 1.pdf | 5.5 MB | Adobe PDF | View/Open | |
chapter 2.pdf | 5.5 MB | Adobe PDF | View/Open | |
chapter 3.pdf | 5.5 MB | Adobe PDF | View/Open | |
chapter 4.pdf | 5.5 MB | Adobe PDF | View/Open | |
chapter 5.pdf | 5.5 MB | Adobe PDF | View/Open | |
list of publication.pdf | 5.5 MB | Adobe PDF | View/Open | |
priliminary pages.pdf | 5.5 MB | Adobe PDF | View/Open | |
references.pdf | 5.5 MB | Adobe PDF | View/Open | |
title page.pdf | 5.5 MB | 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: