This paper presents a radio paths modeling framework for simulating RF coverage in complex indoor environments. We propose an algorithm which utilizes a geometric visibility graph of a building to traverse all possible bounded radio paths. These paths are needed for the computation of signal strength captured at a given receiver location. We have implemented the suggested algorithm and conducte...

We propose a method to measure real-valued time series irreversibility which combines two different tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) b...

Title of dissertation: RANDOM GRAPH MODELING OF KEY DISTRIBUTION SCHEMES IN WIRELESS SENSOR NETWORKS Osman Yağan, Doctor of Philosophy, 2011 Dissertation directed by: Professor Armand M. Makowski Department of Electrical and Computer Engineering Wireless sensor networks (WSNs) are distributed collections of sensors with limited capabilities for computations and wireless communications. It is en...

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles following well-celebrated classic oblivious model. study fundamental problem gathering on a plane, which requires all to meet at single point (or position within small area) is not known beforehand. limited visibility under are only able see other up constant Euclidean distance and f...

Recent observation studies have revealed that earthquakes are classified into several different categories. Each category might be characterized by the unique statistical feature in time series, but present understanding is still limited due to their nonlinear and nonstationary nature. Here we utilize complex network theory shed new light on properties of earthquake series. We investigate two k...