Sharif Digital Repository

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  

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

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

Processor allocation in todays many core MPSoCs is a challenging task, especially since the order and requirements of incoming applications are unknown during design stage. To improve network performance, balance the workload across processing cores, or mitigate the effect of hot processing elements in thermal management methodologies, task migration is a method which has attracted much attention in recent years. Runtime task migration was first proposed in multicomputer with load balancing as the major objective. However, specific NoC properties such as limited amount of communication buffers, more sensitivity to implementation complexity, and tight latency and power consumption constraints... 

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

The growing interest in applications of Wireless Multimedia Sensor Networks (WMSNs) imposes new challenges on congestion control protocols in such networks. In this paper, we propose a new content-aware cross layer WMSN Congestion Control Protocol (WCCP) by considering the characteristics of multimedia content. WCCP employs a Source Congestion Avoidance Protocol (SCAP) in the source nodes, and a Receiver Congestion Control Protocol (RCCP) in the intermediate nodes. SCAP uses Group of Picture (GOP) size prediction to detect congestion in the network, and avoids congestion by adjusting the sending rate of source nodes and distribution of the departing packets from the source nodes. In... 

Today, structural Health monitoring is a major concern in the engineering community. Multisite fatigue damage, hidden cracks and corrosion in hard-to-reach locations are among the major flaws encountered in today's extensive diagnosis and/or prognosis of aircraft structures. Ultrasonic waves, lamb waves are particularly advantageous because of their propagation at large distances with little damp in thin-wall structures. In this paper a new rectangular shape array of embedded piezoelectric sensors is developed to detect some damages in large planar structures. An artificial neural network is trained to identify the damage state and its location. Output signals of each sensor due to various... 

Reliability and energy consumption are two of the main constraints in wireless sensor networks (WSNs). In this paper, a novel energy efficient and high speed error control scheme is introduced that is based on the Redundant Residue Number System (RRNS) allowing real-time application of WSNs. The proposed approach employs a new 3-moduli set {22n+1, 2 2n1-1, 2n- 1 } and an efficient reverse converter which relies on the Mixed Radix Conversion (MRC) algorithm and achieves significant improvements both in terms of conversion delay and hardware design. In order to obtain error controllability, two-redundant-moduli set 23n+1 - 1, 24n+1 - 1 is also added to the main 3-moduli set. The theoretical... 

In wireless body area networks (WBANs) it is necessary to devise an energy-efficient MAC scheduling mechanism which is capable of meeting strict QoS requirements. In this paper, special characteristics of WBAN channels, namely, the slow fading, the periodicity of fading, and the correlation among the channels have been exploited to formulate the sensor scheduling problem as a partially observable Markov decision problem (POMDP). Specific algorithms based on value iteration and pruning have been proposed in order to reduce the computational burden associated with the corresponding POMDP. The proposed scheduling mechanism is compared against a TDMA scheduling for a three-sensor network, and an... 

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

Asynchronous data fusion is inevitable in track-to-track fusion for tracking high-speed targets. For low-speed targets, e.g., the movement of clouds, synchronization is insignificant and, depending on the application, may be disregarded. Real-time asynchronous fusion is a demanding task in sensor networks when the sensors are not synchronous in sampling-rate or in sampling-phase. In the method proposed in this paper, an estimator in the fusion center estimates the actual time of the sample with respect to the time-reference of the fusion center upon receiving the data from a sensor. Then, the computer of the fusion center uses predictions to transfer all the received data to the data... 

We study wireless sensor network (WSN) node placement in an environment where RF signal losses vary with position. This reflects real-world outdoor environments where vegetation and topography cause nonuniform path loss. Many techniques that solve for a variety of objective functions subject to various constraints have previously been proposed for node placement. However, many of these methods make simplifying assumptions such as all nodes having the same transmission range. Our goal is to take the insights and approaches of this previouswork and extend it to real-world environments. The present work assumes we have a map that quantifies the path loss behaviour of the real environment. Based... 

Data aggregation is a key, yet time-consuming functionality in wireless sensor networks (WSNs). Multi-channel design is a promising technique to alleviate interference as a primary reason for long latency of TDMA aggregation scheduling. Indeed, it provides more potential of parallel transmissions over different frequency channels, thus minimizing time latency. In this paper, we focus on designing a multi-channel minimum latency aggregation scheduling protocol, named MC-MLAS, using a new joint approach for tree construction, channel assignment, and transmission scheduling. To our best knowledge, this is the first work in the literature which combines orthogonal channels and partially... 

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

Wireless sensor networks (WSNs) consume energy for their sensing, computation, and communication. To extend the lifetime of the network, sensor nodes are equipped with energy storage devices. Recharging of their batteries is impossible in most applications. Therefore, energy consumption needs to be monitored and limited to extend the high performance operation of the network. In this network, the communication module consumes the highest amount of energy. This paper demonstrates that among several methods offered to reduce the energy consumption, data compression has the highest effect on the energy usage by reducing the number of bits to be broadcasted. To determine the energy efficiency of... 

Wireless sensor networks (WSNs) use energy for their sensing, computation, and communication. To increase the lifetime of the network, sensor nodes are equipped with energy storage devices. Recharging of their batteries is not possible in most applications. Therefore, energy consumption needs to be monitored and limited to increase the energy consumption performance of the network. The communication module uses the highest amount of energy in a WSN. Among several methods offered to reduce the energy consumption, data compression has the highest effect on the energy usage by reducing the number of bits to be broadcasted. This paper illustrates an energy consumption reduction in WSN by... 

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 operates successfully, the active nodes must maintain both sensing coverage and network connectivity. It has been 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 first we consider a rectangular region A = a * b, such that Rs≤a, Rs≤b where Rs is the sensing range of node, and put a constraint on minimum allowed distance between nodes (... 

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

The quality of service in Wireless Multimedia Sensor Networks (WMSN) is related to congestion in network. Recently different studies have been done on developing efficient protocols in the transport layer for controlling packet loss in WMSN. However, all of these protocols are independent of the characteristics of multimedia content. In this paper, a novel transport layer protocol, called Energy Efficient Congestion Avoidance (EECA), is proposed to minimize the packet loss ratio in WMSN by predicting congestion in network, and adjusting the source nodes output rate before congestion happening. EECA adjusts the output video quality in source nodes to adjust the source nodes video quality. The...