13 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 13
Yayın The sectoral sweeper scheme for wireless sensor networks: Adaptive antenna array based sensor node management and location estimation(Kluwer Academic Publishers-Plenum Publishers, 2006-12) Erdoğan, Ayhan; Coşkun, Vedat; Kavak, AdnanWe introduce a novel sensor node management and location estimation method referred as sectoral sweeper (SS) scheme that uses an adaptive antenna array (AAA) at a central node in wireless sensor networks (WSNs). With the SS scheme, the central node can activate or deactivate the nodes in a desired region which is specified by beam direction and beam width of the transmit beam and also by minimum and maximum thresholds (R (min) and R (max)) for the received signal strength indicator (RSSI) of signals received by the nodes. In order to perform a specified task that is associated with a Task_id, two different beams are transmitted, which are task region beam and routing region beam to switch the nodes into active or routing modes. Since our scheme does not require any additional software or hardware for node management and location estimation in sensor nodes, the deficiencies of tiny sensors are effectively eliminated. The proposed scheme is shown to reduce the number of sensing nodes and the amount of data traffic in the network, thus leading to considerable savings in energy consumption and prolonged sensor lifetime.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 Design and implementation of a smart beehive and its monitoring system using microservices in the context of IoT and open data(Elsevier B.V., 2022-05) Aydın, Şahin; Aydın, Mehmet NafizIt is essential to keep honey bees healthy for providing a sustainable ecological balance. One way of keeping honey bees healthy is to be able to monitor and control the general conditions in a beehive and also outside of a beehive. Monitoring systems offer an effective way of accessing, visualizing, sharing, and managing data that is gathered from performed agricultural and livestock activities for domain stakeholders. Such systems have recently been implemented based on wireless sensor networks (WSN) and IoT to monitor the activities of honey bees in beehives as well. Scholars have shown considerable interests in proposing IoT- and WSN-based beehive monitoring systems, but much of the research up to now lacks in proposing appropriate architecture for open data driven beehive monitoring systems. Developing a robust monitoring system based on a contemporary software architecture such as microservices can be of great help to be able to control the activities of honey bees and more importantly to be able to keep them healthy in beehives. This research sets out to design and implementation of a sustainable WSN-based beehive monitoring platform using a microservice architecture. We pointed out that by adopting microservices one can deal with long-standing problems with heterogeneity, interoperability, scalability, agility, reliability, maintainability issues, and in turn achieve sustainable WSN-based beehive monitoring systems.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 On the analysis of expected distance between sensor nodes and the base station in randomly deployed WSNs(Springer Verlag, 2014) Sevgi, Cüneyt; Ali, Syed AmjadIn this study, we focus on the analytical derivation of the expected distance between all sensor nodes and the base station (i.e., E[dtoBS]) in a randomly deployed WSN. Although similar derivations appear in the related literature, to the best of our knowledge, our derivation, which assumes a particular scenario, has not been formulated before. In this specific scenario, the sensing field is a square-shaped region and the base station is located at some arbitrary distance to one of the edges of the square. Having the knowledge of E[dtoBS] value is important because E[dtoBS] provides a network designer with the opportunity to make a decision on whether it is energy-efficient to perform clustering for WSN applications that aim to pursue the clustered architectures. Similarly, a network designer might make use of this expected value during the process of deciding on the modes of communications (i.e., multi-hop or direct communication) after comparing it with the maximum transmission ranges of devices. Last but not least, the use of our derivation is not limited to WSN domain. It can be also exploited in any domain when there is a need for a probabilistic approach to find the average distance between any given number of points which are all assumed to be randomly and uniformly located in any square-shaped region and at a specific point outside this region.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 Quarantine region scheme to mitigate spam attacks in wireless sensor networks(IEEE, 2006-08) Coşkun, Vedat; Çayırcı, Erdal; Levi, Albert; Sancak, SerdarThe Quarantine Region Scheme (QRS) is introduced to defend against spam attacks in wireless sensor networks where malicious antinodes frequently generate dummy spam messages to be relayed toward the sink. The aim of the attacker is the exhaustion of the sensor node batteries and the extra delay caused by processing the spam messages. Network-wide message authentication may solve this problem with a cost of cryptographic operations to be performed over all messages. QRS is designed to reduce this cost by applying authentication only whenever and wherever necessary. In QRS, the nodes that detect a nearby spam attack assume themselves to be in a quarantine region. This detection is performed by intermittent authentication checks. Once quarantined, a node continuously applies authentication measures until the spam attack ceases. In the QRS scheme, there is a trade-off between the resilience against spam attacks and the number of authentications. Our experiments show that, in the worst-case scenario that we considered, a not quarantined node catches 80 percent of the spam messages by authenticating only 50 percent of all messages that it processes.Yayın Distribution games: a new class of games with application to user provided networks(Institute of Electrical and Electronics Engineers Inc., 2022-11-29) Taşçı, Sinan Emre; Shalom, Mordechai; Korçak, ÖmerUser Provided Network (UPN) is a promising solution for sharing the limited network resources by utilizing user capabilities as a part of the communication infrastructure. In UPNs, it is an important problem to decide how to share the resources among multiple clients in decentralized manner. Motivated by this problem, we introduce a new class of games termed distribution games that can be used to distribute efficiently and fairly the bandwidth capacity among users. We show that every distribution game has at least one pure strategy Nash equilibrium (NE) and any best response dynamics always converges to such an equilibrium. We consider social welfare functions that are weighted sums of bandwidths allocated to clients. We present tight upper bounds for the price of anarchy and price of stability of these games provided that they satisfy some reasonable assumptions. We define two specific practical instances of distribution games that fit these assumptions. We conduct experiments on one of these instances and demonstrate that in most of the settings the social welfare obtained by the best response dynamics is very close to the optimum. Simulations show that this game also leads to a fair distribution of the bandwidth.
