Sharif Digital Repository

One of the most important applications of wireless sensor networks is data collection. This paper proposes as efficient approach for data collection in wireless sensor networks by introducing Member Forward List. This list includes the nodes with highest priority for forwarding the data. When a node fails or dies, this list is used to select the next node with higher priority. The benefit of this node is that it prevents the algorithm from repeating when a node fails or dies. The results show that Member Forward List decreases power consumption and latency in wireless sensor networks  

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  

The manner of organizing the sensors in the wireless sensor network for increasing the capability and optimized using of the sensors is of great importance. Hence considering coverage parameter in every Wireless Sensor Network (WSN) is extremely essential and critical. The matter of overlapping covered area by sensors in 2D space had been considered until now. This paper is suggested a pattern in which no more are the sensors located at the same surface, but using the 3D geometrical figures like cube, pyramid and etc, in which the sensors were spreading about the different surfaces. Locating the sensors on the different surfaces can be useful under conditions where the space is not in same... 

The problem of latency in data acquisition, which is specific to the case of mobile wireless sensor networks, has been introduced and investigated. In this regard, the properties of the so-called Data Acquisition Latency Error, and the way it affects the performance of the respective localization schemes in a mobile network were discussed through both theoretical analysis and simulations. Moreover, a weighted version of lateration scheme was introduced and shown to outperform the traditional one, while tracking a mobile node. This work is to the best of our knowledge the first to have addressed the aforementioned problem in mobile wireless sensor networks, and to have offered a solution for... 

A SEnsor Network with Mobile Agents (SENMA) is an architecture proposed for large scale sensor networks in which the access point moves above the network and gathers information from a limited number of nodes. However, the performance of such system is limited by estimation errors and packet errors due to collision. In this paper, we first derive the equations of distortion in a general scenario and use this model to obtain four best node positions in order to achieve min-max estimation error in a square. In addition, an opportunistic MAC is proposed that considers both collision effects and estimation error based on Channel State Information (CSI). As the simulation results show the... 

Although many complex real-world networks are weighted, unweighted networks are used in many applications such as sensor networks. In this Letter it is shown using properly weighted networks the performance can be greatly enhanced by reducing the time necessary for the average consensus. Random geographical models are adapted as network models and a method based on mutually coupled phase oscillators is used for providing average consensus over the network. The consensus time is calculated by numerically solving the network's differential equations and monitoring the average error. The simulation results on some sample networks show that the consensus time is dramatically reduced when the... 

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

In distributed function computation, each node has an initial value and the goal is to compute a function of these values in a distributed manner. In this paper, we propose a novel token-based approach to compute a wide class of target functions to which we refer as "token-based function computation with memory" (TCM) algorithm. In this approach, node values are attached to tokens and travel across the network. Each pair of travelling tokens would coalesce when they meet, forming a token with a new value as a function of the original token values. In contrast to the coalescing random walk (CRW) algorithm, where token movement is governed by random walk, meeting of tokens in our scheme is... 

Sensor networks have a wide range of potential and practical application. A sensor network consists of a large number of tiny, low power and short-living sensors. Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this dissertation, an algorithm proposed which groups sensors in to disjoint subsets. Every subset cans k-cover the whole area. The subsets are scheduled to work successively. Therefore, the network lifetime is prolonged. Furthermore, sensing range is fixed. Also another algorithm, proposed which constructs some non-disjoint subsets, and in each active subset, each sensor... 

Sensor networks have recently emerged as a premier research topic. Sensor networks pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. While designing the sensor networks according to performed computation, the limited number of sensors to cover an area will be considered, so the proper placing of this limited number of sensors will cause costs to reduce regarding to coverage and development of the network in the next stage. In this paper we will present a genetic algorithm to solve the designing issue of the sensor network. The most important... 

The problem of surveillance for intrusion detection in a camera sensor network is addressed in this paper. In order to save limited resources, a sensing task should involve just the right number of sensors. For a wide enough coverage area random and uniform distribution can be applied. We propose a novel method which allows reduction of number of sensors and guarantees a desired surveillance against aerial intrusion. Enhancement of the method is also offered to further reduce the number of sensors and improve the performance. ©2008 IEEE  

In this work, we have examined the problem of distributed consensus averaging over senor networks from a novel point of view considering the need for security. We have proposed a method for incorporating privacy into the scalable average consensus mechanisms. Our proposed method, Random Projections Method (RPM), is lightweight and transparent since it is not based on cryptography and does not require any change in the fusion system. RPM is based on introducing a simple, yet effective pre-fusion algorithm. We mathematically derived the correctness of RPM and analyzed its effect on convergence of the system through simulation. Robustness of RPM against honest-but-curious adversaries is... 

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

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

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

Underwater wireless optical communications are an emerging solution to the expanding demand for broadband links in oceans and seas. In this paper, a cellular underwater wireless optical code division multiple-access network is proposed to provide broadband links for commercial and military applications. The optical orthogonal codes are employed as signature codes of underwater mobile users. Fundamental key aspects of the network, such as its backhaul architecture, its potential applications, and its design challenges, are presented. In particular, a promising underwater localization and positioning scheme based on this cellular network is presented. Furthermore, the proposed network is used... 

Implanted biomedical sensor networks provide a major application of sensor networks in the near future. Their high temperature due to wireless communication, might damage the surrounding tissues. This paper presents an efficient thermal-aware routing. Our proposed protocol states that when some nodes in the shortest path have a high temperature, ignores this path. The simulation results indicate the superiority of the proposed method compared to other thermal-aware routing protocols in terms of reducing temperature without a significant increase in packet delivery delay and power consumption of nodes. © 2009 IEEE  

Considering their special features and numerous applications, sensor networks are noticed so much nowadays. A sub-group of these applications is underwater sensor networks, which encounter some challenges like reliable transportation, routing, MAC, positioning, limited bandwidth, high and variable propagation delay, defective underwater channels and low battery capacity. Acoustic technologies are a particular technology which can make strong underwater communications for Civilian and military applications. These networks are used in oceans for environmental monitoring, under sea discovery, unexpected events prevention, ships assisting, tactical monitoring and naval mine detection, but there... 

Energy distribution to get more lifetime and noninterfering multipath are two major challenges in Wireless Multimedia Sensor Networks (WMSNs) routing. The Greedy Perimeter Stateless Routing (GPSR) is a simple routing protocol which uses minimum geographic distance to forward packets toward sink node. However it does not consider energy level and uses single path. Geographic energy-aware non-interfering multipath Routing (GEAM) overcomes this problem by multipath routing and energy consideration, but keeping state of the multiple non-interfering areas has an overhead. In our proposed routing protocol which is called Energy Aware Greedy Stateless Geographic Routing (EAGSGR) we will introduce...