SDODV. (c2018)
Mobile ad hoc networks (MANETS) are a set of nodes connected to each other in peer to peer fashion. As MANETs have challenging characteristics such as mobility and limited energy, traditional existing routing protocols are not very efficient. Therefore, the routing problem designated to find and mai...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/8000 https://doi.org/10.26756/th.2018.54 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513483766235136 |
|---|---|
| author | Assi, Maram |
| author_facet | Assi, Maram |
| author_role | author |
| dc.creator.none.fl_str_mv | Assi, Maram |
| dc.date.none.fl_str_mv | 2018-06-05T09:48:22Z 2018-06-05T09:48:22Z 2018 2018-06-05 2018-01-17 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/8000 https://doi.org/10.26756/th.2018.54 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | Lebanese American University |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Lebanese American University -- Dissertations Dissertations, Academic Ad hoc networks (Computer networks) -- Research Linear topological spaces -- Research Vector spaces -- Research Routing protocols (Computer network protocols) -- Research |
| dc.title.none.fl_str_mv | SDODV. (c2018) a smart and dynamic on-demand distance vector routing protocol for MANETs |
| dc.type.none.fl_str_mv | Thesis info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/masterThesis |
| description | Mobile ad hoc networks (MANETS) are a set of nodes connected to each other in peer to peer fashion. As MANETs have challenging characteristics such as mobility and limited energy, traditional existing routing protocols are not very efficient. Therefore, the routing problem designated to find and maintain an optimal route between two nodes is not very straight forward. In this work, we present SDODV, a new smart and dynamic on-demand distance vector routing protocol for mobile ad hoc networks that addresses the shortcomings of existing routing protocols. Our proposed adaptive algorithm increases effectively the lifetime of the built network by considering the network topology when establishing a route. It monitors the traffic load, nodes mobility, neighborhood density and battery power to adjust the routing of packets accordingly. This protocol is based on the distributed reinforcement learning approach and on the traditional AODV. SDODV improves the quality of service because its chooses the shortest and the more stable path and it considers mobility, bandwidth and the power of the devices as well. Experimental results prove that SDODV out-performs shortest path and reduces the energy consumption. |
| eu_rights_str_mv | openAccess |
| format | masterThesis |
| id | LAURepo_526b73146b82fe914f4c62e101da8d64 |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/8000 |
| publishDate | 2018 |
| publisher.none.fl_str_mv | Lebanese American University |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | SDODV. (c2018)a smart and dynamic on-demand distance vector routing protocol for MANETsAssi, MaramLebanese American University -- DissertationsDissertations, AcademicAd hoc networks (Computer networks) -- ResearchLinear topological spaces -- ResearchVector spaces -- ResearchRouting protocols (Computer network protocols) -- ResearchMobile ad hoc networks (MANETS) are a set of nodes connected to each other in peer to peer fashion. As MANETs have challenging characteristics such as mobility and limited energy, traditional existing routing protocols are not very efficient. Therefore, the routing problem designated to find and maintain an optimal route between two nodes is not very straight forward. In this work, we present SDODV, a new smart and dynamic on-demand distance vector routing protocol for mobile ad hoc networks that addresses the shortcomings of existing routing protocols. Our proposed adaptive algorithm increases effectively the lifetime of the built network by considering the network topology when establishing a route. It monitors the traffic load, nodes mobility, neighborhood density and battery power to adjust the routing of packets accordingly. This protocol is based on the distributed reinforcement learning approach and on the traditional AODV. SDODV improves the quality of service because its chooses the shortest and the more stable path and it considers mobility, bandwidth and the power of the devices as well. Experimental results prove that SDODV out-performs shortest path and reduces the energy consumption.N/A1 hard copy: xi, 67 leaves; 30 cm. available at RNL.Bibliography : leaves 65-67.Lebanese American University2018-06-05T09:48:22Z2018-06-05T09:48:22Z20182018-06-052018-01-17Thesisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesishttp://hdl.handle.net/10725/8000https://doi.org/10.26756/th.2018.54http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.phpeninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/80002021-03-19T10:43:14Z |
| spellingShingle | SDODV. (c2018) Assi, Maram Lebanese American University -- Dissertations Dissertations, Academic Ad hoc networks (Computer networks) -- Research Linear topological spaces -- Research Vector spaces -- Research Routing protocols (Computer network protocols) -- Research |
| status_str | publishedVersion |
| title | SDODV. (c2018) |
| title_full | SDODV. (c2018) |
| title_fullStr | SDODV. (c2018) |
| title_full_unstemmed | SDODV. (c2018) |
| title_short | SDODV. (c2018) |
| title_sort | SDODV. (c2018) |
| topic | Lebanese American University -- Dissertations Dissertations, Academic Ad hoc networks (Computer networks) -- Research Linear topological spaces -- Research Vector spaces -- Research Routing protocols (Computer network protocols) -- Research |
| url | http://hdl.handle.net/10725/8000 https://doi.org/10.26756/th.2018.54 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |