Browsing by Subject "Extensive simulations"
Now showing 1 - 6 of 6
Results Per Page
Sort Options
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 Control of underactuated planar hexapedal pronking through a dynamically embedded SLIP monopod(IEEE, 2010) Ankarali, M.M.; Saranlı, Uluç; Saranli, A.Pronking (aka. stotting) is a gait in which all legs are used in synchrony, resulting in long flight phases and large jumping heights that may potentially be useful for mobile robots on rough terrain. Robotic instantiations of this gait suffer from severe pitch instability either due to underactuation, or the lack of sufficient feedback. Nevertheless, the dynamic nature of this gait suggests that the Spring-Loaded Inverted Pendulum Model (SLIP), a very successful predictive model for both natural and robotic runners, would be a good basis for more robust and maneuverable robotic pronking. In this paper, we describe how "template-based control", a controller structure based on the embedding of a simple dynamical "template" within a more complex "anchor" system, can be used to achieve stable and controllable pronking for a planar, underactuated hexapod model. In this context, high-level control of the gait is regulated through speed and height commands to the SLIP template, while the embedding controller based on approximate inverse-dynamics and carefully designed passive dynamics ensures the stability of the remaining degrees of freedom. We show through extensive simulation experiments that unlike existing open-loop alternatives, the resulting control structure provides stability, explicit maneuverability and significant robustness against sensor and actuator noise. ©2010 IEEE.Item Open Access Controlled sink mobility algorithms for wireless sensor networks(Taylor and Francis Inc., 2014) Koç, M.; Korpeoglu I.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 processors, the main constraint that makes WSNs different from traditional networks is the battery problem which limits the lifetime of a network. Different approaches are proposed in the literature for improving the network lifetime, including data aggregation, energy efficient routing schemes, and MAC protocols. Sink node mobility is also an effective approach for improving the network lifetime. In this paper, we investigate controlled sink node mobility and present a set of algorithms for deciding where and when to move a sink node to improve network lifetime. Moreover, we give a load-balanced topology construction algorithm as another component of our solution. We did extensive simulation experiments to evaluate the performance of the components of our mobility scheme and to compare our solution with static case and random movement strategy. The results show that our algorithms are effective in improving network lifetime and provide significantly better lifetime compared to static sink case and random movement strategy. © 2014 Metin Koç and Ibrahim Korpeoglu.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 Routing in delay tolerant networks with periodic connections(SpringerOpen, 2015) Mergenci, C.; Korpeoglu, I.In delay tolerant networks (DTNs), the network may not be fully connected at any instant of time, but connections occurring between nodes at different times make the network connected through the entire time continuum. In such a case, traditional routing methods fail to operate because there are no contemporaneous end-to-end paths between sources and destinations. This study examines the routing in DTNs where connections arise in a periodic nature. We analyze various levels of periodicity in order to meet the requirements of different network models. We propose different routing algorithms for different kinds of periodic connections. Our proposed routing methods guarantee the earliest delivery time and minimum hop-count, simultaneously. We evaluate our routing schemes via extensive simulation experiments and compare them to some other popular routing approaches proposed for DTNs. Our evaluations show the feasibility and effectiveness of our schemes as viable routing methods for delay tolerant networks.Item Open Access Tree-based channel assignment schemes for multi-channel wireless sensor networks(John Wiley & Sons Ltd., 2016) Terzi, C.; Korpeoglu, I.Many sensor node platforms used for establishing wireless sensor networks (WSNs) can support multiple radio channels for wireless communication. Therefore, rather than using a single radio channel for whole network, multiple channels can be utilized in a sensor network simultaneously to decrease overall network interference, which may help increase the aggregate network throughput and decrease packet collisions and delays. This method, however, requires appropriate schemes to be used for assigning channels to nodes for multi-channel communication in the network. Because data generated by sensor nodes are usually delivered to the sink node using routing trees, a tree-based channel assignment scheme is a natural approach for assigning channels in a WSN. We present two fast tree-based channel assignment schemes (called bottom up channel assignment and neighbor count-based channel assignment) for multi-channel WSNs. We also propose a new interference metric that is used by our algorithms in making decisions. We validated and evaluated our proposed schemes via extensive simulation experiments. Our simulation results show that our algorithms can decrease interference in a network, thereby increasing performance, and that our algorithms are good alternatives for static channel assignment in WSNs.