Please use this identifier to cite or link to this item:
https://scholarhub.balamand.edu.lb/handle/uob/4017
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Daba, Jihad S. | en_US |
dc.contributor.author | Matta, Michel | en_US |
dc.contributor.author | Khodor, Mahmoud | en_US |
dc.date.accessioned | 2020-12-23T14:39:52Z | - |
dc.date.available | 2020-12-23T14:39:52Z | - |
dc.date.issued | 2015 | - |
dc.identifier.uri | https://scholarhub.balamand.edu.lb/handle/uob/4017 | - |
dc.description | Includes bibliographical references (p.72). | en_US |
dc.description | Supervised by Dr. Jihad Daba. | en_US |
dc.description.abstract | In the past years, there has been a huge advance in the structure and design of wireless networks, and we have seen significant variation form the physical layer algorithm development to the layer protocol design to the system level optimization. Numerous wireless standards have been agreed on to keep up with demand of multiple applications. Over the years researchers came together and realized that for wireless networks, and because of user mobility, fading channel and power resources, and other factors we cannot simply optimize the wireless communication like we used to optimize the wired networks, where they usually concentrate on one layer without paying any attention on the effects it has on other layers. But for wireless networks, interconnection between layers and cross layer optimization is the basic issue to insure high quality performance. One of the most important issues in the cross layer optimization is resource allocation. In Wireless communication there are frequency, time and space diversity as well. If we took advantages of those diversities we can tremendously improve the quality of communication. All those variables contribute to the need of resource allocations. We have seen the advance of resource allocation in the past years with huge progress. As anyone can imagine, because the number of degrees freedom, and multiple parameters, dynamic resource allocation is a broad topic that deals with variety of problems. So the optimization tools and techniques may vary a lot. Aside from the commonly used method which is convex optimization there are non-linear and non-convex methods. When we speak about channel allocation and resource scheduling. Sometimes the problem tends to get more and more complicated. If we took into account the time caring conditions, the problem will evolve to be a dynamic optimization. The cooperation with the distributed and autonomous devices is considered, different mathematical models can be used to find the best strategy and optimal solution. It is only fair to say that there is no single perfect optimization available to solve all the dynamic resource allocation problems. | en_US |
dc.description.statementofresponsibility | by Michel Matta, Mahmoud Khodor | en_US |
dc.format.extent | x, 80 p. :ill., tables ;30 cm | en_US |
dc.language.iso | eng | en_US |
dc.rights | This object is protected by copyright, and is made available here for research and educational purposes. Permission to reuse, publish, or reproduce the object beyond the personal and educational use exceptions must be obtained from the copyright holder | en_US |
dc.subject.lcsh | Wireless communication systems | en_US |
dc.title | Dynamic optimized resource allocation in cellular & wireless networks with software interface | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Department of Computer Engineering | en_US |
dc.contributor.faculty | Faculty of Engineering | en_US |
dc.contributor.institution | University of Balamand | en_US |
dc.date.catalogued | 2016-01-15 | - |
dc.description.degree | MS in Computer Engineering | en_US |
dc.description.status | Published | en_US |
dc.identifier.ezproxyURL | http://ezsecureaccess.balamand.edu.lb/login?url=http://olib.balamand.edu.lb/projects_and_theses/GP-CoE-78.pdf | en_US |
dc.identifier.OlibID | 164823 | - |
dc.provenance.recordsource | Olib | en_US |
Appears in Collections: | UOB Theses and Projects |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.