Search Constraints

Start Over
Filtering by: Creator Hansen, E. M. Remove constraint Creator: Hansen, E. M. Advisor Hamdaoui, Bechir Remove constraint Advisor: Hamdaoui, Bechir Committee Member Liu, Huaping Remove constraint Committee Member: Liu, Huaping

Search Results

  • 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:
    at most com- municate on m different channels at a given time. By letting E ′(i) = {e ∈ E ′ : e

  • 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:
    , . . . , (kě − 1)}. The node degree ℓě in these subcubes is equal to ℓě = ∑m−1 i=0,i 6=ě(ki − 1). Clearly

  • 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:
    has the remaining c+ k agents (sin e n− c(m− 1) = c+ k). We pro eed with the proof by omparing C

  • EM-MAC : an energy-aware multi-channel medium access control protocol for multi-hop wireless networks

    Creator:
    Sivanantha, Akhil
    Abstract:
    The stupendous growth in wireless and mobile devices in the recent years has prompted researchers to look at innovative approaches that enable effective use of the available resources. In this thesis, we propose a medium access control (MAC) protocol, referred to as EM-MAC, that enables wireless devices with multi-channel access...
    Resource Type:
    Masters Thesis
    Full Text:
    50 60 70 80 90 100 Number Of Nodes (N) E ne rg y S av in gs ( % ) (ρ ) ρ (M=5

  • Opportunistic bandwidth sharing through reinforcement learning

    Creator:
    Venkatraman, Pavithra
    Abstract:
    The enormous success of wireless technology has recently led to an explosive demand for, and hence a shortage of, bandwidth resources. This expected shortage problem is reported to be primarily due to the inefficient, static nature of current spectrum allocation methods. As an initial step towards solving this shortage problem,...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . 13 4.1 Throughput behavior under two different primary-user traffic loads pbar ≡ η̄ = 0.5 and 0.8: m

  • Network Traffic-Driven Hybrid Learning for Classifying Seen and Unseen IoT Device Types

    Creator:
    Bao, Jiaqi
    Abstract:
    IoT networks can be viewed as collections of Internet-enabled physical devices and objects, embedded with sensor, actuator, computation, storage and communication components, that are capable of connecting and exchanging data to one another. In recent years, organizations have allowed more and more IoT devices to be connected to their networks,...
    Resource Type:
    Masters Thesis
    Full Text:
    ) (4.3) where σ(z) = 1 1+e−x is Sigmoid function, and W3 is an n×m weight matrix and b3 is an n-length

  • 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:
    of distinct nodes(n,m) such thatm is withinn’s transmission range—i.e.,m is a neighbor ofn— andn