Browsing by Subject "Wireless telecommunication systems"

Now showing 1 - 20 of 37

Open Access
Adaptive power control and MMSE interference suppression
(1998) Ulukus, S.; Yates, R.D.
Power control algorithms assume that the receiver structure is fixed and iteratively update the transmit powers of the users to provide acceptable quality of service while minimizing the total transmitter power. Multiuser detection, on the other hand, optimizes the receiver structure with the assumption that the users have fixed transmitter powers. In this study, we combine the two approaches and propose an iterative and distributed power control algorithm which iteratively updates the transmitter powers and receiver filter coefficients of the users. We show that the algorithm converges to a minimum power solution for the powers, and an MMSE multiuser detector for the filter coefficients.
Open Access
A Bayesian approach to respiration rate estimation via pulse-based ultra-wideband signals
(IEEE, 2009) Soǧancı, Hamza; Gezici, Sinan; Arıkan, Orhan
In this paper, theoretical limits on estimation of respiration rates via pulse-based ultra-wideband (UWB) signals are studied in the presence of prior information about respiration related signal parameters. First, a generalized Cramer-Rao lower bound (G-CRLB) expression is derived, and then simplified versions of the bound are obtained for sinusoidal displacement functions. In addition to the derivation of the theoretical limits, a two-step suboptimal estimator based on matched filter (correlation) processing and maximum a posteriori probability (MAP) estimation is proposed. It is shown that the proposed estimator performs very closely to the theoretical limits under certain conditions. Simulation results are presented to investigate the theoretical results.
Open Access
Bluetooth or 802.15.4 technologies to optimise lifetime of wireless sensor networks: Numerical comparison under a common framework
(IEEE, 2008-04) Buratti, C.; Körpeoğlu, İbrahim; Karasan, Ezhan; Verdone, R.
This paper aims at comparing through simulations the network lifetime of a wireless sensor network using Bluetooth-enabled or IEEE802.15.4 compliant devices. The evaluation is performed under a common reference framework, namely the EMORANS scenario for wireless sensor networks. Since the two enabling technologies rely on different MAC paradigms, suitable definition of the performance metrics is needed, in order to make the comparison meaningful. Thus, the paper has also a methodological objective. In particular, three different definitions of network lifetime are introduced, and a comparison of performance obtained by applying the different definitions is provided. Then, the comparison between the two standards is introduced: it is shown that there are no orders of magnitude of difference in network lifetime when the two technologies are used and the choice of the technology depends on the application requirements.
Open Access
Coded-reference ultra-wideband systems
(2008-09) Gezici, Sinan
Transmitted-reference (TR) and frequency-shifted reference (FSR) ultra-wideband (UWB) systems employ pairs of reference and data signals, which are shifted in the time and frequency domains, respectively, to facilitate low-to-medium data rate communications without the need for complex channel estimation and template signal generation. On the other hand, the recently proposed coded-reference (CR) UWB systems provide orthogonalization of the reference and data signals in the code domain, which has advantages in terms of performance and/or implementation complexity. In this paper, CR UWB systems are investigated. First, it is shown that a CR UWB system can be considered as a generalized non-coherent pulse-position modulated system. Then, an optimal receiver according to the Bayes decision rule is derived for CR UWB systems. In addition, the asymptotic optimality properties of the conventional CR UWB receivers are investigated. Finally, simulation results are presented to compare the performance of the optimal and conventional CR UWB receivers. ©2008 IEEE.
Open Access
Çokyollu ortamda çapraz belirsizlik işlevi-yön bulma tekniğinin başarım analizi
(IEEE, 2008-04) Güldoǧan, Mehmet Burak; Arıkan, Orhan
Bu bildiride, Çapraz Belirsizlik İşlevi-Yön Bulma (CAFDF) tekniğinin çokyollu ortamlardaki sinyallerin zaman gecikmesi, Doppler kayması, geliş yönü(GY) ve genlik kestirimindeki başarımı ile yiiksek çözünürlüklü algoritmalar olan Uzay-Almaşan Genelleşmiş Beklenti-Enbüyüitme (SAGE) ve Çoklu Sinyal Sınıflandırılması(MUSIC)'in sentetik sinyaller iizerindeki başarımları kıyaslanmıştır. Algoritmalann performansları, kök Ortalama Karesel Hata (kOKH) cinsinden degişik işaret Gürültü Oranı (iGO) değerlerinde Monte Carlo denemelerine dayalı olarak sunulmuştur. Sentetik kanallarda istatiksel kıyaslama amaçlı Cramer-Rao alt sınırları eklenmiştir. Simülasyon sonuçları göstermektedir ki, orta ve düşük iGO değerlerinde CAF-DF diğer iki algoritmaya göre üstünlük sağlamaktadır.
Open Access
Comparison of the CAF-DF and sage algorithms in multipath channel parameter estimation
(IEEE, 2008-07) Güldoğan, M. Burak; Arıkan, Orhan
In this paper, performance of the recently proposed Cross Ambiguity Function - Direction Finding (CAF-DF) technique is compared with the Space Alternating Generalized Expectation Maximization (SAGE) technique. The CAF-DF, iteratively estimates direction of arrival (DOA), time-delay, Doppler shift and amplitude corresponding to each impinging signal onto an antenna array by utilizing the cross ambiguity function. On synthetic signals, based on Monte Carlo trials, performances of the algoritms are tested in terms of root Mean Squared Error (rMSE) at different Signal-to-Noise Ratios (SNR). Cramer-Rao lower bound is included for statistical comparisons. Simulation results indicate the superior performance of the CAF-DF technique over SAGE technique for low and medium SNR values. © 2008 IEEE.
Open Access
Distributed joint flow-radio and channel assignment using partially overlapping channels in multi-radio wireless mesh networks
(Springer, 2016) Ulucinar, A. R.; Korpeoglu, I.
Equipping mesh nodes with multiple radios that support multiple wireless channels is considered a promising solution to overcome the capacity limitation of single-radio wireless mesh networks. However, careful and intelligent radio resource management is needed to take full advantage of the extra radios on the mesh nodes. Flow-radio assignment and channel assignment procedures should obey the physical constraints imposed by the radios as well as the topological constraints imposed by routing. Varying numbers of wireless channels are available for the channel assignment procedure for different wireless communication standards. To further complicate the problem, the wireless communication standard implemented by the radios of the wireless mesh network may define overlapping as well as orthogonal channels, as in the case of the IEEE 802.11b/g family of standards. This paper presents Distributed Flow-Radio Channel Assignment, a distributed joint flow-radio and channel assignment scheme and the accompanying distributed protocol in the context of multi-channel multi-radio wireless mesh networks. The scheme’s performance is evaluated on small networks for which the optimal flow-radio and channel configuration can be computed, as well as on large random topologies.
Open Access
Energy efficient IP-connectivity with IEEE 802.11 for home M2M networks
(Oxford University Press, 2017) Ozcelik, I. M.; Korpeoglu, I.; Agrawala, A.
Machine-to-machine communication (M2M) technology enables large-scale device communication and networking, including home devices and appliances. A critical issue for home M2M networks is how to efficiently integrate existing home consumer devices and appliances into an IP-based wireless M2M network with least modifications. Due to its popularity and widespread use in closed spaces, Wi-Fi is a good alternative as a wireless technology to enable M2M networking for home devices. This paper addresses the energy-efficient integration of home appliances into a Wi-Fi- and IP-based home M2M network. Toward this goal, we first propose an integration architecture that requires least modifications to existing components. Then, we propose a novel long-term sleep scheduling algorithm to be applied with the existing 802.11 power save mode. The proposed scheme utilizes the multicast DNS protocol to maintain device and service availability when devices go into deep sleep mode. We prototyped our proposed architecture and algorithm to build a M2M network testbed of home appliances. We performed various experiments on this testbed to evaluate the operation and energy savings of our proposal. We also did simulation experiments for larger scale scenarios. As a result of our test-bed and simulation experiments, we observed significant energy savings compared to alternatives while also ensuring device and service availability. © The British Computer Society 2017. All rights reserved.
Open Access
Enhancements to linear least squares localization through reference selection and ML estimation
(IEEE, 2008-03-04) Güvenç, İsmail; Gezici, Sinan; Watanabe F.; Inamura, H.
Linear least squares (LLS) estimation is a low complexity but sub-optimum method for estimating the location of a mobile terminal (MT) from some distance measurements. It requires selecting one of the fixed terminals (FTs) as a reference FT for obtaining a linear set of expressions. However, selection of the reference FT is commonly performed arbitrarily in the literature. In this paper, a method for selection of the reference FT is proposed, which improves the location accuracy compared to a fixed selection of the reference FT. Moreover, a covariancematrix based LLS estimator is proposed in line of sight (LOS) and non-LOS (NLOS) environments which further improves accuracy since the correlations between the observations are exploited. Simulation results prove the effectiveness of the proposed techniques. © 2008 IEEE.
Open Access
Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks
(Elsevier, 2017) Gokbayrak, K.; Yıldırım, E. A.
Wireless mesh networks (WMNs) provide cost-effective alternatives for extending wireless communication over larger geographical areas. In this paper, given a WMN with its nodes and possible wireless links, we consider the problem of gateway node selection for connecting the network to the Internet along with operational problems such as routing, wireless transmission capacity allocation, and transmission power control for efficient use of wired and wireless resources. Under the assumption that each node of the WMN has a fixed traffic rate, our goal is to allocate capacities to the nodes in proportion to their traffic rates so as to maximize the minimum capacity-to-demand ratio, referred to as the service level. We adopt a time division multiple access (TDMA) scheme, in which a time frame on the same frequency channel is divided into several time slots and each node can transmit in one or more time slots. We propose two mixed integer linear programming formulations. The first formulation, which is based on individual transmissions in each time slot, is a straightforward extension of a previous formulation developed by the authors for a related problem under a different set of assumptions. The alternative formulation, on the other hand, is based on sets of noninterfering wireless transmissions. In contrast with the first formulation, the size of the alternative formulation is independent of the number of time slots in a frame. We identify simple necessary and sufficient conditions for simultaneous transmissions on different links of the network in the same time slot without any significant interference. Our characterization, as a byproduct, prescribes a power level for each of the transmitting nodes. Motivated by this characterization, we propose a simple scheme to enumerate all sets of noninterfering transmissions, which is used as an input for the alternative formulation. We also introduce a set of valid inequalities for both formulations. For large instances, we propose a three-stage heuristic approach. In the first stage, we solve a partial relaxation of our alternative optimization model and determine the gateway locations. This stage also provides an upper bound on the optimal service level. In the second stage, a routing tree is constructed for each gateway node computed in the first stage. Finally, in the third stage, the alternative optimization model is solved by fixing the resulting gateway locations and the routing trees from the previous two stages. For even larger networks, we propose a heuristic approach for solving the partial relaxation in the first stage using a neighborhood search on gateway locations. Our computational results demonstrate the promising performance of our exact and heuristic approaches and the valid inequalities
Open Access
Joint routing, gateway selection, scheduling and power management optimization in wireless mesh networks
(Institute of Industrial Engineers, 2012-05) Uzunlar Onur; Gökbayrak, Kağan; Yıldırım, E. A.
The third generation (3G) wireless communications technology delivers user traffic in a single step to the wired network via base station; therefore it requires all base stations to be connected to the wired network. On the other hand, in the fourth generation (4G) communication systems, it is planned to have the base stations set up so that they can deliver each other's traffic to a small number of base stations equipped with wired connections. In order to improve system resiliency against failures, a mesh structure is preferred. The most important issue in Wireless Mesh Networks (WMN) is that the signals that are simultaneously transmitted on the same frequency channel can interfere with each other to become incomprehensible at the receiver end. It is possible to operate the links at different times or at different frequencies, but this also lowers capacity usage. In this paper, we tackle the planning problems of WMN, using 802.16 (Wi-MAX) protocol, such as deploying a given number of gateway nodes along with operational problems such as routing, management of power used by nodes and scheduling while maximizing the minimum service level provided. In order to be able to apply our results to real systems, we work with optimization models based on realistic assumptions such as physical interference and single path routing. We propose heuristic methods to obtain optimal or near optimal solutions in reasonable time. The models are applied to some cities in Istanbul and Ankara provinces.
Open Access
Maximization of correct decision probability via channel switching over Rayleigh fading channels
(IEEE, 2016) Keskin, Musa Furkan; Kurt, Mehmet Necip; Tutay, Mehmet Emin; Gezici, Sinan; Arıkan, Orhan
In this study, optimal channel switching (time sharing) strategies are investigated under average power and cost constraints in order to maximize the average number of correctly received symbols between a transmitter and a receiver that are connected via multiple additive Gaussian noise channels. The optimal strategy is shown to perform channel switching either among at most three channels with full channel utilization (i.e., no idle periods), or between at most two channels with partial channel utilization. In addition, it is stated that the optimal solution must operate at the maximum average power and the maximum average cost, which facilitates low-complexity approaches for calculating the optimal strategy. For two-channel strategies, an upper bound in terms of the noise standard deviations of the employed channels is provided for the ratio between the optimal power levels. Furthermore, a simple condition depending solely on the systems parameters is derived, under which partial channel utilization cannot be optimal. Numerical examples are presented to demonstrate the validity of the theoretical results.
Open Access
Multi-objective contextual bandits with a dominant objective
(IEEE, 2017) Tekin, Cem; Turgay, Eralp
In this paper, we propose a new contextual bandit problem with two objectives, where one of the objectives dominates the other objective. Unlike single-objective bandit problems in which the learner obtains a random scalar reward for each arm it selects, in the proposed problem, the learner obtains a random reward vector, where each component of the reward vector corresponds to one of the objectives. The goal of the learner is to maximize its total reward in the non-dominant objective while ensuring that it maximizes its reward in the dominant objective. In this case, the optimal arm given a context is the one that maximizes the expected reward in the non-dominant objective among all arms that maximize the expected reward in the dominant objective. For this problem, we propose the multi-objective contextual multi-armed bandit algorithm (MOC-MAB), and prove that it achieves sublinear regret with respect to the optimal context dependent policy. Then, we compare the performance of the proposed algorithm with other state-of-the-art bandit algorithms. The proposed contextual bandit model and the algorithm have a wide range of real-world applications that involve multiple and possibly conflicting objectives ranging from wireless communication to medical diagnosis and recommender systems.
Open Access
A new wireless asynchronous data communications module for industrial applications
(2013) Ege, Y.; Şensoy, M.G.; Kalender O.; Nazlibilek, S.; Çitak H.
All the sensors such as temperature, humidity, and pressure used in industry provide analog outputs as inputs for their control units. Wireless transmission of the data has advantages on wired transmission such as USB port, parallel port and serial port and therefore has great importance for industrial applications. In this work, a new wireless asynchronous data communications module has been developed to send the earth magnetic field data around a ferromagnetic material detected by a KMZ51 AMR sensor. The transmitter module transmits the analog data obtained from a source to a computer environment where they are stored and then presented in a graphical form. In this design, an amplitude shift keying (ASK) transceiver working at the frequency of 433.92 MHz which is a frequency inside the so called Industrial Scientific Medical band (ISM band) used for wireless communications. The analog data first fed into a 10-bit ADC controlled by a PIC microcontroller and then the digital data is sent to the transmitter. A preamble bit string is added in front of the data bits and another bit string for achieving synchronization and determination the start of the data is used. The data arriving at the receiver is taken by the microcontroller and sent to a LCD display as well as the serial port of a computer where it is written in a text file. A Visual Basic based graphics interface is designed to receive, store and present the data in the form of graphical shapes. In the paper, all the work has been explained in detail. © 2013 Published by Elsevier Ltd. All rights reserved.
Open Access
Noise enhanced detection in restricted Neyman-Pearson framework
(IEEE, 2012-06) Bayram, S.; Gültekin, San; Gezici, Sinan
Noise enhanced detection is studied for binary composite hypothesis-testing problems in the presence of prior information uncertainty. The restricted Neyman-Pearson (NP) framework is considered, and a formulation is obtained for the optimal additive noise that maximizes the average detection probability under constraints on worst-case detection and false-alarm probabilities. In addition, sufficient conditions are provided to specify when the use of additive noise can or cannot improve performance of a given detector according to the restricted NP criterion. A numerical example is presented to illustrate the improvements obtained via additive noise. © 2012 IEEE.
Open Access
A novel measurement-based approach for modeling and computing interference factors for wireless channels
(SpringerOpen, 2013) Ulucinar, A. R.; Korpeoglu, I.; Karasan, E.
Wireless communication technologies divide their available spectrum into pre-defined channels. Some wireless technologies, such as the IEEE 802.11b/g, define their channels in such a way that adjacent channels share the spectrum. When two distinct channels share some part of their spectrum, simultaneous transmissions on these channels cause what is k own as the adjacent channel interference. For problems that consider adjacent channel interference, such as the channel assignment problem for multi-channel wireless mesh networks, we need a model that quantitatively describes adjacent channel interference. The interference factor is a concept defined to quantify the amount of the overlap, hence the interference, between two wireless channels. Analytical and experimental methods have been proposed in the literature to define the interference factors among channels of a wireless technology. In this article, we propose a physical-layer-measurement-based, technology-independent and generic approach that is capable of determining interference factors between the channels of a wireless technology and also between the channels of two different wireless technologies, such as IEEE 802.11 and IEEE 802.15.4. We also report our measurement results for interference factors among 802.11b DSSS channels and between 802.15.4 and 802.11b channels. Our results show that our approach is practical, accurate and generic enough to compute the interference factors of radio channels belonging to various wireless communication technologies. © 2013 Ulucinar et al.
Open Access
OLSR-aware distributed channel access scheduling for wireless mesh networks
(IEEE, 2009-04) Kas, Miray; Körpeoğlu, İbrahim; Karasan, Ezhan
In this paper, we present OA-TDMA (OLSR-Aware TDMA), a TDMA based cross-layer channel access scheduling scheme which uses the information collected by the OLSR routing protocol. In OA-TDMA, each node makes decisions in a distributed manner with no central control, using the local information disseminated by the OLSR protocol. The distinctive feature of the OA-TDMA protocol lies in its weighting scheme where OA-TDMA approximates the traffic passing through each node by using the local topology information collected by OLSR. Our simulations on ns-2 confirm the significant performance improvement achieved by the combination of OLSR and OATDMA over other scheduling schemes considered in this paper. ©2009 IEEE.
Open Access
On the performance of linear least-squares estimation in wireless positioning systems
(IEEE, 2008-05) Gezici, Sinan; Güvenç, İ.; Sahinoğlu, Z.
A common technique for wireless positioning is to estimate time-of-arrivals (TOAs) of signals traveling between a target node and a number of reference nodes, and then to determine the position of the target node based on those TOA parameters. In determining the position of the target node from TOA parameters, linear or nonlinear least-squares (LS) estimation techniques can be employed. Although the linear LS techniques are suboptimal in general, they facilitate low-complexity position estimation. In this paper, performance of various linear LS techniques are compared, and suboptimality of the linear approach is quantified in terms of the Cramer-Rao lower bound (CRLB). Simulations are performed to compare the performance of the linear LS approaches versus the CRLBs for linear and nonlinear techniques. ©2008 IEEE.
Open Access
Optimal channel switching for average capacity maximization in the presence of switching delays
(IEEE, 2016) Sezer, Ahmet Dündar; Gezici, Sinan
In this study, the optimal channel switching problem is investigated for average capacity maximization in the presence of channel switching delays. First, the optimal strategy is obtained and the corresponding average capacity is derived when channel switching is performed among a given number of channels. Then, it is proved that channel switching among more than two different channels is not optimal. Also, the maximum average capacity achieved by the optimal channel switching strategy is expressed as a function of the channel switching delay parameter and the average and peak power limits. Then, scenarios in which the optimal strategy corresponds to the use of a single channel or to channel switching between two channels are described. Numerical examples are presented for showing the effects of channel switching delays.
Open Access
Optimal jammer placement in wireless localization networks
(IEEE, 2015-06-07) Gezici, Sinan; Bayram, S.; Gholami, M. R.; Jansson, M.
The optimal jammer placement problem is proposed for a wireless localization network, where the aim is to degrade the accuracy of locating target nodes as much as possible. In particular, the optimal location of a jammer node is obtained in order to maximize the minimum of the Cramér-Rao lower bounds for a number of target nodes under location related constraints for the jammer node. Theoretical results are derived to specify scenarios in which the jammer node should be located as close to a certain target node as possible, or the optimal location of the jammer node is determined by two or three of the target nodes. In addition, explicit expressions for the optimal location of the jammer node are derived in the presence of two target nodes. Numerical examples are presented to illustrate the theoretical results. © 2015 IEEE.