We propose a formal model for non-interactive message authentication protocols (NIMAPs) using two channels and analyze all the attacks that can occur in this model. Further, we introduce the notion of hybrid-collision resistant (HCR) hash functions. This leads to a new proposal for a NIMAP based on HCR hash functions. This protocol is as efficient as the best previous NIMAP while having a very simple structure and not requiring any long strings to be authenticated ahead of time. We investigate interactive message authentication protocols (IMAPs) and propose a new IMAP, based on the existence of interactive-collision resistant (ICR) hash functions, a new notion of hash function security. The efficient and easy-to-use structure of our IMAP makes it very practical in real world ad hoc network scenarios. We also look at message recognition protocols (MRPs) and prove that there is a one-to-one correspondence between non-interactive MRPs and digital signature schemes with message recovery. Further, we look at an existing recognition protocol and point out its inability to recover in case of a specific adversarial disruption. We improve this protocol by suggesting a variant which is equipped with a resynchronization process. Moreover, another variant of the protocol is proposed which self-recovers in case of an intrusion. Finally, we propose a new design for message recognition in ad hoc networks which does not make use of hash chains. This new design uses random passwords that are being refreshed in each session, as opposed to precomputed elements of a hash chain.

The relay channel plays an integral role in network communication systems. An intermediate node acts as a relay to facilitate the communication between the source and the destination. If the rate of codewords is less than the capacity of the source-relay link, the relay can decode the source's messages and forward them to the destination. On the contrary, if the rate of codewords is greater than the capacity of the source-relay link, the relay cannot decode the messages. Nevertheless, the relay can still compress its observations and then send them to the destination. Obviously, if the relay-destination link is of a capacity high enough such that the relay's observations can be losslessly sent to the destination, then the maximum message rate can be achieved as if the relay and the destination can jointly decode. However, when the relay-destination link is of a limited capacity such that the relay's observation cannot be losslessly forwarded to the destination, then what is the maximum achievable rate from the source to the destination? This problem was formulated by Cover in another perspective [7], i.e., what is the minimum rate of the relay-destination link such that the maximum message rate can be achieved? We try to answer this Cover's problem in this thesis. First, a sufficient rate to achieve the maximum message rate can be obtained by Slepian-Wolf coding, which gives us an upper bound on the optimal relay-destination link rate. In this thesis, we show that under some channel conditions, this sufficient condition is also necessary, which implies that Slepian-Wolf coding is already optimal. Hence, the upper bound meets exactly the minimum value of the required rate. In our approach, we start with the standard converse proof. First, we present a necessary condition for achieving the maximum message rate in the single-letter form. Following the condition, we derive a theorem, which is named as "single-letter criterion". The "single-letter criterion" can be easily utilized to verify different channels. Then we show that for two special cases: when the source-relay link and the source-destination link of the relay channel are both binary symmetric channels (BSCs), and when they are both binary erasure channels (BECs), Slepian-Wolf coding is optimal in achieving the maximum message rate. Moreover, the maximum message rates of these two special channels are also calculated in this thesis.

Headwater streams provide diverse habitat for aquatic organisms, drinking water for downstream communities and abundant recreational activities. The addition of in-stream wood to headwater channels can influence the hydrology, morphology and ecology of the system. The recruitment of wood to the channel and the export mechanisms determine the wood load and structure types formed in-stream, thus altering the channel’s morphological response. This research examined the effects of in stream wood on channel morphology in two headwater streams along the eastern slopes of the Canadian Rocky Mountains; Lyons East (LE) and Corolla Creek (CC). Lyons East has natural and anthropogenic disturbance (burned and salvage-logged) in the watershed, while Corolla Creek has anthropogenic (grazing and recreation) disturbances in the watershed. An assessment of the longitudinal spatial distribution and a reach-scale geomorphic classification were conducted to investigate the impacts of in-stream wood on channel morphology, pool formation and sediment storage. The spatial distribution of in-stream wood was 1.49 sites/100m for both watersheds, results that are comparable to previously conducted studies in similar geographic watersheds. The types of structures found in both watersheds were predominately jam formations (LE - 43%, CC - 47%), which is consistent with the wood loading and spatial distribution conceptual model previously developed by Whol and Jaeger (2009) for in-stream wood accumulations in mountain streams. At the reach-scale level of analysis, in-stream wood was found to impact channel morphology and pool forming processes. The addition of wood to the stream caused half of the studied reaches to have forced pool-riffle morphology. For all six selected study reaches, there was a decrease in expected pool spacing and an increase in the diversity of pool types. The relationship between wood-affected pools and sediment storage was examined and the results show that more sediment was stored in the burned/salvage logged reaches. Cohesive sediment was stored only in pools influenced by wood structures for half of the studied reaches. V* was generally higher in wood-affected pools for five of the six study reaches. The weighted average (V*w), which provides information regarding the storage of cohesive at the reach scale, was greater in Lyons East than in Corolla Creek. The presence of both exposed bedrock in the channel as well as the amount of vegetation are possible reasons for the smaller amounts of sediment observed in Corolla Creek. The observations from this reach scale investigation led to the development of a conceptual model, which can be used to predict the location of cohesive sediment storage in headwater streams of the Oldman River Basin. This model highlights the relationship between simultaneous recruitment of in-stream wood and sediment from local sources as a mechanism for protecting and storing cohesive sediment deposits. This research examined channel responses to in-stream wood within the context of land-use planning and Alberta’s Water for Life Strategy. There was evidence of lateral channel migration in the floodplain of both watersheds. At some sites, the channel shifted up to 30 metres while in other sections of the watershed, the channel was confined within a narrow valley. Accordingly, it is recommended that the current salvage logging guidelines be changed to include a flexible riparian buffer that would more appropriately reflect the diversity in riparian widths throughout the watersheds. In addition the best management practice is to allow natural in-stream wood processes to evolve and not to remove in-stream wood from the channel. The in-stream wood provides diverse aquatic habitat and the cycle of wood being recruited and being in the stream is part of the natural ecosystem in forested environments.

A network of n transmitters and n receivers is considered. We assume that transmitter i aims to send data to its designated destination, receiver i. Communications occur in a single-hop fashion and destination nodes are simple linear receivers without multi-user detection. Therefore, in each time slot every source node can only talk to one other destination node. Thus, there is a total of n communication links. An important question now arises. How many links can be active in such a network so that each of them supports a minimum rate Rmin? This dissertation is devoted to this problem and tries to solve it in two di erent settings, dense and extended networks. In both settings our approach is asymptotic, meaning, we only examine the behaviour of the network when the number of nodes tends to in nity. We are also interested in the events that occur asymptotically almost surely (a.a.s.), i.e., events that have probabilities approaching one as the size of the networks gets large. In the rst part of the thesis, we consider a dense network where fading is the dominant factor a ecting the quality of transmissions. Rayliegh channels are used to model the impact of fading. It is shown that a.a.s. log(n)^2 links can simultaneously maintain Rmin and thus be active. In the second part, an extended network is considered where nodes are distant from each other and thus, a more complete model must take internode distances into account. We will show that in this case, almost all of the links can be active while maintaining the minimum rate.

This thesis summarizes the results of an experimental investigation involving the testing of push-out specimens with channel shear connectors. The test program involved the testing of 78 push-out specimens and was aimed at the development of new equations for channel shear connectors embedded in solid concrete slabs and slabs with wide ribbed metal deck oriented parallel to the beam. <p>The test specimens were designed to study the effect of a number of parameters on the shear capacity of channel shear connectors. Six series of push-out specimens were tested in two phases. The primary difference between the two phases was the height of the channel connector. Other test parameters included the compressive strength of concrete, the length and the web thickness of the channel. <p>Three different types of failure mechanisms were observed. In specimens with higher strength concrete, failure was caused by the fracture of the channel near the fillet with the channel web acting like a cantilever beam. Crushing-splitting of concrete was the observed mode of failure in specimens with solid slabs when lower strength concrete was used. In most of the specimens with metal deck slabs, a concrete shear plane type of failure was observed. In the specimens involving this type of failure, the channel connector remained intact and the concrete contained within the flute in front of channel web sheared off along the interface. <p>The load carrying capacity of a channel connector increased almost linearly with the increase in channel length. On average, the increase was about 39% when the channel length was increased from 50 mm to 100 mm. There was a further increase of 24% when the channel length was increased from 100 mm to 150 mm. The influence of web thickness of channel connector was significant when the failure occurred due to channel web fracture but was minimal for a concrete crushing-splitting type of failure. <p>The specimens with solid concrete slabs carried higher load compared to those with metal deck slabs. The increase in load capacity was 33% for specimens with 150 mm long channels but only 12% for those with 50 mm long channel connectors. <p>This investigation resulted in the development of a new equation for predicting the shear strength of channel connectors embedded in solid concrete slabs. The proposed equation provides much better correlation to test results than those obtained using the current CSA equation. <p>The results of specimens with metal deck slabs were used to develop a new equation for predicting the shear capacity of channel connectors embedded in slabs with metal deck oriented parallel to the beam. The values predicted by the proposed equation were in good agreement with the observed test values.

For ultra-wideband (UWB) communications, acquisition is challenging. The reason is from the ultra short pulse shape and ultra dense multipath interference. Ultra short pulse indicates the acquisition region is very narrow. Sampling is another challenge for UWB design due to the need for ultra high speed analog-to digital converter.<p>A sub-optimum and under-sampling scheme using pilot codes as transmitted reference is proposed here for acquisition. The sampling rate for the receiver is at the symbol rate. A new architecture, the reference aided matched filter is studied in this project. The reference aided matched filter method avoids using complex rake receiver to estimate channel parameters and high sampling rate for interpolation. A limited number of matched filters are used as a filter bank to search for the strongest path. Timing offset for acquisition is then estimated and passed to an advanced verification algorithm. For optimum performance of acquisition, the adaptive post detection integration is proposed to solve the problem from dense inter-symbol interference during the acquisition. A low-complex early-late gate tracking loop is one element of the adaptive post detection integration. This tracking scheme assists in improving acquisition accuracy. The proposed scheme is evaluated using Matlab Simulink simulations in term of mean acquisition time, system performance and false alarm. Simulation results show proposed algorithm is very effective in ultra dense multipath channels. This research proves reference aided acquisition with tracking loop is promising in UWB application.

Orthogonal Frequency Division Multiplexing (OFDM) plays an important role in the implementation of high data rate communication. In this thesis, the problems of data detection and channel and carrier frequency offset estimation in OFDM systems are studied. <p>Multi-symbol non-coherent data detection is studied which performs data detection by processing multiple symbols without the knowledge of the channel impulse response (CIR). <p>For coherent data detection, the CIR needs to be estimated. Our objective in this thesis is to work on blind channel estimators which can extract the CIR using just one block of received OFDM data. A blind channel estimator for (Single Input Multi Output) SIMO OFDM systems is derived. The conditions under which the estimator is identifiable is studied and solutions to resolve the phase ambiguity of the proposed estimator are given.<p>A channel estimator for superimposed OFDM systems is proposed and its CRB is derived. The idea of simultaneous transmission of pilot and data symbols on each subcarrier, the so called superimposed technique, introduces the efficient use of bandwidth in OFDM context. Pilot symbols can be added to data symbols to enable CIR estimation without sacrificing the data rate. Despite the many advantages of OFDM, it suffers from sensitivity to carrier frequency offset (CFO). CFO destroys the orthogonality between the subcarriers. Thus, it is necessary for the receiver to estimate and compensate for the frequency offset. Several high accuracy estimators are derived. These include CFO estimators, as well as a joint iterative channel/CFO estimator/data detector for superimposed OFDM. The objective is to achieve CFO estimation with using just one OFDM block of received data and without the knowledge of CIR.

This thesis proposes a potential solution for future ubiquitous broadband wireless access networks, called a cellular wireless mesh network (CMESH), and investigates a number of its performance issues. A CMESH is organized in multi-radio, multi-channel, multi-rate and multi-hop radio cells. It can operate on abundant high radio frequencies, such as 5-50 GHz, and thus may satisfy the bandwidth requirements of future ubiquitous wireless applications.<p> Each CMESH cell has a single Internet-connected gateway and serves up to hundreds of mesh nodes within its coverage area. This thesis studies performance issues in a CMESH, focusing on cell capacity, expressed in terms of the max-min throughput. In addition to introducing the concept of a CMESH, this thesis makes the following contributions.<p> The first contribution is a new method for analyzing theoretical cell capacity. This new method is based on a new concept called Channel Transport Capacity (CTC), and derives new analytic expressions for capacity bounds for carrier-sense-based CMESH cells.<p> The second contribution is a new algorithm called the Maximum Channel Collision Time (MCCT) algorithm and an expression for the nominal capacity of CMESH cells. This thesis proves that the nominal cell capacity is achievable and is the exact cell capacity for small cells within the abstract models.<p> Finally, based on the MCCT algorithm, this thesis proposes a series of greedy algorithms for channel assignment and routing in CMESH cells. Simulation results show that these greedy algorithms can significantly improve the capacity of CMESH cells, compared with algorithms proposed by other researchers.

In modern times the increasing complexity of transistors and their constant decreasingsize require more effective techniques to display and interpret the processes that are inside of devices. In this work, we are modeling a two‐dimensional n‐MOSFET with a long channeland uniformly doped substrate. We assume that this device is a large geometry device so that short‐channel and narrow‐width effects can be neglected. As a result of the thesis, a demonstration program was built. In this executable file, the user can choose parameters of the MOSFET‐model: drain and gate voltage, and different geometrical parameters of the device (junction depth and effective channel length). In the advanced regime of the program, the user can also specify the model re‐calculation parameter, doping concentration in n+ and bulk regions. The program shows the channel between the source and drain region with surface diagrams of carrier density and potential energy as an output. It is possible to save all calculated results to a file and process it in any other program, for example, plot graphics in Matlab or Matematica. The model can be used in lectures that are related to semiconductor physics in order to explain the basic working mechanisms of MOSFETs as well as for further detailed analysis of the processes in MOSFETs. It is possible to use our modeling techniques to rebuild the model in another computer language, or even to build other models of transistors, performing similar calculations and approximations. It is possible to download the executable file of the model here: http://studentdevelop.com/projects/MOSFET_model.zip

Future wireless networks will be required to transmit real-time multimedia data reliably with high speed and low latency. This demands new approaches to the design and analysis of wireless networks. In this context, multiple antenna architectures are a promising solution which provide wireless systems with a high degree of functionality, adaptability, capacity, and robustness. However, efficient use of these systems is possible only by solving a number of critical problems. In this dissertation, we focus on coding and information theoretic aspects of multiple antenna systems. Knowledge in these areas provides us with guidelines into analysis and design of systems, reveals inherent limitations, pinpoints problems and opportunities for improvement, and also allows for rigorous argument and justification of observations. We present novel results on multiple antenna communication systems with both theoretical and practical impacts. In the area of coding theory, performance limits and error bounds for space-time codes will be discussed, along with guidelines for systematic design of space-time codes in the presence of the channel correlation profile. In the area of information theory, a unified approach to the capacity analysis of multiple antenna channels will be discussed. We also present a novel partial ordering relation on fading channels that is helpful in information theoretic analysis of compound and non-stationary channels. The results of the dissertation can be generalized to multiple-user channels. This could lead to a solid understanding of fundamental limits of wireless systems and opportunities for opening new trends and paradigms for future generations of wireless networks.