Wireless Communication

Matlab Based Wireless Communication Projects

  • September 26 2023
  • Bhimsen

IEEE wireless communication matlab based projects for mtech, btech, be, ms and diploma students in bangalore

1.Joint Power and Bandwidth Allocation in Wireless Cooperative Localization Networks

Cooperative localization can enhance the accuracy of wireless network localization by incorporating range information among agent nodes in addition to those between agents and anchors. In this paper, we investigate the optimal allocation of the restricted resources, namely, power and bandwidth, to different nodes.

We formulate the optimization problems for both synchronous networks and asynchronous networks, where one way and round trip measurements are applied for range estimation, respectively. Since the optimization problems are nonconvex, we develop an iterative linearization-based technique, and show by comparison with brute-force search that it provides near-optimal performance in the investigated cases. We also show that especially in the case of inefficient anchor placement and/or severe shadowing, cooperation among agents is important and more resources should be allocated to the agents correspondingly.


2.Secure Communication in Massive MIMO Relay Networks

In this paper, a secure communication system model for massive multiple-input multiple-output (MIMO) relay networks is investigated. Specifically, physical layer secure transmission is provisioned in multi-user relay networks by employing massive MIMO, linear precoder/detectors and artificial noise generation in the presence of a passive multi-antenna eavesdropper. In particular, the achievable asymptotic secrecy rate for infinitely many relay antennas is derived.

The use of random artificial noise shaping matrices is advocated for massive MIMO relays for the sake of reducing the system implementation complexity. The effects of the numbers of antennas at the relay and the eavesdropper in achieving secure communication are investigated by comparing the corresponding achievable secrecy rates.


3.MIMO Wireless Secure Communication Using Data-Carrying Artificial Noise

In MIMO wireless channels, channel estimation can provide a source of randomness common to sender and receiver that may be used to generate secret keys. These keys can provide information theoretically secure communication. Alternatively, a known MIMO channel allows transmitting artificial noise in the null space of the main channel to secure communication. In this paper, we show that both methods can be combined to further enhance secrecy. Symbols encrypted at the transmitter simultaneously act as message for the intended receiver and as noise for any potential eavesdroppers. We derive expressions

for the minimum-guaranteeable secrecy rate as a function of number of symbols encrypted. Given at least one symbol can be encrypted, our proposed method outperforms the standard artificial noise scheme in terms of both secrecy rate and power expenditure. We first analyze the system assuming keys can be instantaneously extracted from channel measurements. We then derive bounds for rates assuming the overhead time required for key generation produces a Gaussian channel-estimation error.


4.Lightweight Ciphers Based on Chaotic Map – LFSR Architectures

In this paper, we propose and analyze two different stream ciphers based on a Skew Tent Map and a Modified Logistic Map respectively. In order to improve the randomness of these systems, a single method for increasing the period length of the generated sequences has been applied. The results prove that the randomness of these systems can be severally increased by using this method, making these systems suitable for secure communications.


5.Block-Diagonalization Precoding in a Multiuser Multicell MIMO System: Competition and Coordination

This paper studies a multiuser multicell system where block-diagonalization (BD) precoding is utilized on a per-cell basis. We examine and compare the multicell system under two operating modes: competition and coordination. In the competition mode, the paper considers a strategic noncooperative game (SNG), where each base-station (BS) greedily determines its BD precoding strategy in a distributed manner, based on the knowledge of the inter-cell interference at its connected mobile-stations (MS). Via the game-theory framework,the existence and uniqueness of a Nash equilibrium in this SNG are subsequently studied.

In the coordination mode, the BD precoders are jointly designed across the multiple BSs to maximize the network weighted sum-rate (WSR). Since this WSR maximization problem is non convex, we consider a distributed algorithm to obtain at least a locally optimal solution. Finally, we extend our analysis of the multicell BD precoding to the case of BD-Dirty Paper Coding (BD-DPC) precoding. We characterize BD-DPC precoding game for the multicell system in the competition mode and propose an algorithm to jointly optimize BD-DPC precoders for the multicell system in the coordination mode. Simulation results show significant network sum-rate improvements by jointly designing the BD or BD-DPC precoders across the multicell system in the coordination mode over the competition mode.


6.Energy Efficient Network Beamforming Design Using Power-Normalized SNR

In this paper, we adopt a novel efficiency measure, namely the received signal-to-noise-ratio (SNR) per unit power, in amplify-and-forward (AF) relay networks. The measure is addressed as the power-normalized SNR (PN-SNR). For several relay network scenarios, we solve the PN-SNR maximization problems and analyze the network performance. First, for single relay networks, we find the optimal relay power control scheme that maximizes the PN-SNR for a given transmitter power.

Then, for multi-relay networks with a sum relay power constraint, we prove that the PN-SNR optimization problem has a unique maximum, thus the globally optimal solution can be found using a gradient-ascent algorithm. Finally, for multi-relay networks with an individual power constraint on each relay, we propose an algorithm to obtain the globally optimal solution and also a low complexity algorithm for a suboptimal solution.

Our results show that with the same average relay transmit power, the PNSNR maximizing scheme is superior to the fixed relay power scheme not only in PN-SNR but also in the outage probability for both single and multi-relay networks. Compared with SNR maximizing scheme, it is significantly superior in PN-SNR with moderate degradation in outage probability. Our results show the potential of using PN-SNR as efficiency measure in network design.


7.Wireless Information and Power Transfer in Multiuser OFDM Systems

In this paper, we study the optimal design for simultaneous wireless information and power transfer (SWIPT) in downlink multiuser orthogonal frequency division multiplexing (OFDM) systems, where the users harvest energy and decode information using the same signals received from a fixed access point (AP). For information transmission, we consider two types of multiple access schemes, namely, time division multiple access (TDMA) and orthogonal frequency division multiple access (OFDMA). At the receiver side, due to the practical limitation that circuits for harvesting energy from radio signals are not yet able to decode the carried information directly,

each user applies either time switching (TS) or power splitting (PS) to coordinate the energy harvesting (EH) and information decoding (ID) processes. For the TDMA-based information transmission, we employ TS at the receivers; for the OFDMA-based information transmission, we employ PS at the receivers. Under the above two scenarios,

we address the problem of maximizing the weighted sum-rate over all users by varying the time/frequency power allocation and either TS or PS ratio, subject to a minimum harvested energy constraint on each user as well as a peak and/or total transmission power constraint. For the TS scheme, by an appropriate variable transformation the problem is reformulated as a convex problem, for which the optimal power allocation and TS ratio are obtained by the Lagrange duality method.

For the PS scheme, we propose an iterative algorithm to optimize the power allocation, subcarrier allocation and the PS ratio for each user. Numerical results show that the peak power constraint imposed on each OFDM subcarrier as well as the number of users in the system play a key role in the rate-energy performance comparison by the two proposed schemes.


Share on:

Leave Your Comment Here