scholarly journals A Random Walk-Based Energy-Aware Compressive Data Collection for Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Keming Dong ◽  
Chao Chen ◽  
Xiaohan Yu
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Markov Chain ◽  
Random Walk ◽  
Sensor Networks ◽  
Data Collection ◽  
Transition Probability ◽  
Transition Probability Matrix ◽  
Wireless Sensor ◽  
Expected Cost

The energy efficiency for data collection is one of the most important research topics in wireless sensor networks (WSNs). As a popular data collection scheme, the compressive sensing- (CS-) based data collection schemes own many advantages from the perspectives of energy efficiency and load balance. Compared to the dense sensing matrices, applications of the sparse random matrices are able to further improve the performance of CS-based data collection schemes. In this paper, we proposed a compressive data collection scheme based on random walks, which exploits the compressibility of data vectors in the network. Each measurement was collected along a random walk that is modeled as a Markov chain. The Minimum Expected Cost Data Collection (MECDC) scheme was proposed to iteratively find the optimal transition probability of the Markov chain such that the expected cost of a random walk could be minimized. In the MECDC scheme, a nonuniform sparse random matrix, which is equivalent to the optimal transition probability matrix, was adopted to accurately recover the original data vector by using the nonuniform sparse random projection (NSRP) estimator. Simulation results showed that the proposed scheme was able to reduce the energy consumption and balance the network load.

scholarly journals Enabling Green Wireless Sensor Networks: Energy Efficient T-MAC Using Markov Chain Based Optimization

Electronics ◽  
2019 ◽  
Vol 8 (5) ◽  
pp. 534 ◽  
Author(s):  
Mahendra Ram ◽  
Sushil Kumar ◽  
Vinod Kumar ◽  
Ajay Sikandar ◽  
Rupak Kharel
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Markov Chain ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Access Control ◽  
Analytical Model ◽  
Wireless Sensor ◽  
Medium Access ◽  
Service Delay

Due to the rapidly growing sensor-enabled connected world around us, with the continuously decreasing size of sensors from smaller to tiny, energy efficiency in wireless sensor networks has drawn ample consideration in both academia as well as in industries’ R&D. The literature of energy efficiency in wireless sensor networks (WSNs) is focused on the three layers of wireless communication, namely the physical, Medium Access Control (MAC) and network layers. Physical layer-centric energy efficiency techniques have limited capabilities due to hardware designs and size considerations. Network layer-centric energy efficiency approaches have been constrained, in view of network dynamics and available network infrastructures. However, energy efficiency at the MAC layer requires a traffic cooperative transmission control. In this context, this paper presents a one-dimensional discrete-time Markov chain analytical model of the Timeout Medium Access Control (T-MAC) protocol. Specifically, an analytical model is derived for T-MAC focusing on an analysis of service delay, throughput, energy consumption and power efficiency under unsaturated traffic conditions. The service delay model calculates the average service delay using the adaptive sleep wakeup schedules. The component models include a queuing theory-based throughput analysis model, a cycle probability-based analytical model for computing the probabilities of a successful transmission, collision, and the idle state of a sensor, as well as an energy consumption model for the sensor’s life cycle. A fair performance assessment of the proposed T-MAC analytical model attests to the energy efficiency of the model when compared to that of state-of-the-art techniques, in terms of better power saving, a higher throughput and a lower energy consumption under various traffic loads.

scholarly journals An Information-Centric Semantic Data Collection Tree for Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (21) ◽  
pp. 6168
Author(s):  
Ngoc-Thanh Dinh ◽  
Younghan Kim
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
State Of The Art ◽  
Important Application ◽  
Wireless Sensor ◽  
Semantic Data ◽  
Construction Scheme ◽  
Semantic Tree

Data collection is an important application of wireless sensor networks (WSNs) and Internet of Things (IoT). Current routing and addressing operations in WSNs are based on IP addresses, while data collection and data queries are normally information-centric. The current IP-based approach incurs significant management overheads and is inefficient for semantic data collection and queries. To address the above issue, this paper proposes a semantic data collection tree (sDCT) construction scheme to build up a semantic data collection tree for wireless sensor networks. The semantic tree is rooted at the edge/sink and supports data collection tasks, queries, and configurations efficiently. We implement the sDCT in Contiki and evaluate the performance of the sDCT in comparison with the state-of-the-art scheme, 6LoWPAN/RPL and L2RMR, using telosb sensors under various scenarios. The obtained results show that the sDCT achieves a significant improvement in terms of the energy efficiency and the packet transmissions required for data collection or a query task compared to 6LoWPAN/RPL and L2RMR.

scholarly journals Adaptive scheme to Control Power Aware for PDR in Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 4507-4514
Author(s):  
R. Sivaranjini ◽  
S.Palanivel Rajan
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Cluster Head ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Cluster Method ◽  
Prediction Scheme

Nowadays Wireless sensor networks playing vital role in all area. Which is used to sense the environmental monitoring, Temperature, Soil erosin etc. Low data delivery efficiency and high energy consumption are the inherent problems in Wireless Sensor Networks. Finding accurate data is more difficult and also it will leads to more expensive to collect all sensor readings. Clustering and prediction techniques, which exploit spatial and temporal correlation among the sensor data, provide opportunities for reducing the energy consumption of continuous sensor data collection and to achieve network energy efficiency and stability. So as we propose Dynamic scheme for energy consumption and data collection in wireless sensor networks by integrating adaptively enabling/disabling prediction scheme, sleep/awake method with dynamic scheme. Our framework is clustering based. A cluster head represents all sensor nodes within the region and collects data values from them. Our framework is general enough to incorporate many advanced features and we show how sleep/awake scheduling can be applied, which takes our framework approach to designing a practical dynamic algorithm for data aggregation, it avoids the need for rampant node-to-node propagation of aggregates, but rather it uses faster and more efficient cluster-to-cluster propagation. To the best of our knowledge, this is the first work adaptively enabling/disabling prediction scheme with dynamic scheme for clustering-based continuous data collection in sensor networks. When a cluster node fails because of energy depletion we need to choose alternative cluster head for that particular region. It will help to achieve less energy consumption. Our proposed models, analysis, and framework are validated via simulation and comparison with Static Cluster method in order to achieve better energy efficiency and PDR.

Bidirectional Random Walk Based Mobile-Sink-LocationPrivacyin WSN

2014 ◽  
Vol 529 ◽  
pp. 730-734
Author(s):  
Jun Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Random Walk ◽  
Sensor Networks ◽  
Data Collection ◽  
Location Privacy ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Random Data ◽  
Privacy Concerns ◽  
Sink Location

As wide applications of wireless sensor networks, privacy concerns have emerged as the main obstacle to success. When wireless sensor networks are used to battlefield, the privacy about sink-locations become a crux issue. If sink location will be exposed to adversary, the consequence is inconceivable. Random data collection scheme has a problem that message latencies become larger higher for protecting mobile-sink-locationprivacy .In this paper, BDRW (Bidirectional Random Walk) is proposed to preserve mobile-sink-location privacy. In BDRW, data are forwarded by directional random walk and stored at pass nodes in the network, the sink move in directional random walk to collect data from the local nodes occasionally, which prevents the attackers from predicting their locations and movements. Compared to random data collection scheme, BDRW has smaller message latencies, while providing satisfactory mobile-sink-location privacy.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Sign in / Sign up

Export Citation Format

Share Document