Analysis and modeling of routing and security problems in wireless sensor networks with mathematical programming

Download
2013
İncebacak, Davut
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 protocols and algorithms is to achieve energy e ciency and to extend the network lifetime. Hence, energy e cient solutions are required for routing and security problems in WSNs. In this dissertation, we model and analyze several routing and security problems in WSNs. We first study the impact of spatial granularity of measurements on the energy requirements of sensor network. We then investigate the energy cost of survivability in the presence of physical attacks. We next study the impact of the number of routing paths on network wide energy balancing under optimal operating conditions. Finally, we investigate the energy cost of route diversity to improve the security of WSNs against adversaries attempting to obtain sensitive sensor data. We contribute to the literature by developing novel mathematical programming frameworks and presenting a comprehensive high level analysis of the several routing and security problems in WSNs. The novel mathematical programming frameworks presented in this thesis can be used with minor modifications for future analysis of di erent routing and security problems in WSNs.

Suggestions

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...
Path planning and localization for mobile anchor based wireless sensor networks
Erdemir, Ecenaz; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2017)
In wireless sensor networks, sensors with limited resources are distributed in a wide area. Localizing the sensors is an important problem. Anchor nodes with known positions are used for sensor localization. A simple and efficient way of generating anchor nodes is to use mobile anchors which have built-in GPS units. In this thesis, a single mobile anchor is used to traverse the region of interest to communicate with the sensor nodes and identify their positions. Therefore planning the best trajectory for th...
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...
Fuzzy unequal clustering in wireless sensor networks
Bağcı, Hakan; Yazıcı, Adnan; Department of Computer Engineering (2010)
In order to gather information more efficiently, wireless sensor networks are partitioned into clusters. The most of the proposed clustering algorithms do not consider the location of the base station. This situation causes hot spots problem in multi-hop wireless sensor networks. Unequal clustering mechanisms, which are designed by considering the base station location, solve this problem. In this thesis, we propose a fuzzy unequal clustering algorithm (EAUCF) which aims to prolong the lifetime of wireless ...
Immune system based distributed node and rate selection in wireless sensor networks
Atakan, Baris; Akan, Ozguer B. (2006-12-13)
Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of dense deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to spatial location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes it is needed to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-...
Citation Formats
D. İncebacak, “Analysis and modeling of routing and security problems in wireless sensor networks with mathematical programming,” Ph.D. - Doctoral Program, Middle East Technical University, 2013.