Static range assignment in wireless sensor networks

Uzun, Erkay
Energy is a limited source in wireless sensor networks and in most applications, it is non-renewable; so designing energy-effcient communication patterns is very important. In this thesis, we define the static range assignment (SRA) problem for wireless sensor networks, which focuses on providing the required connectivity in the network with minimum energy consumption. We propose minimum spanning tree based (MST), pruned minimum spanning tree based (MSTP) and shortest path incremental (SPI) algorithms as effcient heuristics for the SRA problem. As a data dissemination service, multicasting is frequently used for communication in the wireless sensor networks. In a WSN, several multicast requests occur simultaneously. In order to support multiple multicast requests, sensor nodes should have enough power levels for packet transmission between the nodes. In our study we present minimum energy multiple source multicast (MEMSM) problem. MEMSM problem is a special case of the SRA problem and we propose the M-MIPF algorithm as a solution to the MEMSM problem, which is a modified version of the well-known MIPF algorithm in order to support multiple multicast problem. Solutions to MEMSM problem try to make a range assignment that enables all the multicasts in the system and has a minimum energy cost. We compare the algorithms MST, MSTP, SPI and M-MIPF according to their energy consumptions. Our experimental results show that MSTP and SPI algorithms are stable and energy-effcient solutions to the MEMSM problem.


Query based energy efficient clustering methods for wireless sensor networks
Koşar, Onur; Koçyiğit, Altan; Department of Information Systems (2011)
In Wireless Sensor Networks, designing a low overhead routing protocol is crucial for prolonging network lifetime. Wireless sensor nodes depend on limited batteries and if they run out of battery, they cannot contribute to the sensing. There are lots of studies aimed at prolonging network lifetime. One of the methods to extend life time of the wireless sensor networks is clustering. In clustering approaches main aim is to prevent unnecessary messaging and decrease number of messages exchanged by aggregating...
Rule-based in-network processing for event-driven applications in wireless sensor networks
Şanlı, Özgür; Yazıcı, Adnan; Körpeoğlu, İbrahim; Department of Computer Engineering (2011)
Wireless sensor networks are application-specific networks that necessitate the development of specific network and information processing architectures that can meet the requirements of the applications involved. The most important challenge related to wireless sensor networks is the limited energy and computational resources of the battery powered sensor nodes. Although the central processing of information produces the most accurate results, it is not an energy-efficient method because it requires a cont...
Communication Coverage in Wireless Passive Sensor Networks
Bereketli, Alper; Akan, Ozgur B. (2009-02-01)
System lifetime of wireless sensor networks (WSN) is inversely proportional to the energy consumed by critically energy-constrained sensor nodes during RF transmission. In that regard, modulated backscattering (MB) is a promising design choice, in which sensor nodes send their data just by switching their antenna impedance and reflecting the incident signal coming from an RF source. Hence, wireless passive sensor networks (WPSN) designed to operate using MB do not have the lifetime constraints of convention...
Life time sensitive weighted clustering on wireless sensor networks
Alizadeh Jarchlo, Elnaz; Bazlamaçcı, Cüneyt Fehmi; Department of Information Systems (2013)
Wireless Sensor Networks typically include wireless sensor nodes with limited energy. Network lifetime and scalability are considered as two significant requirements for sensor network applications. In order to decrease energy consumption and increase network lifetime one can apply an efficient clustering method. The application of the clustering method proposed in this thesis (LTS-WCA) leads to reducing the energy cost and the transmission distance of each node by grouping the nodes in several clusters and...
Analysis and modeling of routing and security problems in wireless sensor networks with mathematical programming
İncebacak, Davut; Baykal, Nazife; Bıçakcı, Kemal; Department of Information Systems (2013)
Wireless Sensor Networks (WSNs) are composed of battery powered small sensor nodes with limited processing, memory and energy resources. Self organization property together with infrastructureless characteristics of WSNs make them favorable solutions for many applications. Algorithms and protocols developed for WSNs must consider the characteristics and constraints of WSNs but since battery replenishment is not possible or highly challenging for sensor nodes, one of the major concerns in designing network p...
Citation Formats
E. Uzun, “Static range assignment in wireless sensor networks,” M.S. - Master of Science, Middle East Technical University, 2010.