Browsing by Subject "Lower bounds"

Now showing 1 - 16 of 16

Open Access
Climbing depth-bounded discrepancy search for solving hybrid flow shop problems
(Inderscience Publishers, 2007) Hmida, A. B.; Huguet, M.-J.; Lopez, P.; Haouari, M.
This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimises the makespan. We present here an adaptation of the Depth-bounded Discrepancy Search (DDS) method to obtain near-optimal solutions with makespan of high quality. This adaptation for the HFS contains no redundancy for the search tree expansion. To improve the solutions of our HFS problem, we propose a local search method, called Climbing Depth-bounded Discrepancy Search (CDDS), which is a hybridisation of two existing discrepancy-based methods: DDS and Climbing Discrepancy Search (CDS). CDDS introduces an intensification process around promising solutions. These methods are tested on benchmark problems. Results show that discrepancy methods give promising results and CDDS method gives the best solutions.
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
Enhancements to threshold based range estimation for ultra-wideband systems
(IEEE, 2014-09) Soğancı, Hamza; Gezici, Sinan; Güldoğan, M. B.
Ultra-wideband (UWB) signals have very high time resolution, which makes them a very good candidate for range estimation based wireless positioning. Although the accuracy is the major concern for range estimation, it is also important to have low-complexity algorithms that can be employed in real time. In this study, two low-complexity range estimation algorithms are proposed for UWB signals, which achieve improved performance compared to the state-of-the-art low-complexity ranging algorithms. The proposed algorithms are inspired from two well-known algorithms; 'serial backward search' (SBS) and 'jump back and search forward' (JBSF). Performances of the proposed algorithms are compared with those of the SBS and JBSF algorithms based on real measurements. In addition, theoretical bounds are calculated in order to quantify the statistical performance of the algorithms. © 2014 IEEE.
Open Access
Fundamental limits and improved algorithms for linear least-squares wireless position estimation
(John Wiley & Sons, 2010-09-22) Guvenc, I.; Gezici, Sinan; Sahinoglu Z.
In this paper, theoretical lower bounds on performance of linear least-squares (LLS) position estimators are obtained, and performance differences between LLS and nonlinear least-squares (NLS) position estimators are quantified. In addition, two techniques are proposed in order to improve the performance of the LLS approach. First, a reference selection algorithm is proposed to optimally select the measurement that is used for linearizing the other measurements in an LLS estimator. Then, a maximum likelihood approach is proposed, which takes correlations between different measurements into account in order to reduce average position estimation errors. Simulations are performed to evaluate the theoretical limits and to compare performance of various LLS estimators.
Open Access
Improved position estimation using hybrid TW-TOA and TDOA in cooperative networks
(Institute of Electrical and Electronics Engineers, 2012-04-13) Gholami, M. R.; Gezici, Sinan; Ström, E. G.
This paper addresses the problem of positioning multiple target nodes in a cooperative wireless sensor network in the presence of unknown turn-around times. In this type of cooperative networks, two different reference sensors, namely, primary and secondary nodes, measure two-way time-of-arrival (TW-TOA) and time-difference-of-arrival (TDOA), respectively. Motivated by the role of secondary nodes, we extend the role of target nodes such that they can be considered as pseudo secondary nodes. By modeling turn-around times as nuisance parameters, we derive a maximum likelihood estimator (MLE) that poses a difficult global optimization problem due to its nonconvex objective function. To avoid drawbacks in solving the MLE, we linearize the measurements using two different techniques, namely, nonlinear processing and first-order Taylor series, and obtain linear models based on unknown parameters. The proposed linear estimator is implemented in three steps. In the first step, a coarse position estimate is obtained for each target node, and it is refined through steps two and three. To evaluate the performance of different methods, we derive the Cramér-Rao lower bound (CRLB). Simulation results show that the cooperation technique provides considerable improvements in positioning accuracy compared to the noncooperative scenario, especially for low signal-to-noise-ratios.
Open Access
Minimum maximum-degree publish-subscribe overlay network design
(IEEE, 2011) Onus, Melih; Richa, A.W.
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to keep the degree of the nodes in the publish/subscribe system low. It is only natural then to formalize the following problem: Given a collection of nodes and their topic subscriptions, connect the nodes into a graph that has least possible maximum degree in such a way that for each topic t, the graph induced by the nodes interested in t is connected. We present the first polynomial-time logarithmic approximation algorithm for this problem and prove an almost tight lower bound on the approximation ratio. Our experimental results show that our algorithm drastically improves the maximum degree of publish/subscribe overlay systems. We also propose a variation of the problem by enforcing that each topic-connected overlay network be of constant diameter while keeping the average degree low. We present three heuristics for this problem that guarantee that each topic-connected overlay network will be of diameter 2 and that aim at keeping the overall average node degree low. Our experimental results validate our algorithms, showing that our algorithms are able to achieve very low diameter without increasing the average degree by much. © 2011 IEEE.
Open Access
On erasure correction coding for streaming
(IEEE, 2012) Tekin, Ömer Faruk; Ho, T.; Yao, H.; Jaggi, S.
We consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In our previous work [1], we gave a capacity-achieving code construction for the case of a fixed number of erasures. In this work, we consider a sliding window erasure pattern where the number of erasures within windows of size above some threshold is upper bounded by a fraction of the window size, modeling a constraint on burstiness of the channel. We lower bound the rates achievable by our previous code construction as a fraction of the capacity region, which approaches to one as the window size threshold and the initial playout delay increase simultaneously.
Open Access
Online bicriteria load balancing using object reallocation
(Institute of Electrical and Electronics Engineers, 2009-03) Tse, S. S. H.
We study the bicriteria load balancing problem on two independent parameters under the allowance of object reallocation. The scenario is a system of $M$ distributed file servers located in a cluster, and we propose three online approximate algorithms for balancing their loads and required storage spaces during document placement. The first algorithm is for heterogeneous servers. Each server has its individual tradeoff of load and storage space under the same rule of selection. The other two algorithms are for homogeneous servers. The second algorithm combines the idea of the first one and the best existing solution for homogeneous servers. Using document reallocation, we obtain a smooth tradeoff curve of the upper bounds of load and storage space. The last one bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively; and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities of these three algorithms are O(\log M) plus the cost of document reallocation. © 2009 IEEE.
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.
Open Access
Optimal jamming of wireless localization systems
(IEEE, 2015-06) Gezici, Sinan; Gholami, M.R.; Bayram, S.; Jansson, M.
In this study, optimal jamming of wireless localization systems is investigated. Two optimal power allocation schemes are proposed for jammer nodes in the presence of total and peak power constraints. In the first scheme, power is allocated to jammer nodes in order to maximize the average Cramér-Rao lower bound (CRLB) of target nodes whereas in the second scheme the power allocation is performed for the aim of maximizing the minimum CRLB of target nodes. Both schemes are formulated as linear programs, and a closed-form expression is obtained for the first scheme. Also, the full total power utilization property is specified for the second scheme. Simulation results are presented to investigate performance of the proposed schemes. © 2015 IEEE.
Open Access
Positioning algorithms for cooperative networks in the presence of an unknown turn-around time
(IEEE, 2011) Gholami, M.R.; Gezici, Sinan; Ström, E.G.; Rydström, M.
This paper addresses the problem of single node positioning in cooperative network using hybrid two-way time-of-arrival and time-difference-of-arrival where, the turn-around time at the target node is unknown. Considering the turn-around time as a nuisance parameter, the derived maximum likelihood estimator (MLE) brings a difficult global optimization problem due to local minima in the cost function of the MLE. To avoid drawbacks in solving the MLE, we obtain a linear two-step estimator using non-linear pre-processing which is algebraic and closed-form in each step. To compare different methods, Cramér-Rao lower bound (CRLB) is derived. Simulation results confirm that the proposed linear estimator attains the CRLB for sufficiently high signal-to-noise ratios. © 2011 IEEE.
Open Access
Stability analysis of switched systems using Lyapunov-Krasovskii functionals
(Elsevier, 2011) Çalişkan, S.Y.; Özbay, Hitay; Niculescu, S.-I.
Piecewise Lyapunov-Razumikhin functions are previously used for obtaining a lower bound for the dwell time of the switched time delay systems under the assumption that each candidate system is delay dependently stable. In this work, using Lyapunov-Krasovskii functionals, a less conservative lower bound for the dwell time is obtained. Improvement in the dwell time is illustrated with an example. © 2011 IFAC.
Open Access
Theoretical limits and a practical estimator for joint estimation of respiration and heartbeat rates using UWB impulse radio
(IEEE, 2007) Gezici, Sinan; Arıkan, Orhan
In this paper, Cramer-Rao lower bounds are derived fo r joint estimation of respiration and heartbeat rates via impulse radio ultra-wideband signals. Generic models are employed for displacement functions due to respiration and heartbeat, and the bounds are obtained for the cases of known and unknown channel coefficients. In addition, a two-step suboptimal estimator is proposed, which is based on joint time-delay estimation followed by a least-squares approach. It is shown that the proposed estimator is asymptotically optimal under mild conditions. Simulation studies are performed to evaluate the lower bounds and performance of the proposed estimator for realistic system parameters.
Open Access
Tight bounds for the identical parallel machine-schedulingproblem: part II
(Wiley-Blackwell Publishing, 2008) Haouari, M.; Jemmali, M.
A companion paper introduces new lower bounds and heuristics for the problem of minimizing makespan onidentical parallel machines. The objective of this paper is threefold. First, we describe further enhancementsof previously described lower bounds. Second, we propose a new heuristic that requires solving a sequence of0–1 knapsack problems. Finally, we show that embedding these newly derived bounds in a branch-and-boundprocedure yields a very effective exact algorithm. Moreover, this algorithm features a new symmetry-breakingbranching strategy. We present the results of computational experiments that were carried out on a large setof instances and that attest to the efficacy of the proposed algorithm. In particular, we report proven optimalsolutions for some benchmark problems that have been open for some time
Open Access
Ultra-wideband range estimation: Theoretical limits and practical algorithms
(IEEE, 2008-09) Güvenç, İ.; Gezici, Sinan; Şahinoğlu, Z.
The high time resolution of ultra-wideband (UWB) signals enables wireless devices to perform accurate range estimation. In order to realize UWB systems with accurate ranging capabilities, both theoretical limits on range estimation and practical algorithms that approach those limits should be investigated. This paper provides a survey of various UWB ranging algorithms and discusses their performance and complexity tradeoffs. In addition, theoretical limits on range estimation are discussed in terms of Cramer-Rao and Ziv-Zakai lower bounds. Index Terms- Ultra-wideband (UWB), time-of-arrival (TOA) estimation, ranging, Cramer-Rao lower bound (CRLB), Ziv-Zakai lower bound (ZZLB). ©2008 IEEE.
Open Access
An upper bound on the capacity of non-binary deletion channels
(IEEE, 2013) Rahmati, M.; Duman, Tolga M.
We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such studies for the non-binary case are largely missing. The state of the art is the following: as a trivial upper bound, capacity of an erasure channel with the same input alphabet as the deletion channel can be used, and as a lower bound the results by Diggavi and Grossglauser in [1] are available. In this paper, we derive the first non-trivial non-binary deletion channel capacity upper bound and reduce the gap with the existing achievable rates. To derive the results we first prove an inequality between the capacity of a 2K-ary deletion channel with deletion probability d, denoted by C2K(d), and the capacity of the binary deletion channel with the same deletion probability, C2(d), that is, C2K(d) ≤ C2(d)+(1-d) log(K). Then by employing some existing upper bounds on the capacity of the binary deletion channel, we obtain upper bounds on the capacity of the 2K-ary deletion channel. We illustrate via examples the use of the new bounds and discuss their asymptotic behavior as d → 0. © 2013 IEEE.