Flexible and Scalable Routing Approach for Mobile Ad Hoc Networks by Function Approximation of Q-Learning
atmire.migration.oldid | 4458 | |
dc.contributor.advisor | Alhajj, Reda | |
dc.contributor.advisor | Rokne, Jon | |
dc.contributor.author | Elzohbi, Mohamad | |
dc.contributor.committeemember | Kawash, Jalal | |
dc.contributor.committeemember | Helaoui, Mohamed | |
dc.date.accessioned | 2016-05-20T14:52:42Z | |
dc.date.available | 2016-05-20T14:52:42Z | |
dc.date.issued | 2016 | |
dc.date.submitted | 2016 | en |
dc.description.abstract | Wireless mobile devices are rapidly spreading to the extent that it is hard to find a person not exposed to such technology. These devices could be connected directly or indirectly by wireless channels to form a mobile ad hoc network (MANET). Finding a route for flow from a source to a destination in a network is known as routing. Dynamic topology and unstable link states are the main problems facing routing in MANETs. This thesis employs reinforcement learning, namely Q-learning to develop a routing mechanism. Features inspired from the network are used in approximating the Q-function to form a new intelligent routing metric. This way, the routing process concentrates on specific routes instead of network-wide broadcasting. Accordingly, it is possible to achieve flexibility and scalability in routing. Advantages of the proposed routing technique have been highlighted by conducting experiments in two MANETs environments, namely hand-held devices based MANETs and VANETs. | en_US |
dc.identifier.citation | Elzohbi, M. (2016). Flexible and Scalable Routing Approach for Mobile Ad Hoc Networks by Function Approximation of Q-Learning (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/26186 | en_US |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/26186 | |
dc.identifier.uri | http://hdl.handle.net/11023/3034 | |
dc.language.iso | eng | |
dc.publisher.faculty | Graduate Studies | |
dc.publisher.institution | University of Calgary | en |
dc.publisher.place | Calgary | en |
dc.rights | University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission. | |
dc.subject | Artificial Intelligence | |
dc.subject | Computer Science | |
dc.subject.classification | Mobile ad hoc networks | en_US |
dc.subject.classification | Reinforcement learning | en_US |
dc.subject.classification | Q-learning | en_US |
dc.subject.classification | Routing protocol | en_US |
dc.subject.classification | Function approximation | en_US |
dc.title | Flexible and Scalable Routing Approach for Mobile Ad Hoc Networks by Function Approximation of Q-Learning | |
dc.type | master thesis | |
thesis.degree.discipline | Computer Science | |
thesis.degree.grantor | University of Calgary | |
thesis.degree.name | Master of Science (MSc) | |
ucalgary.item.requestcopy | true |