Search Constraints

Start Over
Filtering by: Creator Al-Alusi, Thamir R. Remove constraint Creator: Al-Alusi, Thamir R. Committee Member Liu, Huaping Remove constraint Committee Member: Liu, Huaping Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Some contributions to asymmetric error control codes

    Creator:
    Elmougy, Samir
    Abstract:
    In some practical systems, most of the errors are of 1 → 0 type and 0 → 1 errors occur very rarely. In this thesis, first, the capacity of the asymmetric channel is derived. The capacity of the binary symmetric channel (BSC) and the Z-channel can be derived from this...
    Resource Type:
    Dissertation
    Full Text:
    errors using r = 2 check bits and up to m2 + r 2 errors using r > 2 check bits. Some upper bound on the

  • 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:
    in Fig. 2.2 the average reward r̄(t) (measured and al ulated via Eq. (2.3)) that ea h agent re

  • 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 length r surround- ing it, and is of distancen away from its closest two neighbors in the line

  • 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:
    (h = (ti1h0)): If node r = (s1h0) is available, the al- gorithm constructs the path P (s, ti) as