Sharif Digital Repository

Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off cand network throughput, the proposed approach prolongs the network lifetime. The paper is divided into the following sections: Initially, the discussion is presented on how the sensor nodes can be scheduled to sleep or wake up in order to reduce energy consumption in idle listening. The sensor... 

Recent advances in wireless sensor network (WSN) technology are enabling the deployment of large-scale and collaborative sensor networks. WSNs face several challenges such as security, localisation, and energy consumption. To resolve these issues, evolutionary algorithms can be helpful. The core of every evolutionary algorithm is its fitness function. The drawbacks of fitness functions used in the literature will be investigated and some solutions will be suggested. The simulation results clearly show the improvement due to suggested solutions. © The Institution of Engineering and Technology 2017  

Data gathering is a common but critical operation in many applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks, which can increase scalability and lifetime. These networks require robust wireless communication protocols that are energy efficient and provide low latency. In this paper, we develop and analyze an efficient cooperative transmission protocol with robust clustering (RCCT) for sensor networks that considers a fault-tolerant and energy-efficient distributed clustering with minimum overhead. RCCT distributes... 

In this paper, the distributed recovery units for FM and PPM demodulation in wireless sensor networks is proposed and is showed that, the method introduces very little amount of distortion to recovered signal. With simulations, we have examined several different parameters. Besides, two different filtering schemes are simulated. Effect of iteration coefficient (X) on stability and convergence rate is investigated for different sampling and filtering methods. Next, we have studied the noise effect in demodulation with this method. Simulations results are included to verify convergence. © Springer-Verlag Berlin Heidelberg 2005  

In many wireless sensor network applications, nodes are mobile, while many protocols proposed for these networks assume a static network. Thus, it is important to evaluate if a traditional protocol designed for a static network can tolerate different levels of mobility. This paper provides an analytic model to investigate the effect of mobility on a well-known cluster-based protocol, LEACH. The model evaluates data loss after construction of the clusters due to node mobility, which can be used to estimate a proper update interval to balance the energy and data loss ratio. Thus, the results can help the network designer to adjust the topology update interval given a value of acceptable data... 

This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay-tolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device on-off periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from... 

Localization is a crucial problem in wireless sensor networks and most of the localization algorithms given in the literature are non-adaptive and designed for fixed sensor networks. In this paper, we propose a learning based localization algorithm for mobile wireless sensor networks. By this technique, mobility in the network will be discovered by two crucial methods in the beacons: position and distance checks methods. These two methods help to have accurate localization and constrain communication just when it is necessary. The proposed method localizes the nodes based on connectivity information (hop count), which doesn't need extra hardware and is cost efficient. The experimental... 

In this letter, both the number of participating nodes and spatial dispersion are incorporated to establish a bi-objective optimization problem for maximizing the quality of aggregation under interference and delay constraints in tree-based wireless sensor networks (WSNs). The formulated problem is proved to be NP-hard with respect to Weighted-sum scalarization and a distributed heuristic aggregation scheduling algorithm, named SDMAX, is proposed. Simulation results show that SDMAX not only gives a close approximation of the Pareto-optimal solution, but also outperforms the best, to our knowledge, existing alternative proposed so far in the literature  

Topology of a mobile wireless sensor/ad hoc network is prone to link breakages due to node mobility which compels the periodic re-construction of the topology in so called "hello" intervals. The problem addressed in this paper is determining the maximum "hello" interval preserving the connectivity of a homogeneous topology with high probability. In order to study the optimum "hello" interval, statistical topology lifetime (STL) is formally defined as a value of "hello" interval that ensures statistical connectivity with a given threshold. Temporal properties of the topology are studied based on two phenomena; one concerning a connectivity phase transition with time and the other one... 

To scavenge the energy from the environment and extend the network lifetime, some wireless sensor networks (WSNs) have been equipped with energy harvesters recently. However, the variable amount of environmental energy can affect the reliability of energy harvesting wireless sensor networks (EH-WSNs). In addition, data transmission over a wireless media is vulnerable. Hence, utilizing suitable error control schemes are necessary to improve the reliability. Regarding this point, Automatic Repeat Request (ARQ) and Cooperative ARQ (C-ARQ) schemes are applied in this generation of WSNs. Conventional ARQ as well as C-ARQ scheme are considered and examined through simulation. A comparative... 

This paper presents a novel routing protocol based on the Learning Automata method for large scale Wireless Sensor Networks (WSNs) codenamed DRLR (distributed reinforcement learning routing). In this method, each node is equipped with learning automata so that it can learn the best path to transmit data toward the sink. The approach proved to be efficient, reliable, and scalable. It also prevents routing hole by considering network density and average of energy levels available. The approach also increases network lifetime by balancing energy consumption. We compared our approach to two other methods (MMSPEED and EESPEED) and the simulation results show our algorithm to better meet... 

Wireless Sensor Networks are composed of small, low cost, resource-constrained computing nodes equipped with low power wireless transceivers. In this paper, we study and model the time and energy cost of Kerberos protocol by using timed automata in WSN. We model check the protocol using UPPAAL. We show that considering time in the analysis of security protocols yield more confident results  

Wireless Sensor Networks (WSNs) have been weaved into the fabric of our daily lives. The foremost impediment in the rapid development of these networks is the energy limitation which inhibits them from meeting specific application requirements. Recently, the advances in energy harvesting technology have made it possible to replenish the energy of sensors via external sources. Energy Harvesting-Wireless Sensor Networks (EH-WSNs) are being transformed from a visionary concept into reality. However, this concept is still in its infancy and calls for extensive research to cater to the needs of WSNs. For future progress of EH-WSNs, Medium Access Control (MAC) layer has undoubtedly a decisive role... 

Wireless sensor networks (WSNs) comprise a large number of small sensor nodes scattered across limited geographical areas. The nodes in such networks carry sources of limited and mainly unchangeable energy. Therefore, it is necessary that these networks operate under energy efficient protocols and structures. Energy efficient clustering algorithms have been developed to reduce the networks energy consumption and extend its lifetime. This paper presents an innovative cluster-based communication protocol for WSNs. In order to reduce communication overhead, the authors propose an Energy Aware Clustering Hierarchy Protocol that creates a multi-level hierarchical structure to adequately route and... 

Minimizing energy consumption is the most important concern in wireless sensor networks (WSNs). To achieve this, clustering and prediction methods can enjoy the inherent redundancy of raw data and reduce transmissions more effectively. In this paper, we focus on designing a prediction-based approach, named PDC, to mainly contribute in data-aware clustering. It exploits both spatial and temporal correlations to form highly stable clusters of nodes sensing similar values. Here, the sink node uses only the local prediction models of cluster heads to forecast all readings in the network without direct communication. To the best of our knowledge, PDC is a novel energy efficient approach which... 

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  

This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay-tolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device on-off periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from... 

Limited energy in each node is the major design constraint in wireless sensor networks (WSNs). To overcome this limit, wireless rechargeable sensor networks (WRSNs) have been proposed and studied extensively over the last few years. In a typical WRSN, batteries in sensor nodes can be replenished by a mobile charger that periodically travels along a certain trajectory in the sensing area. To maximize the charged energy in sensor nodes, one fundamental question is how to control the traveling velocity of the charger. In this paper, we first identify the optimal velocity control as a key design objective of mobile wireless charging in WRSNs. We then formulate the optimal charger velocity... 

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...