Data Recovery in Wireless Sensor Networks using Network Coding

2015 ◽  
Vol 73 (3) ◽  
Author(s):  
A. A. Shahidan ◽  
N. Fisal ◽  
Nor-Syahidatul N. Ismail ◽  
Farizah Yunus ◽  
Sharifah H. S. Ariffin
Keyword(s):  
Network Coding ◽  
Packet Loss ◽  
Channel Coding ◽  
Relay Node ◽  
Data Recovery ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Research Areas ◽  
Packet Recovery ◽  
Xor Operation

Data transportation over resources constraint and noisy channel of wireless sensor network (WSN) is very challenging in term of guaranteeing the data survival along the transmission. However, with the convergence of different research areas such as routing, source and channel coding techniques, the WSN technology has successfully been tremendously developed. This paper proposes an on-the-fly data recovery (ODR) scheme using network coding in order to enhance the robustness of the network against packet loss. Along with the ODR scheme, the packet loss formulation is presented while a network model for a network coding designed is also introduced namely for erasure channel. The data generated by the sources are transferred to the destination through relay nodes via three transmission paths. In ODR process, the lost packet is recovered by a relay node by listening to the transmission of two adjacent nodes and performing the XOR operation on the listened packets. We provide the analytical study on network coding performance and conducting the simulation experiment to verify it. In the simulation studies, we have also compared the performance of the network using network coding with and without packet recovery. The result shows that the number of packet loss has been reduced significantly using the proposed scheme compared to the network with normal network coding.  

scholarly journals An Overview of Data Dissemination in Wireless Sensor Network Using an Instantly Decodeable Network Coding

2019 ◽  
pp. 1-8
Author(s):  
Kadiri Kamoru Oluwatoyin ◽  
Kehinde Olalekan Samson
Keyword(s):  
Network Coding ◽  
Data Dissemination ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Research ◽  
Relay Nodes ◽  
Research Areas ◽  
Packet Recovery ◽  
Energy Dissipated ◽  
Alternate Routes

Wireless Sensor Networks (WSNs) are networks of small, cheap, independent battery-powered sensor nodes, finds applications in agriculture, health care, intrusion detection, asset tracking, habitat monitoring and in many other fields. It is sometimes necessary to disseminate data via wireless links after the deployment of sensors so as achieve the objectives of sensors configurations parameters adjustment or distribution of commands management and queries to sensors. The present study considered how Shortest Path Minded Sensor Protocols for Information via Negotiation (SPIN)-Recursive (SPMS-Rec), reduces the energy dissipated in the event of failures by requiring intermediate relay nodes to try alternate routes, is suitable for data dissemination. Despite to the power constraints and memory limitations of sensory nodes, ‘Instantly Decodable Network coding’ (IDNC) was considered because of its practicality, relevance and numerous desirable properties such as instant packet recovery, simple XOR-based packet encoding and decoding, and zero buffer memory to store un-decoded packets. The paper concludes with reference and suggestions of possible future research areas.

CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS

2012 ◽  
Vol 04 (01) ◽  
pp. 1250010 ◽  
Author(s):  
DEYING LI ◽  
ZHENG LI ◽  
WENKAI MA ◽  
WENPING CHEN
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Relay Node ◽  
Network Connectivity ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Underwater Acoustic ◽  
Node Deployment ◽  
Algorithm Framework

An underwater acoustic wireless sensor network (UA-WSN) consists of many resource-constrained underwater sensor nodes (USNs), which are deployed to perform collaborative monitoring tasks over a given region. One way to preserve network connectivity while guaranteeing other network QoS is to deploy some relay nodes (RNs) in the networks. Although RNs' function is more powerful than USNs, but they can lead to more interference and their cost is more expensive. This paper addresses constrained low-interference relay node deployment problem for 3-D UA-WSNs in which the RNs are placed at a subset of candidate locations to ensure connectivity between the USNs such that the number of RNs deployed and the value of total incremental interference are minimized. We first prove that it is NP-hard, then propose a general approximation algorithm framework. Based on the framework, we get two polynomial time O(1)-approximation algorithms.

scholarly journals Prolonging the Lifetime of Two-Tiered Wireless Sensor Networks with Mobile Relays

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Theodore C. Kotsilieris ◽  
George T. Karetsos
Keyword(s):  
Energy Savings ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Large Numbers ◽  
Sensor Networking ◽  
Key Aspects ◽  
Networking Architectures ◽  
Mobile Relay

We propose a clustering scheme for wireless sensor nodes in hierarchical wireless sensor networking architectures that employs mobile relay nodes in order to achieve energy conservation and network lifetime prolongation. The key aspects of our scheme are relay node relocation and reclustering when failures are detected. The performance of the proposed approach is evaluated via simulations for various topology layouts based on the sensor node population and number of mobile relay nodes employed. The results show significant energy savings in particular for topologies with large numbers of sensors.

scholarly journals A Novel Cooperative ARQ Method for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Haiyong Wang ◽  
Geng Yang ◽  
Yiran Gu ◽  
Jian Xu ◽  
Zhixin Sun
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Markov Chain Model ◽  
Relay Node ◽  
Wireless Sensor ◽  
System Throughput ◽  
Chain Model ◽  
Channel Fading ◽  
Relay Nodes

In wireless sensor networks, cooperative communication can combat the effects of channel fading by exploiting diversity gain achieved via cooperation communication among the relay nodes. A cooperative automatic retransmission request (ARQ) protocol based on two-relay node selection was proposed in this paper. A novel discrete time Markov chain model in order to analyze the throughput and energy efficiency was built, and system throughput and energy efficiency performance of proposed protocol and traditional ARQ protocol were studied based on such model. The numerical results reveal that the throughput and energy efficiency of the proposed protocol could perform better when compared with the traditional ARQ protocol.

scholarly journals Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Chi-Chang Chen ◽  
Chi-Yu Chang ◽  
Po-Ying Chen
Keyword(s):  
Approximation Algorithm ◽  
Linear Time ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Relay Nodes ◽  
Placement Problem ◽  
Worst Case ◽  
Time Approximation ◽  
Node Placement

The relay node placement problem in wireless sensor network (WSN) aims at deploying the minimum number of relay nodes over the network so that each sensor can communicate with at least one relay node. When the deployed relay nodes are homogeneous and their communication ranges are circular, one way to solve the WSN relay node placement problem is to solve the minimum geometric disk cover (MGDC) problem first and place the relay nodes at the centers of the covering disks and then, if necessary, deploy additional relay nodes to meet the connection requirement of relay nodes. It is known that the MGDC problem is NP-complete. A novel linear time approximation algorithm for the MGDC problem is proposed, which identifies covering disks using the regular hexagon tessellation of the plane with bounded area. The approximation ratio of the proposed algorithm is (5+ϵ), where0<ϵ≤15. Experimental results show that the worst case is rare, and on average the proposed algorithm uses less than 1.7 times the optimal disks of the MGDC problem. In cases where quick deployment is necessary, this study provides a fast 7-approximation algorithm which uses on average less than twice the optimal number of relay nodes in the simulation.

Analysis of relay node failure in heterogeneous wireless sensor networks

2020 ◽  
Vol 13 ◽  
Author(s):  
Gholamreza Kakamanshadi ◽  
Savita Gupta ◽  
Sukhwinder Singh
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Relay Node ◽  
Network Size ◽  
Wireless Sensor ◽  
Time To Failure ◽  
Relay Nodes ◽  
Tolerance Level ◽  
Heterogeneous Wireless Sensor Networks

Introduction: Fault tolerance is an important issue for assuring data reliability, energy saving and prolonging the lifetime of wireless sensor networks. Since, sensor node, relay node, etc. are prone to failure, there is a need an effective fault tolerance mechanism. Method: Relay nodes have used as cluster heads and the concept of two disjoint paths has used for proving fault tolerance against link failure. To evaluate the Fault Tolerance Level, Mean Time to Failure and subsequently Failure Rate has calculated, that reflect the reliability of the network. Results: The results show that as the area size of the network increases, the average Fault Tolerance Level of the network almost becomes constant. Furthermore, when the Mean Time to Failure of the network decreases then the Failure Rate increases. It means the overall reliability of the network with smaller network size is more than the larger network size. Conclusion: This analysis helps the network designers to decide the quantity of deployment of relay nodes with respect to fault tolerance level. It also, may help to prevent relay nodes failure as to take appropriate action so as to increase the fault tolerance level of the network as well as network reliability. Discussion: This paper presents a detailed analysis of relay nodes failure under distinct network configurations in heterogeneous wireless sensor networks.

A Grid-Based Relay Node Placement Algorithm in Wireless Sensor Networks

2013 ◽  
Vol 385-386 ◽  
pp. 1632-1637
Author(s):  
Zhu Wang ◽  
Cui Cui Lv ◽  
Ling Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Node ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Physical Factors ◽  
Relay Node Placement ◽  
Relay Nodes ◽  
Node Placement ◽  
Placement Algorithm

The relay node placement in wireless sensor networks is usually constrained by physical factors, while most of present relay node placement approaches are unconstrained. To solve the problem, the paper presents a constrained relay node placement algorithm. Based on grid routing mechanism, the algorithm determines the grid intersections as candidates for the relay node locations, and places as fewer relay nodes as possible to assure the network connectivity. Consideration must be given to both the number of relay nodes and energy efficient, the paper uses the greedy norm and constrains to place relay nodes. By the analysis and study of the experiments, the performance of the proposed algorithm is more superior to the algorithm without constrains.

scholarly journals Performance Analysis of Two-Hop mmWave Relay Nodes over the 5G NR Uplink Signal

2021 ◽  
Vol 11 (13) ◽  
pp. 5828
Author(s):  
Randy Verdecia-Peña ◽  
José I. Alonso
Keyword(s):  
Channel Coding ◽  
Software Defined Radio ◽  
Relay Node ◽  
Least Square ◽  
The Other ◽  
Practical Implementation ◽  
Modulation Scheme ◽  
Amplify And Forward ◽  
Relay Nodes ◽  
Qam Modulation

In this paper, the uplink in a two-hop 5G new radio co-operative system using Relay Nodes (RNs) in millimeter bands has been simulated and studied. We focus on an uplink Amplify-and-Forward Relay Node (A&F RN) and Decode-and-Forward Relay Node (D&F RN) with an mmWave-band transceiver chain (Tx/Rx). We study two uplink mmWave MIMO D&F relaying protocols assuming, firstly, the complete knowledge of the uplink channel and, secondly, the uplink channel estimation through a Least Square (LS) algorithm. To verify the benefits of the proposed uplink mmWave MIMO co-operative network, a link-level co-operative simulator has been developed using MatlabTM and SimulinkTM software, where an indoor-to-outdoor scenario and mmWave transceiver with off-the shelf components are considered. The main novelty of this link-level co-operative simulator and the implemented relay nodes is the usage of signals with 5G NR features, such as UL-SCH transport channel coding and PUSCH generation, which are the other main contributions of this article. Based on the numerical results in terms of the achievable Bit Error Rate (BER) and throughput, we show that the two-hop uplink co-operative network substantially improves the performance in the communications between the NR-User Equipment (NR-UE) and the logical 5G Radio Node (gNodeB). For example, the results from using uplink mmWave NR-D&F protocols far exceed those achieved with the uplink mmWave NR-A&F algorithm; in the case of the 64-QAM modulation scheme for the SISO technique, an improvement of 6.5 Mbps was achieved using the D&F PCE protocol, taking into account that the 256-QAM constellation is higher by 4.05 Mbps. On the other hand, an average throughput enhancement of 28.77 Mbps was achieved when an uplink mmWave (2 × 4 × 4) D&F PCE strategy was used versus an uplink mmWave SISO D&F LS protocol for a Signal-to-Noise Ratio (SNR) = 20 dB and 64-QAM signal. However, an improvement of 56.42 Mbps was reached when a 256-QAM modulation scheme was employed. Furthermore, this paper introduces the first study to develop an uplink mmWave MIMO 5G co-operative network platform through a Software Defined Radio (SDR) from a practical implementation point of view.

scholarly journals A Relay Mote Wheeze for Energy Saving and Network Longevity Enhancement in WSN

2019 ◽  
Vol 8 (3) ◽  
pp. 8220-8227
Keyword(s):  
Relay Node ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Data Delivery ◽  
Route Discovery ◽  
Relay Nodes ◽  
Global Energy Balance ◽  
End To End Delay ◽  
Ratio Energy ◽  
Selection Of

Weather Monitoring, surveillance of enemy vehicles, sensed data delivery are few of the applications of Wireless Sensor Networks. All the applications want the nodes to spend their energy in the critical activities. Lifetime depends on the residual energy of the nodes in the network. In this work we modify the Global Energy Balance [1] algorithms to have better network lifetime by making use of fixed relay nodes at various positions in the network. The selection of relay node is based on the distance and residual energy of the relay node all through the route discovery practice. The FRNS scheme is compared with existing algorithms for diverse parameters like End to End Delay, Overall Hops Count, Overall Alive nodes and Dead nodes, Residual energy, Lifetime ratio, Energy Consumption, Throughput and Routing Overhead.

Sign in / Sign up

Export Citation Format

Share Document