6 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 6 / 6
Yayın Force-directed approaches to sensor localization(SIAM, 2006) Efrat, Alon; Forrester, David; Iyer, Anand; Kobourov, Stephen G.; Erten, CesimWe consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor's neighbors. We experimented with classic and new force-directed techniques. The classic techniques work well for small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with noisy data. We describe a new force-directed technique, based on a multi-scale dead-reckoning, that scales well for large networks, is resilient under range errors, and can reconstruct complex underlying regions.Yayın A robust localization framework to handle noisy measurements in wireless sensor networks(IEEE, 2009-09-14) Erten, Cesim; Karataş, ÖmerWe construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to achieve localization. However the measurements of these devices may contain noise both as hardware noise and as environmental noise due to the employment conditions of the network. It Is necessary to provide a general framework that handles such a noise in data and yet still be applicable within several localization algorithms. In order to handle noise in distance measurements, our framework utilizes convex constraints and confidence intervals of a random variable. At the end of the localization process nodes are assigned to a set of feasible regions with corresponding probabilities. The accuracy of the localization can be adjusted and the framework can easily be embedded to work within previously suggested localization algorithms.Yayın Improving age of information in random access channels(Institute of Electrical and Electronics Engineers Inc., 2020-07) Atabay, Doğa Can; Uysal, Elif; Kaya, OnurWe study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario where multiple transmissions result in collision, we propose a threshold-based lazy version of Slotted ALOHA and derive the time average AoI achieved by this policy. We demonstrate that the average AoI performance of the lazy policy is significantly better than Slotted ALOHA, and close to the ideal round robin benchmark.Yayın Energy load balancing for fixed clustering in wireless sensor networks(IEEE, 2012-05-07) Ali, Syed Amjad; Sevgi, CüneytClustering can be used as an effective technique to achieve both energy load balancing and an extended lifetime for a wireless sensor network (WSN). This paper presents a novel approach that first creates energy balanced fixed/static clusters, and then, to attain energy load balancing within each fixed cluster, rotates the role of cluster head through uniformly quantized energy levels based approach to prolong the overall network lifetime. The method provided herein, not only provides near-dynamic clustering performance but also reduces the complexity due to the fact that cluster formation phase is implemented once. The presented simulation results clearly show the efficacy of this proposed algorithm and thus, it can be used as a practical approach to obtain maximized network lifetime for energy balanced clusters in fixed clustering environments.Yayın When to pull data for minimum age penalty(IEEE, 2021-10-18) Yavaşcan, Orhan Tahir; Ceran, Elif Tuğçe; Cakir, Zeynep; Uysal, Elif; Kaya, OnurA communication receiver that wants to pull data from a remote sensor by exploiting wireless energy transfer is considered. The receiver has a long-term average energy budget for this operation, and its goal is to keep the time average of a general age penalty function as small as possible. The channel from the source to the receiver is a two-state (ON/OFF) communication link whose state is IID or Markovian, and known instantaneously by the receiver. Modeling the problem as a constrained Markov decision problem, we obtain a randomized threshold-based decision policy that achieves the minimum possible average age penalty. We determine the optimal time average Age of Information and age violation probabilities by exploiting the optimality of the derived policy.Yayın Resource allocation in the finite blocklength regime under PAoI and delay violation constraints(IEEE, 2023-08-27) Kartal, Özkan Tuğberk; Kaya, Onur; Uysal, ElifURLLC (Ultra-reliable low-latency communication) is one of the more challenging modes for 5G for resource allocation (RA). Most of the previous studies for RA for wireless access in URLLC assumed known packet arrival processes, and focused on maximizing average rates or throughput. The objective of this paper is to present a formulation of allocating resource blocks, modulation and coding rates to multiple short packet machine-type information flows to provide information age and delay violation guarantees. The scenario is motivated by the scheduling of URLLC flows among users served by a common 5G base station. The problem involves the selections of frequency allocation policy and modulation and coding scheme (MCS) under estimated CSI. Moreover, the sensitivity of the information packet size on the choice of modulation and coding parameters as well as the number of resource blocks and the choice of the number of pilot symbols is demonstrated. The results of this formulation are compared with resource allocation algorithms in the literature.
