<p>This thesis o ers some prototypes to provide browser-based and mobile video communication services for Deaf people and evaluates these prototypes. The aim of this research is to identify an acceptable video communication technology for Deaf people by designing and evaluating several prototypes. The goal is to nd one that Deaf people would like to use in their day-to-day life. The thesis focuses on two technologies | browser-based systems and mobile applications. Several challenges emerged, for example, speci c Deaf user requirements are di cult to obtain, the technical details must be hidden from end users, and evaluation of prototypes includes both technical and social aspects. This thesis describes work to provide South African Sign Language communication for Deaf users in a disadvantaged Deaf community in Cape Town. We posit an experimental design to evaluate browser-based and mobile technologies in order to learn what constitutes acceptable video communication for Deaf users. Two browser-based prototypes and two mobile prototypes were built to this e ect. Both qualitative data and quantitative data are collected with user tests to evaluate the prototypes. The video quality of Android satis es Deaf people, and the portable asynchronous communication is convenient for Deaf users. The server performance is low on bandwidth, and will therefore cost less than other alternatives, although Deaf people feel the handset is costly.</p>

This thesis addresses a novel type of network known as a mobile ad hoc network. A mobile ad hoc network is a collection of entirely mobile nodes that can establish communication in the absence of any fixed infrastructure. Envisioned applications of these networks include virtual classrooms, emergency relief operations, military tactical communications, sensor networks and community networking. Mobile ad hoc networking poses several new challenges in the design of network protocols. This thesis focuses on the routing problem. The main challenges in the design of a routing protocol for mobile ad hoc networks result from them having limited resources and there being frequent topological changes that occur unpredictably. Moreover, there is no fixed infrastructure that supports routing. The conventional routing protocols are not generally suitable for mobile ad hoc networks, as they cannot react quickly to the changing network topology, cause excessive communication and computation, or converge very slowly creating routing loops. In this thesis we propose two classes of routing schemes for mobile ad hoc networks. The first class is known as Limited Flooding Protocol. The protocol is fully reactive and does not require the computation of routing tables. It uses some basic principles of flooding, but reduces the communication overhead by restricting packet propagation through the network. Several variations of limited flooding are considered including deterministic, randomised and priority-based mechanisms. The main advantage of this protocol is that it can be used in networks with unpredictable topological changes and highly mobile nodes, since maintaining routing table at the intermediate nodes is not required. The second class of routing protocols is based on hierarchical clustering architecture and is intended for use in a relatively low mobility environment. The basic idea of this protocol is to partition the entire network into smaller units known as clusters and define routing mechanisms both within and between clusters using a hierarchical architecture. The main advantage of this architecture is reduction of storage requirements of routing information, communication overhead and computational overhead at each node. Discrete-event simulation is used for modelling and performance evaluation. Various options and variations of the protocols are examined in the…[Page 2 of abstract is missing.] / Thesis (Ph.D.)-University of Natal, Durban, 2000.

Performance analysis in cellular networks is the determination of customer orientated grade-of-service parameters, such as call blocking and dropping probabilities, using the methods of stochastic theory. This stochastic theory analysis is built on certain assumptions regarding the arrival and service processes of user-offered calls in a network. In the past, cellular networks were analysed using the classical assumptions, Poisson call arrivals and negative exponential channel holding times, borrowed from earlier fixed network analysis. However, cellular networks are markedly different from fixed networks, in that, they afford the user a unique opportunity: the ability to communicate while on the move. User mobility and various other cellular network characteristics, such as customer-billing, cell· layout and hand·off mechanisms, generally invalidate the use of Poisson arrivals and negative exponential holding times. Recent measurements on live networks substantiate this view. Consequently, over the past few years, there has been a noticeable shift towards using more generalised arrival and service distributions in the performance analysis of cellular networks. However, two shortcomings with the resulting models are that they suffer from state space explosion and / or they represent hand off traffic as a state dependent mean arrival rate (thus ignoring the higher moments of the hand-off arrival process). This thesis's contribution to cellular network analysis is a moment-based approach that avoids full state space description but ensures that the hand-off arrival process is modelled beyond the first moment. The thesis considers a performance analysis model that is based on Poisson new call arrivals, generalised hand-off call arrivals and a variety of channel holding times. The thesis shows that the performance analysis of a cellular network may be loosely decomposed into three parts, a generic cell traffic characterising model, a generic cell traffic blocking model and a quality of service evaluation model. The cell traffic characterising model is employed to determine the mean and variance of hand-off traffic offered by a cell to its neighbour. The cell traffic-blocking model is used to detennine the blocking experienced by the various traffic streams offered to each cell. The quality of service evaluation part is essentially afued-point iteration of the cell traffic characterising and cell traffic blocking parts to determine customer orientated grade-of-service parameters such as blocking and dropping probabilities. The thesis also presents detailed mathematical models for user mobility modelling. Finally, the thesis provides extensive results to validate the proposed analysis and to illustrate the accuracy of the proposed analysis when compared to existing methods. / Thesis (Ph.D.)-University of Natal, Durban, 2000.

This thesis interrogates the suitability of wireless technologies to implement an eBusiness infrastructure in Micro and Small Enterprises (MSEs) in developing countries, particularly in Kenya. A research model was developed based on literature and information obtained from a pilot study. The proposed model extended Task-Technology Fit with two core constructs from the Unified Theory of Acceptance and Use of Technology. A preliminary study was conducted to refine the proposed model and inclusion of any variables limiting the suitability of wireless technologies as MSEs’ eBusiness infrastructure. The proposed model was empirically tested using data collected using a survey questionnaire and five descriptive case studies on MSEs in Kenya. A proportionate stratified random sampling method within well defined geographic clusters was used to collect data from 570 MSEs. The constructs were assessed for reliability, validity and exploratory factor analysis using SPSS and validated via a confirmatory factor analysis using Structural Equation Modeling with AMOS maximum likelihood method. Most Kenyans live in rural areas of the country with no access to mainstream technologies and a considerable digital divide exists, particularly between the urban and rural areas. This necessitated an intra-country comparison of access and use of wireless technologies in rural and urban MSEs in implementing an eBusiness infrastructure. The results of the intracountry comparisons indicate that while there are indisputable similarities in usage and perception of barriers and benefits of using wireless technologies to implement eBusiness infrastructure between the rural areas and urban centers in Kenya, there are also considerable differences. The relationships among the research model constructs were different depending on whether the sample was rural or urban. However, the differences between rural and urban MSEs’ ratings of the proposed research model constructs were not statistically significant. The study finds that there are evident positive performance impacts on MSEs that use wireless technologies for their eBusiness infrastructure and that the research model fit well with the data collected. The results also indicate that Task-Technology Fit and Usage directly and significantly affect organizational performance while Performance Expectance, Social Influence and Task-Technology Fit were significant determinants of Usage. Among the three proposed barriers of Security Risks, Affordability and Performance Risks, only Performance Risks had a significant negative effect on Usage. Finally, the study’s results, theoretical, managerial and policy implications are discussed and recommendations for future research given. / Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2010.

An ad hoc network is a multi-hop wireless network in which mobile nodes communicate over a shared wireless channel. The network is formed cooperatively without specific user administration or configuration and is characterised by a distributed network management system and the absence of a wired backbone. Military, law enforcement, and disaster relief operations are often carried out in situations with no pre-existing network infrastructure and can benefit from such networks because base stations, which are single points of failure, are undesirable from a reliability standpoint. The rising popularity of mobile computing has also created a potentially large commercial market for multimedia applications applied over wireless ad hoc networks. This dissertation focuses on the routing aspects of ad hoc networking. The multi-hop routes between nodes constantly change as the mobile nodes migrate. Ad hoc network routing algorithms must therefore adapt to the dynamic and unpredictable topology changes, the random radio propagation conditions and portable power sources. Various routing protocols have been proposed in the literature for ad hoc networks. These protocols together with comparative simulations are discussed and a new protocol based on load balancing and signal quality determination is proposed . and the simulation results are presented. Currently the proposed routing protocols are compared using simulation packages which are often time consuming. This dissertation proposes a mathematical model for evaluating the routing protocols and the resultant end-to-end blocking probabilities. The mathematical model is based on a derivation of the reduced load approximation for analysing networks modelled as loss networks and the evaluation incorporates and adapts models that have been used for the analysis of cellular Code Division Multiple Access (CDMA) systems. While analytical methods of solving blocking probability can potentially generate results orders of magnitude faster than simulation, they are more importantly essential to network sensitivity analysis, design and optimisation. / Thesis (M.Sc.Eng.)-University of Natal, Durban, 2003.

Third generation cellular communication systems based on CDMA techniques have shown great scope for improvement in system capacity. Over the last decade, there has been significant interest in DS-CDMA detectors. The conventional detector, the optimal detector and a number of sub-optimal multi-user detectors (MUD) have been extensively analyzed in the literature. Recently, the reduction of power consumption in DS-CDMA systems has also become another important consideration in both system design and in implementation. In order to support wireless multimedia services, all CDMA-based systems for third generation systems have a large bandwidth and a high data rate, therefore the power consumed by the digital signal processor (DSP) is high. This thesis focuses on power consumption in the adaptive Minimum Mean Square Error (MMSE) detector which is based on the Least Mean Square (LMS) algorithm. This thesis presents a literature survey on MUD and adaptive filter algorithms. A system model of the quantized LMS-MMSE MUD is proposed and its performance is analyzed. The quantization effects in the finite precision LMS-MMSE adaptive MUD including the steady-state weight covariance, mean square error (MSE) and bit error rate (BER) versus wordlength of data and coefficient are investigated when both the data and filter coefficients are quantized. The effects of wordlength size on power consumption are investigated and the tradeoff between the power consumption and performance degradation and the optimal allocation of bits to data and to LMS coefficients under power constraint is presented. / Thesis (M.Sc.Eng.)-University of Natal, Durban, 2003.

Third generation wireless systems have adopted Direct-Sequence/Code-Division Multiple-Access (DS/CDMA) as the multiple access scheme of communication. This system would typically operate in a multipath fading channel. This dissertation only deals with the task of channel estimation at the base station where the multipath delays and attenuations for each user are estimated. This information is used to aid the recovery of data that was transmitted by each user. Subspace-based algorithms are popularly used to perform the task of channel estimation because they have the desirable property of perfectly estimating the channel in a noise-free environment. In this dissertation a new subspace-based channel estimation algorithm for DS/CDMA systems is presented. The proposed algorithm is based on the Parametric Subspace algorithm by Perros-Meilhac et al. for single-user systems. The main focus of this dissertation is to convert the Parametric Subspace algorithm from a single-user system to a multi-user DS/CDMA system. It has been shown in the literature that by using information of the pulse-shaping filter in the Channel Subspace algorithm, the variance of the channel estimates is decreased. However, this has only been applied to a single-user system. There are several subspace algorithms that have been proposed for DS/CDMA systems. Most of these algorithms sample the received signal at the chip rate, making it impossible to exploit knowledge of the pulse-shaping filter in the channel estimation algorithm. In this dissertation a new subspace-based channel estimation algorithm is derived for a DS/CDMA system with multiple receive antennas, where the output is oversampled with respect to the chip rate. By oversampling the received signal, knowledge of the pulse-shaping filter is used in the channel estimation algorithm. It is shown that the variance of the channel estimate for the proposed subspace algorithm is less than the Torlak/Xu subspace algorithm that does not exploit information of the pulse-shaping filter. A mathematical expression of the mean square error of estimation for the new algorithm is also derived. It was shown that the analytic expression provides a good approximation of the actual MSE for high SNR. The Parametric Subspace Delay Estimation (PSDE) algorithm was developed by Perros-Meilhac et al. to estimate the multipath delays introduced by the communications channel. The limitation of the PSDE algorithm is that the performance of the algorithm deteriorates as the power of the multipath signals decrease with increasing delay time. This dissertation proposes a modified version of the PSDE algorithm, called the Modified Parametric Subspace Delay Estimation (MPSDE) algorithm, which performs better than the PSDE algorithm in an environment where the power of the multipath signals varies. The final part of this dissertation discusses the Torlak/Xu channel estimation algorithm and the Bensley/Aazbang delay estimation algorithm. In order to compare the performance of these two subspace algorithms, the Torlak/Xu algorithm is converted to a delay estimation algorithm that is called the Parametric TX algorithm. The performance of the Bensley/Aazbang delay estimation algorithm and the proposed Parametric TX algorithm are compared and it is shown that the Parametric TX algorithm offers the better performance. / Thesis (M.Sc.Eng.)-University of Natal, Durban, 2003.

A mobile ad-hoc network is an autonomous network of mobile devices that are connected via wireless links. In such networks there is no pre-existing infrastructure and nodes are free to move in a random fashion. Due to this mobility mobile ad-hoc networks have dynamic topologies. A host in the network typically has limited bandwidth and energy resources. Routing is a major challenge in the development of such systems and there have been many solutions proposed in the recent past. The aim of this work is to design and implement a routing scheme for a Positional Communication System (PCS). The PCS is a network of mobile handheld pocket PCs connected via wireless interfaces. The system allows voice and data communication between nodes in the network. This dissertation addresses the process of designing a routing protocol for an ad-hoc network. There have been many proposed algorithms that solve the routing problem in a mobile ad-hoc network. It is a difficult task to compare the performance of'these protocols qualitatively as there are many parameters that affect network performance. Various simulation packages for networks of this type exist. One such package is the Network Simulator (NS-2). It is a discrete time event simulator that can be used to model wired and wireless networks. This dissertation presents NS-2 simulations that compare four recently proposed routing algorithms. From this comparison study it is shown that on-demand algorithms perform best in a mobile ad-hoc environment. The dissertation then describes the design of a novel on-demand routing algorithm. The ondemand algorithms proposed thus far use a blind flooding technique during the route discovery process. This method is inefficient and creates excessive routing overhead. The routing protocol proposed in the dissertation implements a query localization technique that significantly reduces the network traffic. The protocol also introduces a load checking metric in addition to the metric used by most on-demand schemes, namely hop count. Simulation results show that such a scheme makes the on-demand routing algorithm more efficient and scalable than existing ones. It is widely believed that prior to implementing a routing protocol in real world systems it is essential that it is tested and validated on a test-bed. The dissertation presents the implementation of an on-demand routing algorithm in a Positional Communication System test-bed, where each handheld PC in the network runs an embedded Linux operating system. / Thesis (M.Sc.Eng.)-University of Natal, Durban, 2003.

Recent studies have shown that considerable system capacity gains in mobile communication systems can be obtained by exploiting the use of antenna arrays at the base station. Unfortunately, these studies make little mention of practical issues concerning implementation. It is thus one of the objectives of the Centre of Excellence (CoE) in Radio Access Technologies at the University of Natal to investigate the development of a widehand CDMA adaptive array transceiver using Alcatel software radios as the transceiver platforms. Such a transceiver system can be subdivided into three major sections: RF front-end, signal digitization and baseband processing stages. Due to the enormity of such an undertaking, the research outlined in this thesis is focused on (but not isolated to) some aspects of the RF front-end implementation for the proposed system. The work in this thesis can be catergorized into two sections. The first section focuses on the theoretical and practical (or implementation) aspects of antenna arrays and beamforming. In particular, it is evident that digital (rather than analogue) beamforming in a multi user environment, is a more viable option from both a cost and implementation standpoint. The second section evaluates the impact of RF component noise and local oscillator generated phase noise in a DS-CDMA system. The implementation of a RP front-end for a BPSK transceiver also forms part of the work in this section. LO phase noise and Error Vector Magnitude (EVM) measurements are performed on this system to support relevant theory. By use of the HP89410A phase noise measurement utility and the phase noise theory developed in this thesis, a quantitative phase noise comparison between two frequency sources used in the system were made. EVM measurement results conclusively verified the importance of an LNA in the system. It has also been shown that the DS-CDMA simulated system exhibits superior performance to the implemented BPSK system. Furthermore, an EVM troubleshooting methodology is introduced to identify possible impairments within the BPSK receiver RF front-end. However, this thesis was written with the intention of bridging the gap between the theoretical and practical implementation aspects of RP wireless communication systems. It is the author's opinion that this has been achieved to a certain extent. / Thesis (M.Sc.Eng.)-University of Natal, Durban, 2000.

Wireless mobile communication is witnessing a rapid growth in, and demand for, improved technology and range of information types and services. Further, third generation cellular networks are expected to provide mobile users with ubiquitous wireless access to a global backbone architecture that carries a wide variety of electronic services. We examine the topic of power control and models that arc suitable for modem third generation wireless networks. CDMA technology is proving to be a promising and attractive approach for spectrally efficient, economical and high quality digital communications wireless networks. This thesis addresses the challenge of integrating heterogeneous transmitting sources with a broad range of Quality of Service characteristics in the cellular COMA networks. Provided the right power control can be devised, COMA offers the potential of extracting gain from the statistical multiplexing of such sources. A distributed power control algorithm is proposed which is required to update the transmitted power of the mobiles in each of the service classes locally. and enhance the performance of the system significantly. Algorithms for pragmatic issues like power level quantization and truncation of power are derived and incorporated into the proposed distributed power control algorithm. / Thesis (M.Sc.Eng.)-University of Natal, Durban, 2000.