Browsing by Author "Korpeoglu, I."
Now showing 1 - 20 of 32
Results Per Page
Sort Options
Item Open Access Active node determination for correlated data gathering in wireless sensor networks(Elsevier BV, 2013-04-07) Karasabun, E.; Korpeoglu, I.; Aykanat, CevdetIn wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that are selected as active form a connected wireless network, the inactive sensor nodes can be turned off. Allowing some sensor nodes to be active and some sensor nodes inactive interchangably during the lifecycle of the application helps the wireless sensor network to have a longer lifetime. The problem of determining a set of active sensor nodes in a correlated data environment for a fully operational wireless sensor network can be formulated as an instance of the connected correlation-dominating set problem. In this work, our contribution is twofold; we propose an effective and runtime-efficient iterative improvement heuristic to solve the active sensor node determination problem, and a benefit function that aims to minimize the number of active sensor nodes while maximizing the residual energy levels of the selected active sensor nodes. Extensive simulations we performed show that the proposed approach achieves a good performance in terms of both network lifetime and runtime efficiency. © 2012 Elsevier B.V. All rights reserved.Item 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.Item Open Access A comparison of epidemic algorithms in wireless sensor networks(Elsevier BV, 2006-08-21) Akdere, M.; Bilgin, C. C.; Gerdaneri, O.; Korpeoglu, I.; Ulusoy, O.; Çetintemel, U.We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, and other sensitive information in wireless sensor networks. Epidemic algorithms are a natural approach for reliable distribution of information in such ad hoc, decentralized, and dynamic environments. In this paper we show the applicability of epidemic algorithms in the context of wireless sensor environments, and provide a comparative performance analysis of the three variants of epidemic algorithms in terms of message delivery rate, average message latency, and messaging overhead on the network. © 2006 Elsevier B.V. All rights reserved.Item Open Access Computing localized power-efficient data aggregation trees for sensor networks(Institute of Electrical and Electronics Engineers, 2011) Tan, H. O.; Korpeoglu, I.; Stojmenovic, I.We propose localized, self organizing, robust, and energy-efficient data aggregation tree approaches for sensor networks, which we call Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs). They are based on topologies, such as LMST and RNG, that can approximate minimum spanning tree and canbeefficiently computed using only position or distance information ofone-hop neighbors. The actual routing tree is constructed over these topologies. We also consider different parent selection strategies while constructing a routing tree. We compare each topology and parent selection strategy and conclude that the best among them is the shortest path strategy over LMST structure. Our solution also involves route maintenance procedures that will beexecuted whenasensor node fails ora new node is added to the network. The proposed solution is also adapted to consider the remaining power levels ofnodes in orderto increase the network lifetime. Our simulation results show that byusing our power-aware localized approach, we can almost have the same performance of a centralized solution in terms of network lifetime, and close to 90 percent of an upper bound derived here. © 2011 IEEE.Item Open Access Coordinated movement of multiple mobile sinks in a wireless sensor network for improved lifetime(SpringerOpen, 2015) Koç, M.; Korpeoglu, I.Sink mobility is one of the most effective solutions for improving lifetime and has been widely investigated for the last decade. Algorithms for single-sink mobility are not directly applied to the multiple-sink case due to the latter’s specific challenges. Most of the approaches proposed in the literature use mathematical programming techniques to solve the multiple-sink mobility problem. However, doing so leads to higher complexities when traffic flow information for any possible sink-site combinations is included in the model. In this paper, we propose two algorithms that do not consider all possible sink-site combinations to determine migration points. We first present a centralized movement algorithm that uses an energy-cost matrix for a user-defined threshold number of combinations to coordinate multiple-sink movement. We also give a distributed algorithm that does not use any prior network information and has a low message exchange overhead. Our simulations show that the centralized algorithm gives better network lifetime performance compared to previously proposed MinDiff-RE, random movement, and static-sink algorithms. Our distributed algorithm has a lower network lifetime than centralized algorithms; sinks travel significantly less than in all the other schemes.Item Open Access Distributed and location-based multicast routing algorithms for wireless sensor networks(SpringerOpen, 2009-01) Korpeoglu, I.; Bagci, H.Multicast routing protocols in wireless sensor networks are required for sending the same message to multiple different destinations. In this paper, we propose two different distributed algorithms for multicast routing in wireless sensor networks which make use of location information of sensor nodes. Our first algorithm groups the destination nodes according to their angular positions and forwards the multicast message toward each group in order to reduce the number of total branches in multicast tree which also reduces the number of messages transmitted. Our second algorithm calculates an Euclidean minimum spanning tree at the source node by using the positions of the destination nodes. The multicast message is forwarded to destination nodes according to the calculated MST. This helps in reducing the total energy consumed for delivering the message to all destinations by decreasing the number of total transmissions. Evaluation results show that the algorithms we propose are scalable and energy efficient, so they are good candidates to be used for multicasting in wireless sensor networks. Copyright © 2009 H. Bagci and I. Korpeoglu.Item Open Access Distributed construction and maintenance of bandwidth and energy efficient bluetooth scatternets(Institute of Electrical and Electronics Engineers, 2006-09) Tekkalmaz, M.; Sözer, H.; Korpeoglu, I.Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet formation policies and algorithms are not well specified. Among many solution proposals for this problem, only a few of them focus on efficient usage of bandwidth in the resulting scatternets. In this paper, we propose a distributed algorithm for the scatternet formation problem that dynamically constructs and maintains a scatternet based on estimated traffic flow rates between nodes. The algorithm is adaptive to changes and maintains a constructed scatternet for bandwidth-efficiency when nodes come and go or when traffic flow rates change. Based on simulations, the paper also presents the improvements in bandwidth-efficiency and reduction in energy consumption provided by the proposed algorithm.Item Open Access Distributed interactive video system design and analysis(Institute of Electrical and Electronics Engineers, 1997) Wu, Tsong-Ho; Korpeoglu, I.; Cheng, Bo-ChaoThe interactive video (IV) market has been expected to capture a significant share of the huge potential revenues to be generated by the business and residential markets. The level of revenues generated depends on the completion rate of calls the service provider can support, no matter what the IV system or network condition. Thus, a cost-effective, scalable fault-tolerant IV system is needed to maximize the video call completion rate at an affordable cost. This article describes design methodologies for a scalable, fault-tolerant IV system and an IV system design and analysis research prototype called IVSDNA (IV System Designer and Analyzer). The IVSDNA prototype is designed to help network planners and engineers to evaluate quantitative trade-offs (in terms of network communications costs, video storage costs, and degree of system fault tolerance) between two major IV system architectures (centralized and distributed) with a variety of video distribution methods, replication strategies, and fault-tolerant access protocols.Item 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.Item Open Access Distributed k-Core view materialization and maintenance for large dynamic graphs(Institute of Electrical and Electronics Engineers, 2014-10) Aksu, H.; Canim, M.; Chang, Yuan-Chi; Korpeoglu, I.; Ulusoy, O.In graph theory, k-core is a key metric used to identify subgraphs of high cohesion, also known as the ‘dense’ regions of a graph. As the real world graphs such as social network graphs grow in size, the contents get richer and the topologies change dynamically, we are challenged not only to materialize k-core subgraphs for one time but also to maintain them in order to keep up with continuous updates. Adding to the challenge is that real world data sets are outgrowing the capacity of a single server and its main memory. These challenges inspired us to propose a new set of distributed algorithms for k-core view construction and maintenance on a horizontally scaling storage and computing platform. Our algorithms execute against the partitioned graph data in parallel and take advantage of k-core properties to aggressively prune unnecessary computation. Experimental evaluation results demonstrated orders of magnitude speedup and advantages of maintaining k-core incrementally and in batch windows over complete reconstruction. Our algorithms thus enable practitioners to create and maintain many k-core views on different topics in rich social network content simultaneously.Item Open Access Distributed power-source-aware routing in wireless sensor networks(Springer New York LLC, 2016) Tekkalmaz, M.; Korpeoglu, I.Although many applications use battery-powered sensor nodes, in some applications battery- and mains-powered nodes coexist. In this paper, we present a distributed algorithm that considers using mains-powered devices to increase the lifetime of wireless sensor networks for such heterogeneous deployment scenarios. In the proposed algorithm, a backbone routing structure composed of mains-powered nodes, sink, and battery-powered nodes if required, is constructed to relay data packets to one or more sinks. The algorithm is fully distributed and can handle dynamic changes in the network, such as node additions and removals, as well as link failures. Our extensive ns-2 simulation results show that the proposed method is able to increase the network lifetime up to 40 % compared to the case in which battery- and mains-powered nodes are not differentiated. © 2015, Springer Science+Business Media New York.Item Open Access A distributed tault-tolerant topology control algorithm for heterogeneous wireless sensor networks(Institute of Electrical and Electronics Engineers, 2015-04) Bagci, H.; Korpeoglu, I.; Yazıcı, A.This paper introduces a distributed fault-tolerant topology control algorithm, called the Disjoint Path Vector (DPV), for heterogeneous wireless sensor networks composed of a large number of sensor nodes with limited energy and computing capability and several supernodes with unlimited energy resources. The DPV algorithm addresses the k-degree Anycast Topology Control problem where the main objective is to assign each sensor's transmission range such that each has at least k-vertex-disjoint paths to supernodes and the total power consumption is minimum. The resulting topologies are tolerant to k - 1 node failures in the worst case. We prove the correctness of our approach by showing that topologies generated by DPV are guaranteed to satisfy k-vertex supernode connectivity. Our simulations show that the DPV algorithm achieves up to 4-fold reduction in total transmission power required in the network and 2-fold reduction in maximum transmission power required in a node compared to existing solutions.Item Open Access Effects of physical channel separation on application flows in a multi-radio multi-hop wireless mesh network: an experimental study on BilMesh testbed(Academic Press, 2014) Ulucinar, A. R.; Korpeoglu, I.; Karasan, E.In this paper, we introduce BilMesh, an indoor 802.11 b/g mesh networking testbed we established, and we report about our performance experiments conducted on multi-hop topologies with single-radio and multi-radio relay nodes. We investigate and report the effects of using multi-radio, multi-channel relay nodes in the mesh networking infrastructure in terms of network and application layer performance metrics. We also study the effects of physical channel separation on achievable end-to-end goodput perceived by the applications in the multi-radio case by varying the channel separation between the radio interfaces of a multi-radio relay node. We have observed that the difference between TCP and UDP goodput performances together with the delay and jitter performance depends on the hop count. We also observed that assigning overlapping channels with a central frequency separation of 5-15 MHz may render the CSMA mechanism used in 802.11 MAC ineffective and hence reduce the overall network performance. Finally, we provide some suggestions that can be considered while designing related protocols and algorithms to deal with the observed facts.Item Open Access Efficient community identification and maintenance at multiple resolutions on distributed datastores(Elsevier BV, 2015) Aksu, H.; Canim, M.; Chang, Yuan-Chi; Korpeoglu, I.; Ulusoy, ÖzgürThe topic of network community identification at multiple resolutions is of great interest in practice to learn high cohesive subnetworks about different subjects in a network. For instance, one might examine the interconnections among web pages, blogs and social content to identify pockets of influencers on subjects like 'Big Data', 'smart phone' or 'global warming'. With dynamic changes to its graph representation and content, the incremental maintenance of a community poses significant challenges in computation. Moreover, the intensity of community engagement can be distinguished at multiple levels, resulting in a multi-resolution community representation that has to be maintained over time. In this paper, we first formalize this problem using the k-core metric projected at multiple k-values, so that multiple community resolutions are represented with multiple k-core graphs. Recognizing that large graphs and their even larger attributed content cannot be stored and managed by a single server, we then propose distributed algorithms to construct and maintain a multi-k-core graph, implemented on the scalable Big Data platform Apache HBase. Our experimental evaluation results demonstrate orders of magnitude speedup by maintaining multi-k-core incrementally over complete reconstruction. Our algorithms thus enable practitioners to create and maintain communities at multiple resolutions on multiple subjects in rich network content simultaneously.Item 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.Item Open Access A framework for use of wireless sensor networks in forest fire detection and monitoring(Elsevier Ltd., 2012) Aslan, Y. E.; Korpeoglu, I.; Ulusoy, T.Forest fires are one of the main causes of environmental degradation nowadays. Current surveillance systems for forest fires lack in supporting real-time monitoring of every point of a region at all times and early detection of fire threats. Solutions using wireless sensor networks, on the other hand, can gather sensory data values, such as temperature and humidity, from all points of a field continuously, day and night, and, provide fresh and accurate data to the fire-fighting center quickly. However, sensor networks face serious obstacles like limited energy resources and high vulnerability to harsh environmental conditions, that have to be considered carefully. In this paper, we propose a comprehensive framework for the use of wireless sensor networks for forest fire detection and monitoring. Our framework includes proposals for the wireless sensor network architecture, sensor deployment scheme, and clustering and communication protocols. The aim of the framework is to detect a fire threat as early as possible and yet consider the energy consumption of the sensor nodes and the environmental conditions that may affect the required activity level of the network. We implemented a simulator to validate and evaluate our proposed framework. Through extensive simulation experiments, we show that our framework can provide fast reaction to forest fires while also consuming energy efficiently. © 2012 Elsevier Ltd.Item Open Access Free riding in peer-to-peer networks(Institute of Electrical and Electronics Engineers, 2009) Karakaya, M.; Korpeoglu, I.; Ulusoy, ÖzgürFree riding in peer-to-peer (P2P) networks poses a serious threat to their proper operation. Here, the authors present a variety of approaches developed to overcome this problem. They introduce several unique aspects of P2P networks and discuss free riding's effects on P2P services. They categorize proposed solutions and describe each category's important features and implementation issues together with some sample solutions. They also discuss open issues, including common attacks and security considerations. © 2009 IEEE.Item Open Access Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components(Elsevier BV, 2015) Ilkhechi, A. R.; Korpeoglu, I.; Ulusoy, ÖzgürFollowing a shift from computing as a purchasable product to computing as a deliverable service to consumers over the Internet, cloud computing has emerged as a novel paradigm with an unprecedented success in turning utility computing into a reality. Like any emerging technology, with its advent, it also brought new challenges to be addressed. This work studies network and traffic aware virtual machine (VM) placement in a special cloud computing scenario from a provider's perspective, where certain infrastructure components have a predisposition to be the endpoints of a large number of intensive flows whose other endpoints are VMs located in physical machines (PMs). In the scenarios of interest, the performance of any VM is strictly dependent on the infrastructure's ability to meet their intensive traffic demands. We first introduce and attempt to maximize the total value of a metric named "satisfaction" that reflects the performance of a VM when placed on a particular PM. The problem of finding a perfect assignment for a set of given VMs is NP-hard and there is no polynomial time algorithm that can yield optimal solutions for large problems. Therefore, we introduce several off-line heuristic-based algorithms that yield nearly optimal solutions given the communication pattern and flow demand profiles of subject VMs. With extensive simulation experiments we evaluate and compare the effectiveness of our proposed algorithms against each other and also against naïve approaches.Item 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.Item Open Access OLSR-aware channel access scheduling in wireless mesh networks(Academic Press, 2011) Kas, M.; Korpeoglu, I.; Karasan, E.Wireless mesh networks (WMNs) have emerged as a key technology having various advantages, especially in providing cost-effective coverage and connectivity solutions in both rural and urban areas. WMNs are typically deployed as backbone networks, usually employing spatial TDMA (STDMA)-based access schemes which are suitable for the high traffic demands of WMNs. This paper aims to achieve higher utilization of the network capacity and thereby aims to increase the application layer throughput of STDMA-based WMNs. The central idea is to use optimized link state routing (OLSR)-specific routing layer information in link layer channel access schedule formation. This paper proposes two STDMA-based channel access scheduling schemes (one distributed, one centralized) that exploit OLSR-specific information to improve the application layer throughput without introducing any additional messaging overhead. To justify the contribution of using OLSR-specific information to the throughput, the proposed schemes are compared against one another and against their non-OLSR-aware versions via extensive ns-2 simulations. Our simulation results verify that utilizing OLSR-specific information significantly improves the overall network performance both in distributed and in centralized schemes. The simulation results further show that OLSR-aware scheduling algorithms attain higher end-to-end throughput although their non-OLSR-aware counterparts achieve higher concurrency in slot allocations. © 2010 Elsevier Inc. All rights reserved.