Sharif Digital Repository

Sound source localization has always been one of the most challenging subjects in different fields of engineering, one of the most important of which being tracking of flying objects. This article focuses on sound source localization using fuzzy fusion and a beamforming method. It proposes a new fuzzy-based algorithm for localizing a sound source using distributed sensor nodes. Eight low-cost sensor nodes have been constructed in this study each of which consists of a microphone array to capture sound waves. Each node is able to record audio signals synchronously on an SD card to evaluate different algorithms offline. However, the sensor nodes are designed to be able to estimate the location... 

Data aggregation is a key, yet time-consuming functionality introduced to conserve energy in wireless sensor networks (WSNs). In this paper, to minimize time latency, we focus on aggregation scheduling problem and propose an efficient distributed algorithm that generates a collision-free schedule with the least number of time slots. In contrast to others, our approach named FAST mainly contributes to both tree construction, where the former studies employ Connected 2-hop Dominating Sets, and aggregation scheduling that was previously addressed through the Competitor Sets computation. We prove that the latency of FAST under the protocol interference model is upper-bounded by 12R+Δ-2, where R... 

A large number of random key pre-distribution (RKD) schemes have been proposed in the literature to secure wireless sensor network applications, relying on symmetric key cryptography. However, sensor nodes are exposed to physical compromise by adversaries, who target the symmetric keys stored at each node. With the stolen keys in their possession, the adversaries are then able to compromise communication links between benign nodes. Here, the big challenge arises: how to increase resilience of RKD schemes for wireless sensor networks to node capture, while maintaining the flexibility and low-cost features of RKD? We propose the idea of key splitting to address this problem, without the need... 

the failure in cluster at a high level can bring up great damages to the system in wireless sensor networks where clustering techniques are used. Certain methods have been reported in the literature in recovering the sensors from a failure cluster. One of the most important methods is to recover the sensors in run-time and without clustering. But it is so much ideal to suppose that all the sensors will be recovered. In this paper, we proposed a method that can operate on the remained sensors that are not recovered. © 2009 IEEE  

We study the problem of optimizing the symbol error probability (SEP) performance of cluster-based cooperative wireless sensor networks (WSNs). We propose that to achieve the minimum SEP at the destination, a joint optimization of power allocation and relay selection should be accomplished. To this aim, we reformulate the SEP performance of a simple cluster-based cooperative WSN in the general form and solve the joint optimization problem efficiently. Simulation results demonstrate that the proposed joint optimization can efficiently improve the SEP performance of the network in comparison with the previous disjoint optimal relay selection schemes  

We propose a range-free localization framework in which a network of randomly deployed acoustic sensors can passively use natural acoustic phenomena within its environment to localize itself. We introduce a novel approach for registration of sensors observations which takes advantage of a clustering technique on triplets of associated observations. A Bayesian filtering method is employed to incrementally improve system state estimation as more observations become available. To the best of our knowledge this is the first work done on range-free passive acoustic localization. Simulation experiments of the proposed algorithms are presented. © 2008 IEEE  

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully the active nodes must maintain both sensing coverage and network connectivity, It proved before if the communication range of nodes is at least twice the sensing range, complete coverage of a convex area implies connectivity among the working set of nodes. In this paper we consider a rectangular region A =a *b , such that Rs ≤ a, Rs ≤ b where Rs is the sensing range of nodes. and put a constraint on minimum allowed distance between nodes( Rs ). according... 

In this paper, we present two physical layer cooperative protocols for heterogeneous sensor networks. There is one cooperator near the transmitter and a second cooperator (as a relay) near the receiver. Although the focus is on heterogeneous sensor networks, the methods can be applied to homogeneous sensor networks as well. Analytical and simulation results show that, under an additive white Gaussian noise channel assumption for the links between the transmitter and its partner and between the receiver and its partner, the proposed protocols achieve a diversity order of three or four by using the amplify-and-forward cooperation strategy and maximal ratio combining in the receiver. In... 

In this work, we have examined the distributed consensus averaging problem from a novel point of view considering the need for privacy and anonymity. We have proposed a method for incorporating security into the scalable average consensus mechanisms proposed in the literature. Random Offsets Method (ROM) is lightweight, transparent and flexible since it is not based on cryptography, does not require any change in the fusion system and can be used optionally by some nodes who care about their privacy. In this method, which is based on noisiflcation of nodes' information, we achieve robustness against n - 1 colluding adversaries in a network of n nodes, which is maximum level of robustness... 

A wireless Ad-hoc sensor network consists of a number of sensors spread across a geographical area as a collection of sensors that form an ad-hoc wireless network. Sensors are very tiny devices that their primary function is to sense the target, convert the signal into a suitable data format, and pass on the data to a command node. These sensor nodes are very heavily constrained in processing power, and have a limited energy supply. Since energy is such a scarce resource, several algorithms have been developed at the routing and MAC layers to utilize energy efficiently and extend the lifetime of the network. First layer of the sensor networks is the infrastructure layer and there is no... 

Sensor network deployment is very challenging due to hostile and unpredictable nature of usage environments. In this letter, we propose two methods for the self-deployment of mobile sensors. The first one is a randomized solution that provides both simplicity and applicability to different environments. Inspired by simulated annealing, it improves both speed and energy conservation of the deployment process. The other method is suggested for environments where sensors form a connected graph, initially. At the cost of this extra limitation, we gain considerable improvements. © 2006 IEEE