Browsing by Author "Yilmaz, Onur"

Now showing 1 - 3 of 3

Citation - WoS: 4
Citation - Scopus: 4
Interference-Aware Dynamic Algorithms for Energy-Efficient Topology Control in Wireless Ad Hoc and Sensor Networks
(Oxford Univ Press, 2011) Yilmaz, Onur; Dagdeviren, Orhan; Erciyes, Kayhan
In wireless ad hoc and sensor networks, energy is a scarce resource and a considerable amount of energy is dissipated due to interference. Therefore, interference is one of the major challenges in wireless ad hoc and sensor networks. It alters or disrupts a message as it is being transmitted along a channel between source and destination. Since the messages are disrupted when the interference occurs, they have to be detected and the interfered messages have to be retransmitted. In this paper, we propose central and distributed heuristic algorithms for reducing average interference in a receiver-centric interference model. In the literature, the minimum spanning tree (MST) algorithm is generally used through the interference coverage graph directly or indirectly in order to generate minimum average interference topology. Our algorithm, dynamic average interference (DAI), however, generates lower average interference as well as more sparse topology than MST. We realized that if the transmission ranges of nodes are taken into consideration at each stage of the topology control algorithm, the interference of links are changed dynamically. This interference changing enables up to 22% more energy saving than the MST algorithm. Thus, DAI provides energy saving by reducing the interference as far as possible in generated topology.
Citation - WoS: 2
Modeling and Simulation Tools for Mobile Ad Hoc Networks
(Crc Press-Taylor & Francis Group, 2012) Erciyes, Kayhan; Dagdeviren, Orhan; Cokuslu, Deniz; Yilmaz, Onur; Gumus, Hasan
[Abstract Not Available]
Citation - WoS: 25
Citation - Scopus: 35
Shortest Hop Multipath Algorithm for Wireless Sensor Networks
(Pergamon-Elsevier Science Ltd, 2012) Yilmaz, Onur; Demirci, Serkan; Kaymak, Yagiz; Ergun, Serkan; Yildirim, Ahmet
Shortest hop or distance path is one of the most common methods used for relaying messages in a wide variety of networks. It provides an efficient message relaying to destination in terms of energy and time. There are many algorithms for constructing shortest hop or distance path. However, according to our knowledge, no algorithm for constructing a shortest hop multipath for wireless sensor networks (WSNs) has yet been proposed in the literature. In this paper, we propose a novel distributed shortest hop multipath algorithm for WSNs in order to generate energy efficient paths for data dissemination or routing. The proposed algorithm generates shortest hop braided multipath to be used for fault-tolerance or load-balancing. It guarantees the BFS tree and generates near optimal paths in O(V.D + V) message complexity and O(D-2) time complexity regarding the communication costs towards the sink after termination of algorithm. (C) 2011 Elsevier Ltd. All rights reserved.