Compressive sensing based routing and data reconstruction scheme for IoT based WSNs

2021 ◽  
pp. 1-17
Author(s):  
Ahmed Aziz ◽  
Karan Singh ◽  
Walid Osamy ◽  
Ahmed M. Khder ◽  
Le Minh Tuan ◽  
...  

Data acquisition problem on large distributed wireless sensor networks (WSNs) is considered as a challenge in the growth of Internet of Things (IoT). Recently, the combination of compressive sensing (CS) and routing techniques has attracted much attention of researchers. An open question of this combination is how to integrate these techniques effectively for specific tasks. On the other hand, CS data reconstruction process is considered as one of the CS challenges because it requires to recover N data from only M measurement where M< <N. Through this paper, we propose a new scheme for data gathering in IoT based heterogeneous WSN that includes a new effective Deterministic Clustering using CS technique (DCCS) to handle the data acquisition problem. DCCS reduces the total overhead computational cost needed to self-organize WSN using a simple approach and then uses CS at each sensor node to decrease the overall energy consumption and increase the network lifetime. The proposed scheme includes also an effective CS reconstruction algorithm called Random Selection Matching Pursuit (RSMP) to improve the recovery process at the base station (BS). RSMP adds a random selection process during the forward step to give the opportunity for more columns to be selected as an estimated solution in each iteration. The simulation results show that the proposed scheme succeeds to minimize the overall network power consumption and prolong the network lifetime beside provide better performance in CS data reconstruction.

2021 ◽  
Vol 7 ◽  
pp. e463
Author(s):  
Walid Osamy ◽  
Ahmed Aziz ◽  
Ahmed M Khedr

Data acquisition problem in large-scale distributed Wireless Sensor Networks (WSNs) is one of the main issues that hinder the evolution of Internet of Things (IoT) technology. Recently, combination of Compressive Sensing (CS) and routing protocols has attracted much attention. An open question in this approach is how to integrate these techniques effectively for specific tasks. In this paper, we introduce an effective deterministic clustering based CS scheme (DCCS) for fog-supported heterogeneous WSNs to handle the data acquisition problem. DCCS employs the concept of fog computing, reduces total overhead and computational cost needed to self-organize sensor network by using a simple approach, and then uses CS at each sensor node to minimize the overall energy expenditure and prolong the IoT network lifetime. Additionally, the proposed scheme includes an effective algorithm for CS reconstruction called Random Selection Matching Pursuit (RSMP) to enhance the recovery process at the base station (BS) side with a complete scenario using CS. RSMP adds random selection process during the forward step to give opportunity for more columns to be selected as an estimated solution in each iteration. The results of simulation prove that the proposed technique succeeds to minimize the overall network power expenditure, prolong the network lifetime and provide better performance in CS data reconstruction.


2014 ◽  
Vol 599-601 ◽  
pp. 1411-1415
Author(s):  
Yan Hai Wu ◽  
Meng Xin Ma ◽  
Nan Wu ◽  
Jing Wang

The traditional reconstruction method of Compressive Sensing (CS) was mostly depended on L1-norm linear regression model. And here we propose Bayesian Compressive Sensing (BCS) to reconstruct the signal. It provides posterior distribution of the parameter rather than point estimate, so we can get the uncertainty of the estimation to optimize the data reconstruction process adaptively. In this paper, we employ hierarchical form of Laplace prior, and aiming at improving the efficiency of reconstruction, we segment image into blocks, employ various sample rates to compress different kinds of block and utilize relevance vector machine (RVM) to sparse signal in the reconstruction process. At last, we provide experimental result of image, and compare with the state-of-the-art CS algorithms, it demonstrating the superior performance of the proposed approach.


Author(s):  
Omkar Singh ◽  
Vinay Rishiwal

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.


2020 ◽  
Vol 13 (2) ◽  
pp. 168-172
Author(s):  
Ravi Kumar Poluru ◽  
M. Praveen Kumar Reddy ◽  
Syed Muzamil Basha ◽  
Rizwan Patan ◽  
Suresh Kallam

Background:Recently Wireless Sensor Network (WSN) is a composed of a full number of arbitrarily dispensed energy-constrained sensor nodes. The sensor nodes help in sensing the data and then it will transmit it to sink. The Base station will produce a significant amount of energy while accessing the sensing data and transmitting data. High energy is required to move towards base station when sensing and transmitting data. WSN possesses significant challenges like saving energy and extending network lifetime. In WSN the most research goals in routing protocols such as robustness, energy efficiency, high reliability, network lifetime, fault tolerance, deployment of nodes and latency. Most of the routing protocols are based upon clustering has been proposed using heterogeneity. For optimizing energy consumption in WSN, a vital technique referred to as clustering.Methods:To improve the lifetime of network and stability we have proposed an Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC).Results:In simulation results describes the protocol performs better regarding network lifetime and packet delivery capacity compared to EEDEC and DEEC algorithm. Stability period and network lifetime are improved in EADEEC compare to DEEC and EDEEC.Conclusion:The EADEEC is overall Lifetime of a cluster is improved to perform the network operation: Data transfer, Node Lifetime and stability period of the cluster. EADEEC protocol evidently tells that it improved the throughput, extended the lifetime of network, longevity, and stability compared with DEEC and EDEEC.


2021 ◽  
Author(s):  
Vimala D ◽  
Manikandan K

Abstract In recent days, wireless sensor network (WSN) gained more attention among researchers as well as industries. It is composed with massive number of sensors which are independently organized cooperate with one another for collecting, processing and transmitting data to the base station (BS) or sink. Since sensors undergo random deployment in harsh environment, it is difficult or not even possible to replace the batteries. So, energy efficient clustering and routing techniques are preferable to reduce the dissipation of energy and improve the network lifetime. This paper introduces a new Grid based Energy-Efficient Cross-Layer Optimization Model in WSN Using Dual Mobile Sink (GEECLO). The proposed method involves three main processes namely grid partitioning, clustering and routing. Initially, the entire network is partitioned into different zones and then sub zones. Then, type II FL process gets executed to select the CHs and construct the clusters. Finally, dolphin swarm optimization algorithm (DSOA) based routing process takes place to select the optimal path for inter-cluster communication. A detailed simulation analysis takes place to ensure the betterment of the GEECLO algorithm. The obtained experimentation outcome depicted that the GEECLO model offers maximum energy efficiency and network lifetime.


Author(s):  
Sandeep Kaur ◽  
Dr. Rajeev Bedi ◽  
Mohit Marwaha

In WSNs, the only source to save life for the node is the battery consumption. During communication with other area nodes or sensing activities consumes a lot of power energy in processing the data and transmitting the collected/selected data to the sink. In wireless sensor networks, energy conservation is directly to the network lifetime and energy plays an important role in the cluster head selection. A new threshold has been formulated for cluster head selection, which is based on remaining energy of the sensor node and the distance from the base station. Proposed approach selects the cluster head nearer to base station having maximum remaining energy than any other sensor node in multi-hop communication. The multi hop approach minimizing the inter cluster communication without effecting the data reliability.


Sign in / Sign up

Export Citation Format

Share Document