Hazer Inaltekin

Dr. Hazer Inaltekin

The School of Engineering, Macquarie University, Macquarie Park, NSW 2109, Australia
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 August 2009 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Hazer InaltekinHazer Inaltekin
Hazer Inaltekin
MCMung Chiang
Mung Chiang
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
SWStephen B. Wicker
Stephen B. Wicker
This paper addresses the following question: how reliable is it to use the unbounded path-loss model G(d) = d-alpha, where alpha is the path-loss exponent, to model the decay of transmitted signal power in wireless networks? G(d) is a good approximation for the path-loss in wireless communications for large values of d but is not valid for small values of d due to the singularity at 0. This model is often used along with a random uniform node distribution, even though in a group of uniformly distributed nodes some may be arbitrarily close to one another. The unbounded path-loss model is compared to a more realistic bounded path-loss model, and it is shown that the effect of the singularity on the total network interference level is significant and cannot be disregarded when nodes are uniformly distributed. A phase transition phenomenon occurring in the interference behavior is analyzed in detail. Several performance metrics are also examined by using the computed interference distributions. In particular, the effects of the singularity at 0 on bit error rate, packet success probability and wireless channel capacity are analyzed.

14 February 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SGSwaroop Gopalam
Swaroop Gopalam
Iain CollingsIain Collings
Iain Collings
SHStephen V. Hanly
Stephen V. Hanly
Hazer InaltekinHazer Inaltekin
Hazer Inaltekin
SPSibi Raj B. Pillai
Sibi Raj B. Pillai
PWPhilip Whiting
Philip Whiting
This paper presents an efficient practical Zak-OTFS modulation implementation using time and frequency windowing methods. We present two general classes of delay-Doppler (DD) twisted convolution (TC) filters (Type-1 and Type-2), and show that they can be realized by time and frequency windowing functions. We then propose practical methods to generate time domain Zak-OTFS signals, for actual transmission, using the windowing functions. For Type-1, the signals are generated using an interpolation filter. For Type-2, they are generated using a form of precoded OFDM. We show that this allows a wide variety of pulse shapes to be implemented in practice for Zak-OTFS modulation. This was not previously possible. We also show that the Type-2 signals are more spectrally efficient than their Type-1 counterparts. Finally, we compare the channel predictability of the two implementations.

3 March 2008 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
Hazer InaltekinHazer Inaltekin
Hazer Inaltekin
SWStephen B. Wicker
Stephen B. Wicker
We address the fundamental question of whether or not there exist stable operating points in a network in which selfish nodes share a common channel, and if they exist, how the nodes behave at these stable operating points. We begin with a wireless communication network in which n nodes (agents), which might have different utility functions, contend for access on a common, wireless communication channel. We characterize this distributed multiple-access problem in terms of a one-shot random-access game, and then analyze the behavior of the nodes using the tools of game theory. We give necessary and sufficient conditions on nodes for the complete characterization of the Nash equilibria of this game for all n ges 2. We show that all centrally controlled optimal solutions are a subset of this game theoretic solution, and almost all (w.r.t. Lebesgue measure) transmission probability assignments chosen by a central authority are supported by the game theoretic solution. We analyze the behavior of the network throughput at Nash equilibria as a function of the costs of the transmitters incurred by failed transmissions. Finally, we conclude the paper with the asymptotic analysis of the system as the number of transmitters goes to infinity. We show that the asymptotic distribution of the packet arrivals converges in distribution to a Poisson random variable, and the channel throughput converges to -(c/(1+c))ln(c/(1+c)) with c > 0 being the cost of failed transmissions. We also give the best possible bounds on the rates of convergence of the packet arrival distribution and the channel throughput.

21 July 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
YFYuting Fang
Yuting Fang
SASaman Atapattu
Saman Atapattu
Hazer InaltekinHazer Inaltekin
Hazer Inaltekin
Jamie EvansJamie Evans
Jamie Evans
The reconfigurable intelligent surface (RIS) is a promising technology that is anticipated to enable high spectrum and energy efficiencies in future wireless communication networks. This paper investigates optimum location-based RIS selection policies in RIS-aided wireless networks to maximize the end-to-end signal-to-noise ratio for product-scaling and sum-scaling path-loss models where the received power scales with the product and sum of the transmitter-to-RIS and RIS-to-receiver distances, respectively. These scaling laws cover the important cases of end-to-end path-loss models in RIS-aided wireless systems. The random locations of all available RISs are modeled as a Poisson point process. To quantify the network performance, the outage probabilities and average rates attained by the proposed RIS selection policies are evaluated by deriving the distance distribution of the chosen RIS node as per the selection policies for both product-scaling and sum-scaling path-loss models. We also propose a limited-feedback RIS selection framework to achieve distributed network operation. The outage probabilities and average rates obtained by the limited-feedback RIS selection policies are derived for both path-loss models as well. The numerical results show notable performance gains obtained by the proposed RIS selection policies.

7 August 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
Hazer InaltekinHazer Inaltekin
Hazer Inaltekin
The problem of Gaussian approximation for the wireless multi-access interference distribution in large spatial wireless networks is addressed. First, a principled methodology is presented to establish rates of convergence of the multi-access interference distribution to a Gaussian distribution for general bounded and power-law decaying path-loss functions. The model is general enough to also include various random wireless channel dynamics such as fading and shadowing arising from multi-path propagation and obstacles existing in the communication environment. It is shown that the wireless multi-access interference distribution converges to the Gaussian distribution with the same mean and variance at a rate 1/√λ, where λ >; 0 is a parameter controlling the intensity of the planar (possibly non-stationary) Poisson point process generating node locations. An explicit expression for the scaling coefficient is obtained as a function of fading statistics and the path-loss function. Second, an extensive numerical and simulation study is performed to illustrate the accuracy of the derived Gaussian approximation bounds. A good statistical fit between the interference distribution and its Gaussian approximation is observed for moderate to high values of λ.

26 June 2012 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Hazer InaltekinHazer Inaltekin
Hazer Inaltekin
SHStephen V. Hanly
Stephen V. Hanly
This paper considers the optimum single cell power control maximizing the aggregate (uplink) communication rate of the cell when there are peak power constraints at mobile users, and a low-complexity data decoder (without successive decoding) at the base station. It is shown that the optimum power allocation is binary, which means that links are either “on” or “off.” By exploiting further structure of the optimum binary power allocation, a simple polynomial-time algorithm for finding the optimum transmission power allocation is proposed, together with a reduced complexity near-optimal heuristic algorithm. Sufficient conditions under which channel-state aware time division multiple access (TDMA) maximizes the aggregate communication rate are established. In a numerical study, we compare and contrast the performance achieved by the optimum binary power-control policy with other suboptimum policies and the throughput capacity achievable via successive decoding. It is observed that two dominant modes of communication arise, wideband or TDMA, and that successive decoding achieves better sum-rates only under near perfect interference cancellation efficiency. In this paper, we exploit the theory of majorization to obtain the aforementioned results. In the final part of this paper, we do so to solve power-control problems in the areas of femtocells and cognitive radio and find that, again, optimal solutions have a binary (or almost binary) character.