dc.contributor.author |
Dikmak, Mostafa Khalil, |
dc.date |
2014 |
dc.date.accessioned |
2015-02-03T10:35:02Z |
dc.date.available |
2015-02-03T10:35:02Z |
dc.date.issued |
2014 |
dc.date.submitted |
2014 |
dc.identifier.other |
b1829750x |
dc.identifier.uri |
http://hdl.handle.net/10938/10071 |
dc.description |
Thesis. M.E. American University of Beirut. Department of Electrical and Computer Engineering, 2014. ET:6119 |
dc.description |
Advisor : Dr. Zaher Dawy, Professor, Electrical and Computer Engineering ; Committee Members: Dr. Hassan Artail, Professor, Electrical and Computer Engineering ; Dr. Sanaa Sharafeddine, Associate Professor, Computer Science and Mathematics, Lebanese American University. |
dc.description |
Includes bibliographical references (leaves 64-68) |
dc.description.abstract |
Multimedia services such as video streaming and online games have been widely spread with the rapid evolution of wireless communication technologies that provide high data rates. The prolonged usage of such services requires the wireless interfaces to be active for long periods, thus increasing the energy consumption which raises a challenge for the designers of battery-operated mobile terminals (MTs). Optimized cooperative content distribution approaches with device-to-device (D2D) cooperation, have been proposed in the literature to reduce the high energy consumption. However, most of these approaches do not take into consideration the variations in the network (MTs leaving, new MTs joining, and-or MTs moving around). This thesis is divided into two main parts. In the first part, we present pseudo-optimal energy-efficient cooperative content distribution algorithms that account for different types of mobility in the network. The content distribution problem is first formulated using two static optimization problems: minimum spanning tree (MST) formulation and two-hop integer programming optimization formulation. Both formulations return optimal solutions at a given point in time. However, upon any variation in the network, the content distribution solution needs to be updated. Since re-solving the optimization problems is computationally expensive, a re-optimization algorithm that returns sub-optimal solutions is proposed for each type of mobility (node insertion, node deletion, edge weight modification). Simulation results for various scenarios demonstrate performance close to the optimal, with major reduction in computational complexity. In the second part of the thesis, we discuss dynamic cooperative content distribution architectures with the following components: network formation, detection and selection mechanisms, and failure detection and recovery mechanisms. |
dc.format.extent |
1 online resource (xi, 68 leaves) : illustrations (some color) ; 30cm |
dc.language.iso |
eng |
dc.relation.ispartof |
Theses, Dissertations, and Projects |
dc.subject.classification |
ET:006119 AUBNO |
dc.subject.lcsh |
Wireless communication systems -- Mathematical models. |
dc.subject.lcsh |
Mathematical optimization. |
dc.subject.lcsh |
Energy consumption. |
dc.subject.lcsh |
Ad hoc networks (Computer networks) |
dc.subject.lcsh |
Combinatorial optimization. |
dc.subject.lcsh |
Peer-to-peer architecture (Computer networks) |
dc.subject.lcsh |
Multimedia communications. |
dc.title |
Energy-aware cooperative content distribution with dynamic topologies - |
dc.type |
Thesis |
dc.contributor.department |
American University of Beirut. Faculty of Engineering and Architecture. Department of Electrical and Computer Engineering, degree granting institution. |