M Tech Dissertations

Permanent URI for this collectionhttp://drsr.daiict.ac.in/handle/123456789/3

Browse

Filters

2004 - 200926

Settings

End date: 2009Subject: search.filters.subject.Wireless communication systems

Search Results

Now showing 1 - 10 of 26
  • Thumbnail Image
    ItemOpen Access
    Executable specification design and simulation of OFDM based communication system
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Sa, Sudhir Kumar; Dubey, Rahul
    The communication system using the OFDM principle is today one of the most important application in communication field. This system has various applications from broadband to 3G and digital TV to Radio LANs. This master’s thesis project deals with the implementation of certain specification, algorithmic exploration for WVAN (wireless video area network) in Simulink®. The implemented model and its specification is the reference for the hardware designing and verification. The model used in OFDM based QPSK/16-QAM modulated communication system for the WHD WVAN standard at the High Rate Physical (HRP) layer. This thesis project describes the functionality of the various communication blocks and the method of data transmission through these blocks. The main purpose of this model is to calculate the BER (Bit Error Rate). The final design which supports the different HRP mode for different code rate and different Modulation scheme can take different length of sub-packets which depends on the HRP mode of Transmission. This model also implements the radix-2 FFT algorithm for fixed point FFT processor. Since the FFT processor cannot be used standalone, so in this thesis it is employed in an OFDM Transmitter and Receiver. The goal of this report is to outline the knowledge gained during the master’s thesis project, to describe a design methodology for the OFDM based communication system for high throughput and best error protection. The functionality of each block of the communication system is written in „C‟ code and the output data of each block of Simulink Model is compared to 'C' code written output for the same input.
  • Thumbnail Image
    ItemOpen Access
    Testbed based experimental analysis of transport protocols over wireless ad hoc networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Shah, Harshil Anilkumar; Srivastava, Sanjay
    Ad hoc networks are networks with no infrastructure and self-organized in nature. ad hoc networks allow nodes to form network when they come into range of each other provided nodes are configured in ad hoc mode. But these types of network are challenges like high bit error rates, route failures due to mobility, high noise, signal fading and low speed etc. to deal with. Due to this, protocols which are widely used in traditional wired networks may not perform well in MANETs. lower layers like MAC and network layer are either completely changed like 802.11 instead of 802.3 at MAC layer and introducing reactive routing protocols instead of only proactive routing at network layer or significant improvement schemes have been proposed for wireless networks in the existing legacy wired network protocols. But transport layer in MANET is mostly similar to wired networks except some improvements like TCP-ELFN and TCP-Feedback and new transport protocols like Ad hoc-TCP (ATCP), Transport Protocol for Ad hoc networks (TPA) and Ad-hoc Transport Pro- tool (ATP).performance degradation of TCP over wireless links is mainly due to wireless characteristics, TCP features like self-clocking, loss based congestion control, coupling of congestion and reliability, slow start. Several studies have been carried out to evaluate performance of TCP over MANETs but most of them are simulation based studies. But as simulation scenarios can not model exactly the unpredictable nature of wireless environment, we have decided to analyze performance of trans- port protocols over experimental test bed which can be more accurate evaluation of protocols in real-life situation. Performance of 2 transport protocols is analyzed.
  • Thumbnail Image
    ItemOpen Access
    Design and implementation of 128-point fixed point streaming FFT processor for OFDM based communication system
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Verma, Sunil Kumar; Dubey, Rahul
    Fast Fourier Transform (FFT) processors are today one of the most important blocks in communication systems. They are used in every communication system from broadband to 3G and digital TV to Radio LANs. This master’s thesis project deals with the pipelined, radix-2 algorithmic exploration and the hardware solution for the FFT processor with the FFT size of 2N points, the selection of the scaling schemes based on application requirement is discussed. The designed architecture is functionally verified in Simulink® and the Xilinx® ISE simulator. How to encapsulate the C++ coded algorithms or functions into the Simulink. This FFT processor is used in OFDM based BPSK modulated communication system for the WHD WVAN standard at the Low Rate Physical (LRP) lay. This thesis project presents the design of the 128 point fixed–point F streaming processor. The final architecture used is the SDF (single path with delay feedback) that implements the radix-2 FFT algorithm. Since the FFT processor can’t be used standalone, so in this thesis it is employed in an OFDM Transmitter and the performance is measured for SNR over a range of PAPRs. The goal of this report is to outline the knowledge gained during the master’s thesis project, to describe a design methodology for the fixed point pipelined FFT processors, the scaling choices and how to encapsulate the existing C code into the Simulink environment to measure the performance of fixed-point systems.
  • Thumbnail Image
    ItemOpen Access
    Cache performance evaluation in DSR protocol through cross-layering for mobile ad hoc networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Sharma, Kapil; Sunitha, V.
    Wireless mobile ad-hoc networks are being actively studied by many researchers these days. These networks are suitable to be used in various situations because of (i) their infrastructure-less property and (ii) the mobility of the nodes of the network. However, it is these features which give rice to problems in study of such networks. Further, routing is one of the basic issues in any network design. Inclusion of moving capability to the nodes, make the routing problem more complicated. One is always interested in increasing the throughput and reducing overhead while at the same time solving the issues related to routing. DSR is a protocol that is extensively used for routing in such networks. Cache management and route caching play a significant role in using DSR successively to attain the best behavior for these networks. This thesis looks at and suggests some methods for route caching in DSR.
  • Thumbnail Image
    ItemOpen Access
    Cooperation enforcement mechanisms in wireless adhoc networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Chaturvedi, Manish Shivshankar; Srivastava, Sanjay
    Wireless adhoc networks are autonomous, infrastrutureless networks where there are no dedicated routers or base stations and nodes are expected to cooperate in Wireless performing routing duties to keep network connected. Cooperation can be assumed if all nodes belong to single authority (e.g. military service or disaster management). But in applications where nodes do not belong to single authority and have limited resources (energy of battery driven devices), like pervasive computing or ubiquitous computing environment, one can not deny possibility of node selfishness. Also as there is no central authority to control node behavior, one can not deny possibility of node maliciousness. Many cooperation enforcement schemes are proposed in literature, and every scheme is shown to perform better under its own set of assumptions. These assumptions are different for different schemes. So, we aim at defining common set of assumptions and comparing selected schemes on this common ground with respect to packet delivery ratio, energy consumption, routing and other control overhead. We find that with the traffic scenario where nodes do not need services of one another at the same time, the cooperation schemes are not effective in dealing with node selfish ness. We also find that, while dealing with malicious nodes, all cooperation schemes perform better than Dynamic Source Routing(DSR) protocol in improving packet de- livery ratio(PDR), but this improvement comes at the cost of significant increase in routing control packets overhead and energy consumption of cooperation enforcement schemes is higher than that of DSR. Also they fail in punishing misbehaving nodes and the PDR of malicious nodes is comparable to that of good nodes.
  • Thumbnail Image
    ItemOpen Access
    Identifying small world network properties in ad-hoc networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Garg, Neha; Sunitha, V.
    Small World Network is a densely connected network with low degree of separation. These types of networks have high clustering property like regular network as well as have low average path length like random network. Thus, Small World Networks are both Locally and Globally ecient as compared to other networks. The above prop- erties can be described using parameters like characteristic path length (L), clustering coefficient (C), local efficiency (Eloc) and global efficiency (Eglob). Through experiments, done in the past, it has been found that many real world networks exihibit the properties of small world network. This has given rise To finding models for real world networks so that the models reflect small world ness of the real world network. This thesis uses the model of converting a square grid into a small world model by introducing some special nodes. The equations to compute the small world parameters for this model with one and or two special nodes derived in this thesis.
  • Thumbnail Image
    ItemOpen Access
    Channel estimation and tracking OFDM and MIMO systems
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Singh, Smriti; Vijaykumar, Chakka
    In this thesis, To estimate and track the slow Time varying channels in OFDM and MIMO systems. In first part: we have used a two-dimensional recursive least square adaptive channel estimation technique is used. In orthogonal frequency division multiplexing (OFDM) system, time- and frequency-domain two-dimensional minimum mean square error (2D-MMSE) channel estimation is optimum. However, accurate channel statistics, which are often time varying and unavailable in practice, are required to realize it.2DRLS adaptive channel estimation does not require accurate channel statistics, and at the same time can make full use of time and frequencydomain correlations of the frequency response of time-varying wireless channels. With properly chosen parameters, 2D-RLS adaptive channel estimation can converge into the steady state in only several OFDM symbols time. Although the 2D RLS algorithm creates adaptive letters with a fast convergence speed, this algorithm diverges when the inverse correlation matrix of input loses the properties of positive definiteness or Hermitian symmetry. The diverging of the 2D RLS algorithm same as standard RLS limits the application of this algorithm. We proposed a QR decomposition-based 2DRLS (inverse QR-2DRLS) algorithm, which can resolve this instability. Instead of propagating inverse of correlation matrix of the input signal, it propogates square root of inverse correlation matrix of the input signal. Therefore, this algorithm guarantees the property of positive definiteness and is more numerically stable than the standard RLS algorithm. The parallel implementation of the inverse QR-2DRLS algorithm permits a direct computation of the least squares weight coefficients matrix MATLAB simulations demonstrate that performance of QR-2D-RLS adaptive channel estimation is same as of 2D-RLS adaptive channel estimation and is very effective and suitable for a broad range of channel conditions. In the second part of the thesis: Since, In MIMO systems, accurate channel estimation is necessary to fully exploit the benefits of spatial diversity offered by such systems. And for time-varying channels, these channel estimates should also be updated accordigly to track the variation of channel. we have used One such method of channel estimation using adaptive SVD updates for channel estimation and tracking of slow-time varying channels in MIMO system. The channel estimates are then further used for symbol detection using V-BLAST/ZF detection algorithm which ensures interference reduction and give better BER vs. SNR performance than SVD based MIMO system.
  • Thumbnail Image
    ItemOpen Access
    Comparative study between exponential back off and dynamic waiting strategies for medium access in wireless ad hoc networks
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Shah, Rahul; Srivastava, Sanjay
    IEEE 802.11 DCF (IEEE 802.11 Distributed Coordination Function) is widely used MAC protocol for wireless channel access. Although it is developed for single hop networks where all nodes are in the same radio range, it can be directly used for wireless multiphop hoc networks. But performance of IEEE 802.11 DCF in wireless ad hoc networks su

    ers as it has been developed considering single hop networks only. Many amendments has been proposed to enhance its performance in multihop ad hoc networks. One such scheme is DWMAC (Dynamic Waiting Medium Access Control). In this work, performance of IEEE 802.11 DCF and DWMAC are compared for different network scenarios and traffic patterns. It has been observed that the performance of DWMAC can be further improved if we alter the restricted mode operation of the nodes. We have proposed a new modified protocol DWMAC-Modied and have shown by simulations that DWMAC-Modied offers singnificant improvements.

  • Thumbnail Image
    ItemOpen Access
    Pulse shaping design for PAPR reduction in OFDM
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Jain, Akansha; Vijaykumar, Chakka
    Future mobile communications systems reaching for ever increasing data rates require higher bandwidths than those typical used in todays cellular systems. By going to higher bandwidth the (for low bandwidth) at fading radio channel becomes frequency selective and time dispersive. Due to its inherent robustness against time dispersion Orthogonal Frequency Division Multiplex (OFDM) is an attractive candidate for such future mobile communication systems. OFDM partitions he available bandwidth into many subchannels with much lower bandwidth. Such a narrowband subchannel experiences now almost at fading channel. However, one potential drawback with OFDM modulation is the high Peak to Average power Ratio (PAPR) of the transmitted signal: The signal transmitted by the OFDM system is the superposition of all signals transmitted in the narrowband subchannels. The transmit signal has then due to the central limit theorem a Gaussian distribution leading to high peak values compared to the average power. system design not taking this into account will have a high clip rate. Each signal sample that is beyond the saturation limit of the power amplier suersither clipping to this limit value or other non- linear distortion, both creating additional bit errors in the receiver. One possibility to avoid clipping is to design he system for very high signal peaks. However, this approach leads to very high power consumption (since the power amplifier must have high supply rails) and also complex power amplifiers. The preferred solution is therefore to apply digital signal processing that reduces such high peak values in the transmitted signal thus voiding clipping. These methods are commonly referred to as PAPR reduction. APR reduction methods can be categorized into transparent methods here the receiver is not aware of the reduction scheme applied by the transmitter and on-transparent methods where the receiver needs to know the PAPR algorithm applied by the transmitter. This master thesis would focus on transparent PAPR reduction algorithms. The pulse shaping mechanism is used to reduce PAPR. he ct is analyzed in terms of BER.
  • Thumbnail Image
    ItemOpen Access
    Design of CDMA transmitter and three finger rake receiver
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2009) Pateriya, Bhavana; Dubey, Rahul
    As cellular wireless communication becomes a worldwide communication standard, it is important in studying how data communications happens in a cellular system. In this Thesis work CDMA transmitter and receiver have been designed including the communication channel which include effects of multipath fading and noise. Effectiveness of rake receiver have been verified for varying SNR and with varying the number of fingers. Also the functionality of each block is analyzed.