Hop Wireless Sensor Networks Research Articles

Adoption features and approach for UWB Wireless Sensor Network based on Pilot Signal assisted MAC

In the field of wireless sensor network (WSN), Pilot Assisted Transmission (PAT) is a new concept. In our previous research, a mac layer algorithm called, “PA-MAC” was designed, which exclusively uses PAT technique for the medium access control. The performance of PA-MAC was evaluated under multi-hop and single hop WSNs. It was excellent under a single hop structure (i.e. network with a few nodes). But when it was evaluated for the dense network topology, the performance seriously declined. It was noted that the two main reasons of performance degradation are interference and transmission range. Technically there are two ways to tackle a dense network traffic problem. One is to use the multi-hop structure and the other one is clustering. In this research paper, clustering based adoption strategy is examined, and beside dynamic clustering approach multiple optimization features (i.e., clustering formation based on transmission range, dynamic cluster head selection and use of the Volterra code for the mitigation of interference) are added and tested. Collectively these adoption features have not only improved the media access performance but also optimized the network lifetime.In the field of wireless sensor network (WSN), Pilot Assisted Transmission (PAT) is a new concept. In our previous research, a mac layer algorithm called, “PA-MAC” was designed, which exclusively uses PAT technique for the medium access control. The performance of PA-MAC was evaluated under multi-hop and single hop WSNs. It was excellent under a single hop structure (i.e. network with a few nodes). But when it was evaluated for the dense network topology, the performance seriously declined. It was noted that the two main reasons of performance degradation are interference and transmission range. Technically there are two ways to tackle a dense network traffic problem. One is to use the multi-hop structure and the other one is clustering. In this research paper, clustering based adoption strategy is examined, and beside dynamic clustering approach multiple optimization features (i.e., clustering formation based on transmission range, dynamic cluster head selection and use of the Volterra code for the mitigation of interference) are added and tested. Collectively these adoption features have not only improved the media access performance but also optimized the network lifetime.

Localization and Tracking of Mobile Jammer Sensor Node Detection in Multi-Hop Wireless Sensor Network

Background: The jammer in a wireless sensor network is located and tracked with open access and shared nature of the wireless medium. The existing algorithms mainly track the stationary jammer. Mobile jammer often moves from one place to another becoming difficult. Mobile jammer location tracker algorithm is proposed to find the location of a mobile jammer with four steps selection i.e., initial examining node, determination of supporting node, trilateration localization and examining group handover. Objective: In this research paper an algorithm is proposed for finding the location of mobile jammer in wireless sensor network. Finding location faces a huge difficulty due to non-supportive working between the multi hop wireless sensor network and jammer. The existing algorithms are used to find the location of stationary jammers only. Mobile jammers frequently change their position from time to time. Therefore jamming increases between the node to node communications in the multi hop wireless sensor network. Methods: The multi hop wireless sensor network is deployed with n number of stationary nodes in a particular area. The omni directional antenna is fitted with those stationary nodes and the transmission powers of the nodes are also constant. The direction-finding table is maintained and keep on updating for an interval of each node. The position of the nodes is tracked with the GPS devices or by existing location finding algorithm. The nodes in the multi hop wireless sensor network are installed in A*A square area uniformly and randomly. The transmitting node is tp node. The received signal to noise ratio is threshold STNR. Neighbor list records the neighbor node of the multi hop wireless sensor networks. Results and Conclusion: The proposed idea of localization and tracking system of mobile jammer is estimated efficiently by the multi hop wireless sensor network with the simulator MATLAB. The nodes in multi hop wireless sensor network are installed in A*A area square uniformly and randomly.

RETRACTED ARTICLE: Routing technique for data transmission under jammer in multi-hop wireless network

The value and general execution of jammers create them an indispensable hazard for wireless sensor networks. In the multi-hop wireless network, jammers be able to obstruct the broadcast of consumer messages in the transitional nodes alongside the way, one may utilize jamming insensible routing after that occupy first layer mechanisms (e.g. spread spectrum) to restrain the jamming. The novel technique is introduced hybrid ERS-RIP (efficient route selection—routing information protocol) for data transmission under jammer in multi hop wireless sensor networks. Efficient route selection is to maintain minimum cost to identify the routes. For route selection the energy cost and trustable path must be measured. RIP is a distance vector routing protocol presence in the application of OSI layer and is to measure the optimal path between sources to destination. RIP gives updating occasionally regarding network exchange. When the jammers are found, then the network area nodes are choose alternate path with secure and monitor the energy of these path and the packets are send safely with the help of routing protocols to destination node. This algorithm explains in which provides the route based on the jammer detection path. This ERS-RIP algorithm works based on the quality of the optimal link. The performance of the proposed methodology is estimated by its end-to-end delay, throughput, packet delivery rate, packet loss rate and node life time. Results show that the performance of hybrid ERS-RIP is considerably improved than the existing algorithms ERS, ESA, and DSR. The Performance analysis of existing techniques is 80.5, 81.6, 83.4 and hybrid ERS-RIP is 85.5.

Energy Conservative Opportunistic Routing(ECOR) in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are large collection of sensing nodes with processing and communication capabilities. The major issue in sensor network is limited battery power. Batteries cannot be recharged or replaced once deployed. Research on wireless sensor network has recently received much attention as they offer an advantage of monitoring various kinds of environment by sensing physical phenomenon. Recently Opportunistic Routing has emerged as a novel routing scheme that effectively improves the capacity of a multi hop wireless sensor networks. It takes the advantage of broadcast nature of wireless communication. In contrast to traditional unicast routing, where the next hop forwarder is formed before the transmission of data. Opportunistic Routing chooses its forwarder list dynamically with poor energy management. The performance of Opportunistic Routing is enhanced with energy conservation algorithms and higher throughput and thus network lifetime is increased.

An Energy Efficient Cluster Head Selection Technique Using Network Trust and Swarm Intelligence

Wireless sensor networks (WSN) have started appearing in our daily life including home, office, industry and vehicles to name a few. The incremental usage of WSN for environmental monitoring demands safety and security enhancement. Strong security mechanisms incurred by WSN leads to resource and energy utilization overhead resulting in faster drainage of energy. Trust and reputation have been extensively used in literature to detect misbehaving nodes and thus improve overall network Quality of Service (QoS) by avoiding them. This work proposed a trust mechanism for effective cluster head selection in a multi hop WSN using Artificial Bee Colony algorithm. The results show that the proposed method successfully avoids nodes with selfish behavior and malicious nature that enable Black Hole, Denial of Service, or packet dropping. Results illustrates improvements in the packet delivery ratio and energy utilization.

A Cross-Layer Communication Protocol with Transmission Power Adjustment for Energy Saving in Multi-hop MhWSNs

Introducing a cross-layer scheme to optimize energy consumption in multi hop wireless sensor networks (MhWSNs) is a relatively new approach. Moreover and contrarily to the existing cross-layer MhWSNs architectures, this paper deals with a new cross-layer design based on three-ware cross-layer architecture which exploits an inversed interaction between network, link and physical layers. We propose a cross-layer and hybrid energy efficiency protocol (named CL-HEEP) with transmission power adjustment to preserve the energy reserves in multi-hop MhWSNs. The main idea is the use of routing information to dynamically adjust the transceiver transmission power and to establish cross-layer duty-cycling. An additional wake-up radio is also implied by CL-HEEP to preserve the energy while avoiding compulsory wake-up, idle listening, interference, and collision problems. The simulation reveals that CL-HEEP is energy-efficient and able to achieve significant performance improvement compared to other cross-layer protocols.

Potentiality Timeserving Reliable Routing (PTRR) Algorithm in Multi Hop Wireless Sensor Networks

This study aims to increase the reliability in the multi hop wireless sensor networks with low radio interference and avoid packet collision. In the proposed scheme, each node has the choice of selecting next forwarder node. The next forwarder node is selected based on the link strength, residual energy and the distance to the target. The source node sends the data packet to the best forwarder node. Immediately, the forwarder node sends the acknowledgement along with the number of packets received back to the node from which it receives the data. The sender node ensures the delivery of the transmitted packets by comparing the value of number of packets sent with the value received with the acknowledgement. If they are equal means it will send the authentication ID to the forwarder node. If it is not equal means it will choose another node with highest link strength. After that, the forwarder node chooses the next forwarder and repeat the process until the data reaches the destination. The performance of the proposed scheme is evaluated by using NS2 Simulator.

Wireless Sensor Network Deployment for Monitoring Soil Moisture Dynamics at the Field Scale

We describe the deployment of a Wireless Sensor Network (WSN), composed of 135 soil moisture and 27 temperature sensors, in an apple tree orchard of about 5000 m2, located in the municipality of Cles, a small town in the Alpine region, northeastern Italy. The orchard is divided into three parcels each one subjected to a different irrigation schedule. The objective of the present work is to monitor soil moisture dynamics in the top soil to a detail, in both space and time, suitable to analyze the interplay between soil moisture dynamics and plant physiology. The deployment consists of 27 locations (verticals) connected by a multi hop WSN, each one equipped with 5 soil moisture sensors deployed at the depths of 10, 20, 30, 50 and 80 cm, and a temperature sensor at the depth of 20 cm. The proposed monitoring system is based on totally independent sensor nodes, which allow both real time and historic data management and are connected through an input/output interface to a WSN platform. Meteorological data are monitored by a weather station located at a distance of approximately 100 m from the experimental site.Great care has been posed to calibration of the capacitance sensors, both in the laboratory, with soil samples, and on site, after deployment, in order to minimize the noise caused by small oscillations in the input voltage and uncertainty in the calibration curves. In this work we report the results of a preliminary analysis on the data collected during the growing season 2009. We observed that the WSN greatly facilitates the collection of detailed measurements of soil moisture, thereby increasing the amount of information useful for exploring hydrological processes, but they should be used with care since the accuracy of collected data depends critically on the capability of the system to maintain constant the input voltage and on the reliability of calibration curves. Finally, we studied the spatial and temporal distribution of soil moisture in all the irrigated parcels, and explored how different irrigation schedules influence orchard's production.

NEW CLUSTERING SCHEMES FOR WIRELESS SENSOR NETWORKS

In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability. In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. In the second one, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer node’s residual energy. We assign to every volunteer node a competition range that may be fixed or variable as a function of distance to BS. The volunteer nodes compete in their competition ranges and every one with more energy would become cluster head. In both proposed algorithms, our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer lifetime.

An Energy-Efficient Adaptive Transmission Protocol for Ultrawideband Wireless Sensor Networks

An energy-efficient adaptive transmission protocol for ultrawideband (UWB) wireless sensor networks (WSNs), called ATP-UWSN, is described and evaluated over time-varying multipath fading channel conditions and multinode interference. Since wireless channels may greatly change from one transmission to the next, the use of fixed transmission parameters for such channels results in wasted energy when channel conditions are good. Adaptation of transmission parameters reduces energy consumption and interference. The proposed ATP-UWSN permits each of the sensor nodes to adapt its code rate and spreading code length (the number of pulses used per data bit) to match the predicted channel-state information (CSI). The transmission parameters are selected in accordance with the predicted CSI characteristics of the communication links in the network to achieve the desired quality of service given by the target bit-error probability. Subsequently, we develop a mathematical adaptation framework for the analytical evaluation of ATP-UWSN. Communication performance is evaluated in terms of average information throughput efficiency, which is a relevant progress-related measure for multi- hop WSNs that is associated with the energy consumption and throughput of a packet transmission. The analytical expression of this performance metric is defined and is used to assess the benefits of the proposed ATP-UWSN when compared with a nonadaptive transmission protocol (NATP) with fixed transmission parameters. Our results show that the ATP-UWSN outperforms the NATP and can improve the robustness of the link and reduce energy consumption by adapting the transmission parameters in response to changes in the predicted CSI.

Performance evaluation of wireless sensor network with hybrid channel access mechanism

In this paper, a hybrid channel access mechanism is proposed for the wireless sensor network that considers the channel access procedure of IEEE 802.15.4 and combines the binary exponential backoff mechanism of IEEE 802.11 due to packet collision of nodes after successful channel assessment. Taking the backlogged nodes due to collision, an extended linear feedback model is developed and a discrete-time Markov chain model is designed to analyze the successful and failure probabilities of the system model of the wireless sensor network. Besides, an energy consumption model for the one hop wireless sensor network is developed based on our models and hybrid channel access mechanism. Extensive performance analysis are done to study the effect of binary exponential contention window on energy consumption of the nodes and it is verified that our simulation results totally match with the theoretical results for different size of contention windows and node numbers.

Fault recovery mechanism in single-hop sensor networks

This paper introduces a memory efficient fault recovery scheme for single hop wireless sensor networks, where the network is able to operate independently of the sink node for long periods of time. The proposed scheme does neither require that the sensors be equipped with stable storage nor that they are permanently connected to the sink node. Rather, the sensors cooperate to maintain redundant information in their memories in order to be able to recover the lost information after a failure, and to distribute the recovered information among the memories of the surviving sensors.