Sharif Digital Repository

Many Random Key Distribution (RKD) schemes have been proposed in the literature to enable security applications in Wireless Sensor Networks (WSNs). A main security aspect of RKD schemes is their resistance against node capture attacks, since compromising the sensors and capturing their keys is a common risk in such networks. We propose a new method, based on a 2-Dimensional Hash Chain (2DHC), that can be applied on any RKD scheme to improve their resilience. Our method maintains the flexibility and low cost features of RKD schemes and it doesn't require any special-purpose hardware or extra memory to store keys in the sensors. We demonstrate that our approach significantly increases the... 

Visibility is an important topic in computer graphics, motion planning, and computational geometry. To deal with the increasing complexity of the scenes considered, some research has been performed in visibility processing in order to accelerate the visibility determination. Two of the most studied such structures are visibility graph and visibility complex. Visibility graph is a fundamental geometric structure which is used in many applications, including illumination and rendering, motion planning, pattern recognition, and sensor networks. While the concept of visibility graph is widely studied for 2D scenes, there is no acceptable equivalence of visibility graph for 3D space. Similarly,... 

Wireless sensor networks (WSNs) are a new technology, foreseen to be used increasingly in the near future, and security is an important issue for them. However because of the nodes resource limitations, other schemes proposed for securing general ad hoc networks, are not appropriate for WSNs. Usually some nodes act maliciously and they are able to do different kinds of DoS attacks. In order to make the network more secure, malicious nodes should be isolated from the network. In this paper, we model the interaction of nodes in WSN and intrusion detection system (IDS) as a Bayesian game formulation and use this idea to make a secure routing protocol. By this approach nodes are motivated to act... 

Wireless body area networks (WBANs) are receiving significant interest as the next generation of wireless networks and emerging technology in the field of health monitoring. One of the most important factors for the acceptance of WBANs is the provision of appropriate security and access control mechanisms. Due to its nature in transferring the patients' sensitive data, WBAN has both classical and specific security requirements. In this paper, we survey such requirements and propose a new security scheme for satisfying them in WBANs. The proposed scheme deals with the overall network architecture, including intra- and inter-WBAN tiers, and proposes two mutual authentication and key exchange... 

In this paper, we investigate the problem of detecting and monitoring changes (abnormality) in molecular communication (MC), using the quickest change detection (QCD) schemes. The objective is to watch an environment using a sensor network and make decisions on the time and location of changes based on the received signals from sensors in the fusion center (FC). Such assumptions call for considering spatial and temporal correlations among sensors' transmitting signals. We use the framework of Partially Observable Markov Decision Processes (POMDPs) based on non-homogeneous Markov models. The metric in detection (stopping-time) scenario is to minimize the delay of announcing an abnormality... 

This paper presents a cycle by cycle Frequency Shift Keying (FSK) demodulator, able to demodulate a FSK signal with 1% frequency modulation index (MI), in a single cycle. Based on the proposed demodulation scheme, a high rate data transmission link can be established through a high-Q inductive coupling link, breaking the basic tradeoff between the power transfer efficiency (PTE) and data rate in single carrier wireless power and data transfer systems. Designed and simulated with 0.18μ m CMOS process, the proposed FSK demodulator, detects successfully a 5Mbps data with a carrier frequency of 5MHz. A test chip is fabricated in 180nm CMOS technology. Measurement results shows that the... 

This paper introduces adaptive consensus, a spatio-temporal adaptive method to improve convergence behavior of the current consensus fusion schemes. This is achieved by introducing a time adaptive weighting method for updating each sensor data in each iteration. Adaptive consensus method will improve node convergence rate, average convergence rate and the variance of error over the network. A mathematical formulation of the method according to the adaptive filter theory as well as derivation of the time adaptive weights and convergence conditions are presented. The analytical results are verified by simulation as well. ©2006 IEEE  

Flooding technique is widely using to manipulate sensor network essential activities such as synchronization, data gathering, network query and in-network information processing. Reliable and low latency data broadcasting is the primary goal in design of appropriate quality of service aware flooding algorithm. This paper proposes a new error-rate adaptive reliable data flooding strategy. Energy consumption which it the main limitation in sensor network, has been considered in optimal presented scheme. Also the tradeoff between reliability, power consumption and latency has been cared to achieve the finest devise. The simulation results have shown significant enhancement in quality of data... 

The use of cooperative schemes in wireless networks has recently attracted much attention in scenarios where application of multipleantenna systems is impractical. In such scenarios, the requirement of having full channel state information (CSI) at the receiver side can be relaxed by using differential distributed (DD) transmission schemes. However, in the DD schemes proposed so far, the decoding complexity as well as the delay requirements increase with the number of relays. In this paper, we propose a low-rate feedback-based DD approach (with one-bit feedback per relay) that enjoys full diversity, linear maximum likelihood (ML) decoding complexity, and unrestrictive delay requirements. In... 

This letter proposes a sparse diffusion algorithm for 1-bit compressed sensing (CS) in wireless sensor networks, and the algorithm is inherently robust against impulsive noise. The approach exploits the diffusion strategy from distributed learning in the 1-bit CS framework. To estimate a common sparse vector cooperatively from only the sign of measurements, a steepest descent method that minimizes the suitable global and local convex cost functions is used. A diffusion strategy is suggested for distributive learning of the sparse vector. A new application of the proposed algorithm to sparse channel estimation is also introduced. The proposed sparse diffusion algorithm is compared with both... 

Wireless Sensor Networks (WSNs) are prone to faults due to battery depletion of nodes. A node failure can disturb routing as it plays a key role in transferring sensed data to the end users. This paper presents a Fault-Tolerant and Energy-Aware Mechanism (FTEAM), which prolongs the lifetime of WSNs. This mechanism can be applied to cluster-based WSN protocols. The main idea behind the FTEAM is to identify overlapped nodes and configure the most powerful ones to the sleep mode to save their energy for the purpose of replacing a failed Cluster Head (CH) with them. FTEAM not only provides fault tolerant sensor nodes, but also tackles the problem of emerging dead area in the network. Our... 

In a distributed algorithm several processing nodes communicate with each other and incorporate in order to reach a common goal. Each unit has its own locally-observed environment while it can either help or mislead other units when sharing its information. This could be either intentional or simply due to the observation noise. Previous works mainly focus on locating the agents properly and assigning weights based on stationary environment in order to minimize the impact of noisy nodes. We, however, propose a method capable of assigning combination weights in accordance with momentary performance of the neighboring nodes. In order to demonstrate this capability, the proposed algorithm has... 

Development of Internet of things (IoT) applications brings a new movement to the functionality of wireless sensor networks (WSNs) from only environment sensing and data gathering to collaborative inferring and ubiquitous intelligence. In intelligent WSNs, nodes collaborate to exchange the information needed to achieve the required inference or smartness. Efficiency or correctness of many smart applications rely on efficient, timely, reliable, and ubiquitous inference of information which may continually change in interaction with other nodes. In this paper, we introduce a framework which provides a generic solution for such common ubiquitous inferences. This framework brings the reliability... 

Wireless sensor networks (WSNs) usually consist of many tiny sensor nodes and a Sink. Problems like nodes' misbehavior due to malicious, compromised or selfishness intentions, and WSNs' security vulnerabilities against different attacks due to free and unprotected communications, untrusted and broadcasted transmissions, hostile environments and limited resources, degrade the security and overall performance of WSNs. In another direction, most of the traditional security mechanisms are unsuitable for WSNs. One significant security solution against these problems is Trust Management System (TMS); TMS enhances the security by detecting the nodes' abnormal behaviors; it improves the cooperation... 

Control of powered lower limb prostheses has a locomotion mode-dependent structure which demands a pattern recognizer that can classify the current locomotion mode and also detect transitions between them in an appropriate time. In order to achieve this goal, this paper presents a Fuzzy sequential locomotion mode recognition system to classify daily locomotion modes including level- walking, stair climbing, slope walking, standing and sitting using low-cost mechanical sensors. Since these signals have a quasi-periodic nature, using sequential pattern recognition tools, such as Hidden Markov Model(HMM) improves the recognition performance considering they use sequences of information to make... 

In this paper, a "Game Theory" approach for finding an optimal path in a "Wireless Sensor Network" is discussed. WSN is one of the most interesting research fields in the communication networks, and is the center of attention in recent years. In our model, a pricing and payment technique is presented to obtain an optimal path in a WSN by considering reliability, energy and traffic load. The proposed algorithm is able to find a path which improves network lifetime, load distribution and path reliability  

In this paper, a "Game Theory" approach for finding an optimal path in a "Wireless Sensor Network" is discussed. WSN is one of the most interesting research fields in the communication networks, and is the center of attention in recent years. In our model, a pricing and payment technique is presented to obtain an optimal path in a WSN by considering reliability, energy and traffic load. The proposed algorithm is able to find a path which improves network lifetime, load distribution and path reliability  

Node localization is of paramount importance to different wireless sensor network (WSN) applications. This paper investigates the received signal strength (RSS) based localization problem with unknown path-loss model parameters. Most works in RSS localization assume the transmit power and path-loss exponent (PLE) are known that is not a realistic assumption in some cases. However this paper, assumes the transmit power and the PLE are both unknown and a novel algorithm for sensor location is proposed. The algorithm is based on the generalized total least-squares (GTLS) method and gives an explicit solution for the localization problem. The performance of the proposed method is compared with... 

Sensor networks are increasingly employed in many applications ranging from environmental to military cases. The network topology used in many sensor network applications has a kind of geographical structure. A graph weighting method for reducing consensus time in random geographical networks is proposed in this paper. We consider a method based on the mutually coupled oscillators for providing general consensus in the network. In this way, one can relate the consensus time to the properties of the Laplacian matrix of the connection graph, i.e. to the second smallest eigenvalue (algebraic connectivity). Our weighting algorithm is based on the node and edge between centrality measures. The... 

In this paper, a hierarchical routing protocol for wireless sensor networks is introduced that aims at reducing the energy imbalance among sensor nodes by integrating the distance of the nodes from the base station into clustering policies. Moreover, the proposed routing protocol does not need any centralized support from a certain node which is at odds with aiming to establish a scalable routing protocol. Mobility management is a salient feature of this protocol that guarantees reliable communications between mobile and static nodes. A simulator was developed in the MATLAB environment to evaluate the performance of this protocol. Simulations on two different network configurations are used...