Browsing by Subject "Topology"

Now showing 1 - 20 of 27

Open Access
An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks
(Elsevier BV, 2016) Deniz, F.; Bagci, H.; Korpeoglu, I.; Yazıcı A.
This paper introduces an adaptive, energy-aware and distributed fault-tolerant topology-control algorithm, namely the Adaptive Disjoint Path Vector (ADPV) algorithm, for heterogeneous wireless sensor networks. In this heterogeneous model, we have resource-rich supernodes as well as ordinary sensor nodes that are supposed to be connected to the supernodes. Unlike the static alternative Disjoint Path Vector (DPV) algorithm, the focus of ADPV is to secure supernode connectivity in the presence of node failures, and ADPV achieves this goal by dynamically adjusting the sensor nodes' transmission powers. The ADPV algorithm involves two phases: a single initialization phase, which occurs at the beginning, and restoration phases, which are invoked each time the network's supernode connectivity is broken. Restoration phases utilize alternative routes that are computed at the initialization phase by the help of a novel optimization based on the well-known set-packing problem. Through extensive simulations, we demonstrate that ADPV is superior in preserving supernode connectivity. In particular, ADPV achieves this goal up to a failure of 95% of the sensor nodes; while the performance of DPV is limited to 5%. In turn, by our adaptive algorithm, we obtain a two-fold increase in supernode-connected lifetimes compared to DPV algorithm.
Open Access
Algorithms for sink mobility in wireless sensor networks to improve network lifetime
(2008) Koç, Metin
A wireless sensor network (WSN) consists of hundreds or thousands of sensor nodes organized in an ad-hoc manner to achieve a predefined goal. Although WSNs have limitations in terms of memory and processor, the main constraint that makes WSNs different from traditional networks is the battery problem. Since sensor nodes are generally deployed to areas with harsh environmental conditions, replacing the exhausted batteries become practically impossible. This requires to use the energy very carefully in both node and network level. Different approaches are proposed in the literature for improving network lifetime, including data aggregation, energy efficient routing schemes and MAC protocols, etc. Main motivation for these approaches is to prolong the network lifetime without sacrificing service quality. Sink (data collection node) mobility is also one of the effective solutions in the literature for network lifetime improvement. In this thesis, we focus on the controlled sink mobility and present a set of algorithms for different parts of the problem, like sink sites determination, and movement decision parameters. Moreover, a load balanced topology construction algorithm is given as another component of network lifetime improvement. Experiment results are presented which compare the performance of different components of the mobility scheme with other approaches in the literature, and the whole sink mobility scheme with random movement and static sink cases. As a result, it is observed that our algorithms perform better than random movement and static cases for different scenarios.
Open Access
Available bit rate traffic engineering in MPLS networks with flow-based multipath routing
(Institute of Electronics Information and Communication Engineers, 2004) Akar, N.; Hökelek, İ.; Karasan, E.
In this paper, we propose a novel traffic engineering architecture for IP networks with MPLS backbones. In this architecture, two link-disjoint label switched paths, namely the primary and secondary paths, are established among every pair of IP routers located at the edges of an MPLS backbone network. As the main building block of this architecture, we propose that primary paths are given higher priority against the secondary paths in the MPLS data plane to cope with the so-called knock-on effect. Inspired by the ABR flow control mechanism in ATM networks, we propose to split traffic between a source-destination pair between the primary and secondary paths using explicit rate feedback from the network. Taking into consideration the performance deteriorating impact of packet reordering in packet-based load balancing schemes, we propose a traffic splitting mechanism that operates on a per-flow basis (i.e., flow-based multipath routing). We show via an extensive simulation study that using flow-based multipath traffic engineering with explicit rate feedback not only provides consistently better throughput than that of a single path but is also void of out-of-order packet delivery.
Open Access
Breathing detection based on the topological features of IR sensor and accelerometer signals
(IEEE, 2017) Erden, Fatih; Çetin, A. Enis
This paper describes a non-contact breathing detection system using a pyro-electric infrared (PIR) sensor and an accelerometer. The multi-sensor system can be used to detect the respiratory disorders. A PIR sensor is placed onto a stand near a bed and an accelerometer is placed on the mattress. We recently developed a PIR sensor which is capable of producing 1-D time-varying signals corresponding to the motions in its field of view. The PIR sensor signal due to the thoracic movements turns out to be an almost periodic signal. Similarly, the accelerometer produces an almost periodic signal in response to vibrations in bed. Sensor signals are processed using a topological approach. Point clouds are constructed from the delay-coordinate embedding of the time series sensor data first. Then, periodic structures in the point clouds are detected using persistent homology. The sensors, with the proposed method, complement each other to produce more accurate decisions in different lying positions.
Open Access
Consensus as a Nash equilibrium of a dynamic game
(IEEE, 2016) Niazi, Muhammad Umar B.; Özgüler, Arif Bülent; Yıldız, Aykut
Consensus formation in a social network is modeled by a dynamic game of a prescribed duration played by members of the network. Each member independently minimizes a cost function that represents his/her motive. An integral cost function penalizes a member's differences of opinion from the others as well as from his/her own initial opinion, weighted by influence and stubbornness parameters. Each member uses its rate of change of opinion as a control input. This defines a dynamic non-cooperative game that turns out to have a unique Nash equilibrium. Analytic explicit expressions are derived for the opinion trajectory of each member for two representative cases obtained by suitable assumptions on the graph topology of the network. These trajectories are then examined under different assumptions on the relative sizes of the influence and stubbornness parameters that appear in the cost functions.
Open Access
Direct volume rendering of unstructured grids
(Pergamon Press, 2003) Berk, Hakan; Aykanat, Cevdet; Güdükbay, Uğur
This paper investigates three categories of algorithms for direct volume rendering of unstructured grids, which are image-space, object-space, and hybrid methods. We propose three new algorithms. Cell Projection algorithm, which falls into object-space category, is capable of rendering non-convex meshes through a simple yet efficient sorting schema that exploits both image and object space coherencies. Existing hybrid methods use object-then-image traversal order that enforces the processing of each cell. Thus, these algorithms perform redundant operations and do not support early ray termination. We propose a hybrid method, called Span-Buffer Ray Casting (SBRC), that can support early ray termination discarding redundant operations by employing image-then-object traversal order. Another hybrid method, called Koyamada-SBRC (K-SBRC), is proposed with the motivation of refining image-space and hybrid methods to extract the best features of them. This method is developed by blending SBRC approach with Koyamada's algorithm, which is an efficient image-space algorithm. All proposed algorithms are capable of handling acyclic non-convex meshes and generating images of acceptable quality. SBRC and K-SBRC algorithms have the additional capabilities of rendering cyclic meshes and supporting early ray termination. The proposed algorithms and Koyamada's algorithm are implemented and experimented in a common framework for analyzing their relative performance. © 2003 Elsevier Science Ltd. All rights reserved.
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
An efficient virtual topology design and traffic engineering scheme for IP/WDM networks
(Springer, 2007) Şengezer, Namık; Karasan, Ezhan
We propose an online traffic engineering (TE) scheme for efficient routing of bandwidth guaranteed connections on a Multiprotocol label switching (MPLS)/wavelength division multiplexing (WDM) network with a traffic pattern varying with the time of day. We first consider the problem of designing the WDM virtual topology utilizing multi-hour statistical traffic pattern. After presenting an effective solution to this offline problem, we introduce a Dynamic tRaffic Engineering AlgorithM (DREAM) that makes use of the bandwidth update and rerouting of the label switched paths (LSPs). The performance of DREAM is compared with commonly used online TE schemes and it is shown to be superior in terms of blocked traffic ratio.
Open Access
Evolution of the Hofstadter butterfly in a tunable optical lattice
(American Physical Society, 2015) Yllmaz, F.; Ünal, F. N.; Oktel, M. O.
Recent advances in realizing artificial gauge fields on optical lattices promise experimental detection of topologically nontrivial energy spectra. Self-similar fractal energy structures generally known as Hofstadter butterflies depend sensitively on the geometry of the underlying lattice, as well as the applied magnetic field. The recent demonstration of an adjustable lattice geometry [L. Tarruell, D. Greif, T. Uehlinger, G. Jotzu, and T. Esslinger, Nature (London) 483, 302 (2012)NATUAS0028-083610.1038/nature10871] presents a unique opportunity to study this dependence. In this paper, we calculate the Hofstadter butterflies that can be obtained in such an adjustable lattice and find three qualitatively different regimes. We show that the existence of Dirac points at zero magnetic field does not imply the topological equivalence of spectra at finite field. As the real-space structure evolves from the checkerboard lattice to the honeycomb lattice, two square-lattice Hofstadter butterflies merge to form a honeycomb lattice butterfly. This merging is topologically nontrivial, as it is accomplished by sequential closings of gaps. Ensuing Chern number transfer between the bands can be probed with the adjustable lattice experiments. We also calculate the Chern numbers of the gaps for qualitatively different spectra and discuss the evolution of topological properties with underlying lattice geometry.
Open Access
Fault-tolerant irregular topology design method for network-on-chips
(IEEE, 2014) Tosun, S.; Ajabshir V.B.; Mercanoglu O.; Öztürk, Özcan
As the technology sizes of integrated circuits (ICs) scale down rapidly, current transistor densities on chips dramatically increase. While nanometer feature sizes allow denser chip designs in each technology generation, fabricated ICs become more susceptible to wear-outs, causing operation failure. Even a single link failure within an on-chip fabric can halt communication between application blocks, which makes the entire chip useless. In this study, we aim to make faulty chips designed with Network-on-Chip (NoC) communication usable. Specifically, we present a fault-tolerant irregular topology generation method for application specific NoC designs. Designed NoC topology allows a different routing path if there is a link failure on the default routing. We compare fault-tolerant topologies with regular fault-tolerant ring topologies, and non-fault-tolerant application specific irregular topologies on energy consumption, performance, and area using multimedia benchmarks and custom-generated graphs. © 2014 IEEE.
Open Access
Fault-tolerant topology generation method for application-specific network-on-chips
(Institute of Electrical and Electronics Engineers, 2015) Tosun, S.; Ajabshir, V. B.; Mercanoglu, O.; Ozturk, O.
As the technology sizes of integrated circuits (ICs) scale down rapidly, current transistor densities on chips dramatically increase. While nanometer feature sizes allow denser chip designs in each technology generation, fabricated ICs become more susceptible to wear-outs, causing operation failure. Even a single link failure within an on-chip fabric can halt communication between application blocks, which makes the entire chip useless. In this paper, we aim to make faulty chips designed with network-on-chip (NoC) communication usable. Specifically, we present fault-tolerant irregular topology-generation method for application-specific NoC designs. Designed NoC topology allows different routing path if there is a link failure on the default routing path. Additionally, we present a simulated annealing-based application mapping algorithm aiming to minimize total energy consumption of the NoC design. We compare fault-tolerant topologies with nonfault-tolerant application-specific irregular topologies on energy consumption, performance, and area using multimedia benchmarks and custom-generated graphs. Our results demonstrate that our method is able to determine fault-tolerant topologies with negligible area increase and better energy values.
Open Access
Graph aware caching policy for distributed graph stores
(IEEE, 2015-03) Aksu, Hidayet; Canım, M.; Chang, Y.-C.; Körpeoğlu, İbrahim; Ulusoy, Özgür
Graph stores are becoming increasingly popular among NOSQL applications seeking flexibility and heterogeneity in managing linked data. Conceptually and in practice, applications ranging from social networks, knowledge representations to Internet of things benefit from graph data stores built on a combination of relational and non-relational technologies aimed at desired performance characteristics. The most common data access pattern in querying graph stores is to traverse from a node to its neighboring nodes. This paper studies the impact of such traversal pattern to common data caching policies in a partitioned data environment where a big graph is distributed across servers in a cluster. We propose and evaluate a new graph aware caching policy designed to keep and evict nodes, edges and their metadata optimized for query traversal pattern. The algorithm distinguishes the topology of the graph as well as the latency of access to the graph nodes and neighbors. We implemented graph aware caching on a distributed data store Apache HBase in the Hadoop family. Performance evaluations showed up to 15x speedup on the benchmark datasets preferring our new graph aware policy over non-aware policies. We also show how to improve the performance of existing caching algorithms for distributed graphs by exploiting the topology information. © 2015 IEEE.
Open Access
Land art on the border between topology and atopology
(2009) Gerekli, Gökçe
The purpose of this study is to discuss the Land Art movement from a topological and atopological perspective. In order to establish an extensive understanding of the matters of topology and atopology, Arkady Plotnitsky’s formalization of quasimathematical thinking, which is derived from Jacques Derrida’s philosophy, is treated in detail. The artistic stance, Robert Smithson, as a major figure of Land Art movement is analyzed both from the artistic and the theoretical perspectives. Thereafter, an algebraic reading of the Smithsonian conceptualization is executed in order to illuminate the liaison between the Land Art movement and the matters of topology and atopology. Finally, the thesis project, Nonlocalizable Displaced Mirrors depicts the whole attitude, which is taken throughout the study, towards the issue of Land Art on the Border between Topology and Atopology.
Open Access
MaterialVis: material visualization tool using direct volume and surface rendering techniques
(Elsevier Inc., 2014) Okuyan, E.; Güdükbay, Uğur; Bulutay, C.; Heinig, Karl-Heinz
Visualization of the materials is an indispensable part of their structural analysis. We developed a visualization tool for amorphous as well as crystalline structures, called MaterialVis. Unlike the existing tools, MaterialVis represents material structures as a volume and a surface manifold, in addition to plain atomic coordinates. Both amorphous and crystalline structures exhibit topological features as well as various defects. MaterialVis provides a wide range of functionality to visualize such topological structures and crystal defects interactively. Direct volume rendering techniques are used to visualize the volumetric features of materials, such as crystal defects, which are responsible for the distinct fingerprints of a specific sample. In addition, the tool provides surface visualization to extract hidden topological features within the material. Together with the rich set of parameters and options to control the visualization, MaterialVis allows users to visualize various aspects of materials very efficiently as generated by modern analytical techniques such as the Atom Probe Tomography.
Open Access
Mental pictures structural constraints Kenneth N. Waltz’s approach to theory
(SAGE Publications, 2023-08-18) Güner, Serdar
The aim of this article is to develop Kenneth N. Waltz’s conceptualization of system structures based on the distribution of capabilities to those described by two traits at system-level: the distribution of capabilities across states and states’ geographic positions with respect to each other, that is, the contiguity configuration. The development generates taxonomies of structures evaluated as mental pictures that guide, organize, and channel thoughts by identifying the ways system structures constrain international interactions. Mental pictures are argued to derive from a multiplicity of interrelated neurophysiological processes of the brain according to functionalism which is a monist doctrine of the philosophy of mind. Mental pictures establish structural constraints as products of an algorithm based on realism and system theory depicting a neo-Kantian view of how our minds impose order on sensory data.
Open Access
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
(Elsevier, 2010) Akgün, İbrahim
Given an undirected network with positive edge costs and a natural number p, the hop-constrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path starting from a specified root node has no more than p hops (edges). In this paper, the new models based on the Miller-Tucker-Zemlin (MTZ) subtour elimination constraints are developed and computational results together with comparisons against MTZ-based, flow-based, and hop-indexed formulations are reported. The first model is obtained by adapting the MTZ-based Asymmetric Traveling Salesman Problem formulation of Sherali and Driscoll [18] and the other two models are obtained by combining topology-enforcing and MTZ-related constraints offered by Akgün and Tansel (submitted for publication) [20] for HMST with the first model appropriately. Computational studies show that the best LP bounds of the MTZ-based models in the literature are improved by the proposed models. The best solution times of the MTZ-based models are not improved for optimally solved instances. However, the results for the harder, large-size instances imply that the proposed models are likely to produce better solution times. The proposed models do not dominate the flow-based and hop-indexed formulations with respect to LP bounds. However, good feasible solutions can be obtained in a reasonable amount of time for problems for which even the LP relaxations of the flow-based and hop-indexed formulations can be solved in about 2 days. © 2010 Elsevier Ltd. All rights reserved.
Open Access
Nonequilibrium fractional Hall response after a topological quench
(American Physical Society, 2016) Ünal, F. N.; Mueller, E. J.; Oktel, M. O.
We theoretically study the Hall response of a lattice system following a quench where the topology of a filled band is suddenly changed. In the limit where the physics is dominated by a single Dirac cone, we find that the change in the Hall conductivity is two-thirds of the quantum of conductivity. We explore this universal behavior in the Haldane model and discuss cold-atom experiments for its observation. Beyond the linear response, the Hall effect crosses over from fractional to integer values. We investigate finite-size effects and the role of harmonic confinement.
Open Access
On the Delay Margin for Consensus in Directed Networks of Anticipatory Agents
(Elsevier B.V., 2016) Irofti D.; Atay, F. M.
We consider a linear consensus problem involving a time delay that arises from predicting the future states of agents based on their past history. In case the agents are coupled in a connected and undirected network, the exact condition for consensus is that the delay be less than a constant threshold that is independent of the network topology or size. In directed networks, however, the situation is quite different. We show that the allowable maximum delay for consensus depends on the network topology in a nontrivial way. We study this delay margin in several network constellations, including various circulant networks with directed links. We show that the delay margin depends not only on the number of neighbors, but also on the directionality of connections with those neighbors. Furthermore, the delay margin improves as the circulant networks are rewired en route to a small-world configuration. © 2016
Open Access
PSAR: Power-source-aware routing in ZigBee networks
(2012) Tekkalmaz, M.; Korpeoglu I.
ZigBee is a recent wireless networking technology built on IEEE 802.15.4 standard and designed especially for low-data rate and low-duty cycle applications such as home and building automation and sensor networks. One of the primary goals of ZigBee is low power consumption and therefore long-living networks. Despite this goal, current network formation and routing protocols described in the ZigBee specification do not fully address power consumption issues. In this work, we propose a distributed routing algorithm to reduce power consumption of battery-powered devices by routing the communication through mains-powered devices whenever possible and consequently increasing the overall network lifetime. The proposed algorithm works on tree topologies supported by ZigBee and requires only minor modifications to the current specification. Our ns-2 simulation results showed that the algorithm is able to reduce the power consumption of battery-powered devices significantly with minimal communication overhead. © Springer Science+Business Media, LLC 2012.
Open Access
Reconstruction of the polarization distribution of the Rice-Mele model
(American Physical Society, 2017) Yahyavi, M.; Hetényi, B.
We calculate the gauge-invariant cumulants (and moments) associated with the Zak phase in the Rice-Mele model. We reconstruct the underlying probability distribution by maximizing the information entropy and applying the moments as constraints. When the Wannier functions are localized within one unit cell, the probability distribution so obtained corresponds to that of the Wannier function. We show that in the fully dimerized limit the magnitudes of the moments are all equal. In this limit, if the on-site interaction is decreased towards zero, the distribution shifts towards the midpoint of the unit cell, but the overall shape of the distribution remains the same. Away from this limit, if alternate hoppings are finite and the on-site interaction is decreased, the distribution also shifts towards the midpoint of the unit cell, but it does this by changing shape, by becoming asymmetric around the maximum, and by shifting. We also follow the probability distribution of the polarization in cycles around the topologically nontrivial point of the model. The distribution moves across to the next unit cell, its shape distorting considerably in the process. If the radius of the cycle is large, the shift of the distribution is accompanied by large variations in the maximum.