Search Constraints

Start Over
Filtering by: Creator Gerdemann, J. W. Remove constraint Creator: Gerdemann, J. W. Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science Advisor Hamdaoui, Bechir Remove constraint Advisor: Hamdaoui, Bechir License All rights reserved Remove constraint License: All rights reserved

Search Results

  • Location Privacy Preservation for Optimal Sensing in Cognitive Radio Networks

    Creator:
    Grissa, Mohamed
    Abstract:
    Cognitive Radio Networks (CRNs) enable opportunistic access to the licensed channel resources by allowing unlicensed users to exploit vacant channel opportunities. One effective technique through which unlicensed users, often referred to as Secondary Users (SUs), acquire whether a channel is vacant is cooperative spectrum sensing. Despite its effectiveness in enabling...
    Resource Type:
    Masters Thesis
    Full Text:
    and bj ← 1 for j = I , . . . , n 16: FC computes the global decision B ← f(w, b) as in equations 2.1

  • Joint Resource Scheduling and Peak Power Shaving for Cloud Data Centers with Distributed Uninterruptible Power Supply

    Creator:
    AlAnazi, Sultan (Sultan Abdulaziz)
    Abstract:
    The grid company enforces high penalties for the peak power demands of cloud data centers. These high penalties result in high electricity bills that can be avoided by relying on the servers' Uninterruptible Power Supply (UPS) as a source of energy during peak load periods. This thesis proposes a management...
    Resource Type:
    Masters Thesis
    Full Text:
    notations, the index i will be used to refer to one of the billing cycle's slots, whereas the index j will

  • One-to-many node disjoint paths routing in generalized hypercube, dense Gaussian, and hexagonal mesh networks

    Creator:
    Alsaleh, Omar I.
    Abstract:
    Routing from a single source node to multiple destination nodes using node disjoint paths (NDP) has many important applications in parallel systems. For example, if a source node wants to send distinct messages to distinct destination nodes, then the one-to-many NDP routing is useful. Unlike parallel systems with shared-memory, each...
    Resource Type:
    Dissertation
    Full Text:
    Algorithm 1 Continued 37: procedure FindingPathOfLength 3 38: j = 0; isFound = false; 39: while j ≤ k0 − 1

  • Data acquisition techniques for next generation wireless sensor networks

    Creator:
    Ehsan, Samina
    Abstract:
    The meteoric rise and prevalent usage of wireless networking technologies for mobile communication applications have captured the attention of media and imagination of public in the recent decade. One such proliferation is experienced in Wireless Sensor Networks (WSNs), where multimedia enabled elements are fused with integrated sensors to empower tightly...
    Resource Type:
    Dissertation
    Full Text:
    for each flow(i, j) ∈ F the following medium contention constraints hold. xij ≤ max{ W dij + 1 ,W

  • Energy-Efficient Resource Management Techniques for Cloud Data Centers

    Creator:
    Dabbagh, Mehiar
    Abstract:
    Energy consumption has become a great deal for cloud service providers due to financial as well as environmental concerns. Studies show that cloud servers operate, most of the time, at only between 10% and 50% of their maximal utilizations. These same studies also show that servers that are kept ON...
    Resource Type:
    Dissertation
    Full Text:
    Heuristic ( Non, Nsleep ) . . . . . . . . . . . . . . . . . 103 3 LimitedHorizonControl ( j, ~Dj , Φ, w

  • Coordinating secondary-user behaviors for inelastic traffic reward maximization in large-scale DSA networks

    Creator:
    NoroozOliaee, MohammadJavad
    Abstract:
    We develop efficient coordination techniques that support inelastic traffic in large-scale distributed dynamic spectrum access DSA networks. By means of any learning algorithm, the proposed techniques enable DSA users to locate and exploit spectrum opportunities effectively, thereby increasing their achieved throughput (or "rewards" to be more general). Basically, learning algorithms...
    Resource Type:
    Masters Thesis
    Full Text:
    e w a rd g i (t)=G(t) g i (t)=r j (t) Figure 2.2: Per-agent average a hieved reward r̄(t

  • Resource allocation methods for quality-of-service provisioning in heterogeneous wireless networks

    Creator:
    Chakchouk, Nessrine
    Abstract:
    The increased use of mobile wireless devices that we have recently been witnessing, such as smartphones, tablets, e-readers, and WiFi enabled devices in general, is driving an unprecedented increase in the amount of data traffic. This fast market adoption of the wireless technology along with the tremendous success of multimedia...
    Resource Type:
    Dissertation
    Full Text:
    is incident to v} • ∀e ∈ E ′, the weight w(e) of link e is the sum of all sessions’ required data

  • Jamming Attack Resiliency and Performance Analysis of Cognitive Radio Communication Networks

    Creator:
    Adem, Nadia
    Abstract:
    Cognitive radio technology emerges as a promising solution for overcoming shortage and inefficient use of spectrum resources. In cognitive radio networks, secondary users, which are users equipped with cognitive radios, can opportunistically access spectrum assigned to primary users, the spectrum license holders. Although it improves spectrum utilization efficiency, this opportunistic...
    Resource Type:
    Dissertation
    Full Text:
    being served when the ith packet arrives, then Ri corresponds to the remaining time until packet j

  • Architectures and algorithms for dynamic overlay networks

    Creator:
    Abdelwahab, Sherif
    Abstract:
    Most of today’s Internet of Things (IoT) applications assume that data will be moved offdevices into centralized cloud platforms. While existing IoT systems leverage cloud-based analytics for meaningful data reasoning, the assumption that data should always be moved off the devices is problematic. The amount of data to be moved...
    Resource Type:
    Dissertation
    Full Text:
    ] computed to a 0.1 error at 95% confidence. . 43 3.6 Average energy consumption per replica in [J] computed

  • Energy-efficient routing for delay-constrained data traffic in linear wireless sensor networks

    Creator:
    Alesaimi, Hani
    Abstract:
    Linear wireless sensor networks (LWSN) are special class of wireless sensor networks where sensor nodes are deployed in a straight line. Monitoring industrial pipelines, railroads, tunnels, power lines, and borders are applications of LWSNs. Wireless sensors are tiny devices with limited energy resources; therefore, efficient energy routing in LWSNs is...
    Resource Type:
    Masters Thesis
    Full Text:
    fow (i, j )s k ∈ F , let xij denote the forwarding data rates in bits per second and X = [xij k ]1